Sciweavers

6365 search results - page 125 / 1273
» Fast Local Computation Algorithms
Sort
View
CVPR
2004
IEEE
16 years 6 months ago
Fast Wide Baseline Matching for Visual Navigation
A new and fast way to find local image correspondences for wide baseline image matching is described. The targeted application is visual navigation, e.g. of a semi-automatic wheel...
Luc J. Van Gool, Tinne Tuytelaars, Toon Goedem&eac...
CORR
2008
Springer
133views Education» more  CORR 2008»
15 years 4 months ago
A simple local 3-approximation algorithm for vertex cover
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
Valentin Polishchuk, Jukka Suomela
ISQED
2005
IEEE
119views Hardware» more  ISQED 2005»
15 years 10 months ago
Fast Decap Allocation Algorithm For Robust On-Chip Power Delivery
Adding on-chip decoupling capacitors (decaps) is an effective way to reduce voltage noise in power/ground networks and ensure robust power delivery. In this paper, we present a fa...
Zhenyu Qi, Hang Li, Sheldon X.-D. Tan, Lifeng Wu, ...
EWSN
2006
Springer
16 years 4 months ago
Hierarchical Localization Algorithm Based on Inverse Delaunay Tessellation
Masayuki Saeki, Junya Inoue, Kok-How Khor, Tomohir...
MICCAI
2005
Springer
16 years 5 months ago
A Physical Model for DT-MRI Based Connectivity Map Computation
In this study we address the problem of extracting a robust connectivity metric for brain white matter. We defined the connectivity problem as an energy minimization task, by assoc...
Burak Acar, Erdem Yörük, Roland Bammer