Sciweavers

1206 search results - page 150 / 242
» Convergence analysis of online algorithms
Sort
View
IWCIA
2009
Springer
15 years 2 months ago
What Does Digital Straightness Tell about Digital Convexity?
Abstract. The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary...
Tristan Roussillon, Laure Tougne, Isabelle Sivigno...
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
15 years 1 months ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig
ICRA
2009
IEEE
133views Robotics» more  ICRA 2009»
15 years 4 months ago
A stochastically stable solution to the problem of robocentric mapping
Abstract— This paper provides a novel solution for robocentric mapping using an autonomous mobile robot. The robot dynamic model is the standard unicycle model and the robot is a...
Adrian N. Bishop, Patric Jensfelt
ICRA
2009
IEEE
94views Robotics» more  ICRA 2009»
15 years 4 months ago
Inferring a probability distribution function for the pose of a sensor network using a mobile robot
— In this paper we present an approach for localizing a sensor network augmented with a mobile robot which is capable of providing inter-sensor pose estimates through its odometr...
David Meger, Dimitri Marinakis, Ioannis M. Rekleit...
ICB
2009
Springer
159views Biometrics» more  ICB 2009»
15 years 4 months ago
Multilinear Tensor-Based Non-parametric Dimension Reduction for Gait Recognition
The small sample size problem and the difficulty in determining the optimal reduced dimension limit the application of subspace learning methods in the gait recognition domain. To...
Changyou Chen, Junping Zhang, Rudolf Fleischer