8413 search results - page 337 / 1683 » Ordering Problem Subgoals |
194
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—In this paper, we introduce a sparse approximation property of order s for a measurement matrix A: xs 2 ≤ D Ax 2 + β σs(x) √ s for all x, where xs is the best s-sparse app...
298
click to vote
FCCM
2011
IEEE
14 years 10 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
299
click to vote
HICSS
2011
IEEE
14 years 10 months ago
2011
IEEE
Although our society is critically dependent on software systems, these systems are mainly secured by protection mechanisms during operation instead of considering security issues...
127
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
208
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Kernel nonnegative matrix factorization (KNMF) is a recent kernel extension of NMF, where matrix factorization is carried out in a reproducing kernel Hilbert space (RKHS) with a f...