Sciweavers

29 search results - page 3 / 6
» Tight Bounds on Minimum Maximum Pointwise Redundancy
Sort
View
RTAS
1998
IEEE
13 years 10 months ago
Bounding Loop Iterations for Timing Analysis
Static timing analyzers need to know the minimum and maximum number of iterations associated with each loop in a real-time program so accurate timing predictions can be obtained. ...
Christopher A. Healy, Mikael Sjödin, Viresh R...
SIGMETRICS
2008
ACM
106views Hardware» more  SIGMETRICS 2008»
13 years 5 months ago
Performance bounds for peer-assisted live streaming
Peer-assisted streaming is a promising way for service providers to offer high-quality IPTV to consumers at reasonable cost. In peerassisted streaming, the peers exchange video ch...
Shao Liu, Rui Zhang-Shen, Wenjie Jiang, Jennifer R...
CISS
2008
IEEE
14 years 7 days ago
Fusion frames and robust dimension reduction
Abstract— We consider the linear minimum meansquared error (LMMSE) estimation of a random vector of interest from its fusion frame measurements in presence noise and subspace era...
Ali Pezeshki, Gitta Kutyniok, A. Robert Calderbank
FSE
2004
Springer
113views Cryptology» more  FSE 2004»
13 years 11 months ago
Minimum Distance between Bent and 1-Resilient Boolean Functions
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
Soumen Maity, Subhamoy Maitra
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
13 years 5 months ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Yonatan Aumann, Yuval Rabani