Titlebook: Computing and Combinatorics; 4th Annual Internati Wen-Lian Hsu,Ming-Yang Kao Conference proceedings 1998 Springer-Verlag Berlin Heidelberg

放縱

On Computing New Classes of Optimal Triangulations with Angular Constraintsh object is to compute the minimum weight triangulation. The weight of a triangulation is defined to be the sum of the Euclidean lengths of the edges in the triangulation. Despite the intensive study made during the lase two decades, it remains unknown that whether the minimum weight triangulation p

拘留

A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulationsomputes the force field in .(log .) time using an . processor CREWPR AM. A key to this optimal parallel algorithm is replacing a recursive top-down force calculation procedure of Appel by an equivalent non-recursive bottom-up procedure. Our parallel algorithm also yields a new .(.) time sequential a

periodontitis

APEX

prediabetes

Min-Max-Boundary Domain Decompositionvertices and the number of edges connecting .. with the other subgraphs is .((|.|/.).). Our algorithm can find such a partition in .(|.| log .) time. Finally, we extend our results to vertex-weighted and vertex-based graph decomposition. Our results can be used to simultaneously balance the computat

motor-unit

accessory

The Inherent Dimension of Bounded Counting Classes≤ 2 we can completely solve the questions, whether a given class has inherent dimension ., and which are the minimal classes with that dimension. For . ≥ 3 we give a sufficient condition for a class being of dimension at least .. We disprove the conjecture that this is also a necessary condition by

有其法作用

MILL

Computing and Combinatorics978-3-540-68535-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

藐視