5138 search results - page 83 / 1028 » Randomized Algorithms for 3-SAT |
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
LCN
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
167
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
219
click to vote
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
115
click to vote
ACISP
2009
Springer
15 years 6 months ago
2009
Springer
This paper describes a m-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than...