6740 search results - page 1346 / 1348 » An s -Hamiltonian Line Graph Problem |
URBAN
2011
13 years 2 months ago
2011
This paper reports on the development and application of strategies and tools for geographic information seeking and knowledge building that leverages unstructured text resources ...
TVCG
2011
13 years 2 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
SIAMIS
2010
13 years 2 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
TSP
2010
13 years 2 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...