Sciweavers

4488 search results - page 384 / 898
» Properties of NP-Complete Sets
Sort
View
EUROCRYPT
2010
Springer
16 years 12 days ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
ICALP
2010
Springer
16 years 12 days ago
Preprocessing of Min Ones Problems: A Dichotomy
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
Stefan Kratsch, Magnus Wahlström
CDC
2009
IEEE
159views Control Systems» more  CDC 2009»
16 years 9 days ago
A distributed machine learning framework
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...
Tansu Alpcan, Christian Bauckhage
CSL
2001
Springer
16 years 3 days ago
Capture Complexity by Partition
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...
Yijia Chen, Enshao Shen
SIGGRAPH
2010
ACM
16 years 2 days ago
Stable spaces for real-time clothing
We present a technique for learning clothing models that enables the simultaneous animation of thousands of detailed garments in real-time. This surprisingly simple conditional mo...
Edilson de Aguiar, Leonid Sigal, Adrien Treuille, ...