360 search results - page 71 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
104
click to vote
BMCBI
2010
14 years 4 months ago
2010
Background: The Ensembl project produces updates to its comparative genomics resources with each of its several releases per year. During each release cycle approximately two week...
SMA
2003
ACM
15 years 2 months ago
2003
ACM
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
108
click to vote
ASIAN
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...