Sciweavers

862 search results - page 120 / 173
» Random Information Spread in Networks
Sort
View
ITNG
2007
IEEE
15 years 6 months ago
Performance Analysis of Error Control Codes for Wireless Sensor Networks
In wireless sensor networks, the data transmitted from the sensor nodes are vulnerable to corruption by errors induced by noisy channels and other factors. Hence it is necessary t...
Gopinath Balakrishnan, Mei Yang, Yingtao Jiang, Yo...
WCNC
2010
IEEE
15 years 3 months ago
MUTON: Detecting Malicious Nodes in Disruption-Tolerant Networks
—The Disruption Tolerant Networks (DTNs) are vulnerable to insider attacks, in which the legitimate nodes are compromised and the adversary modifies the delivery metrics of the ...
Yanzhi Ren, Mooi Choo Chuah, Jie Yang, Yingying Ch...
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 1 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
CCR
2010
133views more  CCR 2010»
14 years 12 months ago
The role of network trace anonymization under attack
In recent years, academic literature has analyzed many attacks on network trace anonymization techniques. These attacks usually correlate external information with anonymized data...
Martin Burkhart, Dominik Schatzmann, Brian Trammel...
CORR
2008
Springer
90views Education» more  CORR 2008»
14 years 12 months ago
A computationally-efficient construction for the matrix-based key distribution in sensor network
Key pre-distribution in wireless sensor network is aimed at delivering keys to sensor networks at the low expense of computation, communication, and memory while providing a high d...
Abedelaziz Mohaisen