• 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

      16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings

      AvMy T. Thai,Sartaj Sahni

      Häftad, Engelska, 2010

      Del i serien Lecture Notes in Computer Science

      1 092 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 16th Annual InternationalComputing and CombinatoricsConference (COCOON 2010), held duringJuly19-21,2010inNhaTrang,Vietnam.Previousmeetingsofthisconf- encewereheldinSingapore(2002),BigSky(2003),JejuIsland(2004),Kunming (2005), Taipei (2006), Alberta (2007), Dalian (2008) and New York (2009). COCOON 2010 provided a forum for researchers working in the areas of - gorithms, theory of computation, computational complexity, and combinatorics related to computing. In all, 133 papers were submitted from 40 countries and regions, of which 54 were accepted.Authors of the submitted papers were from Australia (10), Bangladesh (11), Belgium (1), Canada (23), Chile (1), China (20), Colombia (1), Czech Republic (6), Denmark (1), France (25), France(1), Germany (13), Greece (2), Hong Kong (7), Hungary (2), India (18), Indonesia (8),IslamicRepublicofIran(2),Ireland(1),Israel(6),Italy(6),Japan(31),- publicofKorea(4),Malaysia(1),TheNetherlands(2),NewZealand(2),Norway (3), Pakistan (1), Poland (1), Portugal (1), Russian Federation (3), Singapore (6), Slovakia (1), Spain (7), Sweden (2), Taiwan (19), Thailand (2), UK (2), USA (44), and Vietnam (15). The submitted papers wereevaluated by an internationalTechnical Program Committee (TPC). Each paper was evaluated by at least three TPC members, with possible assistance of the external referees, as indicated by the referee list found in the proceedings. Some of these 54 accepted papers will be selected for publication in a special issue of Algorithmica, Journal of Combinatorial - timization,and Discrete Mathematics, Algorithms, and Application under the standard refereeing procedure.In addition to the selected papers, the conf- ence also included two invited presentations by Manuel Blum (Carnegie Mellon University) and Oscar H. Ibarra (University of California Santa Barbara).

      Produktinformation

      • Utgivningsdatum:2010-07-05
      • Format:Häftad
      • Språk:Engelska
      • Serie:Lecture Notes in Computer Science
      • Antal sidor:553
      • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
      • ISBN:9783642140303

      Utforska kategorier

      • Systemvetenskap och AI inom Data och IT
      • Hårdvara inom Data och IT
      • Programmeringsböcker inom Data och IT

      Innehållsförteckning

      • Invited Talks.- Understanding and Inductive Inference.- Computing with Cells: Membrane Systems.- Complexity and Inapproximability.- Boxicity and Poset Dimension.- On the Hardness against Constant-Depth Linear-Size Circuits.- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model.- The Curse of Connectivity: t-Total Vertex (Edge) Cover.- Counting Paths in VPA Is Complete for #NC 1.- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas.- Approximation Algorithms.- Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing.- Clustering with or without the Approximation.- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks.- Approximate Weighted Farthest Neighbors and Minimum Dilation Stars.- Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs.- Graph Theory and Algorithms.- Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph.- Triangle-Free 2-Matchings Revisited.- The Cover Time of Deterministic Random Walks.- Finding Maximum Edge Bicliques in Convex Bipartite Graphs.- A Note on Vertex Cover in Graphs with Maximum Degree 3.- Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming.- Factorization of Cartesian Products of Hypergraphs.- Graph Drawing and Coloring.- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs.- On Three Parameters of Invisibility Graphs.- Imbalance Is Fixed Parameter Tractable.- The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs.- Computational Geometry.- Optimal Binary Space Partitions in the Plane.- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems.- Effectof Corner Information in Simultaneous Placement of K Rectangles and Tableaux.- Detecting Areas Visited Regularly.- Tile-Packing Tomography Is -hard.- The Rectilinear k-Bends TSP.- Tracking a Generator by Persistence.- Auspicious Tatami Mat Arrangements.- Automata, Logic, Algebra and Number Theory.- Faster Generation of Shorthand Universal Cycles for Permutations.- The Complexity of Word Circuits.- On the Density of Regular and Context-Free Languages.- Extensions of the Minimum Cost Homomorphism Problem.- The Longest Almost-Increasing Subsequence.- Universal Test Sets for Reversible Circuits.- Approximate Counting with a Floating-Point Counter.- Network Optimization and Scheduling Algorithm.- Broadcasting in Heterogeneous Tree Networks.- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks.- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties.- Computational Biology and Bioinformatics.- Discovering Pairwise Compatibility Graphs.- Near Optimal Solutions for Maximum Quasi-bicliques.- Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial.- Constant Time Approximation Scheme for Largest Well Predicted Subset.- On Sorting Permutations by Double-Cut-and-Joins.- A Three-String Approach to the Closest String Problem.- A 2k Kernel for the Cluster Editing Problem.- Data Structure and Sampling Theory.- On the Computation of 3D Visibility Skeletons.- The Violation Heap: A Relaxed Fibonacci-Like Heap.- Threshold Rules for Online Sample Selection.- Heterogeneous Subset Sampling.- Cryptography, Security, Coding and Game Theory.- Identity-Based Authenticated Asymmetric Group Key Agreement Protocol.- Zero-Knowledge Argument for Simultaneous Discrete Logarithms.- Directed Figure Codes: Decidability Frontier.
      Hoppa över listan

      Du kanske också är intresserad av

      Sartaj Sahni, My T. Thai - Computing and Combinatorics, E-bok

      Computing and Combinatorics

      Sartaj Sahni, My T. Thai

      E-bok
      2010

      1 427 kr

      Sartaj Sahni, Dinesh P. Mehta - Handbook of Data Structures and Applications, E-bok

      Handbook of Data Structures and Applications

      Sartaj Sahni, Dinesh P. Mehta

      E-bok
      2018

      864 kr

      Harrick M. Vin, Sartaj Sahni, Mahadeo P. Jaiswal, Sushil K. Prasad, Bundit Thipakorn - Information Systems, Technology and Management, E-bok

      Information Systems, Technology and Management

      Harrick M. Vin, Sartaj Sahni, Mahadeo P. Jaiswal, Sushil K. Prasad, Bundit Thipakorn

      E-bok
      2010

      1 470 kr

      Sartaj Sahni, Sanjay Ranka - Hypercube Algorithms, E-bok

      Hypercube Algorithms

      Sartaj Sahni, Sanjay Ranka

      E-bok
      2012

      710 kr

      Dinesh P. Mehta, Sartaj Sahni - Handbook of Data Structures and Applications, Inbunden

      Handbook of Data Structures and Applications

      Dinesh P. Mehta, Sartaj Sahni

      Inbunden, 2018

      3 404 kr

      Uday Shukla, Viktor K. Prasanna, Sartaj Sahni - High Performance Computing - HiPC 2002, E-bok

      High Performance Computing - HiPC 2002

      Uday Shukla, Viktor K. Prasanna, Sartaj Sahni

      E-bok
      2003

      1 413 kr

      Bundit Thipakorn, Sushil K. Prasad, Mahadeo P. Jaiswal, Sartaj Sahni, Harrick M. Vin - Information Systems, Technology and Management, Häftad
      Del 54

      Information Systems, Technology and Management

      Bundit Thipakorn, Sushil K. Prasad, Mahadeo P. Jaiswal, Sartaj Sahni, Harrick M. Vin

      Häftad, 2010

      1 124 kr

      D.P. Goyal, Sartaj Sahni, Sumeet Dua - Information Intelligence, Systems, Technology and Management, E-bok

      Information Intelligence, Systems, Technology and Management

      D.P. Goyal, Sartaj Sahni, Sumeet Dua

      E-bok
      2011

      732 kr

      Sumeet Dua, Sartaj Sahni, D.P. Goyal - Information Intelligence, Systems, Technology and Management, Häftad
      Del 141

      Information Intelligence, Systems, Technology and Management

      Sumeet Dua, Sartaj Sahni, D.P. Goyal

      Häftad, 2011

      566 kr

      Sartaj Sahni, Viktor K. Prasanna, Uday Shukla - High Performance Computing - HiPC 2002, Häftad

      High Performance Computing - HiPC 2002

      Sartaj Sahni, Viktor K. Prasanna, Uday Shukla

      Häftad, 2002

      1 124 kr