Keynote Address I

• 
  Sartaj Sahni, Kun Suk Kim, Haibin Lu: Data Structures For One-Dimensional Packet Classification Using Most-Specific-Rule Matching. 3-

Algorithm I

• 
  Min-Te Sun, Chung-Kuo Chang, Ten-Hwang Lai: A Self-Routing Topology for Bluetooth Scatternets. 17-22
• 
  S. Sitharama Iyengar, Qishi Wu: Computational Aspects of Distributed Sensor Network. 23-30
• 
  Thanasis Loukopoulos, Dimitris Papadias, Ishfaq Ahmad: An Overview of Data Replication on the Internet. 31-

Data Base and Data Mining I

• 
  Adora E. Calaor, Augusto Y. Hermosilla, Bobby O. Corpus Jr.: Parallel Hybrid Adventures with Simulated Annealing and Genetic Algorithms. 39-44
• 
  James A. Esquivel, Philip Chan: An Algorithm for Resolving the Join Component Selection Problem in Parallel Join Optimization. 45-50
• 
  David Taniar, Rebecca Boon-Noi Tan: Parallel Processing of Multi-Join Expansion_aggregate Data Cube Query in High Performance Database Systems. 51-

Algorithm II

• 
  Peter R. Cappello, Ömer Egecioglu: Automatic Processor Lower Bound Formulas for Array Computations. 59-64
• 
  Michael A. Palis: Online Real-Time Job Scheduling with Rate of Progress Guarantees. 65-70
• 
  Koji Nakano, Stephan Olariu: A Survey on Leader Election Protocols for Radio Networks. 71-

Wireless Networks

• 
  Victor O. K. Li, Wanjiun Liao: Wireless Multimedia Networks. 79-84
• 
  Jie Wu, Fei Dai: On Locality of Dominating Set in Ad Hoc Networks with Switch-On/Off Operations. 85-90
• 
  Caimu Tang, Cauligi S. Raghavendra, Viktor K. Prasanna: Energy Efficient Adaptation of Multicast Protocols in Power Controlled Wireless Ad Hoc Networks. 91-

Algorithm III

• 
  Yen-Chun Lin, Jun-Wei Hsiao: A New Approach to Constructing Optimal Prefix Circuits with Small Depth. 99-104
• 
  Jinhyuk Yoon, Sang Lyul Min, Yookun Cho: Buffer Cache Management: Predicting the Future from the Past. 105-110
• 
  Aaron Harwood, Hong Shen: Random Hierarchies that Facilitate Self-Organization. 111-

Parallel and Network Computing

• 
  Allan K. Y. Wong, May T. W. Ip, Tharam S. Dillon: M3RT: An Internet End-to-End Performance Measurement Approach for Real-time Applications with Mobile Agents. 119-124
• 
  Rafael P. Saldaña, Winfer C. Tabares, William Emmanuel S. Yu: Parallel Implementations of Cellular Automata Algorithms on the AGILA High Performance Computing System. 125-132
• 
  Daniel G. Pamintuan Ii, Eliezer A. Albacea: File Replication and Distribution System for Low Bandwidth Networks. 133-

Keynote Address II

• 
  Lenwood S. Heath: Networks in Bioinformatics. 141-

Routing, Sorting and Clustering

• 
  Jacir Luiz Bordim, Koji Nakano, Hong Shen: Sorting on Single-Channel Wireless Sensor Networks. 153-158
• 
  Putchong Uthayopas, Thara Angskun, Jullawadee Maneesilp: On the Building of the Next Generation Integrated Environment for Beowulf Clusters. 159-164
• 
  Yamin Li, Shietung Peng, Wanming Chu: Efficient Communication in Metacube: A New Interconnection Network. 165-

Interconnection Networks I

• 
  Marissa P. Justan, Felix P. Muga II, Ivan Hal Sudborough: On the Generalization of the Pancake Network. 173-178
• 
  Chun-Nan Hung, Kao-Yung Liang, Lih-Hsing Hsu: Embedding Hamiltonian Paths and Hamiltonian Cycles in Faulty Pancake Graphs. 179-184
• 
  Ke Qiu, Sajal K. Das: Interconnection Networks and Their Eigenvalues. 185-

Routing and Scheduling

