LEADER 06260nam 22008175 450 001 9910768172403321 005 20251226195513.0 010 $a3-540-74450-9 024 7 $a10.1007/978-3-540-74450-4 035 $a(CKB)1000000000490390 035 $a(SSID)ssj0000316699 035 $a(PQKBManifestationID)11225836 035 $a(PQKBTitleCode)TC0000316699 035 $a(PQKBWorkID)10276214 035 $a(PQKB)10414760 035 $a(DE-He213)978-3-540-74450-4 035 $a(MiAaPQ)EBC3063287 035 $a(MiAaPQ)EBC6426742 035 $a(PPN)123164486 035 $a(MiAaPQ)EBC337268 035 $a(BIP)32372524 035 $a(BIP)14495879 035 $a(EXLCZ)991000000000490390 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorics, Algorithms, Probabilistic and Experimental Methodologies $eFirst International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers /$fedited by Bo Chen, Mike Paterson, Guochuan Zhang 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XII, 530 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4614 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-74449-5 320 $aIncludes bibliographical references and index. 327 $aThe Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I)???11/9OPT(I)?+?6/9 -- Sequential Vector Packing -- A Tighter Analysis of Set Cover Greedy Algorithm for Test Set -- A More Effective Linear Kernelization for Cluster Editing -- CR-precis: A Deterministic Summary Structure for Update Data Streams -- An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning -- On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems -- A Digital Watermarking Scheme Based on Singular Value Decomposition -- A New (t,n)??Threshold Scheme Based on Difference Equations -- Clique-Transversal Sets in Cubic Graphs -- On the L(h,k)-Labeling of Co-comparability Graphs -- An Approximation Algorithm for the General Mixed Packing and Covering Problem -- Extending the Hardness of RNA Secondary Structure Comparison -- On the On-Line Weighted k-Taxi Problem -- Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling -- On the Minimum Risk-Sum Path Problem -- Constrained Cycle Covers in Halin Graphs -- Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost -- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection -- Online Coupon Consumption Problem -- Application of Copula and Copula-CVaR in the Multivariate Portfolio Optimization -- Online Capacitated Interval Coloring -- Energy Efficient Heuristic Scheduling Algorithms for Multimedia Service -- Call Control and Routing in SONET Rings -- Fast Matching Method for DNA Sequences -- All-Pairs Ancestor Problems in Weighted Dags -- Streaming Algorithms for Data in Motion -- A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers -- Phrase-Based Statistical Language Modeling from Bilingual ParallelCorpus -- Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory -- On-Line Bin Packing with Arbitrary Release Times -- On the Complexity of the Max-Edge-Coloring Problem with Its Variants -- Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm -- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance -- Robust Optimization Model for a Class of Uncertain Linear Programs -- An Efficient Algorithm for Solving the Container Loading Problem -- A Bijective Code for k-Trees with Linear Time Encoding and Decoding -- Market-Based Service Selection Framework in Grid Computing -- Informative Gene Selection and Tumor Classification by Null Space LDA for Microarray Data -- Heuristic Search for 2D NMR Alignment to Support Metabolite Identification -- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array -- Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem -- Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach -- A New Load Balanced Routing Algorithm for Torus Networks -- Optimal Semi-online Scheduling Algorithms on a Small Number of Machines -- Lower Bounds on Edge Searching. 330 $aThe refereed post-proceedings of the First International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies are presented in this volume. The symposium provided an interdisciplinary forum for researchers to share their discoveries and approaches. The 46 full papers address large data processing problems using different methodologies from major disciplines such as computer science, combinatorics, and statistics. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4614 606 $aAlgorithms 606 $aPattern recognition systems 606 $aComputer simulation 606 $aData mining 606 $aBioinformatics 606 $aAlgorithms 606 $aAutomated Pattern Recognition 606 $aComputer Modelling 606 $aData Mining and Knowledge Discovery 606 $aComputational and Systems Biology 615 0$aAlgorithms. 615 0$aPattern recognition systems. 615 0$aComputer simulation. 615 0$aData mining. 615 0$aBioinformatics. 615 14$aAlgorithms. 615 24$aAutomated Pattern Recognition. 615 24$aComputer Modelling. 615 24$aData Mining and Knowledge Discovery. 615 24$aComputational and Systems Biology. 676 $a511.6 702 $aChen$b Bo$cDr, 702 $aPaterson$b Michael S. 702 $aZhang$b Guochuan 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768172403321 996 $aCombinatorics, Algorithms, Probabilistic and Experimental Methodologies$9774273 997 $aUNINA