Sciweavers

983 search results - page 5 / 197
» Continuous Queries in Oracle
Sort
View
IPL
2006
114views more  IPL 2006»
15 years 2 months ago
Quantum lower bounds for the Goldreich-Levin problem
At the heart of the Goldreich-Levin Theorem is the problem of determining an n-bit string a by making queries to two oracles, referred to as IP (inner product) and EQ (equivalence...
Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H...
FOCS
2007
IEEE
15 years 9 months ago
Lower Bounds on Signatures From Symmetric Primitives
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
Boaz Barak, Mohammad Mahmoody-Ghidary
ICDE
2000
IEEE
156views Database» more  ICDE 2000»
16 years 4 months ago
Oracle8i - The XML Enabled Data Management System
XML is here as the internet standard for information exchange among e-businesses and applications. With its dramatic adoption and its ability to model structured, unstructured and...
Sandeepan Banerjee, Vishu Krishnamurthy, Muralidha...
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 3 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
ISAAC
2004
Springer
121views Algorithms» more  ISAAC 2004»
15 years 8 months ago
Approximate Distance Oracles for Graphs with Dense Clusters
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
Mattias Andersson, Joachim Gudmundsson, Christos L...