175 search results - page 18 / 35 » Bounds for Permutation Rate-Distortion |
CSR
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we classify several algorithmic problems in group theory in the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to ...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
FOCS
2003
IEEE
14 years 28 days ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
DAC
1999
ACM
13 years 12 months ago
1999
ACM
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...