510 search results - page 18 / 102 » Sparse probabilistic projections |
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
In this paper, we propose a bilevel sparse coding model for coupled feature spaces, where we aim to learn dictionaries for sparse modeling in both spaces while enforcing some desi...
CP
2005
Springer
14 years 1 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
PC
2010
13 years 2 months ago
2010
We study the forward and backward substitution phases of a sparse multifrontal factorization. These phases are often neglected in papers on sparse direct factorization but, in man...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
An ensemble is a group of learners that work together as a committee to solve a problem. However, the existing ensemble training algorithms sometimes generate unnecessary large en...
APPROX
2004
Springer
14 years 28 days ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...