315 search results - page 23 / 63 » Cell-probe lower bounds for the partial match problem |
156
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
72
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
PKC
2010
Springer
15 years 1 months ago
2010
Springer
A fundamental privacy problem in the client-server setting is the retrieval of a record from a database maintained by a server so that the computationally bounded server remains ob...
103
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
COLT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...