Sciweavers

1225 search results - page 36 / 245
» Maximal Consistent Subsets
Sort
View
IROS
2006
IEEE
120views Robotics» more  IROS 2006»
14 years 1 months ago
Optimal local map size for EKF-based SLAM
Abstract— In this paper we show how to optimize the computational cost and maximize consistency in EKF-based SLAM for large environments. We combine Local Mapping with Map Joinin...
Lina María Paz, José Neira
POPL
1994
ACM
13 years 11 months ago
Dominators, Super Blocks, and Program Coverage
In this paper we present techniques to nd subsets of nodes of a owgraph that satisfy the followingproperty: A test set that exercises all nodes in a subset exercises allnodes in t...
Hiralal Agrawal
ALT
1998
Springer
13 years 12 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
VMV
2001
303views Visualization» more  VMV 2001»
13 years 9 months ago
Extracting Cylinders in Full 3D Data Using a Random Sampling Method and the Gaussian Image
This paper presents a new method for extracting cylinders from an unorganized set of 3D points. The originality of this approach is to separate the extraction problem into two dis...
Thomas Chaperon, François Goulette
ESA
2005
Springer
146views Algorithms» more  ESA 2005»
14 years 1 months ago
An Approximation Algorithm for the Minimum Latency Set Cover Problem
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
Refael Hassin, Asaf Levin