Sciweavers

888 search results - page 32 / 178
» Improving Random Projections Using Marginal Information
Sort
View
ICASSP
2008
IEEE
15 years 11 months ago
Finding needles in noisy haystacks
The theory of compressed sensing shows that samples in the form of random projections are optimal for recovering sparse signals in high-dimensional spaces (i.e., finding needles ...
Rui M. Castro, Jarvis Haupt, Robert Nowak, Gil M. ...
WWW
2002
ACM
15 years 4 months ago
Improvement of HITS-based algorithms on web documents
In this paper, we present two ways to improve the precision of HITS-based algorithms on Web documents. First, by analyzing the limitations of current HITS-based algorithms, we pro...
Longzhuang Li, Yi Shang, Wei Zhang
ELPUB
2007
ACM
15 years 8 months ago
Beyond Publication - A Passage Through Project StORe
The principal aim of Project StORe is to provide middleware that will enable bi-directional links between source repositories of research data and the output repositories containi...
Graham Pryor
AAAI
2008
15 years 6 months ago
Manifold Integration with Markov Random Walks
Most manifold learning methods consider only one similarity matrix to induce a low-dimensional manifold embedded in data space. In practice, however, we often use multiple sensors...
Heeyoul Choi, Seungjin Choi, Yoonsuck Choe
ACISICIS
2008
IEEE
15 years 6 months ago
Efficient Projection for Compressed Sensing
Compressed sensing (CS), a joint compression and sensing process, is a emerging field of activity in which the signal is sampled and simultaneously compressed at a greatly reduced...
Vo Dinh Minh Nhat, Duc Vo, Subhash Challa, Sungyou...