Sciweavers

1888 search results - page 54 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
CIKM
1994
Springer
15 years 8 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet
GIS
2006
ACM
16 years 5 months ago
Filtering with raster signatures
Efficient evaluation of spatial queries is an important issue in spatial database. Among spatial operations, spatial join is very useful, intersection being the most common predic...
Leonardo Guerreiro Azevedo, Ralf Hartmut Güti...
RECOMB
2009
Springer
16 years 5 months ago
Searching Protein 3-D Structures in Linear Time
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
Tetsuo Shibuya
GIS
2007
ACM
16 years 5 months ago
Robust location search from text queries
Robust, global, address geocoding is challenging because there is no single address format that applies to all geographies, and in any case, users may not restrict themselves to w...
Vibhuti S. Sengar, Tanuja Joshi, Joseph Joy, Samar...
ICCS
2007
Springer
15 years 8 months ago
A Comparison of Different Conceptual Structures Projection Algorithms
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...
Heather D. Pfeiffer, Roger T. Hartley