Frontiers in Algorithmics First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings /

Corporate Author: SpringerLink (Online service)
Other Authors: Preparata, Franco P. (Editor, http://id.loc.gov/vocabulary/relators/edt), Fang, Qizhi. (Editor, http://id.loc.gov/vocabulary/relators/edt)
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edition:1st ed. 2007.
Series:Theoretical Computer Science and General Issues ; 4613
Subjects:
Online Access:https://doi.org/10.1007/978-3-540-73814-5
LEADER 05046nam a22005895i 4500
001 978-3-540-73814-5
003 DE-He213
005 20210625004524.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540738145  |9 978-3-540-73814-5 
024 7 |a 10.1007/978-3-540-73814-5  |2 doi 
050 4 |a QA76.6-76.66 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
072 7 |a UM  |2 thema 
082 0 4 |a 005.11  |2 23 
245 1 0 |a Frontiers in Algorithmics  |h [electronic resource] :  |b First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings /  |c edited by Franco P. Preparata, Qizhi Fang. 
250 |a 1st ed. 2007. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2007. 
300 |a XI, 348 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues ;  |v 4613 
505 0 |a 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. 
650 0 |a Computer programming. 
650 0 |a Algorithms. 
650 0 |a Computer science—Mathematics. 
650 0 |a Numerical analysis. 
650 0 |a Computer graphics. 
650 0 |a Bioinformatics. 
650 1 4 |a Programming Techniques.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I14010 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I16021 
650 2 4 |a Discrete Mathematics in Computer Science.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I17028 
650 2 4 |a Numeric Computing.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 
650 2 4 |a Computer Graphics.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I22013 
650 2 4 |a Computational Biology/Bioinformatics.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I23050 
700 1 |a Preparata, Franco P.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Fang, Qizhi.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540841371 
776 0 8 |i Printed edition:  |z 9783540738138 
830 0 |a Theoretical Computer Science and General Issues ;  |v 4613 
856 4 0 |u https://doi.org/10.1007/978-3-540-73814-5 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)