Sciweavers

846 search results - page 118 / 170
» On the Computational Complexity of Spatio-Temporal Logics
Sort
View
DAWAK
2003
Springer
15 years 4 months ago
Handling Large Workloads by Profiling and Clustering
View materialization is recognized to be one of the most effective ways to increase the Data Warehouse performance; nevertheless, due to the computational complexity of the techniq...
Matteo Golfarelli
FPL
2009
Springer
85views Hardware» more  FPL 2009»
15 years 3 months ago
Generating high-performance custom floating-point pipelines
Custom operators, working at custom precisions, are a key ingredient to fully exploit the FPGA flexibility advantage for high-performance computing. Unfortunately, such operators...
Florent de Dinechin, Cristian Klein, Bogdan Pasca
PODS
1999
ACM
89views Database» more  PODS 1999»
15 years 3 months ago
Type Inference in the Polymorphic Relational Algebra
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
Jan Van den Bussche, Emmanuel Waller
ICCAD
1998
IEEE
98views Hardware» more  ICCAD 1998»
15 years 3 months ago
Determination of worst-case aggressor alignment for delay calculation
Increases in delay due to coupling can have a dramatic impact on IC performance for deep submicron technologies. To achieve maximum performance there is a need for analyzing logic...
Paul D. Gross, Ravishankar Arunachalam, Karthik Ra...
ICLP
1997
Springer
15 years 3 months ago
Hybrid Probabilistic Programs
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
Alex Dekhtyar, V. S. Subrahmanian