Sciweavers

1154 search results - page 119 / 231
» On the editing distance of graphs
Sort
View
IJIG
2002
117views more  IJIG 2002»
13 years 9 months ago
Eigenspaces for Graphs
In this paper, we investigate the feasibility of using graph-based descriptions to learn the view structure of 3D objects. The graphs used in our study are constructed from the De...
Bin Luo, Edwin R. Hancock, Richard C. Wilson
ICALP
2007
Springer
14 years 4 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 10 months ago
Longest paths in Planar DAGs in Unambiguous Logspace
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
SSPR
2004
Springer
14 years 3 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...
HYBRID
2010
Springer
14 years 3 months ago
Distributed Kalman Filter algorithms for self-localization of mobile devices
This paper addresses the problem of self localization of mobile devices. In particular, each device combines noisy measurements of its absolute position with distance measurements...
Anne-Kathrin Hess, Anders Rantzer