1434 search results - page 252 / 287 » Distributed Computing with Imperfect Randomness |
128
click to vote
PODS
2012
ACM
13 years 4 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
140
click to vote
SIGIR
2009
ACM
15 years 8 months ago
2009
ACM
Social network systems, like last.fm, play a significant role in Web 2.0, containing large amounts of multimedia-enriched data that are enhanced both by explicit user-provided an...
129
click to vote
P2P
2006
IEEE
15 years 8 months ago
2006
IEEE
Content storage in a distributed collaborative environment uses redundancy for better resilience and thus provides good availability and durability. In a peer-to-peer environment,...
154
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
115
click to vote
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...