Sciweavers

1888 search results - page 126 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
GIS
2003
ACM
16 years 5 months ago
Processing in-route nearest neighbor queries: a comparison of alternative approaches
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., locationbased services, advanced traveler information syst...
Shashi Shekhar, Jin Soung Yoo
EDBT
1998
ACM
131views Database» more  EDBT 1998»
15 years 9 months ago
Processing Complex Similarity Queries with Distance-Based Access Methods
Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similar...
Paolo Ciaccia, Marco Patella, Pavel Zezula
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
16 years 4 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 9 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
ICDE
2010
IEEE
271views Database» more  ICDE 2010»
16 years 4 months ago
Preference Queries in Large Multi-Cost Transportation Networks
Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, howev...
Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu