Sciweavers

2095 search results - page 383 / 419
» Improved pebbling bounds
Sort
View
ICDE
2006
IEEE
158views Database» more  ICDE 2006»
14 years 11 months ago
Space-efficient Relative Error Order Sketch over Data Streams
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wa...
DAC
2002
ACM
14 years 11 months ago
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
Malay K. Ganai, Pranav Ashar, Aarti Gupta, Lintao ...
ICML
1995
IEEE
14 years 10 months ago
Learning to Make Rent-to-Buy Decisions with Systems Applications
In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can ...
P. Krishnan, Philip M. Long, Jeffrey Scott Vitter
SIGSOFT
2003
ACM
14 years 10 months ago
Deadline analysis of interrupt-driven software
Real-time, reactive, and embedded systems are increasingly used throughout society (e.g., flight control, railway signaling, vehicle management, medical devices, and many others)....
Dennis Brylow, Jens Palsberg
POPL
2009
ACM
14 years 10 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...