Sciweavers

2192 search results - page 52 / 439
» Algorithms for Challenging Motif Problems
Sort
View
IJCNN
2008
IEEE
14 years 2 months ago
Building meta-learning algorithms basing on search controlled by machine complexity
Abstract— Meta-learning helps us find solutions to computational intelligence (CI) challenges in automated way. Metalearning algorithm presented in this paper is universal and m...
Norbert Jankowski, Krzysztof Grabczewski
ICPR
2000
IEEE
14 years 14 days ago
Scaling-Up Support Vector Machines Using Boosting Algorithm
In the recent years support vector machines (SVMs) have been successfully applied to solve a large number of classification problems. Training an SVM, usually posed as a quadrati...
Dmitry Pavlov, Jianchang Mao, Byron Dom
ICPR
2008
IEEE
14 years 2 months ago
A new algorithm for static camera foreground segmentation via active coutours and GMM
Foreground segmentation is one of the most challenging problems in computer vision. In this paper, we propose a new algorithm for static camera foreground segmentation. It combine...
Chengkai Wan, Baozong Yuan, Zhenjiang Miao
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
13 years 10 months ago
A Robust Seedless Algorithm for Correlation Clustering
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
Mohammad S. Aziz, Chandan K. Reddy
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 8 months ago
Adversary lower bounds for nonadaptive quantum algorithms
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
Pascal Koiran, Jürgen Landes, Natacha Portier...