96 search results - page 16 / 20 » Structure and linear time recognition of 3-leaf powers |
146
click to vote
INFOCOM
2006
IEEE
15 years 11 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...
178
click to vote
SIAMDM
2010
15 years 15 days 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)...
148
click to vote
TON
2010
15 years 14 days 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...
153
click to vote
NN
1997
Springer
15 years 10 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...
170
click to vote
WG
1993
Springer
15 years 9 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...