Sciweavers

1284 search results - page 165 / 257
» Data Structures for Mergeable Trees
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
14 years 11 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
CG
2008
Springer
14 years 10 months ago
Parallel reflective symmetry transformation for volume data
Many volume data possess symmetric features that can be clearly observed, for example, those existing in diffusion tensor image data sets. The exploitations of symmetries for volu...
Yuan Hong, Han-Wei Shen
ESWS
2008
Springer
14 years 12 months ago
Adding Data Mining Support to SPARQL Via Statistical Relational Learning Methods
Exploiting the complex structure of relational data enables to build better models by taking into account the additional information provided by the links between objects. We exten...
Christoph Kiefer, Abraham Bernstein, André ...
ADC
2008
Springer
141views Database» more  ADC 2008»
15 years 4 months ago
Approximate Retrieval of XML Data with ApproXPath
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
Lin Xu, Curtis E. Dyreson
STDBM
2004
Springer
143views Database» more  STDBM 2004»
15 years 3 months ago
Indexing Query Regions for Streaming Geospatial Data
This paper introduces the Dynamic Cascade Tree (DCT), a structure designed to index query regions on multi-dimensional data streams. The DCT is designed for a stream management sy...
Quinn Hart, Michael Gertz