找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Automata, Languages and Programming; 34th International C Lars Arge,Christian Cachin,Andrzej Tarlecki Conference proceedings 2007 Springer-

[复制链接]
楼主: Spouse
发表于 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.
发表于 2025-3-23 22:51:28 | 显示全部楼层
发表于 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 | 显示全部楼层
发表于 2025-3-24 18:32:20 | 显示全部楼层
发表于 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..
发表于 2025-3-24 23:34:11 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 22:56
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表