大看台
发表于 2025-3-23 10:24:15
https://doi.org/10.1007/978-3-662-28681-4e probability of sampling a variable is proportional to any function of its value. We prove a lower bound of . samples for any reasonable sum estimator using general weighted sampling, which implies that our algorithm combining uniform and linear weighted sampling is an almost optimal sum estimator.
流浪
发表于 2025-3-23 14:41:43
https://doi.org/10.1007/978-3-662-41785-0g, the sublinear additive spanners of Thorup and Zwick, and the (non constant) additive spanners of Baswana et al. Our constructions rival the simplicity of all comparable algorithms and provide substantially better spanners, in some cases reducing the density . exponentially.
枪支
发表于 2025-3-23 18:57:46
Estimating Sum by Weighted Samplinge probability of sampling a variable is proportional to any function of its value. We prove a lower bound of . samples for any reasonable sum estimator using general weighted sampling, which implies that our algorithm combining uniform and linear weighted sampling is an almost optimal sum estimator.
Obituary
发表于 2025-3-23 22:51:28
http://reply.papertrans.cn/17/1663/166231/166231_14.png
灯丝
发表于 2025-3-24 05:45:19
https://doi.org/10.1007/978-3-662-11879-5arts of the story. So is the growing trend toward using algorithms as modeling tools for natural phenomena. I will discuss some of these developments; in particular, dimension reduction, sublinear algorithms, online reconstruction, and self-improving algorithms.
幼儿
发表于 2025-3-24 08:22:24
,Schneidstähle zum Gewindeschneiden, and what theoretic results on security mean for practical applications. We argue that several such issues are often overlooked or misunderstood, and that it may be very productive if both theoreticians and practitioners think more consciously about these issues and act accordingly.
懦夫
发表于 2025-3-24 12:34:17
http://reply.papertrans.cn/17/1663/166231/166231_17.png
acolyte
发表于 2025-3-24 18:32:20
http://reply.papertrans.cn/17/1663/166231/166231_18.png
继而发生
发表于 2025-3-24 22:36:26
,Schneideisen und Selbstöffner,t . vertex disjoint paths connecting . and .. The paper establishes an upper bound of ..log. on the number of bits used in a label. The best previous upper bound for the label size of such labeling scheme is 2.log..
CON
发表于 2025-3-24 23:34:11
http://reply.papertrans.cn/17/1663/166231/166231_20.png