Sciweavers

5170 search results - page 285 / 1034
» Consistency of the FastSLAM Algorithm
Sort
View
LMCS
2006
126views more  LMCS 2006»
15 years 1 months ago
The Completeness of Propositional Resolution: A Simple and Constructive Proof
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing tha...
Jean H. Gallier
CORR
2002
Springer
117views Education» more  CORR 2002»
15 years 1 months ago
Computing stable models: worst-case performance estimates
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Zbigniew Lonc, Miroslaw Truszczynski
IJDAR
2002
98views more  IJDAR 2002»
15 years 1 months ago
An unconstrained handwriting recognition system
Abstract. In this paper, an integrated offline recognition system for unconstrained handwriting is presented. The proposed system consists of seven main modules: skew angle estimat...
Ergina Kavallieratou, Nikos Fakotakis, George K. K...
TIP
2002
110views more  TIP 2002»
15 years 1 months ago
Localization based on DEM matching using multiple aerial image pairs
This paper proposes the localization algorithm that estimates translation parameters of an aircraft by comparing the sampled elevation map recovered from aerial sequence images, an...
Dong-Gyu Sim, Rae-Hong Park
107
Voted
ALGORITHMICA
2010
115views more  ALGORITHMICA 2010»
15 years 1 months ago
Multi-Color Pebble Motion on Graphs
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
Gilad Goraly, Refael Hassin