Results 271 to 280 of about 701,199 (295)
Some of the next articles are maybe not open access.
Almost Optimal Private Information Retrieval
2003A private information retrieval (PIR) protocol allows a user to retrieve one of N records from a database while hiding the identity of the record from the database server. With the initially proposed PIR protocols to process a query, the server has to process the entire database, resulting in an unacceptable response time for large databases.
Dmitri Asonov, Johann Christoph Freytag
openaire +1 more source
Algorithms for Construction of Optimal and Almost-Optimal Length-Restricted Codes
Data Compression Conference, 2005In this paper we present new results on sequential and parallel construction of optimal and almost-optimal length-restricted prefix-free codes. We show that length-restricted prefix-free codes with error 1/nk for any k > 0 can be constructed in O(n log n) time, or in O( log n) time with n CREW processors.
Marek Karpinski, Yakov Nekrich
openaire +1 more source
Almost Optimal Hash Sequence Traversal
2003We introduce a novel technique for computation of consecutive preimages of hash chains. Whereas traditional techniques have a memory-times-computation complexity of O(n) per output generated, the complexity of our technique is only O(log2n), where n is the length of the chain. Our solution is based on the same principal amortization principle as [2],
Don Coppersmith, Markus Jakobsson
openaire +2 more sources
ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS
International Journal of Computational Geometry & Applications, 2010We implement an algorithm for k-clustering for small k in fixed dimensions and report experimental results here. Although the theoretical bounds on the running time are hopeless for 1 + ∊ approximating k-clusters, we note that for dimensions 2 and 3, k-clustering is practical for small k (k ≤ 4) and simple enough shapes. For the purposes of this paper,
Pankaj Kumar, Piyush Kumar
openaire +1 more source
Some (almost) optimally extendable linear codes
Designs, Codes and Cryptography, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Claude Carlet +2 more
openaire +1 more source
Almost Optimal Canonical Property Testers for Satisfiability
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 2012In the $(k, d)$-Function-SAT problem we are given a set of $n$ variables $\{X_1, \dots, X_n\}$ that can take values from the set $\{1, \dots, d\}$ and a set of Boolean constraints on these variables, where each constraint is of the form $f:\{1, \dots, d\}^k \right arrow \{0, 1\}$, i.e. the constraint depends on exactly $k$ of these variables.
openaire +1 more source
Wyner-Ziv compression is (almost) optimal for distributed optimization
2022 IEEE International Symposium on Information Theory (ISIT), 2022Prathamesh Mayekar +2 more
openaire +1 more source