RAS
2006
13 years 11 months ago
2006
In this paper, we present techniques that allow one or multiple mobile robots to efficiently explore and model their environment. While much existing research in the area of Simul...
SIAMSC
2008
13 years 11 months ago
2008
This paper discusses both the theoretical and statistical errors obtained by various well-known dot products, from the canonical to pairwise algorithms, and introduces a new and mo...
SIAMSC
2008
13 years 11 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
SIAMSC
2008
13 years 11 months ago
2008
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
SIAMJO
2008
13 years 11 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
IJAR
2007
13 years 11 months ago
2007
The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domai...
PRL
2006
13 years 11 months ago
2006
To recover depth from images, the human visual system uses many monocular depth cues, which vision research has only begun to explore. Because a given image can have many possible...
PRL
2006
13 years 11 months ago
2006
This paper introduces a method for rejecting the false matches of points between successive views in a video sequence used to perform Pose from Motion for a mobile sensing platfor...
SIAMCOMP
2008
13 years 11 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
SIAMCOMP
2008
13 years 11 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...