Sciweavers

124 search results - page 11 / 25
» Antichain Algorithms for Finite Automata
Sort
View
ANCS
2007
ACM
15 years 7 months ago
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
Sailesh Kumar, Balakrishnan Chandrasekaran, Jonath...
ACL
2004
15 years 5 months ago
Discriminative Language Modeling with Conditional Random Fields and the Perceptron Algorithm
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...
Brian Roark, Murat Saraclar, Michael Collins, Mark...
NIPS
2003
15 years 5 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
CONCUR
2010
Springer
15 years 5 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...
125
Voted
CORR
2007
Springer
100views Education» more  CORR 2007»
15 years 3 months ago
Interference Automata
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate th...
M. V. Panduranga Rao