Sciweavers

3257 search results - page 309 / 652
» Some Results on Effective Randomness
Sort
View
INFORMATICALT
2002
91views more  INFORMATICALT 2002»
15 years 6 months ago
Bayesian Heuristic Approach to Scheduling
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
Jonas Mockus
IOR
2002
88views more  IOR 2002»
15 years 6 months ago
An Adaptive Bayesian Replacement Policy with Minimal Repair
In this study, an adaptive Bayesian decision model is developed to determine the optimal replacement age for the systems maintained according to a general age replacement policy. I...
Savas Dayanik, Ülkü Gürler
JCSS
2002
199views more  JCSS 2002»
15 years 6 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
TCAD
2008
92views more  TCAD 2008»
15 years 6 months ago
IP Watermarking Using Incremental Technology Mapping at Logic Synthesis Level
Abstract--This paper proposes an adaptive watermarking technique by modulating some closed cones in an originally optimized logic network (master design) for technology mapping. Th...
Aijiao Cui, Chip-Hong Chang, Sofiène Tahar
ECCV
2010
Springer
15 years 5 months ago
Hybrid Compressive Sampling via a New Total Variation TVL1
Compressive sampling (CS) is aimed at acquiring a signal or image from data which is deemed insufficient by Nyquist/Shannon sampling theorem. Its main idea is to recover a signal ...
Xianbiao Shu, Narendra Ahuja