116 search results - page 17 / 24 » The Classification of Digital Covering Spaces |
PAMI
2008
13 years 7 months ago
2008
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
This paper proposes a data mining approach to modeling relationships among categories in image collection. In our approach, with image feature grouping, a visual dictionary is cre...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
COMPGEOM
1994
ACM
13 years 12 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...