1402 search results - page 105 / 281 » Sparse-Memory Graph Search |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
With the increasing importance of search in guiding today's web traffic, more and more effort has been spent to create search engine spam. Since link analysis is one of the m...
ACCV
2010
Springer
14 years 5 months ago
2010
Springer
In this paper, we proposed a fast and accurate human pose estimation framework that combines top-down and bottom-up methods. The framework consists of an initialization stage and a...
CP
2006
Springer
15 years 1 months ago
2006
Springer
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...