• 
  Andrzej M. Goscinski, Phillip Jeffers, Jackie Silcock: Data Collection for Global Scheduling in the GENESIS System. 193-198
• 
  Sunghyun Jee, Kannappan Palaniappan: Compiler Processor Tradeoffs for DISVLIW Architecture. 199-204
• 
  Wee-Chong Oon, Andrew Lim: Multi-Player Game Approach to Scheduling Problems. 205-

Interconnection Networks II

• 
  Christopher M. Lagman, Pierre U. Tagle: Aggressive Transmission in the Interconnected Parallel Banyan Network. 213-218
• 
  Douglas W. Bass, Ivan Hal Sudborough: Symmetric k-Factorizations of Hypercubes with Factors of Small Diameter. 219-224
• 
  Jaime D. L. Caro, Tedros Weldemicael Zeratsion: On the Diameter of a Class of the Generalized de Bruijn Graphs. 225-

Compilers

• 
  Cheng-Wei Chen, Chung-Kai Chen, Jenq Kuen Lee: Building Ontology for Optimization and Composition of Parallel JavaBean Programs. 233-238
• 
  Chi-Leung Wong, Zehra Sura, David A. Padua, Xing Fang, Jaejin Lee, Samuel P. Midkiff: The Pensieve Project: A Compiler Infrastructure for Memory Models. 239-244
• 
  Peiyi Tang, Pen-Chung Yew: Interprocedural Induction Variable Analysis. 245-250
• 
  Tong Chen, Jin Lin, Wei-Chung Hsu, Pen-Chung Yew: On the Impact of Naming Methods for Heap-Oriented Pointers in C Programs. 251-

Architecture and Systems

• 
  Simon See: A Distributed Simulation Management Engine for Ordinary Differential Equations. 259-268
• 
  Kei Hiraki, Mary Inaba, Junji Tamatsukuri, Ryutaro Kurusu, Yukichi Ikuta, Hisashi Koga, Akira Zinzaki: Data Reservoir: A New Approach to Data-Intensive Scientific Computation. 269-274
• 
  Tao Liu, Qiuyang Li, Yulu Yang: Advanced Baseline: A New MIN with Fault-Tolerance Characteristic. 275-280
• 
  Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough: Fixed Layer Embeddings of Binary Trees. 281-

Routing Algorithms I

• 
  Akiya Jouraku, Michihiro Koibuchi, Hideharu Amano, Akira Funahashi: Routing Algorithms Based on 2D Turn Model for Irregular Networks. 289-294
• 
  Weijia Jia, Pui-on Au, Yong He, Wanlei Zhou: Optimal Multicast Tree Routing for Cluster Computing in Hypercube Interconnection Networks. 295-300
• 
  Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen: Fault-Tolerant Routing on the Star Graph with Safety Vectors. 301-

Data Base and Data Mining II

• 
  J. Wenny Rahayu, David Taniar: Parallel Selection Query Processing Involving Index in Parallel Database Systems. 309-314
• 
  Cheng-Fa Tsai, Han-Chang Wu, Chun-Wei Tsai: A New Data Clustering Approach for Data Mining in Large Databases. 315-320
• 
  Ling Tan, David Taniar, Kate A. Smith: A New Parallel Genetic Algorithm. 321-

Routing Algorithms II

• 
  C. W. Lam, Francis C. M. Lau: Fault-Tolerant Routing Algorithms for Unidirectional Networks. 329-334
• 
  Tzu-Lun Huang, D. T. Lee: A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks. 335-340
• 
  Xiaohong Jiang, Hong Shen, Md. Mamun-ur-Rashid Khandker, Susumu Horiguchi: A New Scheme to Realize Crosstalk-free Permutations in Optical MINs with Vertical Stacking. 341-

Sorting and Routing

• 
  Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough: Block Sorting is Hard. 349-354
• 
  Nasir Shaikh-Husin, Mohamed Khalil Hani, Teoh Giap Seng: Implementation of Recurrent Neural Network Algorithm for Shortest Path Calculation in Network Routing. 355-360
• 
  Sasthi C. Ghosh, Bhabani P. Sinha, Nabanita Das: An Efficient Channel Assignment Technique for Hexagonal Cellular Networks. 361-366

last updated on Mon May 20 02:22:09 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page