Sciweavers

5595 search results - page 703 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CINQ
2004
Springer
118views Database» more  CINQ 2004»
16 years 8 days ago
Boolean Formulas and Frequent Sets
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
Jouni K. Seppänen, Heikki Mannila
ACISP
2010
Springer
15 years 8 months ago
Security Estimates for Quadratic Field Based Cryptosystems
Abstract. We describe implementations for solving the discrete logarithm problem in the class group of an imaginary quadratic field and in the infrastructure of a real quadratic fi...
Jean-François Biasse, Michael J. Jacobson, ...
186
Voted
DICTA
2003
15 years 8 months ago
Shift-invariance in the Discrete Wavelet Transform
In this paper we review a number of approaches to reducing, or removing, the problem of shift variance in the discrete wavelet transform (DWT). We describe a generalization of the ...
Andrew P. Bradley
ICASSP
2010
IEEE
15 years 7 months ago
Guaranteed robust distributed estimation in a network of sensors
This paper proposes a guaranteed robust bounded-error distributed estimation algorithm. It may be employed to perform parameter estimation from data collected in a network of wire...
Jean-Benoist Leger, Michel Kieffer
CG
2002
Springer
15 years 6 months ago
Towards robust broadcasting of geometry data
We present new algorithms for the robust transmission of geometric data sets, i.e. transmission which allows the receiver to recover (an approximation of) the original geometric o...
Stephan Bischoff, Leif Kobbelt