Sciweavers

67 search results - page 4 / 14
» Compressed Data Structures: Dictionaries and Data-Aware Meas...
Sort
View
CVPR
2010
IEEE
13 years 10 months ago
Classification and Clustering via Dictionary Learning with Structured Incoherence
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
Pablo Sprechmann, Ignacio Ramirez, Guillermo Sapir...
BNCOD
2007
151views Database» more  BNCOD 2007»
13 years 9 months ago
Compressed Materialised Views of Semi-Structured Data
Query performance issues over semi-structured data have led to the emergence of materialised XML views as a means of restricting the data structure processed by a query. However p...
Richard Gourlay, Brian Tripney, John N. Wilson
WWW
2010
ACM
14 years 24 days ago
RDF compression: basic approaches
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...
Javier D. Fernández, Claudio Gutierrez, Mig...
ICIP
2009
IEEE
14 years 8 months ago
Reconstructing Ft-ir Spectroscopic Imaging Data With A Sparse Prior
Fourier Transform Infrared (FT-IR) spectroscopic imaging is a potentially valuable tool for diagnosing breast and prostate cancer, but its clinical deployment is limited due to lo...
PODS
2006
ACM
216views Database» more  PODS 2006»
14 years 7 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...