6365 search results - page 169 / 1273 » Fast Local Computation Algorithms |
173
click to vote
FOCS
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
193
click to vote
FOCS
2010
IEEE
15 years 3 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...
155
Voted
FGR
2006
IEEE
15 years 11 months ago
2006
IEEE
The computer is an ubiquitous element of modern society, nonetheless, human computer interaction is still rather inflexible. Particularly in local collaborative environments, lik...
142
click to vote
MICCAI
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. We present a new method for the fast and robust computation of information theoretic similarity measures for alignment of multi-modality medical images. The proposed meth...
138
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
— We aim to perform robust and fast vision-based localization using a pre-existing large map of the scene. A key step in localization is associating the features extracted from t...