Sciweavers

1036 search results - page 27 / 208
» Algorithms for Learning Regular Expressions
Sort
View
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
15 years 1 months ago
Semi-Supervised Learning Based on Semiparametric Regularization
Semi-supervised learning plays an important role in the recent literature on machine learning and data mining and the developed semisupervised learning techniques have led to many...
Zhen Guo, Zhongfei (Mark) Zhang, Eric P. Xing, Chr...
218
Voted
APWEB
2011
Springer
14 years 7 months ago
Assisting the Design of XML Schema: Diagnosing Nondeterministic Content Models
One difficulty in the design of XML Schema is the restriction that the content models should be deterministic, i. e., the Unique Particle Attribution (UPA) constraint, which means ...
Haiming Chen, Ping Lu
PLDI
2011
ACM
14 years 3 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
LREC
2008
65views Education» more  LREC 2008»
15 years 1 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
104
Voted
PLDI
2004
ACM
15 years 5 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....