• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Nyheter
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Pocketböcker
  • Spel & pussel

Upp till 20% på populära nyheter →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Populära bokserier
    • Barnbokskaraktärer
    • Populära författare

    Mina sidor

      Hjälp

      • Kundservice
      • Vanliga frågor och svar
      • Frakt och leverans
      • Retur vid ångerrätt
      • Reklamera vara
      • Betalning
      • Köpvillkor
      • Allmänna villkor
      • Information om webbplatsens tillgänglighet

      Om Bokus

      • Om oss
      • Pressrum
      • För studenter
      • För företag
      • För bibliotek och offentlig verksamhet
      • För leverantörer
      • Hållbarhet

      Populärt

      • Aktuella erbjudanden
      • Presentkort
      • Studentlitteratur
      • Nya böcker
      • Topplistor
      • Signerade böcker
      • Engelska böcker

      Inspiration

      • Boktips
      • BookTok
      • Populära bokserier
      • Barnbokskaraktärer
      • Populära författare
      Logotyp för Bokus
      Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
      bokus @ CookiesIntegritetspolicyKöpvillkor
      Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
      1. Data och IT
      2. Systemvetenskap och AI

      Computing and Combinatorics

      6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings

      AvDing-Zhu Du,Peter Eades

      Häftad, Engelska, 2000

      Del i serien Lecture Notes in Computer Science

      574 kr

      Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

      Beskrivning

      The papers in this volume were selected for presentation at the 6th Annual International Computing and Combinatorics Conference (COCOON2000), in Sydney, Australia from July 26 - 28, 2000. The topics cover many areas in t- oretical computer science and combinatorial optimization. There were 81 high quality papers submitted to COCOON2000. Each paper was reviewed by at least three program committee members, and the 44 papers were selected. It is expected that most of them will appear in a more complete form in scientic journals. In addition to the selected papers, the volume also contains the papers from two invited keynote speeches by Christos Papad- itriou and Richard Brent. This year the Hao Wang Award was given to honor the paper judged by the programcommittee to have the greatest merit. The recipient is \Approximating Uniform TriangularMeshes in Polygons"byFranz Aurenhammer, NaokiKatoh, Hiromichi Kojima, Makoto Ohsaki, and Yinfeng Xu. The rst Best Young - searcher paper award was given to William Duckworth for his paper \Maximum Induced Matchings of Random Cubic Graphs".We wish to thank all who have made this meeting possible: the authors for submitting papers, the program committee members and the external referees, sponsors, the local organizers, ACM SIGACT for handling electronic subm- sions,Springer-Verlagfor their support, and Debbie Hatherellfor her assistance.

      Produktinformation

      • Utgivningsdatum:2000-07-12
      • Mått:155 x 235 x 27 mm
      • Vikt:744 g
      • Format:Häftad
      • Språk:Engelska
      • Serie:Lecture Notes in Computer Science
      • Antal sidor:478
      • Upplaga:2000
      • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
      • ISBN:9783540677871

      Utforska kategorier

      • Systemvetenskap och AI inom Data och IT
      • Grafik och bildbehandling inom Data och IT
      • Programmeringsböcker inom Data och IT

      Innehållsförteckning

      • Invited Talks.- Theoretical Problems Related to the Internet.- Recent Progress and Prospects for Integer Factorisation Algorithms.- Hao Wang Award Paper.- Approximating Uniform Triangular Meshes in Polygons.- The Best Young Researcher Paper.- Maximum Induced Matchings of Random Cubic Graphs.- Computational Geometry 1.- A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems.- On Local Transformation of Polygons with Visibility Properties.- Graph Drawing.- Embedding Problems for Paths with Direction Constrained Edges.- Characterization of Level Non-planar Graphs by Minimal Patterns.- Rectangular Drawings of Plane Graphs Without Designated Corners.- Computing Optimal Embeddings for Planar Graphs.- Graph Theory and Algorithms 1.- Approximation Algorithms for Independent Sets in Map Graphs.- Hierarchical Topological Inference on Planar Disc Maps.- Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs.- Complexity, Discrete Mathematics, and Number Theory.- Parameterized Complexity of Finding Subgraphs with Hereditary Properties.- Some Results on Tries with Adaptive Branching.- Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound.- Closure Properties of Real Number Classes under Limits and Computable Operators.- Graph Theory and Algorithms 2.- A Characterization of Graphs with Vertex Cover Six.- On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree.- Online Algorithms.- Online Independent Sets.- Two-Dimensional On-Line Bin Packing Problem with Rotatable Items.- Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.- Ordinal On-Line Scheduling on Two Uniform Machines.- Parallel and Distributed Computing.- Agents, Distributed Algorithms, and Stabilization.- A Fast Sorting Algorithm and Its Generalization on Broadcast Communications.- Efficient List Ranking Algorithms on Reconfigurable Mesh.- Computational Geometry 2.- Tripods Do Not Pack Densely.- An Efficient k Nearest Neighbor Searching Algorithm for a Query Line.- Tetrahedralization of Two Nested Convex Polyhedra.- Efficient Algorithms for Two-Center Problems for a Convex Polygon.- Combinatorial Optimization.- On Computation of Arbitrage for Markets with Friction.- On Some Optimization Problems in Obnoxious Facility Location.- Generating Necklaces and Strings with Forbidden Substrings.- Optimal Labelling of Point Features in the Slider Model.- Data Structures and Computational Biology.- Mappings for Conflict-Free Access of Paths in Elementary Data Structures.- Theory of Trinomial Heaps.- Polyhedral Aspects of the Consecutive Ones Problem.- The Complexity of Physical Mapping with Strict Chimerism.- Learning and Cryptography.- Logical Analysis of Data with Decomposable Structures.- Learning from Approximate Data.- A Combinatorial Approach to Asymmetric Traitor Tracing.- Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs.- Automata and Quantum Computing.- One-Way Probabilistic Reversible and Quantum One-Counter Automata.- Similarity Enrichment in Image Compression through Weighted Finite Automata.- On the Power of Input-Synchronized Alternating Finite Automata.- Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction.
      Hoppa över listan

      Du kanske också är intresserad av

      Arun Sharma, Xuemin Lin, Vladimir Estivill-Castro, Peter Eades, Ding-Zhu Du - Computing and Combinatorics, E-bok

      Computing and Combinatorics

      Arun Sharma, Xuemin Lin, Vladimir Estivill-Castro, Peter Eades, Ding-Zhu Du

      E-bok
      2003

      718 kr

      Tadao Takaoka, Peter Eades - Algorithms and Computation, E-bok

      Algorithms and Computation

      Tadao Takaoka, Peter Eades

      E-bok
      2003

      1 427 kr

      Oscar Pedreira, Vladimir Estivill-Castro - Similarity Search and Applications, Häftad
      Del 14289

      Similarity Search and Applications

      Oscar Pedreira, Vladimir Estivill-Castro

      Häftad, 2023

      731 kr

      Peter Eades, Tadao Takaoka - Algorithms and Computation, Häftad

      Algorithms and Computation

      Peter Eades, Tadao Takaoka

      Häftad, 2001

      1 142 kr

      Vladimir Estivill-Castro, Oscar Pedreira - Similarity Search and Applications, E-bok

      Similarity Search and Applications

      Vladimir Estivill-Castro, Oscar Pedreira

      E-bok
      2023

      903 kr

      John Staples, Peter Eades, Naoki Katoh, Alistair Moffat - Algorithms and Computations, Häftad

      Algorithms and Computations

      John Staples, Peter Eades, Naoki Katoh, Alistair Moffat

      Häftad, 1995

      574 kr

      Guangyan Huang, Divesh Srivastava, Yannis Manolopoulos, Xuemin Lin - Web Information Systems Engineering -- WISE 2013, E-bok

      Web Information Systems Engineering -- WISE 2013

      Guangyan Huang, Divesh Srivastava, Yannis Manolopoulos, Xuemin Lin

      E-bok
      2013

      739 kr

      Yang-Sae Moon, Xuemin Lin, Jae-Gil Lee, Longbing Cao, Kyuseok Shim, Jinho Kim - Advances in Knowledge Discovery and Data Mining, E-bok

      Advances in Knowledge Discovery and Data Mining

      Yang-Sae Moon, Xuemin Lin, Jae-Gil Lee, Longbing Cao, Kyuseok Shim, Jinho Kim

      E-bok
      2017

      1 470 kr

      Jeffrey Xu Yu, Xuemin Lin, Hongjun Lu, Yanchun Zhang - Advanced Web Technologies and Applications, Häftad

      Advanced Web Technologies and Applications

      Jeffrey Xu Yu, Xuemin Lin, Hongjun Lu, Yanchun Zhang

      Häftad, 2004

      1 142 kr

      Yixiang Fang, Kai Wang, Xuemin Lin, Wenjie Zhang - Cohesive Subgraph Search Over Large Heterogeneous Information Networks, Häftad

      Cohesive Subgraph Search Over Large Heterogeneous Information Networks

      Yixiang Fang, Kai Wang, Xuemin Lin, Wenjie Zhang

      Häftad, 2022

      503 kr