Sciweavers

226 search results - page 26 / 46
» Parsing with the Shortest Derivation
Sort
View
ACL
1998
13 years 11 months ago
Compacting the Penn Treebank Grammar
Treebanks, such as the Penn Treebank (PTB), offer a simple approach to obtaining a broad coverage grammar: one can simply read the grammar off the parse trees in the treebank. Whi...
Alexander Krotov, Mark Hepple, Robert J. Gaizauska...
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 10 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
EOR
2007
90views more  EOR 2007»
13 years 9 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
JSAC
2007
119views more  JSAC 2007»
13 years 9 months ago
Cooperative routing for distributed detection in large sensor networks
— In this paper, the detection of a correlated Gaussian field using a large multi-hop sensor network is investigated. A cooperative routing strategy is proposed by introducing a...
Youngchul Sung, Saswat Misra, Lang Tong, Anthony E...
JDA
2008
122views more  JDA 2008»
13 years 9 months ago
An approximation algorithm for sorting by reversals and transpositions
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan