Sciweavers

12825 search results - page 54 / 2565
» Improved PLSOM algorithm
Sort
View
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
MFCS
2009
Springer
14 years 1 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
CEC
2007
IEEE
14 years 3 months ago
Improving generalization capability of neural networks based on simulated annealing
— This paper presents a single-objective and a multiobjective stochastic optimization algorithms for global training of neural networks based on simulated annealing. The algorith...
Yeejin Lee, Jong-Seok Lee, Sun-Young Lee, Cheol Ho...
KDD
2003
ACM
162views Data Mining» more  KDD 2003»
14 years 9 months ago
Improving spatial locality of programs via data mining
In most computer systems, page fault rate is currently minimized by generic page replacement algorithms which try to model the temporal locality inherent in programs. In this pape...
Karlton Sequeira, Mohammed Javeed Zaki, Boleslaw K...
ANCS
2005
ACM
14 years 2 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan