901 search results - page 171 / 181 » Nearest Neighbor Ensemble |
COMPGEOM
2003
ACM
14 years 10 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...
CIVR
2003
Springer
14 years 9 days ago
2003
Springer
We present an algorithm for video retrieval that fuses the decisions of multiple retrieval agents in both text and image modalities. While the normalization and combination of evi...
COMPGEOM
2010
ACM
14 years 5 days ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
COMPGEOM
2010
ACM
14 years 5 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...