347 search results - page 50 / 70 » Schaefer's theorem for graphs |
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
ICMLA
2004
14 years 11 months ago
2004
Detecting outliers is an important topic in data mining. Sometimes the outliers are more interesting than the rest of the data. Outlier identification has lots of applications, su...
COMBINATORICS
2007
14 years 9 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents a novel approach of multiple target tracking from multiple collaborative cameras. Firstly, particle filtering for conditional density propagation on graphs to...