2631 search results - page 142 / 527 » A Practical Method for the Sparse Resultant |
193
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
202
click to vote
SIAMJO
2010
15 years 1 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
177
click to vote
RECOMB
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents a new approach to site-directed recombination, swapping combinations of selected discontiguous fragments from a source protein in place of corresponding fragmen...
163
click to vote
ICASSP
2008
IEEE
16 years 23 days ago
2008
IEEE
We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden var...
160
click to vote
ICASSP
2008
IEEE
16 years 23 days ago
2008
IEEE
We propose a new approach to underdetermined Blind Source Separation (BSS) using sparse decomposition over monochannel dictionary atoms and compare it to multichannel dictionary a...