3946 search results - page 540 / 790 » The computational complexity of choice sets |
211
click to vote
TKDE
2008
15 years 6 months ago
2008
In this paper, a new symmetry-based genetic clustering algorithm is proposed which automatically evolves the number of clusters as well as the proper partitioning from a data set. ...
167
click to vote
BIOINFORMATICS
2002
15 years 6 months ago
2002
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
175
click to vote
IPM
2000
15 years 6 months ago
2000
In this paper, a competition-based connectionist model for diagnostic problem-solving is adapted to information retrieval. In this model, we treat documents as \disorders" an...
159
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
386
click to vote
PAMI
2010
15 years 5 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...