3640 search results - page 639 / 728 » The Geometry of Web Search |
221
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
167
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we propose a method for detecting humans in imagery taken from a UAV. This is a challenging problem due to small number of pixels on target, which makes it more di...
159
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
249
click to vote
SIGIR
1992
ACM
15 years 10 months ago
1992
ACM
ct We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling. Many areas of scienti...
173
click to vote
SWAT
2000
Springer
15 years 10 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...