Sciweavers

1787 search results - page 170 / 358
» classification 2006
Sort
View
ESANN
2006
15 years 5 months ago
Designing neural network committees by combining boosting ensembles
The use of modified Real Adaboost ensembles by applying weighted emphasis on erroneous and critical (near the classification boundary) has been shown to lead to improved designs, ...
Vanessa Gómez-Verdejo, Aníbal R. Fig...
CI
2006
69views more  CI 2006»
15 years 4 months ago
The Importance of Neutral Examples for Learning Sentiment
Most research on learning to identify sentiment ignores "neutral" examples, learning only from examples of significant (positive or negative) polarity. We show that it i...
Moshe Koppel, Jonathan Schler
COMPUTING
2006
162views more  COMPUTING 2006»
15 years 4 months ago
Numerical Cubature on Scattered Data by Radial Basis Functions
We study cubature formulas on relatively small scattered samples in the unit square, obtained by integrating radial basis function (RBF) interpolants. Numerical tests show that, d...
Alvise Sommariva, Marco Vianello
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 4 months ago
Longest Common Pattern between two Permutations
In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm...
Dominique Rossin, Mathilde Bouvel
DAM
2006
100views more  DAM 2006»
15 years 4 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling