Sciweavers

1204 search results - page 235 / 241
» Termination of Polynomial Programs
Sort
View
FOCS
1998
IEEE
15 years 1 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
STACS
1999
Springer
15 years 1 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
RTSS
1998
IEEE
15 years 1 months ago
Practical Solutions for QoS-Based Resource Allocation
Abstract: The QoS-based Resource Allocation Model (QRAM) proposed in [20] presented an analytical approach for satisfying multiple quality-of-service dimensions in a resource-const...
Ragunathan Rajkumar, Chen Lee, John P. Lehoczky, D...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 1 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
EMSOFT
2009
Springer
15 years 1 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond