145 search results - page 5 / 29 » On finding approximate optimal paths in weighted regions |
FOIKS
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
SMC
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
IPL
2006
13 years 7 months ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
ICPPW
2002
IEEE
14 years 12 days ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We present an active geodesic contour model in which we constrain the evolving active contour to be a geodesic with respect to a weighted edge-based energy through its entire evol...