Sciweavers

2430 search results - page 297 / 486
» Computing Tutte Polynomials
Sort
View
STOC
1998
ACM
89views Algorithms» more  STOC 1998»
15 years 8 months ago
Minimizing Stall Time in Single and Parallel Disk Systems
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
Susanne Albers, Naveen Garg, Stefano Leonardi
AAECC
1997
Springer
115views Algorithms» more  AAECC 1997»
15 years 8 months ago
Efficient Multivariate Factorization over Finite Fields
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected det...
Laurent Bernardin, Michael B. Monagan
CRYPTO
1997
Springer
169views Cryptology» more  CRYPTO 1997»
15 years 8 months ago
Deniable Encryption
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...
Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostr...
ICLP
1997
Springer
15 years 8 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
ICLP
1997
Springer
15 years 8 months ago
Total Homeostaticity and Integrity Constraints Restorability Recognition
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...
Michael I. Dekhtyar, Alexander Ja. Dikovsky