Sciweavers

406 search results - page 23 / 82
» Database-friendly random projections
Sort
View
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 2 months ago
Optimal Column-Based Low-Rank Matrix Reconstruction
We prove that for any real-valued matrix X ∈ Rm×n , and positive integers r k, there is a subset of r columns of X such that projecting X onto their span gives a r+1 r−k+1 -a...
Venkatesan Guruswami, Ali Kemal Sinop
TSP
2010
13 years 2 months ago
Compressive Sensing on Manifolds Using a Nonparametric Mixture of Factor Analyzers: Algorithm and Performance Bounds
Nonparametric Bayesian methods are employed to constitute a mixture of low-rank Gaussians, for data x RN that are of high dimension N but are constrained to reside in a low-dimen...
Minhua Chen, Jorge Silva, John William Paisley, Ch...
JSS
2007
118views more  JSS 2007»
13 years 7 months ago
A new imputation method for small software project data sets
Effort prediction is a very important issue for software project management. Historical project data sets are frequently used to support such prediction. But missing data are oft...
Qinbao Song, Martin J. Shepperd
ECCC
2000
113views more  ECCC 2000»
13 years 7 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
ICASSP
2011
IEEE
12 years 11 months ago
Compressed classification of observation sets with linear subspace embeddings
We consider the problem of classification of a pattern from multiple compressed observations that are collected in a sensor network. In particular, we exploit the properties of r...
Dorina Thanou, Pascal Frossard