5889 search results - page 430 / 1178 » Graph Layout Problems |
213
click to vote
SIAMDM
2008
15 years 7 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...
176
click to vote
CVPR
2005
IEEE
16 years 9 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 ...
188
click to vote
ICCV
2007
IEEE
16 years 9 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...
166
click to vote
WWW
2009
ACM
16 years 8 months ago
2009
ACM
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
168
click to vote
IJCAI
2001
15 years 9 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...