Sciweavers

147 search results - page 18 / 30
» Very sparse random projections
Sort
View
ICASSP
2008
IEEE
15 years 8 months ago
Wavelet-domain compressive signal reconstruction using a Hidden Markov Tree model
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...
106
Voted
WCE
2007
15 years 3 months ago
On the Non-Gaussian Nature of Random Vehicle Vibrations
—This paper presents one of the outcomes of a research project concerned with the development of a method for synthesizing, under controlled conditions in the laboratory, the ran...
Vincent Rouillard
SODA
2012
ACM
213views Algorithms» more  SODA 2012»
13 years 4 months ago
Expanders are universal for the class of all spanning trees
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...
BIOADIT
2006
Springer
15 years 5 months ago
Attractor Memory with Self-organizing Input
We propose a neural network based autoassociative memory system for unsupervised learning. This system is intended to be an example of how a general information processing architec...
Christopher Johansson, Anders Lansner
ICPP
2006
IEEE
15 years 8 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri