Sciweavers

1432 search results - page 252 / 287
» Hardness of robust network design
Sort
View
MIDDLEWARE
2004
Springer
15 years 11 months ago
Toward a standard ubiquitous computing framework
This paper surveys a variety of subsystems designed to be the building blocks from which sophisticated infrastructures for ubiquitous computing are assembled. Our experience shows...
Martin Modahl, Bikash Agarwalla, Gregory D. Abowd,...
DEBS
2007
ACM
15 years 9 months ago
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
Gregory Chockler, Roie Melamed, Yoav Tock, Roman V...
COLT
2006
Springer
15 years 9 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
15 years 9 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna
MOBISYS
2010
ACM
15 years 8 months ago
On the limits of effective hybrid micro-energy harvesting on mobile CRFID sensors
Mobile sensing is difficult without power. Emerging Computational RFIDs (CRFIDs) provide both sensing and generalpurpose computation without batteries--instead relying on small ca...
Jeremy Gummeson, Shane S. Clark, Kevin Fu, Deepak ...