Sciweavers

6192 search results - page 1238 / 1239
» Distributed Control of Attention
Sort
View
PODC
2009
ACM
14 years 6 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
IMC
2006
ACM
13 years 12 months ago
Malware prevalence in the KaZaA file-sharing network
In recent years, more than 200 viruses have been reported to use a peer-to-peer (P2P) file-sharing network as a propagation vector. Disguised as files that are frequently exchan...
Seungwon Shin, Jaeyeon Jung, Hari Balakrishnan
COMPGEOM
2004
ACM
13 years 11 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky
SASN
2004
ACM
13 years 11 months ago
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
Yih-Chun Hu, David B. Johnson
DSD
2002
IEEE
96views Hardware» more  DSD 2002»
13 years 11 months ago
Networks on Silicon: Blessing or Nightmare?
Continuing VLSI technology scaling raises several deep submicron (DSM) problems like relatively slow interconnect, power dissipation and distribution, and signal integrity. Those ...
Paul Wielage, Kees G. W. Goossens
« Prev « First page 1238 / 1239 Last » Next »