Sciweavers

6365 search results - page 222 / 1273
» Fast Local Computation Algorithms
Sort
View
150
Voted
ICPR
2008
IEEE
16 years 25 days ago
On the scalability of robot localization using high-dimensional features
This study provides an investigation of scalability of mobile robot localization. In recent years, inference algorithms based on map-matching have proved their superior performanc...
Takeshi Ueda, Kanji Tanaka
SIBGRAPI
2000
IEEE
15 years 10 months ago
On Estimating Local Geometric Properties of Intersection Curves
This paper presents a simple and robust algorithm for estimating the local geometric properties of intersection curves, namely the tangent, normal, binormal, curvature and torsion ...
Shin-Ting Wu, Osmar Aléssio, Sueli I. Rodri...
OPODIS
2003
15 years 7 months ago
Detecting Locally Stable Predicates Without Modifying Application Messages
In this paper, we give an efficient algorithm to determine whether a locally stable predicate has become true in an underlying computation. Examples of locally stable predicates in...
Ranganath Atreya, Neeraj Mittal, Vijay K. Garg
182
Voted
ICMCS
2008
IEEE
151views Multimedia» more  ICMCS 2008»
16 years 25 days ago
Fast keyword detection with sparse time-frequency models
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...
Effrosini Kokiopoulou, Pascal Frossard, Olivier Ve...
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 6 months ago
Fast paths in large-scale dynamic road networks
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
Giacomo Nannicini, Philippe Baptiste, Gilles Barbi...