134 search results - page 17 / 27 » An Heuristic for the Construction of Intersection Graphs |
COMPGEOM
2006
ACM
13 years 9 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—In road networks, sensors are deployed sparsely (hundreds of meters apart) to save costs. This makes the existing localization solutions based on the ranging be ineffect...
COMPGEOM
2000
ACM
13 years 12 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
ASPDAC
1998
ACM
13 years 11 months ago
1998
ACM
- In this paper, we study the wire sizing and wire spacing problem for post-layout performance optimization under Elmore delay model. Both ground capacitance and coupled capacitanc...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
A novel framework for image inpainting is proposed, relying on graph-based diffusion processes. Depending on the construction of the graph, both flow-based and exemplar-based inpa...