Sciweavers

675 search results - page 24 / 135
» Biased Range Trees
Sort
View
EMNLP
2010
14 years 9 months ago
Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing
Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency gram...
Phil Blunsom, Trevor Cohn
CORR
2007
Springer
86views Education» more  CORR 2007»
14 years 11 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert
103
Voted
DATAMINE
2010
166views more  DATAMINE 2010»
14 years 11 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
89
Voted
RANLP
2003
15 years 8 days ago
Structured parameter estimation for LFG-DOP
Despite its state-of-the-art performance, the Data Oriented Parsing (DOP) model has been shown to suffer from biased parameter estimation, and the good performance seems more the ...
Mary Hearne, Khalil Sima'an
93
Voted
ICDCN
2009
Springer
15 years 3 months ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon