251 search results - page 48 / 51 » When Is Nearest Neighbors Indexable |
STOC
1997
ACM
13 years 11 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
IR
2006
13 years 7 months ago
2006
Search facilitated with agglomerative hierarchical clustering methods was studied in a collection of Finnish newspaper articles (N = 53,893). To allow quick experiments, clustering...
COMPGEOM
2003
ACM
14 years 22 days ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
TNN
2008
13 years 7 months ago
2008
Aging effects, environmental changes, thermal drifts, and soft and hard faults affect physical systems by changing their nature and behavior over time. To cope with a process evolu...
BMCBI
2004
13 years 7 months ago
2004
Background: Computational gene prediction continues to be an important problem, especially for genomes with little experimental data. Results: I introduce the SNAP gene finder whi...