63 search results - page 2 / 13 » Deterministic algorithms for sampling count data |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
PODS
2012
ACM
11 years 7 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
BMVC
2010
13 years 2 months ago
2010
RANSAC (Random Sample Consensus) is a popular and effective technique for estimating model parameters in the presence of outliers. Efficient algorithms are necessary for both fram...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present and evaluate GPU Bucket Sort, a parallel deterministic sample sort algorithm for many-core GPUs. Our method is considerably faster than Thrust Merge (Satish et.al., Pro...