5448 search results - page 629 / 1090 » Breakpoints and Time in Distributed Computations |
158
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
222
click to vote
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
202
click to vote
HPDC
2010
IEEE
15 years 8 months ago
2010
IEEE
Text analysis tools are nowadays required to process increasingly large corpora which are often organized as small files (abstracts, news articles, etc). Cloud computing offers a ...
197
click to vote
PODC
2005
ACM
16 years 18 days ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
220
click to vote
CLOUD
2010
ACM
16 years 3 days ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...