Sciweavers

876 search results - page 162 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
111
Voted
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 7 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
102
Voted
MSWIM
2005
ACM
15 years 6 months ago
Topology control with better radio models: implications for energy and multi-hop interference
Topology Control (TC) is a well-studied technique used in wireless ad hoc networks to find energy-efficient and/or low-interference subgraphs of the maxpower communication graph....
Douglas M. Blough, Mauro Leoncini, Giovanni Resta,...
108
Voted
SIGSOFT
2004
ACM
15 years 6 months ago
Correlation exploitation in error ranking
Static program checking tools can find many serious bugs in software, but due to analysis limitations they also frequently emit false error reports. Such false positives can easi...
Ted Kremenek, Ken Ashcraft, Junfeng Yang, Dawson R...
106
Voted
WSNA
2003
ACM
15 years 6 months ago
Parametric probabilistic sensor network routing
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...
Christopher L. Barrett, Stephan Eidenbenz, Lukas K...
114
Voted
INFOCOM
2002
IEEE
15 years 5 months ago
Scalable IP Lookup for Programmable Routers
Abstract— Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services...
David E. Taylor, John W. Lockwood, Todd S. Sproull...