Sciweavers

12825 search results - page 221 / 2565
» Improved PLSOM algorithm
Sort
View
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 8 months ago
Improved results for directed multicut
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of Ã...
Anupam Gupta
APNOMS
2006
Springer
15 years 10 months ago
Improving Handoff Performance by Using Distance-Based Dynamic Hysteresis Value
Abstract. In this study, an adaptive handoff algorithm with a dynamic hysteresis value, based on the distance between the mobile station and the serving base station, is proposed f...
Huamin Zhu, Kyung Sup Kwak
ICASSP
2010
IEEE
15 years 6 months ago
Multiple Selection Approximation for improved spatio-temporal prediction in video coding
In this contribution, a novel spatio-temporal prediction algorithm for video coding is introduced. This algorithm exploits temporal as well as spatial redundancies for effectively...
Jürgen Seiler, André Kaup
ANTS
2004
Springer
149views Algorithms» more  ANTS 2004»
16 years 3 days ago
A Binary Recursive Gcd Algorithm
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
Damien Stehlé, Paul Zimmermann
AAAI
1996
15 years 8 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter