Sciweavers

9572 search results - page 265 / 1915
» Cover Algorithms and Their Combination
Sort
View
ICGI
2000
Springer
15 years 10 months ago
Computation of Substring Probabilities in Stochastic Grammars
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
Ana L. N. Fred
ICLP
1995
Springer
15 years 10 months ago
Type Inferencing for Polymorphic Order-Sorted Logic Programs
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
Christoph Beierle
EACL
2003
ACL Anthology
15 years 8 months ago
Well-Nested Parallelism Constraints for Ellipsis Resolution
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ell...
Katrin Erk, Joachim Niehren
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
15 years 4 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
ACL
2010
15 years 4 months ago
Weakly Supervised Learning of Presupposition Relations between Verbs
Presupposition relations between verbs are not very well covered in existing lexical semantic resources. We propose a weakly supervised algorithm for learning presupposition relat...
Galina Tremper