Sciweavers

10608 search results - page 455 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ACSC
2007
IEEE
15 years 11 months ago
Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
Lin Tian, Tadao Takaoka
IPPS
2007
IEEE
15 years 11 months ago
Challenges in Mapping Graph Exploration Algorithms on Advanced Multi-core Processors
Multi-core processors are a shift of paradigm in computer architecture that promises a dramatic increase in performance. But multi-core processors also bring an unprecedented leve...
Oreste Villa, Daniele Paolo Scarpazza, Fabrizio Pe...
IROS
2007
IEEE
135views Robotics» more  IROS 2007»
15 years 11 months ago
Power-SLAM: A linear-complexity, consistent algorithm for SLAM
— In this paper, we present an Extended Kalman Filter (EKF)-based estimator for simultaneous localization and mapping (SLAM) with processing requirements that are linear in the n...
Esha D. Nerurkar, Stergios I. Roumeliotis
EVOW
2007
Springer
15 years 11 months ago
Unsupervised Evolutionary Segmentation Algorithm Based on Texture Analysis
Abstract. This work describes an evolutionary approach to texture segmentation, a long-standing and important problem in computer vision. The difficulty of the problem can be relat...
Cynthia B. Pérez, Gustavo Olague
DSD
2006
IEEE
110views Hardware» more  DSD 2006»
15 years 11 months ago
A Graph Based Algorithm for Data Path Optimization in Custom Processors
The rising complexity, customization and short time to market of modern digital systems requires automatic methods for generation of high performance architectures for such system...
Jelena Trajkovic, Mehrdad Reshadi, Bita Gorjiara, ...