5138 search results - page 117 / 1028 » Randomized Algorithms for 3-SAT |
112
Voted
COMBINATORICS
2007
15 years 1 months ago
2007
We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...
116
click to vote
EUROCRYPT
2004
Springer
15 years 7 months ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
151
Voted
ESA
2011
Springer
14 years 1 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
114
click to vote
CSR
2006
Springer
15 years 5 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
EMMCVPR
2001
Springer
15 years 6 months ago
2001
Springer
This paper introduces R-SMW, a new algorithm for stereo