5138 search results - page 140 / 1028 » Randomized Algorithms for 3-SAT |
134
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
103
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
115
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
136
click to vote
BMVC
2002
15 years 4 months ago
2002
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
108
click to vote
TSP
2010
14 years 8 months ago
2010
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...