2996 search results - page 271 / 600 » Numberings and Randomness |
188
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
163
click to vote
CP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
152
click to vote
STACS
2004
Springer
16 years 1 days ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
167
click to vote
ASIACRYPT
2006
Springer
15 years 10 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
164
click to vote
AUSAI
2009
Springer
15 years 10 months ago
2009
Springer
Ensembles are often capable of greater prediction accuracy than any of their individual members. As a consequence of the diversity between individual base-learners, an ensemble wil...