683 search results - page 63 / 137 » A Fine-grained Analysis of a Simple Independent Set Algorith... |
168
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Cluster analysis is an important technique for the exploratory analysis of biological data. Such data is often high-dimensional, inherently noisy and contains outliers...
115
Voted
ICDAR
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
101
click to vote
OPODIS
2004
15 years 5 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
104
click to vote
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...
ICA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present a set of gradient based orthogonal and nonorthogonal matrix joint diagonalization algorithms. Our approach is to use the geometry of matrix Lie groups to devel...