Sciweavers

7930 search results - page 551 / 1586
» Greedy in Approximation Algorithms
Sort
View
PAMI
2011
15 years 2 months ago
Semi-Supervised Learning via Regularized Boosting Working on Multiple Semi-Supervised Assumptions
—Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learni...
Ke Chen, Shihai Wang
ICML
2003
IEEE
16 years 7 months ago
Link-based Classification
Over the past few years, a number of approximate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algori...
Qing Lu, Lise Getoor
ICC
2007
IEEE
116views Communications» more  ICC 2007»
16 years 1 months ago
A Simple Iterative Gaussian Detector for Severely Delay-Spread MIMO Channels
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...
Tianbin Wo, Peter Adam Hoeher
SPIRE
2005
Springer
16 years 16 days ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
15 years 10 months ago
An efficient multi-objective evolutionary algorithm with steady-state replacement model
The generic Multi-objective Evolutionary Algorithm (MOEA) aims to produce Pareto-front approximations with good convergence and diversity property. To achieve convergence, most mu...
Dipti Srinivasan, Lily Rachmawati