303 search results - page 44 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
RECOMB
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. Contemporary inferences about evolution occasionally involve analyzing infinitely large feature spaces, requiring specific algorithmic techniques. We consider parsimony a...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
CVPR
2010
IEEE
13 years 11 months ago
2010
IEEE
In a sparse-representation-based face recognition scheme, the desired dictionary should have good representational power (i.e., being able to span the subspace of all faces) while...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...