๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 4112 || Computing Maximum-Scoring Segments in Almost Linear Time

โœ Scribed by Chen, Danny Z.; Lee, D. T.


Book ID
118031436
Publisher
Springer Berlin Heidelberg
Year
2006
Tongue
German
Weight
362 KB
Category
Article
ISBN
3540369260

No coin nor oath required. For personal study only.

โœฆ Synopsis


This Book Presents The Refereed Proceedings Of The 12th Annual International Computing And Combinatorics Conference, Cocoon 2006, Held In Taipei, Taiwan, August 2006. The Book Offers 52 Revised Full Papers Presented Together With Abstracts Of 2 Invited Talks. The Papers Are Organized In Topical Sections On Computational Economics, Finance, And Management, Graph Algorithms, Computational Complexity And Computability, Quantum Computing, Computational Biology And Medicine, Computational Geometry, Graph Theory, And More.


๐Ÿ“œ SIMILAR VOLUMES


[Lecture Notes in Computer Science] Comp
โœ Chen, Danny Z.; Lee, D. T. ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 362 KB

This Book Presents The Refereed Proceedings Of The 12th Annual International Computing And Combinatorics Conference, Cocoon 2006, Held In Taipei, Taiwan, August 2006. The Book Offers 52 Revised Full Papers Presented Together With Abstracts Of 2 Invited Talks. The Papers Are Organized In Topical Sect

[Lecture Notes in Computer Science] Comp
โœ Fu, Bin; Du, Ding-Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English โš– 216 KB

This book constitutes the refereed proceedings of the 17th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data s