67 search results - page 9 / 14 » Local versus Global Search in Channel Graphs |
SIAMSC
2008
14 years 9 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
ICCAD
1993
IEEE
15 years 1 months ago
1993
IEEE
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...
NIPS
2003
14 years 11 months ago
2003
This paper presents a novel graph-theoretic approach, named ratio contour, to extract perceptually salient boundaries from a set of noisy boundary fragments detected in real image...
ICDCS
2005
IEEE
15 years 3 months ago
2005
IEEE
The link structure of the Web graph is used in algorithms such as Kleinberg’s HITS and Google’s PageRank to assign authoritative weights to Web pages and thus rank them. Both ...
JAIR
2006
14 years 9 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...