Sciweavers

28 search results - page 3 / 6
» The Global Power of Additional Queries to Random Oracles
Sort
View
ICDT
2007
ACM
107views Database» more  ICDT 2007»
14 years 1 months ago
Privacy in GLAV Information Integration
Abstract. We define and study formal privacy guarantees for information integration systems, where sources are related to a public schema by mappings given by source-to-target dep...
Alan Nash, Alin Deutsch
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 7 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
CCS
2003
ACM
14 years 18 days ago
Cryptographic tamper evidence
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
Gene Itkis
ICALP
2004
Springer
14 years 22 days ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
CVPR
2009
IEEE
15 years 2 months ago
Continuous Maximal Flows and Wulff Shapes: Application to MRFs
Convex and continuous energy formulations for low level vision problems enable efficient search procedures for the corresponding globally optimal solutions. In this work we exte...
Christopher Zach (UNC Chapel Hill), Marc Niethamme...