4114 search results - page 706 / 823 » Efficient Algorithms for the 2-Center Problems |
SMA
2008
ACM
13 years 9 months ago
2008
ACM
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
ICCV
1999
IEEE
14 years 11 months ago
1999
IEEE
A new approach to computing a panoramic (360 degrees) depth map is presented in this paper. Our approach uses a large collection of images taken by a camera whose motion has been c...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
SODA
2010
ACM
14 years 6 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 ...