Sciweavers

166 search results - page 23 / 34
» Complexity of Some Geometric and Topological Problems
Sort
View
TROB
2008
168views more  TROB 2008»
13 years 8 months ago
A Minimalistic Approach to Appearance-Based Visual SLAM
This paper presents a vision-based approach to SLAM in indoor / outdoor environments with minimalistic sensing and computational requirements. The approach is based on a graph repr...
Henrik Andreasson, Tom Duckett, Achim J. Lilientha...
VLSID
2002
IEEE
136views VLSI» more  VLSID 2002»
14 years 9 months ago
Buffered Routing Tree Construction under Buffer Placement Blockages
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
Wei Chen, Massoud Pedram, Premal Buch
COMPGEOM
2011
ACM
13 years 5 days ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
PVM
1997
Springer
14 years 23 days ago
Message-Passing Program Development by Ensemble
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing enviro...
John Yiannis Cotronis
IVC
2007
131views more  IVC 2007»
13 years 8 months ago
Multi-view correspondence by enforcement of rigidity constraints
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
Ricardo Oliveira, João Xavier, João ...