3049 search results - page 108 / 610 » On the Convergence of Bound Optimization Algorithms |
172
Voted
WIOPT
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
170
click to vote
IJON
2006
15 years 4 months ago
2006
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
137
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
160
click to vote
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
139
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic ...