Sciweavers

3875 search results - page 492 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
GLOBECOM
2006
IEEE
16 years 22 days ago
Power Optimal Opportunistic Scheduling
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
Abhijeet Bhorkar, Abhay Karandikar, Vivek S. Borka...
CINQ
2004
Springer
118views Database» more  CINQ 2004»
16 years 2 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, ...
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 6 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