Titlebook: Algorithms and Data Structures; 5th International Wo Frank Dehne,Andrew Rau-Chaplin,Roberto Tamassia Conference proceedings 1997 Springer-V

恫嚇

On-line load balancing for related machines,e ratio of 3 + √8 ≈ 5.828 for the deterministic version, and 3.31/ln 2.155 ≈ 4.311 for its randomized variant, improving the previous competitive ratios of 8 and 2. ≈ 5.436. We also prove lower bounds of 2.4380 on the competitive ratio of deterministic algorithms and 1.8372 on the competitive ratio of randomized algorithms for this problem.

crease

Checking the convexity of polytopes and the planarity of subdivisions (extended abstract), dimensions, and for various types of planar subdivisions, such as triangulations, Delaunay triangulations, and convex subdivisions. Our checkers are simpler and more general than the ones previously described in the literature. Their performance is studied also in terms of the degree, which characterizes the arithmetic precision required.

mediocrity

Voronoi diagrams for polygon-offset distance functions,int sites in the plane. We provide optimal deterministic .(.(log . + log .) + .)-time algorithms, where . is the number of points and . is the complexity of the underlying polygon, for computing compact representations of both diagrams.

tooth-decay

搖曳的微光

詞根詞綴法

Tortuous

Mechanics

amyloid

Biomarker