Sciweavers

448 search results - page 77 / 90
» Fast Approximation Algorithms for Multicommodity Flow Proble...
Sort
View
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 12 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
ICMCS
2006
IEEE
107views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Rain Removal in Video by Combining Temporal and Chromatic Properties
Removal of rain streaks in video is a challenging problem due to the random spatial distribution and fast motion of rain. This paper presents a new rain removal algorithm that inc...
Xiaopeng Zhang, Hao Li, Yingyi Qi, Wee Kheng Leow,...
CDC
2009
IEEE
159views Control Systems» more  CDC 2009»
14 years 8 days ago
A distributed machine learning framework
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...
Tansu Alpcan, Christian Bauckhage
DAS
2006
Springer
13 years 11 months ago
Combining Multiple Classifiers for Faster Optical Character Recognition
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...
Kumar Chellapilla, Michael Shilman, Patrice Simard
EUROPAR
2008
Springer
13 years 9 months ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler