2519 search results - page 127 / 504 » Martingales and Locality in Distributed Computing |
ACSAC
2010
IEEE
13 years 18 days ago
2010
IEEE
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...
HPCA
1998
IEEE
14 years 1 months ago
1998
IEEE
Parallel computing on clusters of workstations is attractive because of the low costs in comparison to MPPs, but the speed of the local area network limits the class of applicatio...
SI3D
2012
ACM
12 years 4 months ago
2012
ACM
Shading complex materials such as acquired reflectances in multilight environments is computationally expensive. Estimating the shading integral requires multiple samples of the ...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
MOBIHOC
2005
ACM
14 years 8 months ago
2005
ACM
Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility condition...