1091 search results - page 103 / 219 » Approximation Algorithms for Data Placement Problems |
FOCS
2000
IEEE
14 years 9 days ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
SIAMSC
2010
13 years 6 months ago
2010
In numerous applications of image processing, e.g. astronomical and medical imaging, data-noise is well-modeled by a Poisson distribution. This motivates the use of the negative-lo...
PRL
2008
13 years 7 months ago
2008
In this work we propose an approach to binary classification based on an extension of Bayes Point Machines. Particularly, we take into account the whole set of hypotheses that are...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
FAW
2009
Springer
14 years 2 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...