Sciweavers

9842 search results - page 1758 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
15 years 10 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
SASO
2009
IEEE
15 years 10 months ago
Evolution of Probabilistic Consensus in Digital Organisms
—The complexity of distributed computing systems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and ...
David B. Knoester, Philip K. McKinley
ICPP
2009
IEEE
15 years 10 months ago
End-to-End Study of Parallel Volume Rendering on the IBM Blue Gene/P
—In addition to their role as simulation engines, modern supercomputers can be harnessed for scientific visualization. Their extensive concurrency, parallel storage systems, and...
Tom Peterka, Hongfeng Yu, Robert B. Ross, Kwan-Liu...
ICRA
2009
IEEE
145views Robotics» more  ICRA 2009»
15 years 10 months ago
Distributed maximum a posteriori estimation for multi-robot cooperative localization
— This paper presents a distributed Maximum A Posteriori (MAP) estimator for multi-robot Cooperative Localization (CL). As opposed to centralized MAP-based CL, the proposed algor...
Esha D. Nerurkar, Stergios I. Roumeliotis, Agostin...
ICRA
2009
IEEE
83views Robotics» more  ICRA 2009»
15 years 10 months ago
Real-time correlative scan matching
— Scan matching, the problem of registering two laser scans in order to determine the relative positions from which the scans were obtained, is one of the most heavily relied-upo...
Edwin B. Olson
« Prev « First page 1758 / 1969 Last » Next »