000 05528nam a22006495i 4500
001 978-3-540-69311-6
003 DE-He213
005 20240423125601.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540693116
_9978-3-540-69311-6
024 7 _a10.1007/978-3-540-69311-6
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aFrontiers in Algorithmics
_h[electronic resource] :
_bSecond International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceedings /
_cedited by Franco P. Preparata, Xiaodong Wu, Jianping Yin.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXI, 350 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5059
505 0 _aFixed Point Computation and Equilibrium -- Computer Science in the Information Age -- Knowledge-Based Approaches to Quantitative Medical Image Analysis and Image-Based Decision Making -- Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy -- A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem -- SlopeMiner: An Improved Method for Mining Subtle Signals in Time Course Microarray Data -- A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance -- Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information -- Estimating Hybrid Frequency Moments of Data Streams -- Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations -- NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT???k ,r-UNLSAT???k ) -- Absorbing Random Walks and the NAE2SAT Problem -- Versioning Tree Structures by Path-Merging -- A Linear In-situ Algorithm for the Power of Cyclic Permutation -- Multi-bidding Strategy in Sponsored Keyword Auction -- A CSP-Based Approach for Solving Parity Game -- Characterizing and Computing Minimal Cograph Completions -- Efficient First-Order Model-Checking Using Short Labels -- Matching for Graphs of Bounded Degree -- Searching Trees with Sources and Targets -- Ranking of Closeness Centrality for Large-Scale Social Networks -- Mixed Search Number of Permutation Graphs -- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs -- A Distributed Algorithm to Approximate Node-Weighted Minimum ?-Connected (?,k)-Coverage in Dense Sensor Networks -- Optimal Surface Flattening -- Visiting a Polygon on the Optimal Way to a Query Point -- Constraint Abstraction in Verification of Security Protocols -- Fast Convergence ofVariable-Structure Congestion Control Protocol with Explicit Precise Feedback -- Applying a New Grid-Based Elitist-Reserving Strategy to EMO Archive Algorithms -- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants -- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach -- A Scalable Algorithm for Graph-Based Active Learning -- A Supervised Feature Extraction Algorithm for Multi-class -- An Incremental Feature Learning Algorithm Based on Least Square Support Vector Machine -- A Novel Wavelet Image Fusion Algorithm Based on Chaotic Neural Network.
520 _aThis book constitutes the refereed proceedings of the Second International Frontiers of Algorithmics Workshop, FAW 2008, held in Changsha, China, in June 2008. The 33 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 80 submissions. The papers were selected for 9 special focus tracks in the areas of biomedical informatics, discrete structures, geometric information processing and communication, games and incentive analysis, graph algorithms, internet algorithms and protocols, parameterized algorithms, design and analysis of heuristics, approximate and online algorithms, and machine learning.
650 0 _aComputer programming.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aNumerical analysis.
650 0 _aComputer graphics.
650 0 _aBioinformatics.
650 1 4 _aProgramming Techniques.
650 2 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aNumerical Analysis.
650 2 4 _aComputer Graphics.
650 2 4 _aComputational and Systems Biology.
700 1 _aPreparata, Franco P.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aWu, Xiaodong.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aYin, Jianping.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540693109
776 0 8 _iPrinted edition:
_z9783540865285
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5059
856 4 0 _uhttps://doi.org/10.1007/978-3-540-69311-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c179554
_d179554