534 search results - page 82 / 107 » Tight approximation algorithm for connectivity augmentation ... |
146
click to vote
INFOCOM
2010
IEEE
15 years 14 days ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
136
Voted
COMCOM
2004
15 years 2 months ago
2004
In multihop wavelength division multiplexing systems, a connection between two communication nodes consists of one or more lightpaths. A wavelength conversion is required at the j...
110
Voted
UAI
2004
15 years 3 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
125
Voted
COLT
2007
Springer
15 years 8 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
115
Voted
SIAMDM
2008
15 years 2 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...