762 search results - page 10 / 153 » Intercode Regular Languages |
ENTCS
2002
13 years 7 months ago
2002
d Abstract) Naoshi Tabuchi Eijiro Sumii Akinori Yonezawa 1 Department of Computer Science, Graduate School of Information Science and Technology, University of Tokyo We present re...
ITA
2007
13 years 7 months ago
2007
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...
DBPL
2007
Springer
14 years 1 months ago
2007
Springer
Martens et al. defined a pattern-based specification language equivalent in expressive power to the widely adopted XML Schema definitions (XSDs). This language consists of rules...
JMLR
2012
11 years 9 months ago
2012
We consider the multiple-response regression problem, where the response is subject to sparse gross errors, in the high-dimensional setup. We propose a tractable regularized M-est...
IANDC
2007
13 years 7 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...