Sciweavers

1649 search results - page 65 / 330
» Improved Matrix Interpretation
Sort
View
ICA
2007
Springer
15 years 6 months ago
Two Improved Sparse Decomposition Methods for Blind Source Separation
In underdetermined blind source separation problems, it is common practice to exploit the underlying sparsity of the sources for demixing. In this work, we propose two sparse decom...
B. Vikrham Gowreesunker, Ahmed H. Tewfik
FSTTCS
2000
Springer
15 years 4 months ago
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
Michael R. Fellows, Catherine McCartin, Frances A....
65
Voted
CSDA
2010
105views more  CSDA 2010»
15 years 21 days ago
James-Stein shrinkage to improve k-means cluster analysis
We study a general algorithm to improve accuracy in cluster analysis that employs the James-Stein shrinkage effect in k-means clustering. We shrink the centroids of clusters towar...
Jinxin Gao, David B. Hitchcock
98
Voted
IPL
2011
91views more  IPL 2011»
14 years 7 months ago
A note on improving the performance of approximation algorithms for radiation therapy
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
Therese C. Biedl, Stephane Durocher, Holger H. Hoo...
98
Voted
ICDAR
2009
IEEE
15 years 7 months ago
An Improved Online Tamil Character Recognition Engine Using Post-Processing Methods
We propose script-specific post processing schemes for improving the recognition rate of online Tamil characters. At the first level, features derived at each sample point of the ...
Suresh Sundaram, Angarai Ganesan Ramakrishnan