6110 search results - page 149 / 1222 » Approximate Computing |
295
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
239
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
202
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
162
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
180
click to vote
ISIPTA
2005
IEEE
16 years 13 hour ago
2005
IEEE
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...