836 search results - page 121 / 168 » Orthogonal Colorings of Graphs |
128
click to vote
ICC
2009
IEEE
15 years 8 months ago
2009
IEEE
A graph-based framework for dynamic fractional frequency reuse (FFR) in multi-cell OFDMA networks is proposed in this work. FFR is a promising resource allocation technique that c...
109
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
123
Voted
GLOBECOM
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
144
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
120
Voted
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...