Sciweavers

3049 search results - page 114 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
NIPS
2007
15 years 6 months ago
Learning Bounds for Domain Adaptation
Empirical risk minimization offers well-known learning guarantees when training and test data come from the same domain. In the real world, though, we often wish to adapt a classi...
John Blitzer, Koby Crammer, Alex Kulesza, Fernando...
JACM
2011
98views more  JACM 2011»
14 years 11 months ago
Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
Haim Avron, Sivan Toledo
TWC
2008
107views more  TWC 2008»
15 years 4 months ago
A low complexity user scheduling algorithm for uplink multiuser MIMO systems
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...
Yangyang Zhang, Chunlin Ji, Yi Liu, Wasim Q. Malik...
CEE
2005
92views more  CEE 2005»
15 years 4 months ago
An adaptive call admission algorithm for cellular networks
In this paper, we first propose a new continuous action-set learning automaton and theoretically study its convergence properties and show that it converges to the optimal action....
Hamid Beigy, Mohammad Reza Meybodi
COCOA
2009
Springer
15 years 11 months ago
Improved Bounds for Facility Location Games with Fair Cost Allocation
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
Thomas Dueholm Hansen, Orestis Telelis