441 search results - page 55 / 89 » Sparse Recovery Using Sparse Random Matrices |
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we consider the problem of sampling far below the Nyquist rate signals that are sparse linear superpositions of shifts of a known, potentially wide-band, pulse. This...
266
click to vote
ICA
2012
Springer
13 years 5 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
IDEAL
2010
Springer
14 years 8 months ago
2010
Springer
Intrusion detection in computer networks faces the problem of a large number of both false alarms and unrecognized attacks. To improve the precision of detection, various machine l...
RSA
2011
14 years 4 months ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...