Sciweavers

53 search results - page 8 / 11
» Regularity Lemmas and Combinatorial Algorithms
Sort
View
CP
2006
Springer
13 years 11 months ago
Revisiting the Sequence Constraint
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
Willem Jan van Hoeve, Gilles Pesant, Louis-Martin ...
PRIB
2009
Springer
209views Bioinformatics» more  PRIB 2009»
14 years 2 months ago
Class Prediction from Disparate Biological Data Sources Using an Iterative Multi-Kernel Algorithm
For many biomedical modelling tasks a number of different types of data may influence predictions made by the model. An established approach to pursuing supervised learning with ...
Yiming Ying, Colin Campbell, Theodoros Damoulas, M...
NCA
2010
IEEE
13 years 6 months ago
Genetic algorithm-based training for semi-supervised SVM
The Support Vector Machine (SVM) is an interesting classifier with excellent power of generalization. In this paper, we consider applying the SVM to semi-supervised learning. We p...
Mathias M. Adankon, Mohamed Cheriet
IJCV
2006
299views more  IJCV 2006»
13 years 7 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 9 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets