One of the inherent problems in pattern recognition is the undersampled data problem, also known as the curse of dimensionality reduction. In this paper a new algorithm called pai...
Managing and communicating information and knowledge with patterns entail a multitude of assumptions, interests, and validity claims. Patterns are socially constructed, and they m...
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
This paper presents an algorithm, called the modified suppressed fuzzy c-means (MS-FCM), that simultaneously performs clustering and parameter selection for the suppressed fuzzy c...
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...