96 search results - page 16 / 20 » Structure and linear time recognition of 3-leaf powers |
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
SIAMDM
2010
14 years 4 months ago
2010
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...
TON
2010
14 years 4 months ago
2010
Abstract-- In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a...
NN
1997
Springer
15 years 1 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
WG
1993
Springer
15 years 1 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...