資料來源: Google Book
Computing and combinatorics :10th annual international conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004 : proceedings
- 其他作者: Chwa, Kyung-Yong, , Munro, J. Ian.
- 出版: Berlin : Springer 2004.
- 稽核項: 1 online resource (xiii, 474 pages) :illustrations.
- 叢書名: Lecture notes in computer science,3106
- 標題: Combinatorics , Informatique Congrès. , COMPUTERS , COMPUTERS Reference. , Computer Science. , Computer science , Informatique , Reference. , COMPUTERS Machine Theory. , HardwareGeneral. , Analyse combinatoire , Data Processing. , Combinatorial analysis Congresses. , Computer science Congresses. , Computer Literacy. , Combinatorial analysis , Combinatorial analysis. , Conference papers and proceedings. , Analyse combinatoire Congrès. , COMPUTERS Computer Science. , Electronic books. , COMPUTERS Hardware -- General. , COMPUTERS Computer Literacy. , Information Technology. , Computing , COMPUTERS Information Technology. , Machine Theory. , Computer science. , COMPUTERS Data Processing. , COCOON
- ISBN: 3540277986 , 9783540277989
- ISBN: 354022856X , 9783540228561 , 0302-9743 ;
- 試查全文@TNUA:
- 附註: Includes bibliographical references and author index. Invited Presentations -- External Geometric Data Structures -- The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems -- Robust Geometric Computation Based on Digital Topology -- Data Structures and Algorithms I -- Adjacency of Optimal Regions for Huffman Trees -- A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs -- Towards Constructing Optimal Strip Move Sequences -- Computational Geometry I -- Large Triangles in the d-Dimensional Unit-Cube -- Progress on Maximum Weight Triangulation -- Coloring Octrees -- Games and Combinatorics -- Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes -- Q-Ary Ulam-Rényi Game with Weighted Constrained Lies -- Necessary and Sufficient Numbers of Cards for the Transformation Protocol -- Combinatorial Optimization I -- On the Selection and Assignment with Minimum Quantity Commitments -- Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study -- Transshipment Through Crossdocks with Inventory and Time Windows -- Graph Algorithms -- Approximated Vertex Cover for Graphs with Perfect Matchings -- An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs -- On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts -- The Worst-Case Time Complexity for Generating All Maximal Cliques -- Automata and Learning Theory -- Regular Expressions for Languages over Infinite Alphabets -- On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations -- Learning DNFs and Circuits Using Teaching Assistants -- On the Complexity of Samples for Learning -- Scheduling -- New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation -- Maximization of the Size and the Weight of Schedules of Degradable Intervals -- Minimizing Maximum Lateness on Identical Parallel Batch Processing Mac
- 摘要: This book constitutes the refereed proceedings of the 10th Annual International Computing and Combinatorics Conference, COCOON 2004, held in Jeju Island, Korea, in August 2004. The 46 revised full papers presented together with abstracts of 3 invited talks were carefully reviewed and selected from 109 submissions. The papers are organized in topical sections on data structures and algorithms, computational geometry, games and combinatorics, combinatorial optimization, graph algorithms, automata and learning theory, scheduling, graph drawing, complexity theory, parallel and distributed architectures, and computational biology.
- 電子資源: https://dbs.tnua.edu.tw/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=133907
- 系統號: 005312136
- 資料類型: 電子書
- 讀者標籤: 需登入
- 引用網址: 複製連結
Thepapersinthisvolumewereselectedforpresentationatthe10thInternational Computing and Combinatorics Conference (COCOON 2004), held on August 17–20, 2004 in Jeju Island, Korea. Previous meetings were held in Xi’an (1995), HongKong(1996),Shanghai(1997),Taipei(1998),Tokyo(1999),Sydney(2000), Guilin (2001), Singapore (2002), and Big Sky (2003). In response to the call for papers, 109 extended abstracts were submitted from 23 countries, of which 46 were accepted. The submitted papers were from Belgium (1), Canada (5), China (6), France (1), Germany (6), Hong Kong (8), India (6), Iran (1), Ireland (1), Israel (4), Italy (2), Japan (17), Korea (23), Mexico (3), New Zealand (1), Poland(1), Russia (1), Singapore (5), Sweden (2), Switzerland (3), Taiwan (2), the UK (1), and the USA (9). Each paper was evaluated by at least three program committee members, with the assistance of referees, as indicated by the referee list found in these proceedings. There were many more acceptable papers than there was space available in the conference schedule, and the program committee’s task was extremely di?cult. In addition to selected papers, the conference also included threeinvitedpresentationsbyLarsArge,JeongHanKim,andKokichiSugihara. We thank all program committee members and their referees for their - cellent work, especially given the demanding time constraints; they gave the conference its distinctive character. We thank all who submitted papers for c- sideration: they all contributed to the high quality of the conference. Finally,wethankallthepeoplewhoworkedhardtoputinplacethelogistical arrangements of the conference — our colleagues and our graduate students. It is their hard work that made the conference possible and enjoyable.
來源: Google Book
來源: Google Book
評分