Sciweavers

121 search results - page 21 / 25
» Approximating Maximum Weight Matching in Near-Linear Time
Sort
View
TCOM
2010
167views more  TCOM 2010»
13 years 9 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho
ICIP
1999
IEEE
14 years 3 months ago
Power Spectrum Condition for Energy-Efficient Watermarking
This paper presents a model for watermarking and some attacks on watermarks. Given the watermarked signal, the so-called Wiener attack performs minimum mean-squared error (MMSE) es...
Jonathan K. Su, Bernd Girod
TMM
2002
91views more  TMM 2002»
13 years 10 months ago
Power-spectrum condition for energy-efficient watermarking
This paper presents a model for watermarking and some attacks on watermarks. Given the watermarked signal, the so-called Wiener attack performs minimum mean-squared error (MMSE) es...
Jonathan K. Su, Bernd Girod
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
14 years 26 days ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
INFOCOM
2002
IEEE
14 years 3 months ago
Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches
— High-aggregate bandwidth switches are those whose port count multiplied by the operating line rate is very high; for example, a 30 port switch operating at 40 Gbps or a 1000 po...
Paolo Giaccone, Balaji Prabhakar, Devavrat Shah