Sciweavers

5329 search results - page 362 / 1066
» The Weighted Majority Algorithm
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Clustering of bootstrapped acoustic model with full covariance
HMM-based acoustic models built from bootstrap are generally very large, especially when full covariance matrices are used for Gaussians. Therefore, clustering is needed to compac...
Xin Chen, Xiaodong Cui, Jian Xue, Peder Olsen, Joh...
ICCV
2011
IEEE
14 years 6 months ago
Maximizing All Margins: Pushing Face Recognition with Kernel Plurality
We present two theses in this paper: First, performance of most existing face recognition algorithms improves if instead of the whole image, smaller patches are individually class...
Ritwik Kumar, Arunava Banerjee, CISE, Univ, Baba V...
179
Voted
PRL
2007
146views more  PRL 2007»
15 years 6 months ago
Neighbor number, valley seeking and clustering
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
Chaolin Zhang, Xuegong Zhang, Michael Q. Zhang, Ya...
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
16 years 21 days ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
174
Voted
ICPR
2008
IEEE
16 years 1 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang