Skip to main content
  • Conference proceedings
  • © 2007

Frontiers in Algorithmics

First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4613)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): FAW: International Workshop on Frontiers in Algorithmics

Conference proceedings info: FAW 2007.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (33 papers)

  1. Front Matter

  2. A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays

    • Seung-Ho Kang, In-Seon Jeong, Mun-Ho Choi, Hyeong-Seok Lim
    Pages 14-25
  3. Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation

    • Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
    Pages 26-37
  4. New Algorithms for the Spaced Seeds

    • Xin Gao, Shuai Cheng Li, Yinan Lu
    Pages 50-61
  5. Region-Based Selective Encryption for Medical Imaging

    • Yang Ou, Chul Sur, Kyung Hyune Rhee
    Pages 62-73
  6. Extracting Information of Anti-AIDS Inhibitor from the Biological Literature Based on Ontology

    • Chunyan Zhang, Jin Du, Ruisheng Zhang, Xiaoliang Fan, Yongna Yuan, Ting Ning
    Pages 74-83
  7. On Coordination Among Multiple Auctions

    • Peter Chuntao Liu, Aries Wei Sun
    Pages 108-116
  8. The On-Line Rental Problem with Risk and Probabilistic Forecast

    • Yucheng Dong, Yinfeng Xu, Weijun Xu
    Pages 117-123
  9. Distributed Planning for the On-Line Dial-a-Ride Problem

    • Claudio Cubillos, Broderick Crawford, Nibaldo Rodríguez
    Pages 124-135
  10. Maximizing the Number of Independent Labels in the Plane

    • Kuen-Lin Yu, Chung-Shou Liao, D. T. Lee
    Pages 136-147
  11. On the Complexity of Approximation Streaming Algorithms for the k-Center Problem

    • Mahdi Abdelguerfi, Zhixiang Chen, Bin Fu
    Pages 160-171
  12. Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness

    • Shuyan Bai, Fuzeng Zhang, Shuguang Li, Qiming Liu
    Pages 172-177
  13. A Non-interleaving Denotational Semantics of Value Passing CCS with Action Refinement

    • Guang Zheng, Shaorong Li, Jinzhao Wu, Lian Li
    Pages 178-190
  14. Constraints Solution for Time Sensitive Security Protocols

    • Zhoujun Li, Ti Zhou, Mengjun Li, Huowang Chen
    Pages 191-203
  15. Using Bit Selection to Do Routing Table Lookup

    • Zhenqiang Li, Dongqu Zheng, Yan Ma
    Pages 204-215

Other Volumes

  1. Frontiers in Algorithmics

Keywords

  • Microarray
  • Performance
  • algorithmics
  • algorithms
  • approximation algorithms
  • bioinformatics
  • biomedical research
  • clustering
  • complexity
  • digital signature
  • discrete structures
  • fault tolerance
  • fuzzy vault
  • informa
  • information processing
  • algorithm analysis and problem complexity

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions