Sciweavers

7215 search results - page 257 / 1443
» On the Consistency of Ranking Algorithms
Sort
View
ICIP
2006
IEEE
14 years 10 months ago
An Efficient Method for the Removal of Impulse Noise
A computationally efficient algorithm is proposed to remove noise impulses from speech and audio signals while retaining its features and tonal quality. The proposed method is bas...
Wenbin Luo, Dung Dang
ICML
2005
IEEE
14 years 9 months ago
Predictive low-rank decomposition for kernel methods
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
Francis R. Bach, Michael I. Jordan
EMNLP
2007
13 years 9 months ago
Mandarin Part-of-Speech Tagging and Discriminative Reranking
We present in this paper methods to improve HMM-based part-of-speech (POS) tagging of Mandarin. We model the emission probability of an unknown word using all the characters in th...
Zhongqiang Huang, Mary P. Harper, Wen Wang
IPCO
2001
95views Optimization» more  IPCO 2001»
13 years 9 months ago
Bisubmodular Function Minimization
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to ...
Satoru Fujishige, Satoru Iwata
NA
2008
203views more  NA 2008»
13 years 8 months ago
Block Krylov-Schur method for large symmetric eigenvalue problems
Stewart's Krylov-Schur algorithm offers two advantages over Sorensen's implicitly restarted Arnoldi (IRA) algorithm. The first is ease of deflation of converged Ritz vect...
Yunkai Zhou, Yousef Saad