Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Lund, Carsten"'
In computing, as in many aspects of life, changes incur cost. Many optimization problems are formulated as a one-time instance starting from scratch. However, a common case that arises is when we already have a set of prior assignments, and must deci
Externí odkaz:
http://arxiv.org/abs/1302.2137
From a high volume stream of weighted items, we want to maintain a generic sample of a certain limited size $k$ that we can later use to estimate the total weight of arbitrary subsets. This is the classic context of on-line reservoir sampling, thinki
Externí odkaz:
http://arxiv.org/abs/0803.0473
Starting with a set of weighted items, we want to create a generic sample of a certain size that we can later use to estimate the total weight of arbitrary subsets. For this purpose, we propose priority sampling which tested on Internet data performe
Externí odkaz:
http://arxiv.org/abs/cs/0509026
Publikováno v:
Proceedings of the VLDB Endowment; 20240101, Issue: Preprints p431-442, 12p
Autor:
Duffield, Nick1 duffield@research.att.com, Lund, Carsten1 lund@research.att.com, Thorup, Mikkel1 mthroup@research.att.com
Publikováno v:
Journal of the ACM. Dec2007, Vol. 54 Issue 6, p1-37. 37p. 1 Diagram, 2 Charts, 4 Graphs.
Publikováno v:
Journal of the ACM. May98, Vol. 45 Issue 3, p501. 55p. 1 Diagram, 2 Charts.
Publikováno v:
In Journal of Computer and System Sciences February 1999 58(1):222-231
Autor:
Lund, Carsten1 lund@research.att.com, Reingold, Nick1 reingold@research.att.edu, Westbrook, Jeffery1,2 westbrook@research.att.com, Yan, Dicky3 yan@att.com
Publikováno v:
SIAM Journal on Computing. 1998, Vol. 28 Issue 3, p1086. 26p.
Autor:
Lund, Carsten, Yannakakis, Mihalis
Publikováno v:
Journal of the ACM; Sep1994, Vol. 41 Issue 5, p960-981, 22p