Sciweavers

46 search results - page 8 / 10
» Closest Pair Queries in Spatial Databases
Sort
View
SSD
2001
Springer
103views Database» more  SSD 2001»
13 years 9 months ago
Similarity of Cardinal Directions
Like people who casually assess similarity between spatial scenes in their routine activities, users of pictorial databases are often interested in retrieving scenes that are simil...
Roop K. Goyal, Max J. Egenhofer
CIVR
2007
Springer
178views Image Analysis» more  CIVR 2007»
13 years 11 months ago
Layout indexing of trademark images
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...
Reinier H. van Leuken, M. Fatih Demirci, Victoria ...
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 6 months ago
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
Bernd-Uwe Pagel, Flip Korn, Christos Faloutsos
DEXAW
2000
IEEE
92views Database» more  DEXAW 2000»
13 years 9 months ago
Consistent Queries over Cardinal Directions across Different Levels of Detail
Current models for cardinal directions, such as north and northeast, are either point-based or region-based, but no models exist that apply equally, independent of the geometric d...
Roop K. Goyal, Max J. Egenhofer
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 6 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk