Sciweavers

1206 search results - page 93 / 242
» Convergence analysis of online algorithms
Sort
View
ICC
2007
IEEE
143views Communications» more  ICC 2007»
15 years 4 months ago
A Stochastic Framework for Scheduling in Wireless Packet Access Networks
— We put forth a unified framework for downlink and uplink scheduling of multiple connections with diverse qualityof-service requirements, where each connection transmits using ...
Xin Wang, Georgios B. Giannakis
BMVC
2010
14 years 7 months ago
Large-scale Dictionary Learning For Local Coordinate Coding
Local coordinate coding has recently been introduced to learning visual feature dictionary and achieved top level performance for object recognition. However, the computational co...
Bo Xie, Mingli Song, Dacheng Tao
MOC
2002
78views more  MOC 2002»
14 years 9 months ago
A geometric theory for preconditioned inverse iteration applied to a subspace
ABSTRACT. The aim of this paper is to provide a convergence analysis for a preconditioned subspace iteration, which is designated to determine a modest number of the smallest eigen...
Klaus Neymeyr
SIAMJO
2010
92views more  SIAMJO 2010»
14 years 4 months ago
Inexact Proximal Point Methods for Variational Inequality Problems
We present a new family of proximal point methods for solving monotone variational inequalities. Our algorithm has a relative error tolerance criterion in solving the proximal subp...
Regina Sandra Burachik, Joydeep Dutta
COR
2008
122views more  COR 2008»
14 years 10 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr