3934 search results - page 322 / 787 » A monothetic clustering method |
170
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robust...
236
click to vote
SISAP
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
190
click to vote
EUROCAST
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
177
click to vote
SISAP
2008
IEEE
16 years 1 months ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
175
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
In the general area of high-performance computing, object-oriented methods have gone largely unnoticed. In contrast, the Computational Neighborhood (CN), a framework for parallel ...