Sciweavers

6142 search results - page 873 / 1229
» The Complexity of Partition Functions
Sort
View
CASES
2003
ACM
16 years 1 days ago
Clustered calculation of worst-case execution times
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblo...
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
CCGRID
2009
IEEE
15 years 10 months ago
Experiment and Workflow Management Using Cyberaide Shell
In recent years the power of Grid computing has grown exponentially through the development of advanced middleware systems. While usage has increased, the penetration of Grid compu...
Gregor von Laszewski, Andrew J. Younge, Xi He, Kum...
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
15 years 10 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
DBPL
1995
Springer
106views Database» more  DBPL 1995»
15 years 10 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong