6740 search results - page 481 / 1348 » An s -Hamiltonian Line Graph Problem |
190
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
183
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
181
click to vote
SIAMDM
2008
15 years 6 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
156
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Illumination changes are a ubiquitous problem in computer vision. They present a challenge in many applications, including tracking: for example, an object may move in and out of ...
170
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We present a new approach for the incorporation of shape information into a segmentation algorithm. Unlike previous approaches to the problem, our method requires no initializatio...