Sciweavers

849 search results - page 15 / 170
» Completely Non-malleable Schemes
Sort
View
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
13 years 9 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
TC
2002
13 years 7 months ago
Dynamic Power Management for Nonstationary Service Requests
Dynamic Power Management (DPM) is a design methodology aiming at reducing power consumption of electronic systems by performing selective shutdown of idle system resources. The eff...
Eui-Young Chung, Luca Benini, Alessandro Bogliolo,...
ICIP
2007
IEEE
14 years 9 months ago
On a Watermarking Scheme in the Logarithmic Domain and its Perceptual Advantages
Scaling attacks are well-known to be some of the most harmful strategies against quantization-based watermarking methods, as they can completely ruin the performance of the waterm...
Pedro Comesaña, Fernando Pérez-Gonz&...
ICASSP
2011
IEEE
12 years 11 months ago
How efficient is estimation with missing data?
In this paper, we present a new evaluation approach for missing data techniques (MDTs) where the efficiency of those are investigated using listwise deletion method as reference....
Seliz G. Karadogan, Letizia Marchegiani, Lars Kai ...
EUC
2007
Springer
14 years 1 months ago
On Using Probabilistic Forwarding to Improve HEC-Based Data Forwarding in Opportunistic Networks
In this paper, we propose the HEC-PF scheme, an enhancement of our previous H-EC scheme for effective data forwarding in opportunistic networks. The enhanced scheme modifies the a...
Ling-Jyh Chen, Cheng-Long Tseng, Cheng-Fu Chou