Sciweavers

4850 search results - page 170 / 970
» Approximate Data Structures with Applications
Sort
View
ICDE
2006
IEEE
239views Database» more  ICDE 2006»
16 years 5 days ago
Grid Representation for Efficient Similarity Search in Time Series Databases
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
Guifang Duan, Yu Suzuki, Kyoji Kawagoe
167
Voted
ER
2006
Springer
123views Database» more  ER 2006»
15 years 9 months ago
A Quantitative Summary of XML Structures
Statistical summaries in relational databases mainly focus on the distribution of data values and have been found useful for various applications, such as query evaluation and data...
Zi Lin, Bingsheng He, Byron Choi
233
Voted
IPMI
2011
Springer
14 years 9 months ago
Nonnegative Factorization of Diffusion Tensor Images and Its Applications
This paper proposes a novel method for computing linear basis images from tensor-valued image data. As a generalization of the nonnegative matrix factorization, the proposed method...
Yuchen Xie, Jeffrey Ho, Baba C. Vemuri
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
16 years 6 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 6 months ago
Efficient Similarity Search for Hierarchical Data in Large Databases
Structured and semi-structured object representations are getting more and more important for modern database applications. Examples for such data are hierarchical structures inclu...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö...