Sciweavers

759 search results - page 35 / 152
» Overlap-Free Regular Languages
Sort
View
FUIN
2007
133views more  FUIN 2007»
13 years 8 months ago
Intercode Regular Languages
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
Yo-Sub Han, Kai Salomaa, Derick Wood
JALC
2007
95views more  JALC 2007»
13 years 8 months ago
Learning Regular Tree Languages from Correction and Equivalence Queries
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
Catalin Ionut Tîrnauca, Cristina Tîrna...
ITA
2007
101views Communications» more  ITA 2007»
13 years 8 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
IR
2002
13 years 8 months ago
Threshold Setting and Performance Optimization in Adaptive Filtering
An experimental adaptive filtering system, built on the Okapi search engine, is described. In addition to the regular text retrieval functions, the system requires a complex set o...
Stephen E. Robertson
JMLR
2012
11 years 11 months ago
Robust Multi-task Regression with Grossly Corrupted Observations
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...
Huan Xu, Chenlei Leng