Sciweavers

306 search results - page 36 / 62
» Underspecified computation of normal forms
Sort
View
MFCS
2005
Springer
15 years 3 months ago
Regular Sets of Higher-Order Pushdown Stacks
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
Arnaud Carayol
VLDB
2005
ACM
105views Database» more  VLDB 2005»
15 years 3 months ago
View Matching for Outer-Join Views
Prior work on computing queries from materialized views has focused on views defined by expressions consisting of selection, projection, and inner joins, with an optional aggrega...
Per-Åke Larson, Jingren Zhou
ICALP
2004
Springer
15 years 2 months ago
A Calculus of Coroutines
We describe a simple but expressive calculus of sequential processes, represented as coroutines. We show that this calculus can be used to express a variety of programming languag...
James Laird
PODS
2010
ACM
187views Database» more  PODS 2010»
15 years 2 months ago
Incremental query evaluation in a ring of databases
This paper approaches the incremental view maintenance problem from an algebraic perspective. We construct a ring of databases and use it as the foundation of the design of a quer...
Christoph Koch
VISUALIZATION
2000
IEEE
15 years 1 months ago
Polyhedral modeling
Polyhedral meshes are used for visualization, computer graphics or geometric modeling purposes and result from many applications like iso-surface extraction, surface reconstructio...
Georges-Pierre Bonneau, Stefanie Hahmann