Sciweavers

415 search results - page 41 / 83
» Regular Processes and Timed Automata
Sort
View
ICGI
2000
Springer
14 years 8 days 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
IR
2002
13 years 8 months ago
Threshold Setting and Performance Optimization in Adaptive Filtering
An experimental adaptive filtering system, built on the Okapi search engine, is described. In addition to the regular text retrieval functions, the system requires a complex set o...
Stephen E. Robertson
FUIN
2007
114views more  FUIN 2007»
13 years 8 months ago
Cellular Devices and Unary Languages
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
Andreas Klein, Martin Kutrib
ALT
1998
Springer
14 years 28 days ago
Predictive Learning Models for Concept Drift
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
John Case, Sanjay Jain, Susanne Kaufmann, Arun Sha...
POPL
1995
ACM
14 years 6 days ago
Default Timed Concurrent Constraint Programming
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta