183 search results - page 26 / 37 » On the Matching Problem for Special Graph Classes |
113
click to vote
EJIVP
2010
14 years 8 months ago
2010
Abstract--In this paper we address the problem of unsupervised discovery of action classes in video data. Different from all existing methods thus far proposed for this task, we pr...
131
click to vote
JMLR
2012
13 years 3 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
131
click to vote
EMMCVPR
2007
Springer
15 years 7 months ago
2007
Springer
Most of the traditional methods for shape classification are based on contour. They often encounter difficulties when dealing with classes that have large nonlinear variability, es...
131
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
134
click to vote
DM
2006
15 years 1 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...