Sciweavers

322 search results - page 39 / 65
» Least Expected Cost Query Optimization: What Can We Expect
Sort
View
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
14 years 1 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
SIGECOM
2006
ACM
88views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Implementation with a bounded action space
While traditional mechanism design typically assumes isomorphism between the agents’ type- and action spaces, in many situations the agents face strict restrictions on their act...
Liad Blumrosen, Michal Feldman
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 8 months ago
Succinct Geometric Indexes Supporting Point Location Queries
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Mahesh...
ICS
2010
Tsinghua U.
13 years 11 months ago
Speeding up Nek5000 with autotuning and specialization
Autotuning technology has emerged recently as a systematic process for evaluating alternative implementations of a computation, in order to select the best-performing solution for...
Jaewook Shin, Mary W. Hall, Jacqueline Chame, Chun...
PUK
2000
13 years 10 months ago
Knowledge-Based Control of Decision Theoretic Planning - Adaptive Planning Model Selection
This paper proposes a new planning architecture for agents operating in uncertain and dynamic environments. Decisiontheoretic planning has been recognized as a useful tool for rea...
Jun Miura, Yoshiaki Shirai