Bibliothèque de L'IMIST/CNRST

Votre panier est vide.
IMIST


Votre recherche a retourné 21 résultats.

Algorithms, complexity analysis and vlsi architectures for mpeg-4 motion estimation par Kuhn,, Peter M. Publication : [S.l.] Springer 2010 . 239 p. , MPEG-4 is the multimedia standard for combining interactivity, natural and synthetic digital video, audio and computer-graphics. Typical applications are: internet, video conferencing, mobile videophones, multimedia cooperative work, teleteaching and games. With MPEG-4 the next step from block-based video (ISO/IEC MPEG-1, MPEG-2, CCITT H.261, ITU-T H.263) to arbitrarily-shaped visual objects is taken. This significant step demands a new methodology for system analysis and design to meet the considerably higher flexibility of MPEG-4. Motion estimation is a central part of MPEG-2-1-4 and H.261/H.263 video compression standards and has attracted much attention in research and industry, for the following reasons: it is computationally the most demanding algorithm of a video encoder (about 60-80% of the total computation time), it has a high impact on the visual quality of a video encoder, and it is not standardized, thus being open to competition. Algorithms, Complexity Analysis, and VLSI Architectures for MPEG-4 Motion Estimation covers in detail every single step in the design of a MPEG-2-1-4 or H.261/H.263 compliant video encoder: Fast motion estimation algorithms Complexity analysis tools Detailed complexity analysis of a software implementation of MPEG-4 video Complexity and visual quality analysis of fast motion estimation algorithms within MPEG-4 Design space on motion estimation VLSI architectures Detailed VLSI design examples of (1) a high throughput and (2) a low-power MPEG-4 motion estimator. Algorithms, Complexity Analysis and VLSI Architectures for MPEG-4 Motion Estimation is an important introduction to numerous algorithmic, architectural and system design aspects of the multimedia standard MPEG-4. As such, all researchers, students and practitioners working in image processing, video coding or system and VLSI design will find this book of interest. 23 cm. Date : 2010 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Réserver Ajouter au panier
An introduction to sequential dynamical systems par Mortveit,, Henning. Publication : Virginia Springer 2007 . 260 p. , This introductory text to the class of Sequential Dynamical Systems (SDS) is the first textbook on this timely subject. Driven by numerous examples and thought-provoking problems throughout, the presentation offers good foundational material on finite discrete dynamical systems, which then leads systematically to an introduction of SDS. From a broad range of topics on structure theory - equivalence, fixed points, invertibility and other phase space properties - thereafter SDS relations to graph theory, classical dynamical systems as well as SDS applications in computer science are explored. This is a versatile interdisciplinary textbook. 24 cm. Date : 2007 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1),

Réserver Ajouter au panier
Communication complexity and parallel computing par Hromkovič,, Juraj, Publication : Berlin | New York Springer. 1997 . x, 336 pages 24 cm. Date : 1997 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Réserver Ajouter au panier
Computational complexity a conceptual perspective par Goldreich,, Oded. Publication : Cambridge | New York Cambridge University Press 2008 . xxiv, 606 pages 27 cm. Date : 2008 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1),

Réserver Ajouter au panier
Computational complexity a modern approach par Arora, Sanjeev. Publication : Cambridge | New York Cambridge University Press 2009 . xxiv, 579 pages 27 cm. Date : 2009 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1),

