Sciweavers

6455 search results - page 1171 / 1291
» Research problems
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 11 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
14 years 11 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
MOBISYS
2009
ACM
14 years 11 months ago
Wifi-reports: improving wireless network selection with collaboration
Wi-Fi clients can obtain much better performance at some commercial hotspots than at others. Unfortunately, there is currently no way for users to determine which hotspot access p...
Jeffrey Pang, Ben Greenstein, Michael Kaminsky, Da...
MOBIHOC
2009
ACM
14 years 11 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
MOBIHOC
2009
ACM
14 years 11 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu
« Prev « First page 1171 / 1291 Last » Next »