scientific article; zbMATH DE number 3907805

MaRDI QIDQ3685231zbMATH OpenFDO

Authors

Publication date 1980

zbMATH Keywords

ConferenceProceedingsPattern recognitionIEEEMiami Beach/Florida

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(20)

• Sphere of influence graphs and the \(L_{\infty}\)-metric
• A linear time algorithm for computing the convex hull of an ordered crossing polygon
• Sphere of influence graphs: Edge density and clique size
• Finding a largest rectangle inside a digital object and rectangularization
• The Hamiltonian connectivity of rectangular supergrid graphs
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
• On using prototype reduction schemes to enhance the computation of volume-based inter-class overlap measures
• Recognition of spatial point patterns
• Optimal reference subset selection for nearest neighbor classification by tabu search
• Hamiltonian cycles in linear-convex supergrid graphs
• Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
• The Hamiltonian properties of supergrid graphs
• Implicit moment particle simulation of plasmas
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space
• Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms
• An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
• Sphere-of-influence graphs using the sup-norm
• A unified approach to pattern recognition
• Abstract sphere-of-influence graphs
• Sphere of influence graphs in general metric spaces

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685231)