Sciweavers

3105 search results - page 452 / 621
» The Path-Packing Structure of Graphs
Sort
View
DIALM
2004
ACM
113views Algorithms» more  DIALM 2004»
15 years 9 months ago
Gathering correlated data in sensor networks
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
Pascal von Rickenbach, Roger Wattenhofer
ISAAC
2004
Springer
107views Algorithms» more  ISAAC 2004»
15 years 9 months ago
On the Hardness and Easiness of Random 4-SAT Formulas
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
Andreas Goerdt, André Lanka
WOMPAT
2004
Springer
15 years 9 months ago
Dragon: A Static and Dynamic Tool for OpenMP
A program analysis tool can play an important role in helping users understand and improve OpenMP codes. Dragon is a robust interactive program analysis tool based on the Open64 co...
Oscar Hernandez, Chunhua Liao, Barbara M. Chapman
ICRA
2003
IEEE
146views Robotics» more  ICRA 2003»
15 years 9 months ago
An atlas framework for scalable mapping
Abstract— This paper describes Atlas, a hybrid metrical/topological approach to SLAM that achieves efficient mapping of large-scale environments. The representation is a graph o...
Michael Bosse, Paul M. Newman, John J. Leonard, Ma...
103
Voted
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
15 years 9 months ago
PCG: a foothold selection algorithm for spider robot locomotion in 2D tunnels
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
Amir Shapiro, Elon Rimon