Sciweavers

674 search results - page 76 / 135
» Arguments and Results
Sort
View
LREC
2010
116views Education» more  LREC 2010»
13 years 10 months ago
Identifying Sources of Weakness in Syntactic Lexicon Extraction
Previous work has shown that large scale subcategorisation lexicons could be extracted from parsed corpora with reasonably high precision. In this paper, we apply a standard extra...
Claire Gardent, Alejandra Lorenzo
IANDC
2007
133views more  IANDC 2007»
13 years 8 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
Alexander Rabinovich
LICS
2010
IEEE
13 years 6 months ago
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Manuel Bodirsky, Martin Hils, Barnaby Martin
ESOP
2009
Springer
14 years 3 months ago
An Interval-Based Inference of Variant Parametric Types
Abstract. Variant parametric types (VPT) represent the successful result of combining subtype polymorphism with parametric polymorphism to support a more flexible subtyping for Ja...
Florin Craciun, Wei-Ngan Chin, Guanhua He, Shengch...
FOCS
2009
IEEE
14 years 3 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...