Sciweavers

2168 search results - page 187 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
157
Voted
EUROGP
2007
Springer
171views Optimization» more  EUROGP 2007»
15 years 5 months ago
Geometric Particle Swarm Optimisation
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Cecilia Di Chio, Riccardo Poli
99
Voted
COLT
2008
Springer
15 years 5 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
169
Voted
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
15 years 3 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
122
Voted
IJCAI
2007
15 years 5 months ago
Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree
In the past ten years, boosting has become a major field of machine learning and classification. This paper brings contributions to its theory and algorithms. We first unify a ...
Claudia Henry, Richard Nock, Frank Nielsen
128
Voted
EUSFLAT
2007
147views Fuzzy Logic» more  EUSFLAT 2007»
15 years 5 months ago
Various Representations and Algebraic Structure of Linear Imprecision Indices
The paper is devoted to the investigation of imprecision indices, introduced in [7]. They are used for evaluation of uncertainty (or more exactly imprecision), which is contained ...
Alexander E. Lepskiy, Andrey G. Bronevich