Sciweavers

338 search results - page 5 / 68
» Approximation Spaces and Information Granulation
Sort
View
SPIRE
1998
Springer
13 years 11 months ago
Fast Approximate String Matching in a Dictionary
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
Ricardo A. Baeza-Yates, Gonzalo Navarro
NIPS
2003
13 years 8 months ago
Approximate Planning in POMDPs with Macro-Actions
Recent research has demonstrated that useful POMDP solutions do not require consideration of the entire belief space. We extend this idea with the notion of temporal abstraction. ...
Georgios Theocharous, Leslie Pack Kaelbling
CDC
2009
IEEE
14 years 3 days ago
Metrics on the space of bounded Keplerian orbits and space situational awareness
— A main difficulty for orbit determination of space debris is the correlation of tracks of data belonging to the same physical object. A sequence of optical measurements of an ...
Jared M. Maruskin, Daniel J. Scheeres
AI
2011
Springer
13 years 2 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
LATIN
1998
Springer
13 years 11 months ago
Improved Approximate Pattern Matching on Hypertext
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
Gonzalo Navarro