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...
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...
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...
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...
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...