34 search results - page 2 / 7 » Towards General Algorithms for Grammatical Inference |
125
Voted
JIIS
2008
15 years 3 months ago
2008
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
176
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
160
Voted
SAS
1994
Springer
15 years 7 months ago
1994
Springer
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
126
Voted
TAPSOFT
1997
Springer
15 years 8 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
153
Voted
CVPR
2010
IEEE
16 years 4 days ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...