2698 search results - page 142 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
161
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
144
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
169
click to vote
TNN
1998
15 years 6 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
185
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...