Sciweavers

2111 search results - page 8 / 423
» Understanding the Yarowsky Algorithm
Sort
View
EMNLP
2007
13 years 11 months ago
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
David A. Smith, Jason Eisner
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
13 years 8 months ago
The Computational Structure of Progress Conditions
Abstract. Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n...
Gadi Taubenfeld
IJCV
2006
120views more  IJCV 2006»
13 years 10 months ago
Contour Inferences for Image Understanding
We present a new approach to the algorithmic study of planar curves, with applications to estimations of contours in images. We construct spaces of curves satisfying constraints su...
Washington Mio, Anuj Srivastava, Xiuwen Liu
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
14 years 2 months ago
Indirect co-evolution for understanding belief in an incomplete information dynamic game
This study aims to design a new co-evolution algorithm, Mixture Co-evolution which enables modeling of integration and composition of direct co-evolution and indirect coevolution....
Nanlin Jin