Sciweavers

147 search results - page 12 / 30
» Very sparse random projections
Sort
View
GFKL
2007
Springer
123views Data Mining» more  GFKL 2007»
14 years 1 months ago
Projecting Dialect Distances to Geography: Bootstrap Clustering vs. Noisy Clustering
Abstract. Dialectometry produces aggregate distance matrices in which a distance is specified for each pair of sites. By projecting groups obtained by clustering onto geography on...
John Nerbonne, Peter Kleiweg, Wilbert Heeringa, Fr...
ICASSP
2010
IEEE
13 years 8 months ago
Consensus in correlated random topologies: Weights for finite time horizon
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
Dusan Jakovetic, João Xavier, José M...
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 7 months ago
Channel Estimation for Opportunistic Spectrum Access: Uniform and Random Sensing
The knowledge of channel statistics can be very helpful in making sound opportunistic spectrum access decisions. It is therefore desirable to be able to efficiently and accurately...
Quanquan Liang, Mingyan Liu
ICASSP
2008
IEEE
14 years 2 months ago
Compressive sensing of parameterized shapes in images
Compressive Sensing (CS) uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or compressible signals. The Hough t...
Ali Cafer Gurbuz, James H. McClellan, Justin K. Ro...
ICIP
2007
IEEE
14 years 9 months ago
Compressed Sensing Image Reconstruction Via Recursive Spatially Adaptive Filtering
We introduce a new approach to image reconstruction from highly incomplete data. The available data are assumed to be a small collection of spectral coef?cients of an arbitrary li...
Karen O. Egiazarian, Alessandro Foi, Vladimir Katk...