989 search results - page 156 / 198 » Pebbling and Proofs of Work |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
ESORICS
2009
Springer
14 years 8 months ago
2009
Springer
Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and databases to the centralized large data centers, whe...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...