Sciweavers

1612 search results - page 125 / 323
» Asynchronous Pattern Matching
Sort
View
RISE
2005
Springer
15 years 7 months ago
Formal Development of Reactive Fault Tolerant Systems
Usually complex systems are controlled by an operator co-operating with a computer-based controller. The controlling software runs in continuous interaction with the operator and c...
Linas Laibinis, Elena Troubitsyna
102
Voted
COMCOM
2000
82views more  COMCOM 2000»
15 years 2 months ago
Experience with RT-LOTOS, a temporal extension of the LOTOS formal description technique
This paper is devoted to the presentation of the RT-LOTOS formal description technique, which is a formalism suited for applications where concurrency, complex synchronization pat...
Jean-Pierre Courtiat, C. A. S. Santos, Christophe ...
SSPR
2000
Springer
15 years 6 months ago
Studies of Radical Model for Retrieval of Cursive Chinese Handwritten Annotations
Our research focuses on Chinese online ink matching that tries to match handwritten annotations with handwritten queries without attempting to recognize them. Previously, we propos...
Matthew Y. Ma, Chi Zhang, Patrick Shen-Pei Wang
CPM
2009
Springer
94views Combinatorics» more  CPM 2009»
15 years 9 months ago
Online Approximate Matching with Non-local Distances
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
Raphaël Clifford, Benjamin Sach
150
Voted
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
15 years 8 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang