Sciweavers

315 search results - page 7 / 63
» Algebraic Lower Bounds for Computing on Encrypted Data
Sort
View
81
Voted
DAC
1999
ACM
15 years 1 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
87
Voted
AINA
2005
IEEE
15 years 3 months ago
An Efficient Hierarchical Key Management Scheme Using Symmetric Encryptions
The concept of hierarchical access control is that a higher privileged user (or higher level) has the ability to access data in lower privileged user (or lower level). Hierarchica...
Chu-Hsing Lin, Wei Lee, Yi-Kang Ho
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
15 years 9 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
ICALP
1992
Springer
15 years 1 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
CORR
2010
Springer
249views Education» more  CORR 2010»
14 years 9 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder