LEADER 05958nam 22008295 450 001 996465421903316 005 20230406055943.0 010 $a1-280-38299-6 010 $a9786613560902 010 $a3-642-02270-7 024 7 $a10.1007/978-3-642-02270-8 035 $a(CKB)1000000000753973 035 $a(SSID)ssj0000317806 035 $a(PQKBManifestationID)11248528 035 $a(PQKBTitleCode)TC0000317806 035 $a(PQKBWorkID)10308064 035 $a(PQKB)11500807 035 $a(DE-He213)978-3-642-02270-8 035 $a(MiAaPQ)EBC3064329 035 $a(PPN)136306683 035 $a(EXLCZ)991000000000753973 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFrontiers in Algorithmics$b[electronic resource] $eThird International Workshop, FAW 2009, Hefei, China, June 20-23, 2009, Proceedings /$fedited by Xiaotie Deng, John E. Hopcroft, Jinyun Xue 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XIV, 372 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5598 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-02269-3 320 $aIncludes bibliographical references and index. 327 $aFAW 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5598 606 $aArtificial intelligence?Data processing 606 $aComputer science?Mathematics 606 $aArtificial intelligence 606 $aAlgorithms 606 $aDiscrete mathematics 606 $aSoftware engineering 606 $aData Science 606 $aMathematics of Computing 606 $aArtificial Intelligence 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aSoftware Engineering 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science?Mathematics. 615 0$aArtificial intelligence. 615 0$aAlgorithms. 615 0$aDiscrete mathematics. 615 0$aSoftware engineering. 615 14$aData Science. 615 24$aMathematics of Computing. 615 24$aArtificial Intelligence. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSoftware Engineering. 676 $a005.1 686 $aDAT 530f$2stub 686 $aSS 4800$2rvk 702 $aDeng$b Xiaotie$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aHopcroft$b John E.$f1939-$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aXue$b Jinyun$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465421903316 996 $aFrontiers in algorithmics$958649 997 $aUNISA