Sciweavers

2031 search results - page 167 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ICML
2005
IEEE
15 years 11 months ago
Weighted decomposition kernels
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...
Sauro Menchetti, Fabrizio Costa, Paolo Frasconi
STACS
2010
Springer
15 years 5 months ago
Exact Covers via Determinants
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...
Andreas Björklund
ICASSP
2009
IEEE
15 years 4 months ago
Separation of a subspace-sparse signal: Algorithms and conditions
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...
Arvind Ganesh, Zihan Zhou, Yi Ma
CSR
2009
Springer
15 years 4 months ago
Variations on Muchnik's Conditional Complexity Theorem
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 ...
Daniil Musatov, Andrei E. Romashchenko, Alexander ...
ICASSP
2007
IEEE
15 years 4 months ago
Temporal Modeling of Slide Change in Presentation Videos
We develop a general framework to automatically match electronic slides to the videos of corresponding presentations. Applications include supporting indexing and browsing of educ...
Quanfu Fan, Arnon Amir, Kobus Barnard, Ranjini Swa...