Sciweavers

323 search results - page 63 / 65
» SANDS: Specialized Active Networking for Distributed Simulat...
Sort
View
PODC
2009
ACM
14 years 6 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...
IJCAI
1997
13 years 7 months ago
Combining Probabilistic Population Codes
We study the problemof statisticallycorrect inference in networks whose basic representations are population codes. Population codes are ubiquitous in the brain, and involve the s...
Richard S. Zemel, Peter Dayan
INFOCOM
2009
IEEE
14 years 28 days ago
Defending Mobile Phones from Proximity Malware
—As mobile phones increasingly become the target of propagating malware, their use of direct pair-wise communication mechanisms, such as Bluetooth and WiFi, pose considerable cha...
Gjergji Zyba, Geoffrey M. Voelker, Michael Liljens...
IWCMC
2010
ACM
13 years 11 months ago
Only the short die old: route optimization in MANETs by dynamic subconnection shrinking
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
Zeki Bilgin, Bilal Khan, Ala I. Al-Fuqaha
FCCM
2006
IEEE
113views VLSI» more  FCCM 2006»
14 years 10 days ago
GraphStep: A System Architecture for Sparse-Graph Algorithms
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
Michael DeLorimier, Nachiket Kapre, Nikil Mehta, D...