Sciweavers

354 search results - page 67 / 71
» Approximate String Joins
Sort
View
ACNS
2011
Springer
254views Cryptology» more  ACNS 2011»
12 years 11 months ago
Linear Analysis of Reduced-Round CubeHash
Abstract. Recent developments in the field of cryptanalysis of hash functions has inspired NIST to announce a competition for selecting a new cryptographic hash function to join t...
Tomer Ashur, Orr Dunkelman
DCC
2006
IEEE
14 years 7 months ago
The B-coder: An Improved Binary Arithmetic Coder and Probability Estimator
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
Benjamin Kelly, David F. Brailsford
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 8 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
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
SI3D
1999
ACM
13 years 12 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha