2084 search results - page 149 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
126
Voted
CORR
2010
Springer
15 years 5 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...
143
Voted
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
180
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
155
click to vote
ARC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Monte Carlo simulation is one of the most widely used techniques for computationally intensive simulations in mathematical analysis and modeling. A multivariate Gaussian ...
153
Voted
CHES
1999
Springer
15 years 9 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...