Sciweavers

2723 search results - page 16 / 545
» Learning lexicographic orders
Sort
View
CPM
2009
Springer
183views Combinatorics» more  CPM 2009»
13 years 5 months ago
Permuted Longest-Common-Prefix Array
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
Juha Kärkkäinen, Giovanni Manzini, Simon...
LREC
2010
143views Education» more  LREC 2010»
13 years 8 months ago
Learning Morphology of Romance, Germanic and Slavic Languages with the Tool Linguistica
In this paper we present preliminary work conducted on semi-automatic induction of inflectional paradigms from non annotated corpora using the open-source tool Linguistica (Goldsm...
Helena Blancafort
FLAIRS
2011
12 years 11 months ago
Learning Opponent Strategies through First Order Induction
In a competitive game it is important to identify the opponent’s strategy as quickly and accurately as possible so that an effective response can be staged. In this vain, this p...
Katie Long Genter, Santiago Ontañón,...
ICML
2003
IEEE
14 years 8 months ago
Weighted Order Statistic Classifiers with Large Rank-Order Margin
We investigate how stack filter function classes like weighted order statistics can be applied to classification problems. This leads to a new design criteria for linear classifie...
Reid B. Porter, Damian Eads, Don R. Hush, James Th...
ECML
2006
Springer
13 years 11 months ago
(Agnostic) PAC Learning Concepts in Higher-Order Logic
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
Kee Siong Ng