Sciweavers

1029 search results - page 44 / 206
» Probabilistic Recurrence Relations
Sort
View
JCT
2010
87views more  JCT 2010»
14 years 8 months ago
Bijections between pattern-avoiding fillings of Young diagrams
The pattern-avoiding fillings of Young diagrams we study arose from Postnikov’s work on positive Grassman cells. They are called Γ -diagrams, and are in bijection with decorate...
Matthieu Josuat-Vergès
EC
2008
157views ECommerce» more  EC 2008»
14 years 9 months ago
The Crowding Approach to Niching in Genetic Algorithms
A wide range of niching techniques have been investigated in evolutionary and genetic algorithms. In this article, we focus on niching using crowding techniques in the context of ...
Ole J. Mengshoel, David E. Goldberg
ACL
2001
14 years 11 months ago
Parse Forest Computation of Expected Governors
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
Helmut Schmid, Mats Rooth
ACL
2009
14 years 8 months ago
Distant supervision for relation extraction without labeled data
Modern models of relation extraction for tasks like ACE are based on supervised learning of relations from small hand-labeled corpora. We investigate an alternative paradigm that ...
Mike Mintz, Steven Bills, Rion Snow, Daniel Jurafs...
ACL
2011
14 years 2 months ago
In-domain Relation Discovery with Meta-constraints via Posterior Regularization
We present a novel approach to discovering relations and their instantiations from a collection of documents in a single domain. Our approach learns relation types by exploiting m...
Harr Chen, Edward Benson, Tahira Naseem, Regina Ba...