906 search results - page 10 / 182 » Chain Dominated Orders |
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM-based) wireless downlink systems. We show that the Server-Side Greedy (SSG) rul...
APPML
2008
14 years 12 months ago
2008
Let G = (V, E) be a simple graph. A set D V is a dominating set of G if every vertex of V - D is adjacent to a vertex of D. The domination number of G, denoted by (G), is the min...
107
click to vote
JCT
2006
14 years 11 months ago
2006
A k-majority tournament T on a finite vertex set V is defined by a set of 2k - 1 linear orderings of V, with u v if and only if u lies above v in at least k of the orders. Motiva...
115
Voted
RECOMB
1999
Springer
15 years 4 months ago
1999
Springer
We consider the problem of identifying common three-dimensional substructures between proteins. Our method is based on comparing the shape of the α-carbon backbone structures of ...
78
Voted
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We investigate the relation between the theory of the iterations in the sense of Shelah-Stupp and of Muchnik, resp., and the theory of the base structure for several logics. These ...