Sciweavers

7986 search results - page 1404 / 1598
» Computational Science and its Applications
Sort
View
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
16 years 7 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
16 years 7 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...
OSDI
2008
ACM
16 years 7 months ago
Improving MapReduce Performance in Heterogeneous Environments
MapReduce is emerging as an important programming model for large-scale data-parallel applications such as web indexing, data mining, and scientific simulation. Hadoop is an open-...
Matei Zaharia, Andy Konwinski, Anthony D. Joseph, ...
VLDB
2006
ACM
147views Database» more  VLDB 2006»
16 years 7 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
16 years 7 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
« Prev « First page 1404 / 1598 Last » Next »