814 search results - page 140 / 163 » Optimal pairings |
COMBINATORICS
1999
13 years 9 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
WEBI
2010
Springer
13 years 7 months ago
2010
Springer
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
INFOCOM
2012
IEEE
12 years 9 days ago
2012
IEEE
Abstract—Opportunistic wireless channel access by nonlicensed users has emerged as a promising solution for addressing the bandwidth scarcity challenge. Auctions represent a natu...
CVPR
2003
IEEE
14 years 12 months ago
2003
IEEE
This paper studies the problem of combining region and boundary cues for natural image segmentation. We employ a large database of manually segmented images in order to learn an o...