Sciweavers

438 search results - page 77 / 88
» The forest hiding problem
Sort
View
INFOCOM
2009
IEEE
15 years 6 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...
ISCA
2002
IEEE
91views Hardware» more  ISCA 2002»
15 years 4 months ago
Slack: Maximizing Performance Under Technological Constraints
Many emerging processor microarchitectures seek to manage technological constraints (e.g., wire delay, power, and circuit complexity) by resorting to nonuniform designs that provi...
Brian A. Fields, Rastislav Bodík, Mark D. H...
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
15 years 4 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
15 years 4 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
ISI
2006
Springer
14 years 11 months ago
Measures to Detect Word Substitution in Intercepted Communication
Abstract. Those who want to conceal the content of their communications can do so by replacing words that might trigger attention by other words or locutions that seem more ordinar...
SzeWang Fong, David B. Skillicorn, Dmitri Roussino...