Sciweavers

264 search results - page 13 / 53
» Learning Linearly Separable Languages
Sort
View
ACL
2009
13 years 6 months ago
Concise Integer Linear Programming Formulations for Dependency Parsing
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
André L. Martins, Noah A. Smith, Eric P. Xi...
NLPRS
2001
Springer
14 years 1 months ago
A Separate-and-Learn Approach to EM Learning of PCFGs
WeproposeanewapproachtoEMlearning of PCFGs. We completely separate the process of EM learning from that of parsing, andfor theformer, weintroduce a new EM algorithm called the gra...
Taisuke Sato, Shigeru Abe, Yoshitaka Kameya, Kiyoa...
CP
2005
Springer
14 years 2 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
AML
2005
104views more  AML 2005»
13 years 8 months ago
Weak theories of linear algebra
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
Neil Thapen, Michael Soltys
IJON
2010
150views more  IJON 2010»
13 years 7 months ago
Linear discriminant analysis using rotational invariant L1 norm
Linear Discriminant Analysis (LDA) is a well-known scheme for supervised subspace learning. It has been widely used in the applications of computer vision and pattern recognition....
Xi Li, Weiming Hu, Hanzi Wang, Zhongfei Zhang