Sciweavers

12697 search results - page 100 / 2540
» Call for Papers
Sort
View
AUSDM
2007
Springer
107views Data Mining» more  AUSDM 2007»
16 years 15 days ago
A Discriminant Analysis for Undersampled Data
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...
Matthew Robards, Junbin Gao, Philip Charlton
BIRTHDAY
2004
Springer
15 years 11 months ago
Universal Actability of and with Knowledge: Managing and Communicating Knowledge with Patterns
Managing and communicating information and knowledge with patterns entail a multitude of assumptions, interests, and validity claims. Patterns are socially constructed, and they m...
Fahri Yetim
DM
2006
76views more  DM 2006»
15 years 6 months ago
Lex M versus MCS-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...
Yngve Villanger
PRL
2006
124views more  PRL 2006»
15 years 6 months ago
Parameter selection for suppressed fuzzy c-means with an application to MRI segmentation
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...
Wen-Liang Hung, Miin-Shen Yang, De-Hua Chen
IPPS
1998
IEEE
15 years 10 months ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
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, ...