1545 search results - page 200 / 309 » On tree congestion of graphs |
102
click to vote
MMNS
2004
14 years 11 months ago
2004
Existing multicast traffic engineering (TE) solutions tend to use explicit routing through MPLS tunnels. In this paper we shift away from this overlay approach and address the band...
ECCC
2007
14 years 10 months ago
2007
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
DCC
2002
IEEE
15 years 9 months ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...