Sciweavers

759 search results - page 6 / 152
» Odometers on Regular Languages
Sort
View
PAAMS
2010
Springer
13 years 5 months ago
A Case Study on Grammatical-Based Representation for Regular Expression Evolution
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
Antonio González-Pardo, David F. Barrero, D...
CONCUR
2009
Springer
13 years 5 months ago
On Convergence of Concurrent Systems under Regular Interactions
Convergence is often the key liveness property for distributed systems that interact with physical processes. Techniques for proving convergence (asymptotic stability) have been ex...
Pavithra Prabhakar, Sayan Mitra, Mahesh Viswanatha...
DLT
2006
13 years 8 months ago
Prime Decompositions of Regular Languages
We investigate factorizations of regular languages in terms of prime languages. A language is said to be strongly prime decomposable if any way of factorizing the language yields a...
Yo-Sub Han, Kai Salomaa, Derick Wood
JMLR
2012
11 years 9 months ago
A Simple Geometric Interpretation of SVM using Stochastic Adversaries
We present a minimax framework for classification that considers stochastic adversarial perturbations to the training data. We show that for binary classification it is equivale...
Roi Livni, Koby Crammer, Amir Globerson
TON
2012
11 years 9 months ago
Scalable Lookahead Regular Expression Detection System for Deep Packet Inspection
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao