Sciweavers

1781 search results - page 203 / 357
» Functional Answer Set Programming
Sort
View
FOCS
2005
IEEE
15 years 7 months ago
On the Impossibility of Obfuscation with Auxiliary Input
Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how ...
Shafi Goldwasser, Yael Tauman Kalai
122
Voted
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
16 years 1 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
109
Voted
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
15 years 7 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
TCC
2007
Springer
114views Cryptology» more  TCC 2007»
15 years 7 months ago
Multi-authority Attribute Based Encryption
Abstract. In an identity based encryption scheme, each user is identified by a unique identity string. An attribute based encryption scheme (ABE), in contrast, is a scheme in whic...
Melissa Chase
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
15 years 3 days ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...