Sciweavers

562 search results - page 103 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
COLT
2008
Springer
13 years 10 months ago
On the Power of Membership Queries in Agnostic Learning
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
Vitaly Feldman
FOCS
2009
IEEE
13 years 6 months ago
Learning and Smoothed Analysis
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua T...
IJWMC
2010
115views more  IJWMC 2010»
13 years 5 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James
INFOCOM
2011
IEEE
13 years 5 days ago
Feasibility and optimization of delay guarantees for non-homogeneous flows in IEEE 802.11 WLANs
—Due to the rapid growth of real-time applications and the ubiquity of IEEE 802.11 MAC as a layer-2 protocol for wireless local area networks (WLANs), it is of increasing interes...
Yan Gao, Chee Wei Tan, Ying Huang, Zheng Zeng, P. ...
SECON
2008
IEEE
14 years 2 months ago
Breath: A Self-Adapting Protocol for Wireless Sensor Networks in Control and Automation
—The novel cross-layer protocol Breath for wireless sensor networks is designed, implemented, and experimentally evaluated. The Breath protocol is based on randomized routing, MA...
Pan Gun Park, Carlo Fischione, Alvise Bonivento, K...