الصفحة 1
الصفحة 1
Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications
This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.
Algorithms and Complexity ; 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings
Here are the refereed proceedings of the 6th Italian Conference on Algorithms and Computation, CIAC 2006. The 33 revised full papers presented together with 3 invited papers address such topics as sequential, parallel and distributed algorithms, data structures, approximation algorithms, randomized algorithms, on-line algorithms, graph algorithms, analysis of algorithms, algorithm engineering, algorithmic game theory, computational biology, computational complexity, communication networks, computational geometry, cryptography, discrete optimization, graph drawing, mathematical programming, and quantum algorithms.
Adaptive Filtering : Algorithms and Practical Implementation
The book presents basic concepts of adaptive signal processing and filtering in a concise and straightforward manner. It concentrates on on-line algorithms whose adaptation occurs whenever a new sample of each environment signal is available. The material also illustrates block algorithms using a sub-band filtering framework whose adaptation occurs when a new block of data is available.
