3471 search results - page 592 / 695 » Obstacle Numbers of Graphs |
144
click to vote
ICCAD
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
140
click to vote
CVPR
2010
IEEE
16 years 17 days ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
147
click to vote
CVPR
2010
IEEE
16 years 1 days ago
2010
IEEE
We propose Recursive Compositional Models (RCMs) for simultaneous multi-view multi-object detection and parsing (e.g. view estimation and determining the positions of the object s...
137
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
165
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...