Sciweavers

3247 search results - page 372 / 650
» Randomized smoothing networks
Sort
View
WCNC
2010
IEEE
15 years 10 months ago
Optimal Tradeoff Between Transmission Rate and Packet Duration in Wireless Ad Hoc Networks
—This paper considers the tradeoff between bursty and continuous transmissions in wireless ad hoc networks. In our network model, packets belonging to specific transmitters arri...
Jon E. Corneliussen, Mariam Kaynia, Geir E. &Oslas...
WCNC
2010
IEEE
15 years 10 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...
ICDM
2007
IEEE
162views Data Mining» more  ICDM 2007»
15 years 10 months ago
Exploiting Network Structure for Active Inference in Collective Classification
Active inference seeks to maximize classification performance while minimizing the amount of data that must be labeled ex ante. This task is particularly relevant in the context o...
Matthew J. Rattigan, Marc Maier, David Jensen, Bin...
MASCOTS
2007
15 years 8 months ago
Measurement Based Physical Layer Modeling for Wireless Network Simulations
—Simulation methods have become an integral part of almost all aspects of networking research and particularly in the area of wireless networks. Any new protocol or methodology t...
Dheeraj Reddy, George F. Riley
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 8 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