Sciweavers

1192 search results - page 234 / 239
» Computing Weakest Readings
Sort
View
IJRR
2002
175views more  IJRR 2002»
14 years 11 months ago
Navigation Strategies for Exploring Indoor Environments
This paper investigates safe and efficient map-building strategies for a mobile robot with imperfect control and sensing. In the implementation, a robot equipped with a range sens...
Héctor H. González-Baños, Jea...
108
Voted
MST
2002
128views more  MST 2002»
14 years 11 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
102
Voted
NECO
1998
151views more  NECO 1998»
14 years 11 months ago
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
We describe a new method for performing a nonlinear form of Principal Component Analysis. By the use of integral operator kernel functions, we can e ciently compute principal comp...
Bernhard Schölkopf, Alex J. Smola, Klaus-Robe...
113
Voted
JFR
2007
163views more  JFR 2007»
14 years 11 months ago
Real-time localization and elevation mapping within urban search and rescue scenarios
Urban Search And Rescue (USAR) is a time critical task. Rescue teams have to explore a large terrain within a short amount of time in order to locate survivors after a disaster. O...
Alexander Kleiner, Christian Dornhege
MST
2007
122views more  MST 2007»
14 years 11 months ago
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
Consider a collection of r identical asynchronous mobile agents dispersed on an arbitrary anonymous network of size n. The agents all execute the same protocol and move from node ...
Lali Barrière, Paola Flocchini, Pierre Frai...