5183 search results - page 399 / 1037 » The Complexity of Distributions |
208
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
212
click to vote
SSPR
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. In surveillance systems for monitoring people behaviour, it is imporant to build systems that can adapt to the signatures of the people tasks and movements in the environ...
178
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
209
click to vote
MBEES
2007
15 years 8 months ago
2007
: The development of embedded systems is a challenging task because of the distributed, reactive and real-time nature of such systems. Distribution of embedded components across bu...
186
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...