5595 search results - page 327 / 1119 » Approximation Algorithms for Clustering Problems |
222
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
166
click to vote
ICTCS
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
180
click to vote
GI
2008
Springer
15 years 7 months ago
2008
Springer
: This paper investigates organization problems of large wireless sensor networks. In spite of their random deployment, nodes have to organize themselves as energy efficient as pos...
161
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
d Abstract] Shai Halevi Robert Krauthgamer Eyal Kushilevitz Kobbi Nissim ? The notion of private approximation was introduced recently by Feigenbaum, Fong, Strauss and Wright. Inf...
184
click to vote
TEC
2002
15 years 6 months ago
2002
It is not unusual that an approximate model is needed for fitness evaluation in evolutionary computation. In this case, the convergence properties of the evolutionary algorithm are...