Sciweavers

524 search results - page 13 / 105
» On the Performance of Clustering in Hilbert Spaces
Sort
View
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
15 years 10 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
15 years 2 months ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
JCP
2008
167views more  JCP 2008»
14 years 10 months ago
Accelerated Kernel CCA plus SVDD: A Three-stage Process for Improving Face Recognition
kernel canonical correlation analysis (KCCA) is a recently addressed supervised machine learning methods, which shows to be a powerful approach of extracting nonlinear features for...
Ming Li, Yuanhong Hao
77
Voted
BMCBI
2006
117views more  BMCBI 2006»
14 years 10 months ago
The Cluster Variation Method for Efficient Linkage Analysis on Extended Pedigrees
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
Cornelis A. Albers, Martijn A. R. Leisink, Hilbert...
CATA
2003
14 years 11 months ago
A Task Migration Scheme for High Performance Real-Time Cluster System
In a real-time system, it is attractive to use cluster computing system for realizing high performance and high availability. The objectives of the real-time clusters are maximize...
Makoto Suzuki, Hidenori Kobayashi, Nobuyuki Yamasa...