Sciweavers

3750 search results - page 357 / 750
» Timed Automata Patterns
Sort
View
ICGI
2000
Springer
15 years 8 months ago
Computation of Substring Probabilities in Stochastic Grammars
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
Ana L. N. Fred
CIARP
2006
Springer
15 years 6 months ago
A Probabilistic Approach to Build 2D Line Based Maps from Laser Scans in Indoor Environments
In this work we consider a mobile robot with a laser range finder. Our goal is to find the best set of lines from the sequence of points given by a laser scan. We propose a probabi...
Leonardo Romero, Carlos Lara
FLAIRS
2001
15 years 6 months ago
Tracking Clusters in Evolving Data Sets
As organizations accumulate data over time, the problem of tracking how patterns evolve becomes important. In this paper, we present an algorithm to track the evolution of cluster...
Daniel Barbará, Ping Chen
153
Voted
BMVC
1998
15 years 6 months ago
Choosing an Optimal Neural Network Size to aid a Search Through a Large Image Database
In this paper a fast method of selecting a neural network architecture for pattern recognition tasks is presented. We demonstrate that our proposed method of selecting both input ...
Kieron Messer, Josef Kittler
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 6 months ago
Real scaled matching
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scale...
Amihood Amir, Ayelet Butman, Moshe Lewenstein