6274 search results - page 1082 / 1255 » From query complexity to computational complexity |
133
click to vote
PAM
2010
Springer
15 years 11 months ago
2010
Springer
The ability to pinpoint the geographic location of IP hosts is compelling for applications such as on-line advertising and network attack diagnosis. While prior methods can accurat...
144
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriï...
137
click to vote
MOBILWARE
2009
ACM
15 years 11 months ago
2009
ACM
Abstract. Advances in the miniaturization and embedding of electronics for microcomputing, communication and sensor/actuator systems, have fertilized the pervasion of technology in...
134
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
165
click to vote
BROADNETS
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— Limited resources and time-varying nature of wireless ad hoc networks demand optimized use of resources across layers. Cross-layer optimization (CLO) for wireless netwo...