Sciweavers

83 search results - page 8 / 17
» List Update Algorithms for Data Compression
Sort
View
NIPS
2008
13 years 8 months ago
An Homotopy Algorithm for the Lasso with Online Observations
It has been shown that the problem of 1-penalized least-square regression commonly referred to as the Lasso or Basis Pursuit DeNoising leads to solutions that are sparse and there...
Pierre Garrigues, Laurent El Ghaoui
DASFAA
2010
IEEE
141views Database» more  DASFAA 2010»
14 years 2 months ago
Optimizing Write Performance for Read Optimized Databases
Compression in column-oriented databases has been proven to offer both performance enhancements and reductions in storage consumption. This is especially true for read access as c...
Jens Krüger, Martin Grund, Christian Tinnefel...
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
14 years 9 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
JCP
2007
118views more  JCP 2007»
13 years 7 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci
COMGEO
1999
ACM
13 years 7 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid