237 search results - page 28 / 48 » Improved Approximations of Independent Sets in Bounded-Degre... |
IM
2007
13 years 7 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
ISBI
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a general framework for image discrimination based on identifying small, localized differences between images. Our novel matching scheme is based on an alternate inform...
AIPS
2000
13 years 9 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
EJC
2007
13 years 7 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...