0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R2,500 - R5,000 (2)
  • R5,000 - R10,000 (1)
  • -
Status
Brand

Showing 1 - 3 of 3 matches in All Departments

VLSI 2010 Annual Symposium - Selected papers (Hardcover, 2011): Nikolaos Voros, Amar Mukherjee, Nicolas Sklavos, Konstantinos... VLSI 2010 Annual Symposium - Selected papers (Hardcover, 2011)
Nikolaos Voros, Amar Mukherjee, Nicolas Sklavos, Konstantinos Masselos, Michael Huebner
R5,618 Discovery Miles 56 180 Ships in 10 - 15 working days

VLSI 2010 Annual Symposium will present extended versions of the best papers presented in ISVLSI 2010 conference. The areas covered by the papers will include among others: Emerging Trends in VLSI, Nanoelectronics, Molecular, Biological and Quantum Computing. MEMS, VLSI Circuits and Systems, Field-programmable and Reconfigurable Systems, System Level Design, System-on-a-Chip Design, Application-Specific Low Power, VLSI System Design, System Issues in Complexity, Low Power, Heat Dissipation, Power Awareness in VLSI Design, Test and Verification, Mixed-Signal Design and Analysis, Electrical/Packaging Co-Design, Physical Design, Intellectual property creating and sharing.

The Burrows-Wheeler Transform: - Data Compression, Suffix Arrays, and Pattern Matching (Hardcover, 2008 ed.): Donald Adjeroh,... The Burrows-Wheeler Transform: - Data Compression, Suffix Arrays, and Pattern Matching (Hardcover, 2008 ed.)
Donald Adjeroh, Timothy Bell, Amar Mukherjee
R3,073 Discovery Miles 30 730 Ships in 10 - 15 working days

The Burrows-Wheeler Transform is one of the best lossless compression me- ods available. It is an intriguing - even puzzling - approach to squeezing redundancy out of data, it has an interesting history, and it has applications well beyond its original purpose as a compression method. It is a relatively late addition to the compression canon, and hence our motivation to write this book, looking at the method in detail, bringing together the threads that led to its discovery and development, and speculating on what future ideas might grow out of it. The book is aimed at a wide audience, ranging from those interested in learning a little more than the short descriptions of the BWT given in st- dard texts, through to those whose research is building on what we know about compression and pattern matching. The ?rst few chapters are a careful description suitable for readers with an elementary computer science ba- ground (and these chapters have been used in undergraduate courses), but later chapters collect a wide range of detailed developments, some of which are built on advanced concepts from a range of computer science topics (for example, some of the advanced material has been used in a graduate c- puter science course in string algorithms). Some of the later explanations require some mathematical sophistication, but most should be accessible to those with a broad background in computer science.

The Burrows-Wheeler Transform: - Data Compression, Suffix Arrays, and Pattern Matching (Paperback, Softcover reprint of... The Burrows-Wheeler Transform: - Data Compression, Suffix Arrays, and Pattern Matching (Paperback, Softcover reprint of hardcover 1st ed. 2008)
Donald Adjeroh, Timothy Bell, Amar Mukherjee
R2,881 Discovery Miles 28 810 Ships in 10 - 15 working days

The Burrows-Wheeler Transform is one of the best lossless compression me- ods available. It is an intriguing - even puzzling - approach to squeezing redundancy out of data, it has an interesting history, and it has applications well beyond its original purpose as a compression method. It is a relatively late addition to the compression canon, and hence our motivation to write this book, looking at the method in detail, bringing together the threads that led to its discovery and development, and speculating on what future ideas might grow out of it. The book is aimed at a wide audience, ranging from those interested in learning a little more than the short descriptions of the BWT given in st- dard texts, through to those whose research is building on what we know about compression and pattern matching. The ?rst few chapters are a careful description suitable for readers with an elementary computer science ba- ground (and these chapters have been used in undergraduate courses), but later chapters collect a wide range of detailed developments, some of which are built on advanced concepts from a range of computer science topics (for example, some of the advanced material has been used in a graduate c- puter science course in string algorithms). Some of the later explanations require some mathematical sophistication, but most should be accessible to those with a broad background in computer science.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Baby Dove Shampoo Rich Moisture 200ml
R50 Discovery Miles 500
Bunty 380GSM Golf Towel (30x50cm)(3…
R500 R255 Discovery Miles 2 550
Lucky Define - Plastic 3 Head…
R390 Discovery Miles 3 900
Baby Dove Rich Moisture Wipes (50Wipes)
R40 Discovery Miles 400
Complete Self Feeder (10kg)
 (4)
R413 R372 Discovery Miles 3 720
Goldair GBF-809 Rechargeable Box Fan…
R454 Discovery Miles 4 540
Tommee Tippee Sangenic Twist & Click…
R469 R325 Discovery Miles 3 250
Tenet
John David Washington, Robert Pattinson Blu-ray disc  (1)
R50 Discovery Miles 500
The Papery A5 WOW 2025 Diary - Owl
R349 R300 Discovery Miles 3 000
Lucky Plastic 3-in-1 Nose Ear Trimmer…
R289 Discovery Miles 2 890

 

Partners