12659 search results - page 213 / 2532 » The distributed breakout algorithms |
176
click to vote
MOBIHOC
2006
ACM
16 years 5 months ago
2006
ACM
Location knowledge of nodes in a network is essential for many tasks such as routing, cooperative sensing, or service delivery in ad hoc, mobile, or sensor networks. This paper in...
139
click to vote
PC
2007
15 years 5 months ago
2007
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
230
click to vote
PODC
2011
ACM
14 years 8 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
294
click to vote
BIS
2011
14 years 5 months ago
2011
Distributed information retrieval is a well-known approach for accessing heterogeneous, highly autonomous sources of unstructured information. Selecting and querying only a number ...
140
click to vote
ICML
2006
IEEE
16 years 6 months ago
2006
IEEE
The Dirichlet compound multinomial (DCM) distribution, also called the multivariate Polya distribution, is a model for text documents that takes into account burstiness: the fact ...