Sciweavers

6365 search results - page 91 / 1273
» Fast Local Computation Algorithms
Sort
View
IJCV
2002
96views more  IJCV 2002»
15 years 2 months ago
A VLSI-Compatible Computer Vision Algorithm for Stereoscopic Depth Analysis in Real-Time
The analysis of the depth coordinates of objects in a visual scene is of vital importance for animals as well as in technological applications like autonomous robot navigation or p...
Bernd Porr, Bernd Nürenberg, Florentin Wö...
CORR
2008
Springer
162views Education» more  CORR 2008»
15 years 2 months ago
Accelerating Scientific Computations with Mixed Precision Algorithms
On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit ...
Marc Baboulin, Alfredo Buttari, Jack Dongarra, Jak...
GREC
2009
Springer
15 years 5 months ago
A Performance Characterization Algorithm for Symbol Localization
In this paper we present an algorithm for performance characterization of symbol localization systems. This algorithm is aimed to be a more “reliable” and “open” solution t...
Mathieu Delalandre, Jean-Yves Ramel, Ernest Valven...
120
Voted
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 2 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
123
Voted
ADHOCNOW
2008
Springer
15 years 8 months ago
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
Andreas Wiese, Evangelos Kranakis