Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1. FAW 2007: Lanzhou, China
- Franco P. Preparata, Qizhi Fang:
Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings. Lecture Notes in Computer Science 4613, Springer 2007, ISBN 978-3-540-73813-8 - Danny Z. Chen, Mark A. Healy, Chao Wang, Bin Xu:
Geometric Algorithms for the Constrained 1-D K -Means Clustering Problems and IMRT Applications. 1-13 - Seung-Ho Kang, In-Seon Jeong, Mun-Ho Choi, Hyeong-Seok Lim:
A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays. 14-25 - Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn:
Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. 26-37 - Je-Gyeong Jo, Jong-Won Seo, Hyung-Woo Lee:
Biometric Digital Signature Key Generation and Cryptography Communication Based on Fingerprint. 38-49 - Xin Gao, Shuaicheng Li
, Yinan Lu:
New Algorithms for the Spaced Seeds. 50-61 - Yang Ou, Chul Sur, Kyung Hyune Rhee:
Region-Based Selective Encryption for Medical Imaging. 62-73 - Chunyan Zhang, Jin Du, Ruisheng Zhang, Xiaoliang Fan, Yongna Yuan, Ting Ning:
Extracting Information of Anti-AIDS Inhibitor from the Biological Literature Based on Ontology. 74-83 - Tianding Chen:
A Novel Biology-Based Reversible Data Hiding Fusion Scheme. 84-95 - Li-Sha Huang, Shang-Hua Teng:
On the Approximation and Smoothed Complexity of Leontief Market Equilibria. 96-107 - Peter Chuntao Liu, Aries Wei Sun:
On Coordination Among Multiple Auctions. 108-116 - Yucheng Dong, Yinfeng Xu, Weijun Xu:
The On-Line Rental Problem with Risk and Probabilistic Forecast. 117-123 - Claudio Cubillos, Broderick Crawford, Nibaldo Rodríguez:
Distributed Planning for the On-Line Dial-a-Ride Problem. 124-135 - Kuen-Lin Yu, Chung-Shou Liao, D. T. Lee:
Maximizing the Number of Independent Labels in the Plane. 136-147 - Daya Ram Gaur, Kazuhisa Makino:
On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions. 148-159 - Mahdi Abdelguerfi, Zhixiang Chen, Bin Fu:
On the Complexity of Approximation Streaming Algorithms for the k -Center Problem. 160-171 - Shuyan Bai, Fuzeng Zhang, Shuguang Li, Qiming Liu:
Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness. 172-177 - Guang Zheng, Shaorong Li, Jinzhao Wu, Lian Li:
A Non-interleaving Denotational Semantics of Value Passing CCS with Action Refinement. 178-190 - Zhoujun Li, Ti Zhou, Mengjun Li, Huowang Chen:
Constraints Solution for Time Sensitive Security Protocols. 191-203 - Zhenqiang Li, Dongqu Zheng, Yan Ma:
Using Bit Selection to Do Routing Table Lookup. 204-215 - Zhoujun Li, Tao Wang, Ruoxue Wang, Yuejin Yan, Huowang Chen:
A New Fuzzy Decision Tree Classification Method for Mining High-Speed Data Streams Based on Binary Search Trees. 216-227 - Yun Sun, Zhoujun Li, Deqiang Wang:
Hamiltonian Property on Binary Recursive Networks. 228-235 - Hongmei Liu:
A Performance Guaranteed New Algorithm for Fault-Tolerant Routing in Folded Cubes. 236-243 - Beidou Zhang, Yide Ma, Dongmei Lin, Liwen Zhang:
Pathologic Region Detection Algorithm for Prostate Ultrasonic Image Based on PCNN. 244-251 - Yong-Ming Wang, Nan-Feng Xiao, Hong-Li Yin, En-Liang Hu:
A Novel Heuristic Approach for Job Shop Scheduling Problem. 252-260 - Bendu Bai, Kam-Wah Wong, Yanning Zhang:
An Efficient Physically-Based Model for Chinese Brush. 261-270 - Jun Mao, Gang Cheng, Yanxiang He, Zehuan Xing:
A Trigram Statistical Language Model Algorithm for Chinese Word Segmentation. 271-280 - Stavros D. Nikolopoulos, Leonidas Palios:
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs. 281-292 - Detlef Seese:
Easy Problems for Grid-Structured Graphs. 293-304 - Hao Li, Guanghui Wang, Shan Zhou:
Long Alternating Cycles in Edge-Colored Complete Graphs. 305-309 - Jiguo Yu, Guizhen Liu:
Notes on Fractional (1, f )-Odd Factors of Graphs. 310-316 - Shuying Peng, Meili Li, Shenggui Zhang, T. C. Edwin Cheng:
Some New Structural Properties of Shortest 2-Connected Steiner Networks. 317-324 - Hannes Moser, Somnath Sikdar:
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. 325-336 - Haiyan Kang, Jichang Wu, Guojun Li:
Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs. 337-345
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
