215 search results - page 11 / 43 » Approximating Geometrical Graphs via |
WG
2010
Springer
13 years 8 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
ESANN
2004
13 years 11 months ago
2004
The role of dendritic spines in neuronal information processing is still not completely clear. However, it is known that spines can change shape rapidly during development and duri...
FOCS
2010
IEEE
13 years 7 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
SLP
1997
13 years 11 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
ICPR
2004
IEEE
14 years 11 months ago
2004
IEEE
We present a framework for edge detection in range images acquired by a time of flight laser sensor. Our edge detection approach is inspired by [7], in the context of which edge d...