Sciweavers

1220 search results - page 63 / 244
» Restricting grammatical complexity
Sort
View
ACL
1990
13 years 8 months ago
Computational Structure of Generative Phonology and its Relation to Language Comprehension
We analyse the computational complexity of phonological models as they have developed over the past twenty years. The major results ate that generation and recognition are undecid...
Eric Sven Ristad
IPL
2008
65views more  IPL 2008»
13 years 7 months ago
On the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
Iain A. Stewart
CAD
1999
Springer
13 years 7 months ago
Multiple sweeping using the Denavit-Hartenberg representation method
The method of consecutive revolving or extrusion of a geometric entity in a CAD system is typically used by a designer to represent complex solids. While it is evident that consec...
Karim Abdel-Malek, Saeb Othman
FOCS
2008
IEEE
14 years 2 months ago
On the Union of Cylinders in Three Dimensions
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
Esther Ezra
SIGMOD
1993
ACM
150views Database» more  SIGMOD 1993»
13 years 11 months ago
Predicate Migration: Optimizing Queries with Expensive Predicates
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
Joseph M. Hellerstein, Michael Stonebraker