562 search results - page 103 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
107
click to vote
COLT
2008
Springer
15 years 3 months ago
2008
Springer
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...
101
click to vote
FOCS
2009
IEEE
14 years 11 months ago
2009
IEEE
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...
131
click to vote
IJWMC
2010
14 years 10 months ago
2010
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...
186
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—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...
105
click to vote
SECON
2008
IEEE
15 years 7 months ago
2008
IEEE
—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...