Sciweavers

1285 search results - page 75 / 257
» On the Complexity of Ordinal Clustering
Sort
View
PKDD
2004
Springer
277views Data Mining» more  PKDD 2004»
14 years 2 months ago
Scalable Density-Based Distributed Clustering
Clustering has become an increasingly important task in analysing huge amounts of data. Traditional applications require that all data has to be located at the site where it is scr...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle
ICIP
2002
IEEE
14 years 10 months ago
Boosting face recognition on a large-scale database
Performance of many state-of-the-art face recognition (FR) methods deteriorates rapidly, when large in size databases are considered. In this paper, we propose a novel clustering ...
Juwei Lu, Konstantinos N. Plataniotis
EDBT
2006
ACM
116views Database» more  EDBT 2006»
14 years 9 months ago
VICO: Visualizing Connected Object Orderings
In modern databases, complex objects like multimedia data, proteins or text objects can be modeled in a variety of representations and can be decomposed into multiple instances of ...
Stefan Brecheisen, Hans-Peter Kriegel, Matthias Sc...
GLOBECOM
2006
IEEE
14 years 3 months ago
Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
Bo Han, Weijia Jia
CCGRID
2005
IEEE
14 years 2 months ago
Network performance variability in NOW clusters
Performance management of clusters and Grids poses many challenges. Sharing large distributed sets of resources can provide efficiencies, but it also introduces complexity in ter...
Jeffrey J. Evans, Cynthia S. Hood