10412 search results - page 1476 / 2083 » The efficiency of algorithms - misconceptions |
254
click to vote
SODA
2010
ACM
16 years 4 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 ...
181
click to vote
CIDM
2007
IEEE
16 years 1 months ago
2007
IEEE
Outlier detection has recently become an important problem in many industrial and financial applications. This problem is further complicated by the fact that in many cases, outlie...
215
click to vote
3DIM
1999
IEEE
15 years 11 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...
218
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
182
click to vote
WADS
1989
Springer
15 years 11 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...