779 search results - page 88 / 156 » A graph polynomial for independent sets of bipartite graphs |
JCO
2006
14 years 9 months ago
2006
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
137
click to vote
CORR
2010
Springer
14 years 4 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
JGT
2010
14 years 8 months ago
2010
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper addresses the problem of learning archetypal structural models from examples. To this end we define a generative model for graphs where the distribution of observed nod...