Sciweavers

780 search results - page 136 / 156
» Robustness and Randomness
Sort
View
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
14 years 9 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
KSEM
2009
Springer
14 years 3 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
INFOCOM
2007
IEEE
14 years 3 months ago
Rate-Adaptive Framing for Interfered Wireless Networks
The majority of existing wireless rate controls are based on the implicit assumption that frames are corrupted due to the random, arbitrary environmental and thermal noises. They ...
Chun-cheng Chen, Haiyun Luo, Eunsoo Seo, Nitin H. ...
INFOCOM
2006
IEEE
14 years 2 months ago
RandPeer: Membership Management for QoS Sensitive Peer-to-Peer Applications
— Many Peer-to-peer (P2P) applications such as media broadcasting and content distribution require a high performance overlay structure in order to deliver satisfying quality of ...
Jin Liang, Klara Nahrstedt
SPAA
2004
ACM
14 years 2 months ago
Pagoda: a dynamic overlay network for routing, data management, and multicasting
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
Ankur Bhargava, Kishore Kothapalli, Chris Riley, C...