383 search results - page 45 / 77 » A Bound on the Total Chromatic Number |
GLOBECOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
COCO
2010
Springer
14 years 2 months ago
2010
Springer
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
TWC
2008
13 years 10 months ago
2008
Optimal power scheduling for distributed detection in a Gaussian sensor network is addressed for both independent and correlated observations. We assume amplify-and-forward local p...
INFOCOM
2009
IEEE
14 years 5 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
COLT
1992
Springer
14 years 2 months ago
1992
Springer
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...