Sciweavers

791 search results - page 70 / 159
» Approximating the Maximum Sharing Problem
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Design of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity
This paper proposes a class of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity. To improve the analyticity of complex wavelet, a different allpass ...
Xi Zhang
TIT
2010
110views Education» more  TIT 2010»
13 years 2 months ago
Error rates of the maximum-likelihood detector for arbitrary constellations: convex/concave behavior and applications
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN ch...
Sergey Loyka, Victoria Kostina, François Ga...
WWW
2008
ACM
14 years 8 months ago
A combinatorial allocation mechanism with penalties for banner advertising
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, ...
MP
2007
100views more  MP 2007»
13 years 7 months ago
Power optimization for connectivity problems
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. ...
VLDB
2004
ACM
134views Database» more  VLDB 2004»
14 years 1 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom