1888 search results - page 134 / 378 » Algorithms for Querying by Spatial Structure |
151
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
151
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
A location-based service (LBS) provides information based on the location information specified in a query. Nearest-neighbor (NN) search is an important class of queries supported ...
153
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
251
click to vote
ICDE
2002
IEEE
16 years 6 months ago
2002
IEEE
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
144
click to vote
EDBT
2000
ACM
15 years 8 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...