Sciweavers

868 search results - page 42 / 174
» A general compression algorithm that supports fast searching
Sort
View
ICDE
2010
IEEE
268views Database» more  ICDE 2010»
14 years 7 months ago
Techniques for Efficiently Searching in Spatial, Temporal, Spatio-temporal, and Multimedia Databases
This tutorial provides a comprehensive and comparative overview of general techniques to efficiently support similarity queries in spatial, temporal, spatio-temporal, and multimedi...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
WWW
2009
ACM
14 years 8 months ago
Online expansion of rare queries for sponsored search
Sponsored search systems are tasked with matching queries to relevant advertisements. The current state-of-the-art matching algorithms expand the user's query using a variety...
Andrei Z. Broder, Peter Ciccolo, Evgeniy Gabrilovi...
ICASSP
2010
IEEE
13 years 8 months ago
Adaptive compressed sensing - A new class of self-organizing coding models for neuroscience
Sparse coding networks, which utilize unsupervised learning to maximize coding efficiency, have successfully reproduced response properties found in primary visual cortex [1]. Ho...
William K. Coulter, Cristopher J. Hillar, Guy Isle...
CIKM
2009
Springer
14 years 2 months ago
Compact full-text indexing of versioned document collections
We study the problem of creating highly compressed fulltext index structures for versioned document collections, that is, collections that contain multiple versions of each docume...
Jinru He, Hao Yan, Torsten Suel
ICASSP
2011
IEEE
12 years 11 months ago
Weighted and structured sparse total least-squares for perturbed compressive sampling
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data...
Hao Zhu, Georgios B. Giannakis, Geert Leus