Sciweavers

588 search results - page 13 / 118
» Reducibility and Completeness in Private Computations
Sort
View
SIGMOD
2010
ACM
377views Database» more  SIGMOD 2010»
14 years 9 days ago
Online aggregation and continuous query support in MapReduce
MapReduce is a popular framework for data-intensive distributed computing of batch jobs. To simplify fault tolerance, the output of each MapReduce task and job is materialized to ...
Tyson Condie, Neil Conway, Peter Alvaro, Joseph M....
ACMSE
2005
ACM
14 years 1 months ago
Reducing application code complexity with vocabulary-specific XML language bindings
The eXtensible Markup Language (XML) has become a ubiquitous data exchange and storage format. A variety of tools are available for incorporating XML-based data into applications....
Jules White, Boris Kolpackov, Balachandran Nataraj...
ICDCSW
2002
IEEE
14 years 13 days ago
Reducing the Cost of the Critical Path in Secure Multicast for Dynamic Groups
In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these ...
Sandeep S. Kulkarni, Bezawada Bruhadeshwar
CF
2009
ACM
14 years 2 months ago
A light-weight fairness mechanism for chip multiprocessor memory systems
Chip Multiprocessor (CMP) memory systems suffer from the effects of destructive thread interference. This interference reduces performance predictability because it depends heavil...
Magnus Jahre, Lasse Natvig
ENTCS
2007
158views more  ENTCS 2007»
13 years 7 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer