Sciweavers

295 search results - page 48 / 59
» Compressed full-text indexes
Sort
View
MCS
2008
Springer
13 years 7 months ago
Dynamical low-rank approximation: applications and numerical experiments
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
Achim Nonnenmacher, Christian Lubich
ICDE
2007
IEEE
220views Database» more  ICDE 2007»
14 years 9 months ago
Structural Selectivity Estimation for XML Documents
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
Damien K. Fisher, Sebastian Maneth
ICDE
2010
IEEE
491views Database» more  ICDE 2010»
14 years 7 months ago
TrajStore: An Adaptive Storage System for Very Large Trajectory Data Sets
The rise of GPS and broadband-speed wireless devices has led to tremendous excitement about a range of applications broadly characterized as "location based services". Cu...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
CPM
2005
Springer
101views Combinatorics» more  CPM 2005»
14 years 1 months ago
Succinct Suffix Arrays Based on Run-Length Encoding
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
Veli Mäkinen, Gonzalo Navarro
ICDE
2002
IEEE
162views Database» more  ICDE 2002»
14 years 27 days ago
Similarity Search Over Time-Series Data Using Wavelets
We consider the use of wavelet transformations as a dimensionality reduction technique to permit efficient similarity search over high-dimensional time-series data. While numerou...
Ivan Popivanov, Renée J. Miller