5580 search results - page 164 / 1116 » Randomized priority algorithms |
STOC
2002
ACM
15 years 10 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...
SIGMOD
2004
ACM
15 years 10 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...
115
click to vote
BMVC
2002
15 years 14 days 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...
TSP
2010
14 years 4 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 ...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...