Sciweavers

1208 search results - page 72 / 242
» Uniform eventown problems
Sort
View
EACL
2003
ACL Anthology
14 years 11 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
78
Voted
AAAI
1997
14 years 11 months ago
Query Optimization Using Local Completeness
We consider the problem of query plan optimization in information brokers. Information brokers are programs that facilitate access to collections of information sources by hiding ...
Oliver M. Duschka
ACL
1992
14 years 11 months ago
GPSM: A Generalized Probabilistic Semantic Model for Ambiguity Resolution
In natural language processing, ambiguity resolution is a central issue, and can be regarded as a preference assignment problem. In this paper, a Generalized Probabilistic Semanti...
Jing-Shin Chang, Yih-Fen Luo, Keh-Yih Su
75
Voted
CORR
2010
Springer
137views Education» more  CORR 2010»
14 years 10 months ago
State Elimination Ordering Strategies: Some Experimental Results
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
Nelma Moreira, Davide Nabais, Rogério Reis
COMPUTING
2008
87views more  COMPUTING 2008»
14 years 10 months ago
Simple a posteriori error estimators for the h-version of the boundary element method
The h-h/2-strategy is one very basic and well-known technique for the a posteriori error estimation for Galerkin discretizations of energy minimization problems. Let denote the e...
Samuel Ferraz-Leite, Dirk Praetorius