430 search results - page 43 / 86 » A New Linearizing Restriction in the Pattern Matching Proble... |
KDD
2000
ACM
13 years 11 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
CPM
2010
Springer
14 years 22 days ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
PRL
2002
13 years 7 months ago
2002
Pattern detection problems require a separation between two classes, Target and Clutter, where the probability of the former is substantially smaller compared to that of the latte...
IJON
2000
2000
Synthesis approach for bidirectional associative memories based on the perceptron training algorithm
13 years 7 months ago
Bidirectional associative memories are being used extensively for solving a variety of problems related to pattern recognition. In the present paper, a new synthesis approach is d...