Frontiers in algorithmics : Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009 : proceedings / / Xiaotie Deng, John E. Hopcroft, Jinyun Xue (eds.)

• Pubblicazione: Berlin ; ; New York, : Springer, 2009
• Edizione: 1st ed. 2009.
• Descrizione fisica: 1 online resource (XIV, 372 p.)
• Disciplina: 005.1
• Soggetto topico: Algorithms; Computer algorithms
• Classificazione: DAT 530f; SS 4800
• Altri autori: DengXiaotie HopcroftJohn E. <1939-> XueJinyun
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: FAW 2009 -- Study on Parallel Computing -- Communication Complexity and Its Applications -- Algorithmic Problems in Computer and Network Power Management -- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains -- Edge Search Number of Cographs in Linear Time -- Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems -- Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs -- Covering-Based Routing Algorithms for Cyclic Content-Based P/S System -- On the ?-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games -- Cop-Robber Guarding Game with Cycle Robber Region -- Covered Interest Arbitrage in Exchange Rate Forecasting Markets -- CFI Construction and Balanced Graphs -- Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions -- Space–Query-Time Tradeoff for Computing the Visibility Polygon -- Square and Rectangle Covering with Outliers -- Processing an Offline Insertion-Query Sequence with Applications -- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs -- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs -- On Modulo Linked Graphs -- Pathwidth is NP-Hard for Weighted Trees -- A Max-Margin Learning Algorithm with Additional Features -- DDoS Attack Detection Algorithm Using IP Address Features -- Learning with Sequential Minimal Transductive Support Vector Machine -- Junction Tree Factored Particle Inference Algorithm for Multi-Agent Dynamic Influence Diagrams -- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set -- Heuristics for Mobile Object Tracking Problem in Wireless Sensor Networks -- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems -- The BDD-Based Dynamic A* Algorithm for Real-Time Replanning -- Approximating Scheduling Machines with Capacity Constraints -- Approximating the Spanning k-Tree Forest Problem -- Toward an Automatic Approach to Greedy Algorithms -- A Novel Approximate Algorithm for Admission Control -- On the Structure of Consistent Partitions of Substring Set of a Word -- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet -- An Improved Database Classification Algorithm for Multi-database Mining -- Six-Card Secure AND and Four-Card Secure XOR.
• Sommario/riassunto: This book constitutes the refereed proceedings of the Third International Frontiers of Algorithmics Workshop, FAW 2009, held in Hefei, Anhui, China, in June 2009. The 33 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on graph algorithms; game theory with applications; graph theory, computational geometry; machine learning; parameterized algorithms, heuristics and analysis; approximation algorithms; as well as pattern recognition algorithms, large scale data mining.
• Titolo autorizzato: Frontiers in algorithmics
• ISBN: 1-280-38299-6; 9786613560902; 3-642-02270-7
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910483641603321
• Lo trovi qui: Univ. Federico II
• Serie: Lecture notes in computer science ; ; 5598.; LNCS sublibrary. : SL 1, . -Theoretical computer science and general issues.