1632 search results - page 39 / 327 » Sublinear Time Algorithms for Metric Space Problems |
115
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
105
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
127
click to vote
CAV
2008
Springer
15 years 5 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
109
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
120
click to vote
VLDB
1997
ACM
15 years 7 months ago
1997
ACM
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...