Sciweavers

71228 search results - page 182 / 14246
» Algorithms
Sort
View
COCOON
2009
Springer
15 years 8 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura
ICHIT
2009
Springer
15 years 8 months ago
A new stereo matching algorithm for binocular vision
The stereo matching algorithms for binocular vision are very popular and widely applied. However, the algorithms may have lower matching quality or higher time complexity. To impr...
Tao Hu, May Huang
FOCS
2008
IEEE
15 years 8 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
ICASSP
2008
IEEE
15 years 8 months ago
Frequency domain selective tap adaptive algorithms for sparse system identification
We propose a new low complexity and fast converging frequencydomain adaptive algorithm for sparse system identification. This is achieved by exploiting the MMax and SP tap-select...
Andy W. H. Khong, Xiang Lin, Milos Doroslovacki, P...
ICASSP
2008
IEEE
15 years 8 months ago
Avoiding divergence in the constant modulus algorithm
One of the most popular algorithms for blind equalization is the Constant Modulus Algorithm (CMA), due to its simplicity and low computational cost. However, if the step-size is n...
Maria D. Miranda, M. T. M. Silva, Vitor H. Nascime...
« Prev « First page 182 / 14246 Last » Next »