562 search results - page 99 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
Alpha matting refers to the problem of softly extracting the foreground from an image. Given a trimap (specifying known foreground/background and unknown pixels), a straightforwar...
EMMCVPR
2011
Springer
12 years 8 months ago
2011
Springer
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
JGAA
2006
13 years 8 months ago
2006
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of neares...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...