Sciweavers

3724 search results - page 89 / 745
» Timed regular expressions
Sort
View
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 5 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
123
Voted
SAS
1991
Springer
15 years 7 months ago
Polymorphic Time Systems for Estimating Program Complexity
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
Vincent Dornic, Pierre Jouvelot, David K. Gifford
JMLR
2006
143views more  JMLR 2006»
15 years 3 months ago
Consistency and Convergence Rates of One-Class SVMs and Related Algorithms
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...
Régis Vert, Jean-Philippe Vert
ITA
2007
101views Communications» more  ITA 2007»
15 years 3 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau
LREC
2008
65views Education» more  LREC 2008»
15 years 5 months ago
A Three-stage Disfluency Classifier for Multi Party Dialogues
We present work on a three-stage system to detect and classify disfluencies in multi party dialogues. The system consists of a regular expression based module and two machine lear...
Margot Mieskes, Michael Strube