Sciweavers

559 search results - page 5 / 112
» Dependency Inference
Sort
View
FLOPS
2008
Springer
13 years 9 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
EMNLP
2007
13 years 9 months ago
A Constraint Satisfaction Approach to Dependency Parsing
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighte...
Sander Canisius, Erik Tjong Kim Sang
UAI
2000
13 years 8 months ago
Probabilistic State-Dependent Grammars for Plan Recognition
Techniques for plan recognition under uncertainty require a stochastic model of the plangeneration process. We introduce probabilistic state-dependent grammars (PSDGs) to represen...
David V. Pynadath, Michael P. Wellman
JUCS
2008
100views more  JUCS 2008»
13 years 7 months ago
Stacked Dependency Networks for Layout Document Structuring
: We address the problems of structuring and annotation of layout-oriented documents. We model the annotation problems as the collective classification on graph-like structures wit...
Boris Chidlovskii, Loïc Lecerf
TACAS
2005
Springer
106views Algorithms» more  TACAS 2005»
14 years 28 days ago
Dependent Types for Program Understanding
Abstract. Weakly-typed languages such as Cobol often force programrepresent distinct data abstractions using the same low-level physical type. In this paper, we describe a techniqu...
Raghavan Komondoor, Ganesan Ramalingam, Satish Cha...