Sciweavers

5115 search results - page 257 / 1023
» On Randomized Lanczos Algorithms
Sort
View
JPDC
2010
65views more  JPDC 2010»
15 years 5 months ago
Combining shared-coin algorithms
This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Brac...
James Aspnes, Hagit Attiya, Keren Censor
CISS
2008
IEEE
16 years 1 months ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah
INFOCOM
2007
IEEE
16 years 1 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
EVOW
2007
Springer
16 years 1 months ago
Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems
Abstract. Addressing dynamic optimization problems has been a challenging task for the genetic algorithm community. Over the years, several approaches have been developed into gene...
Shengxiang Yang
ISCAS
2006
IEEE
96views Hardware» more  ISCAS 2006»
16 years 1 months ago
On the initialization of the DNMF algorithm
— A subspace supervised learning algorithm named Discriminant Non-negative Matrix Factorization (DNMF) has been recently proposed for classifying human facial expressions. It dec...
Ioan Buciu, Nikos Nikolaidis, Ioannis Pitas