Sciweavers

524 search results - page 29 / 105
» On the Performance of Clustering in Hilbert Spaces
Sort
View
81
Voted
ICMCS
2005
IEEE
120views Multimedia» more  ICMCS 2005»
15 years 3 months ago
KPYR: An Efficient Indexing Method
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
Thierry Urruty, Fatima Belkouch, Chabane Djeraba
IPPS
1998
IEEE
15 years 2 months ago
Migration and Rollback Transparency for Arbitrary Distributed Applications in Workstation Clusters
Programmers and users of compute intensive scientific applications often do not want to (or even cannot) code load balancing and fault tolerance into their programs. The PBEAM syst...
Stefan Petri, Matthias Bolz, Horst Langendörf...
72
Voted
CVPR
2006
IEEE
16 years 6 days ago
Automatic Cast Listing in Feature-Length Films with Anisotropic Manifold Space
Our goal is to automatically determine the cast of a feature-length film. This is challenging because the cast size is not known, with appearance changes of faces caused by extrin...
Ognjen Arandjelovic, Roberto Cipolla
ICML
2005
IEEE
15 years 11 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
92
Voted
NN
2008
Springer
146views Neural Networks» more  NN 2008»
14 years 9 months ago
Clustering and co-evolution to construct neural network ensembles: An experimental study
This paper introduces an approach called Clustering and Co-evolution to Construct Neural Network Ensembles (CONE). This approach creates neural network ensembles in an innovative ...
Fernanda L. Minku, Teresa Bernarda Ludermir