Sciweavers

514 search results - page 86 / 103
» Foundations of Aggregation Constraints
Sort
View
DAC
2008
ACM
14 years 9 months ago
Automated hardware-independent scenario identification
Scenario-based design exploits the time-varying execution behavior of applications by dynamically adapting the system on which they run. This is a particularly interesting design ...
Juan Hamers, Lieven Eeckhout
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
14 years 8 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 8 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
VLDB
2004
ACM
128views Database» more  VLDB 2004»
14 years 8 months ago
Operator scheduling in data stream systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...
SIGMOD
2001
ACM
134views Database» more  SIGMOD 2001»
14 years 8 months ago
Preservation of Digital Data with Self-Validating, Self-Instantiating Knowledge-Based Archives
Digital archives are dedicated to the long-term preservation of electronic information and have the mandate to enable sustained access despite rapid technology changes. Persistent...
Bertram Ludäscher, Richard Marciano, Reagan Moore