Sciweavers

340 search results - page 24 / 68
» Computationally Private Information Retrieval with Polylogar...
Sort
View
MOBICOM
2006
ACM
14 years 22 days ago
Double rulings for information brokerage in sensor networks
We study the problem of information brokerage in sensor networks, where information consumers (sinks, users) search for data acquired by information producers (sources). Innetwork...
Rik Sarkar, Xianjin Zhu, Jie Gao
CHI
2009
ACM
14 years 7 months ago
User-created forms as an effective method of human-agent communication
A key challenge for mixed-initiative systems is to create a shared understanding of the task between human and agent. To address this challenge, we created a mixed-initiative inte...
John Zimmerman, Kathryn Rivard, Ian Hargraves, Ant...
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 8 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
ICISC
2009
146views Cryptology» more  ICISC 2009»
13 years 4 months ago
First CPIR Protocol with Data-Dependent Computation
We design a new (n, 1)-CPIR protocol BddCpir for -bit strings as a combination of a noncryptographic (BDD-based) data structure and a more basic cryptographic primitive (communicat...
Helger Lipmaa
WWW
2005
ACM
14 years 7 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry