1567 search results - page 136 / 314 » Compressing Relations and Indexes |
149
Voted
SDM
2010
SIAM
15 years 7 months ago
2010
SIAM
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
186
click to vote
JEA
2008
15 years 6 months ago
2008
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
167
click to vote
MCS
2008
Springer
15 years 5 months ago
2008
Springer
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...
274
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
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 ...
169
click to vote
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
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...