137 search results - page 20 / 28 » Parameterized approximation of dominating set problems |
128
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This work addresses the problem of deciding whether a set of realizations of a vector-valued time series with unknown temporal correlation are spatially correlated or not. Speciļ¬...
143
Voted
ICDCS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
103
Voted
IJCAI
2007
15 years 5 months ago
2007
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difļ¬cult in practical multi-attribute settings. In this...
128
Voted
NIPS
2007
15 years 5 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random ļ¬eld (i.e. a random ļ¬eld deļ¬ned using a ļ¬nite and discrete set of labels) is known ...
179
Voted
EC
2011
14 years 10 months ago
2011
AbstractāIn the ļ¬eld of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...