1254 search results - page 127 / 251 » Making Hard Problems Harder |
151
Voted
MOBIHOC
2004
ACM
16 years 12 days ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
101
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
108
click to vote
SAC
2009
ACM
15 years 7 months ago
2009
ACM
In a typical client-server scenario, a trusted server provides valuable services to a client, which runs remotely on an untrusted platform. Of the many security vulnerabilities th...
108
Voted
IPSN
2009
Springer
15 years 7 months ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
114
Voted
AAIM
2009
Springer
15 years 7 months ago
2009
Springer
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...