Sciweavers

1897 search results - page 220 / 380
» Conditional Linear Planning
Sort
View
130
Voted
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 3 months ago
Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices
We study the information-theoretic limits of exactly recovering the support set of a sparse signal, using noisy projections defined by various classes of measurement matrices. Our ...
Wei Wang, Martin J. Wainwright, Kannan Ramchandran
BIOINFORMATICS
2006
92views more  BIOINFORMATICS 2006»
15 years 3 months ago
What should be expected from feature selection in small-sample settings
Motivation: High-throughput technologies for rapid measurement of vast numbers of biological variables offer the potential for highly discriminatory diagnosis and prognosis; howev...
Chao Sima, Edward R. Dougherty
JMLR
2008
73views more  JMLR 2008»
15 years 3 months ago
On the Suitable Domain for SVM Training in Image Coding
Conventional SVM-based image coding methods are founded on independently restricting the distortion in every image coefficient at some particular image representation. Geometrical...
Gustavo Camps-Valls, Juan Gutierrez, Gabriel G&oac...
259
Voted
VLDB
2005
ACM
185views Database» more  VLDB 2005»
16 years 3 months ago
Storing and querying XML data using denormalized relational databases
XML database systems emerge as a result of the acceptance of the XML data model. Recent works have followed the promising approach of building XML database management systems on un...
Andrey Balmin, Yannis Papakonstantinou
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
15 years 10 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar