5138 search results - page 297 / 1028 » Randomized Algorithms for 3-SAT |
173
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
177
click to vote
DCC
2001
IEEE
16 years 6 months ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
168
click to vote
CP
2007
Springer
16 years 23 days ago
2007
Springer
Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent...
137
click to vote
RANDOM
1998
Springer
15 years 10 months ago
1998
Springer
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
197
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...