Titlebook: Computing in the 90‘s; The First Great Lake Naveed A. Sherwani,Elise Doncker,John A. Kapenga Conference proceedings 1991 Springer-Verlag Be

Insul岛

Conference proceedings 1991Science. Typically, research in data structures, algorithms (both parallel and sequential), database and VLSI design. Artificial intelligence has received the most attention. The 1989 proceedings of the Great Lakes Computer Science Conference consists of 64 papers. Artificial Intelligence, with 11 p

不近人情

Jonathan D. Cryer,Kung-Sik Channg on lateral model-based transformative induction methods similar to Quinlan‘s ID3 and Michalski‘s AQ algorithms — except that models are the generalized object(s) rather than simply decision trees or rules.

dapper

脱水

Decrepit

扩音器

斑驳

A cooperative algorithm for the dynamic stereo problem,eneral smoothness of motion criterion using (1) the center of gravity of each object in each monocular view, (2) the sizes of the objects, as well as (3) the stereo disparities between possible matched stereo objects. Experiments using tennis balls shows the algorithm to be very promising.

书法

Computational complexity of geometric symmetry detection in graphs,or general graphs, however, detecting the presence of even a single axial or rotational symmetry is NP-complete. A number of related results are also established, including the #P-completeness of counting the axial or rotational symmetries of a graph.

PAC

headway

Computational complexity of geometric symmetry detection in graphs, much investigation. Displaying symmetry has emerged as one of the foremost criteria for achieving good drawings. Linear-time algorithms are already known for the detection and display of symmetry in trees, outerplanar graphs, and embedded planar graphs. The central results of this paper show that f