Sciweavers

354 search results - page 22 / 71
» Recovery Rate of Clustering Algorithms
Sort
View
171
Voted
ICASSP
2008
IEEE
15 years 9 months ago
Unsupervised optimal phoneme segmentation: Objectives, algorithm and comparisons
Phoneme segmentation is a fundamental problem in many speech recognition and synthesis studies. Unsupervised phoneme segmentation assumes no knowledge on linguistic contents and a...
Yu Qiao, Naoya Shimomura, Nobuaki Minematsu
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 3 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
MLMI
2005
Springer
15 years 8 months ago
The TNO Speaker Diarization System for NIST RT05s Meeting Data
The TNO speaker speaker diarization system is based on a standard BIC segmentation and clustering algorithm. Since for the NIST Rich Transcription speaker dizarization evaluation m...
David van Leeuwen
ISCIS
2003
Springer
15 years 8 months ago
A Solution to the Composition Problem in Object-Based Video Coding
Abstract. In this paper, we introduce the composition problem associated with object-based video coding and propose a solution to this problem. Although the object-based rate contr...
Jeong-Woo Lee, Yo-Sung Ho
117
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Estimating Sparse MIMO channels having Common Support
We propose an algorithm (SCS-FRI) to estimate multipath channels with Sparse Common Support (SCS) based on Finite Rate of Innovation (FRI) sampling. In this setup, theoretical low...
Yann Barbotin, Ali Hormati, Sundeep Rangan, Martin...