Réserver Ajouter au panier
Computing in nonlinear media & automata collectives / par Adamatzky,, Andrew. Publication : [S.l.] : Taylor & Francis, 2001 . 395 p. ; , The book gives an account of new ways to design massively parallel computing devices in advanced mathematical models (such as cellular automata and lattice swarms), and from unconventional materials, for example chemical solutions, bio-polymers and excitable media. The subject of this book is computing in excitable and reaction-diffusion media. This is one approach to novel computing methods. Other approaches include quantum and evolutionary computation, and swarm optimization. The book explains how to design computing devices in nonlinear media. This is achieved in three steps. First, cellular automaton models of reaction-diffusion and excitable computing are built. Second, natural analogies of simulated phenomena are sought. Third, working prototypes of laboratory processors are fabricated. Throughout the book it is assumed a computation is implemented using spreading waves and spatially interacting reagents. The book is full of examples of computation in cellular automata, swarms of mobile machines, thin-layer chemical liquids, insect societies, solitons, breathers and other wonders of Nature. In this book computer scientists and engineers will find blueprints inspired by Nature for the design of novel computing devices. Mathematicians will find exciting reasons to theorise. Physicists and chemists will be surprised and pleased to find that the systems they study can be used in completely new contexts. Biologists will discover that results of their field experiments also give solutions for celebrated mathematical problems. 25 cm. Date : 2001 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Réserver Ajouter au panier
Forcing with random variables and proof complexity par Krajíček, Jan Publication : Cambridge, UK | New York Cambridge University Press 2011 . xvi, 247 pages : , "This book introduces a new approach to building models of bounded arithmetic, with techniques drawn from recent results in computational complexity. Propositional proof systems and bounded arithmetics are closely related. In particular, proving lower bounds on the lengths of proofs in propositional proof systems is equivalent to constructing certain extensions of models of bounded arithmetic. This offers a clean and coherent framework for thinking about lower bounds for proof lengths, and it has proved quite successful in the past. This book outlines a brand new method for constructing models of bounded arithmetic, thus for proving independence results and establishing lower bounds for proof lengths. The models are built from random variables defined on a sample space which is a non-standard finite set and sampled by functions of some restricted computational complexity. It will appeal to anyone interested in logical approaches to fundamental problems in complexity theory"-- 23 cm. Date : 2011 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1),

Réserver Ajouter au panier
Foundations of complex systems emergence, information and prediction par Nicolis, G. Publication : Singapore | London World Scientific 2012 . xvi, 367 pages 24 cm Date : 2012 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Réserver Ajouter au panier
Noisy information and computational complexity par Plaskota, Leszek. Publication : Cambridge Cambridge University Press 2011 . 1 vol. (XI-308 p.) 24 cm Date : 2011 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1),

Réserver Ajouter au panier
Parameterized complexity par Downey, R. G. Publication : New York Springer 1999 . xv, 533 pages 24 cm. Date : 1999 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1),

Réserver Ajouter au panier
Randomness and complexity, from leibniz to chaitin par Calude,, Cristian S. Publication : [S.l.] World Scientific Publishing Company 2007 . 468 p. , The book is a collection of papers written by a selection of eminent authors from around the world in honour of Gregory Chaitin s 60th birthday. This is a unique volume including technical contributions, philosophical papers and essays. 24 cm. Date : 2007 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1),

Réserver Ajouter au panier
Introduction a la résolution des systèmes polynomiaux / par Elkadi, Mohamed. Publication : Berlin ; | New York : Springer, 2007 . 1 online resource (305 pages) : Date : 2007 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1),

Réserver Ajouter au panier
Computational complexity : a quantitative perspective / par Zimand, Marius. Publication : . 1 online resource (xii, 340 pages) Disponibilité :  http://www.sciencedirect.com/science/book/9780444828415,  http://www.sciencedirect.com/science/publication?issn=03040208&volume=196,

Ajouter au panier
Theories of computational complexity / par Calude, Cristian, Publication : . 1 online resource (xiii, 487 pages) , Includes indexes. Disponibilité :  http://www.sciencedirect.com/science/book/9780444703569,  http://www.sciencedirect.com/science/publication?issn=01675060&volume=35,

Ajouter au panier
Vous ne trouvez pas ce que vous cherchez ?
© Tous droits résérvés IMIST/CNRST
Angle Av. Allal Al Fassi et Av. des FAR, Hay Ryad, BP 8027, 10102 Rabat, Maroc
Tél:(+212) 05 37.56.98.00
CNRST / IMIST

Propulsé par Koha