438 search results - page 64 / 88 » A Theory of Competitive Analysis for Distributed Algorithms |
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
IPSN
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
SIGECOM
2003
ACM
14 years 20 days ago
2003
ACM
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
MM
2009
ACM
14 years 1 months ago
2009
ACM
We propose a novel technique for semi-supervised image annotation which introduces a harmonic regularizer based on the graph Laplacian of the data into the probabilistic semantic ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Tournament selection has been widely used and studied in evolutionary algorithms. To supplement the study of tournament selection, this paper provides several models describing th...