Frontiers in Algorithmics : First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings / / edited by Franco P. Preparata, Qizhi Fang

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
• Edizione: 1st ed. 2007.
• Descrizione fisica: 1 online resource (XI, 348 p.)
• Disciplina: 005.1
• Soggetto topico: Computer programming; Algorithms; Computer science—Mathematics; Discrete mathematics; Numerical analysis; Computer graphics; Bioinformatics; Programming Techniques; Discrete Mathematics in Computer Science; Numerical Analysis; Computer Graphics; Computational and Systems Biology
• Persona (resp. second.): PreparataFranco P; FangQizhi
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: Geometric Algorithms for the Constrained 1-D K-Means Clustering Problems and IMRT Applications -- A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays -- Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation -- Biometric Digital Signature Key Generation and Cryptography Communication Based on Fingerprint -- New Algorithms for the Spaced Seeds -- Region-Based Selective Encryption for Medical Imaging -- Extracting Information of Anti-AIDS Inhibitor from the Biological Literature Based on Ontology -- A Novel Biology-Based Reversible Data Hiding Fusion Scheme -- On the Approximation and Smoothed Complexity of Leontief Market Equilibria -- On Coordination Among Multiple Auctions -- The On-Line Rental Problem with Risk and Probabilistic Forecast -- Distributed Planning for the On-Line Dial-a-Ride Problem -- Maximizing the Number of Independent Labels in the Plane -- On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions -- On the Complexity of Approximation Streaming Algorithms for the k-Center Problem -- Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness -- A Non-interleaving Denotational Semantics of Value Passing CCS with Action Refinement -- Constraints Solution for Time Sensitive Security Protocols -- Using Bit Selection to Do Routing Table Lookup -- A New Fuzzy Decision Tree Classification Method for Mining High-Speed Data Streams Based on Binary Search Trees -- Hamiltonian Property on Binary Recursive Networks -- A Performance Guaranteed New Algorithm for Fault-Tolerant Routing in Folded Cubes -- Pathologic Region Detection Algorithm for Prostate Ultrasonic Image Based on PCNN -- A Novel Heuristic Approach for Job Shop Scheduling Problem -- An Efficient Physically-Based Model for Chinese Brush -- A Trigram Statistical Language Model Algorithm for Chinese Word Segmentation -- An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs -- Easy Problems for Grid-Structured Graphs -- Long Alternating Cycles in Edge-Colored Complete Graphs -- Notes on Fractional (1,f)-Odd Factors of Graphs -- Some New Structural Properties of Shortest 2-Connected Steiner Networks -- The Parameterized Complexity of the Induced Matching Problem in Planar Graphs -- Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs.
• Titolo autorizzato: Frontiers in algorithmics
• ISBN: 1-281-04281-1; 9786611042813; 3-540-73814-2
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910484287103321
• Lo trovi qui: Univ. Federico II
• Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 4613