Sciweavers

6546 search results - page 75 / 1310
» Improving the Performance of the RISE Algorithm
Sort
View
ICA
2007
Springer
14 years 2 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
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
14 years 2 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
USENIX
2001
13 years 10 months ago
Scalable Linux Scheduling
For most of its existence, Linux has been used primarily as a personal desktop operating system. Yet, in recent times, its use as a cost-efficient alternative to commercial operat...
Stephen Molloy, Peter Honeyman
ICPR
2008
IEEE
14 years 3 months ago
Improvement on Mean Shift based tracking using second-order information
Object tracking based on Mean Shift (MS) algorithm has been very successful and thus receives significant research interests. Unfortunately, traditional MS based tracking only ut...
Lijuan Xiao, Peihua Li
ICPP
2007
IEEE
14 years 3 months ago
Improving Static Task Scheduling in Heterogeneous and Homogeneous Computing Systems
In this paper, we present a heuristic algorithm that improves the performance of static task scheduling. Our algorithm is based on the list-scheduling mechanism. For the listing p...
Chih-Hsueh Yang, PeiZong Lee, Yeh-Ching Chung