429 search results - page 38 / 86 » Solving the Maximum Clique Problem Using PUBB |
IJFCS
2007
13 years 7 months ago
2007
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
ICCAD
1996
IEEE
13 years 12 months ago
1996
IEEE
In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We de ne a class of optimization problems as CH-posynomial programs and reveal a genera...
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
A method is presented to recover 3D scene structure and camera motion from multiple images without the need for correspondence information. The problem is framed as finding the ma...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...