Sciweavers

119 search results - page 17 / 24
» Exploring the Regular Tree Types
Sort
View
JMLR
2011
105views more  JMLR 2011»
13 years 2 months ago
Posterior Sparsity in Unsupervised Dependency Parsing
A strong inductive bias is essential in unsupervised grammar induction. In this paper, we explore a particular sparsity bias in dependency grammars that encourages a small number ...
Jennifer Gillenwater, Kuzman Ganchev, João ...
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 7 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
WFLP
2000
Springer
148views Algorithms» more  WFLP 2000»
13 years 11 months ago
The Use of Functional and Logic Languages in Machine Learning
Abstract. Traditionally, machine learning algorithms such as decision tree learners have employed attribute-value representations. From the early 80's on people have started t...
Peter A. Flach
IJDMMM
2008
72views more  IJDMMM 2008»
13 years 7 months ago
Mining event histories: a social science perspective
We explore how recent data-mining-based tools developed in domains such as biomedicine or text-mining for extracting interesting knowledge from sequence data could be applied to pe...
Gilbert Ritschard, Alexis Gabadinho, Nicolas S. M&...
BMCBI
2005
134views more  BMCBI 2005»
13 years 7 months ago
Ancestral sequence alignment under optimal conditions
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
Alexander K. Hudek, Daniel G. Brown 0001