Sciweavers

230 search results - page 25 / 46
» Testing Closeness of Discrete Distributions
Sort
View
CVPR
2004
IEEE
15 years 12 months ago
A Probabilistic Framework for Combining Tracking Algorithms
For the past few years researches have been investigating enhancing tracking performance by combining several different tracking algorithms. We propose an analytically justified, ...
Ido Leichter, Michael Lindenbaum, Ehud Rivlin
ICML
2006
IEEE
15 years 10 months ago
Combined central and subspace clustering for computer vision applications
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
Le Lu, René Vidal
TPDS
1998
98views more  TPDS 1998»
14 years 9 months ago
A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
Yeh-Ching Chung, Ching-Hsien Hsu, Sheng-Wen Bai
CEC
2009
IEEE
15 years 4 months ago
An orthogonal multi-objective evolutionary algorithm with lower-dimensional crossover
Abstract— This paper proposes an multi-objective evolutionary algorithm. The algorithm is based on OMOEA-II[2]. A new linear breeding operator with lower-dimensional crossover an...
Song Gao, Sanyou Y. Zeng, Bo Xiao, Lei Zhang, Yulo...
ICASSP
2011
IEEE
14 years 1 months ago
Improved F0 modeling and generation in voice conversion
F0 is an acoustic feature that varies largely from one speaker to another. F0 is characterized by a discontinuity in the transition between voiced and unvoiced sounds that present...
Aki Kunikoshi, Yao Qian, Frank K. Soong, Nobuaki M...