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

Danny Z. Chen, Mark A. Healy, Chao Wang, Bin Xu (auth.), Franco P. Preparata, Qizhi Fang (eds.)3540738134, 9783540738138

This book constitutes the refereed proceedings of the First Annual International Frontiers of Algorithmics Workshop, FAW 2007, held in Lanzhou, China in August 2007.The 33 revised full papers presented were carefully reviewed and selected from 141 submissions. The papers were selected for 9 special focus tracks in the areas of bioinformatics, 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 algorithms in medical applications.

---

Table of contents :
Front Matter….Pages –
Geometric Algorithms for the Constrained 1-D K -Means Clustering Problems and IMRT Applications….Pages 1-13
A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays….Pages 14-25
Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation….Pages 26-37
Biometric Digital Signature Key Generation and Cryptography Communication Based on Fingerprint….Pages 38-49
New Algorithms for the Spaced Seeds….Pages 50-61
Region-Based Selective Encryption for Medical Imaging….Pages 62-73
Extracting Information of Anti-AIDS Inhibitor from the Biological Literature Based on Ontology….Pages 74-83
A Novel Biology-Based Reversible Data Hiding Fusion Scheme….Pages 84-95
On the Approximation and Smoothed Complexity of Leontief Market Equilibria….Pages 96-107
On Coordination Among Multiple Auctions….Pages 108-116
The On-Line Rental Problem with Risk and Probabilistic Forecast….Pages 117-123
Distributed Planning for the On-Line Dial-a-Ride Problem….Pages 124-135
Maximizing the Number of Independent Labels in the Plane….Pages 136-147
On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions….Pages 148-159
On the Complexity of Approximation Streaming Algorithms for the k -Center Problem….Pages 160-171
Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness….Pages 172-177
A Non-interleaving Denotational Semantics of Value Passing CCS with Action Refinement….Pages 178-190
Constraints Solution for Time Sensitive Security Protocols….Pages 191-203
Using Bit Selection to Do Routing Table Lookup….Pages 204-215
A New Fuzzy Decision Tree Classification Method for Mining High-Speed Data Streams Based on Binary Search Trees….Pages 216-227
Hamiltonian Property on Binary Recursive Networks….Pages 228-235
A Performance Guaranteed New Algorithm for Fault-Tolerant Routing in Folded Cubes….Pages 236-243
Pathologic Region Detection Algorithm for Prostate Ultrasonic Image Based on PCNN….Pages 244-251
A Novel Heuristic Approach for Job Shop Scheduling Problem….Pages 252-260
An Efficient Physically-Based Model for Chinese Brush….Pages 261-270
A Trigram Statistical Language Model Algorithm for Chinese Word Segmentation….Pages 271-280
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs….Pages 281-292
Easy Problems for Grid-Structured Graphs….Pages 293-304
Long Alternating Cycles in Edge-Colored Complete Graphs….Pages 305-309
Notes on Fractional (1, f )-Odd Factors of Graphs….Pages 310-316
Some New Structural Properties of Shortest 2-Connected Steiner Networks….Pages 317-324
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs….Pages 325-336
Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs….Pages 337-345
Back Matter….Pages –