Sciweavers

82 search results - page 17 / 17
» cacm 2010
Sort
View
COLT
2010
Springer
14 years 10 months ago
Learning to Create is as Hard as Learning to Appreciate
We explore the relationship between a natural notion of unsupervised learning studied by Kearns et al. (STOC '94), which we call here "learning to create" (LTC), an...
David Xiao
SPIRE
2010
Springer
14 years 10 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura