Sciweavers

3250 search results - page 43 / 650
» Parameterized Learning Complexity
Sort
View
ACL
2004
13 years 11 months ago
Discriminative Training of a Neural Network Statistical Parser
Discriminative methods have shown significant improvements over traditional generative methods in many machine learning applications, but there has been difficulty in extending th...
James Henderson
FSTTCS
2010
Springer
13 years 8 months ago
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
Sebastian Ordyniak, Daniël Paulusma, Stefan S...
EMNLP
2007
13 years 11 months ago
Determining Case in Arabic: Learning Complex Linguistic Behavior Requires Complex Linguistic Features
This paper discusses automatic determination of case in Arabic. This task is an important part and major source of errors in full diacritization of Arabic. We use a goldstandard s...
Nizar Habash, Ryan Gabbard, Owen Rambow, Seth Kuli...
COCO
2008
Springer
93views Algorithms» more  COCO 2008»
13 years 11 months ago
Learning Complexity vs. Communication Complexity
Nati Linial, Adi Shraibman
COLT
2001
Springer
14 years 2 months ago
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy le...
Sanjay Jain, Efim B. Kinber