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

Mitwirkende(r):

Resource type: Ressourcentyp: Buch (Online)Buch (Online)Sprache: Englisch Reihen: SpringerLink Bücher | Lecture notes in computer science ; 4613Verlag: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Beschreibung: Online-Ressource (XI, 348 p. Also available online, digital)ISBN:

9783540738145

Schlagwörter:

Genre/Form:

Konferenzschrift -- 2007 -- Lanzhou

Andere physische Formen: 9783540738138 | Buchausg. u.d.T.: Frontiers in algorithmics. 1. ed. Berlin : Springer, 2007. XI, 348 S.DDC-Klassifikation:

005.11 23
005.1
004

MSC: MSC: *68-06 | 68Wxx | 00B25LOC-Klassifikation:

QA76.9.A43

DOI: DOI: 10.1007/978-3-540-73814-5Online-Ressourcen:

Zugang im Netz des KIT

Zusammenfassung: 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.PPN: PPN: 1646885961Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB | ZDB-2-LNC

Exemplare ( 0 )

Dieser Titel hat keine Exemplare