Computing and combinatorics : 4th annual international conference, COCOON ’98, Taipei, Taiwan, R.o.C., August 12-14, 1998 : proceedings

Computing and Combinatorics: 4th Annual International Conference COCOON’98 Taipei, Taiwan, R.o.C., August 12–14, 1998 Proceedings
Author: Wen-Lian Hsu, Ming-Yang Kao
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-64824-6
DOI: 10.1007/3-540-68535-9

Table of Contents:

• Algorithmic Approaches to Information Retrieval and Data Mining
• Combinatorial Problems Arising in Massive Data Sets
• Estimating Parameters of Monotone Boolean Functions
• De-amortization of Algorithms
• On Computing New Classes of Optimal Triangulations with Angular Constraints
• Maximum Weight Triangulation and Its Application on Graph Drawing
• The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
• Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space
• Parallel Geometric Algorithms in Coarse-Grain Network Models
• On the Bahncard Problem
• The Ultimate Strategy to Search on m Rays?
• Better Approximation of Diagonal-Flip Transformation and Rotation Transformation
• A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations
• Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT
• Algorithms for Almost-Uniform Generation with an Unbiased Binary Source
• Improved Algorithms for Chemical Threshold Testing Problems
• Min-Max-Boundary Domain Decomposition
• On Boolean Lowness and Boolean Highness
• The Inherent Dimension of Bounded Counting Classes
• An Exact Characterization of Symmetric Functions in q

Includes bibliographical references and index