𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Computational Complexity of Best L1-approximation

✍ Scribed by Paulo Oliva

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
213 KB
Volume
48
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of task allocation
On the complexity of task allocation
✍ A. Schoneveld; J. F. de Ronde; P. M. A. Sloot πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 134 KB πŸ‘ 1 views

A detailed study is presented on the combinatorial optimization problem of allocating parallel tasks to a parallel computer. Depending on two application/machine-specific parameters, both a sequential and a parallel optimal allocation phase are shown to exist. A sudden "phase" transition is observed

Time complexity and linear-time approxim
Time complexity and linear-time approximation of the ancient two-machine flow shop
✍ GΓΌnter Rote; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 1998 πŸ› Springer US 🌐 English βš– 87 KB

We consider the scheduling problems F2 "" C and F2"no-wait"C , i.e. makespan minimization in a two-machine flow shop, with and without no wait in process. For both problems solution algorithms based on sorting with O(n log n) running time are known, where n denotes the number of jobs. [1,2]. We pro

A note on classification and the approxi
A note on classification and the approximation of functionals
✍ Sandberg, Irwin W. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 68 KB πŸ‘ 1 views

Information is given concerning the implemention and complexity of an important family of signal classi"ers.