4110 search results - page 748 / 822 » Efficient algorithms for the 2-gathering problem |
136
click to vote
ICALP
2009
Springer
16 years 4 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....
304
click to vote
SIGMOD
2008
ACM
16 years 4 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...
173
click to vote
SODA
2010
ACM
16 years 1 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 ...
152
click to vote
3DIM
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper, we report on recent extensions to a surface matching algorithm based on local 3-D signatures. This algorithm was previously shown to be effective in view registrati...
147
click to vote
SSD
1999
Springer
15 years 8 months ago
1999
Springer
There is an increasing need to integrate spatial index structures into commercial database management systems. In geographic information systems (GIS), huge amounts of information ...