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...
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...
Koen Langendoen, Rutger F. H. Hofman, Henri E. Bal
Shading complex materials such as acquired reflectances in multilight environments is computationally expensive. Estimating the shading integral requires multiple samples of the ...
Mahdi M. Bagher, Cyril Soler, Kartic Subr, Laurent...
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...
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...