Sciweavers

1089 search results - page 139 / 218
» Bounds on generalized Frobenius numbers
Sort
View
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 10 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
GECCO
2008
Springer
161views Optimization» more  GECCO 2008»
13 years 10 months ago
An evolutionary design technique for collective communications on optimal diameter-degree networks
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
Jirí Jaros, Vaclav Dvorak
ICASSP
2010
IEEE
13 years 9 months ago
Distributed bearing estimation via matrix completion
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
Andrew Waters, Volkan Cevher
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 9 months ago
A Spectral Algorithm for Learning Hidden Markov Models
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
Daniel Hsu, Sham M. Kakade, Tong Zhang
DM
2008
72views more  DM 2008»
13 years 9 months ago
(p, 1)-Total labelling of graphs
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
Frédéric Havet, Min-Li Yu