2031 search results - page 167 / 407 » On Tree-Constrained Matchings and Generalizations |
132
Voted
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
142
click to vote
STACS
2010
Springer
16 years 24 days ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
163
Voted
ICASSP
2009
IEEE
16 years 17 days ago
2009
IEEE
In this paper, we show how two classical sparse recovery algorithms, Orthogonal Matching Pursuit and Basis Pursuit, can be naturally extended to recover block-sparse solutions for...
134
click to vote
CSR
2009
Springer
16 years 11 days ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
155
click to vote
ICASSP
2007
IEEE
16 years 4 days ago
2007
IEEE
We develop a general framework to automatically match electronic slides to the videos of corresponding presentations. Applications include supporting indexing and browsing of educ...