找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: Spouse
11#
發(fā)表于 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.
12#
發(fā)表于 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.
13#
發(fā)表于 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.
14#
發(fā)表于 2025-3-23 22:51:28 | 只看該作者
15#
發(fā)表于 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.
16#
發(fā)表于 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.
17#
發(fā)表于 2025-3-24 12:34:17 | 只看該作者
18#
發(fā)表于 2025-3-24 18:32:20 | 只看該作者
19#
發(fā)表于 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..
20#
發(fā)表于 2025-3-24 23:34:11 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-31 09:20
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
个旧市| 镇原县| 天门市| 灵丘县| 邻水| 同仁县| 柯坪县| 同江市| 乐至县| 田林县| 江阴市| 原平市| 涡阳县| 东源县| 宣武区| 横山县| 肇东市| 南木林县| 兴义市| 赤峰市| 茌平县| 古交市| 德昌县| 黔东| 洛宁县| 都匀市| 琼中| 肇东市| 阿巴嘎旗| 邹平县| 合肥市| 高陵县| 衡水市| 农安县| 新泰市| 太仓市| 萝北县| 临沭县| 乌兰浩特市| 阿鲁科尔沁旗| 宁南县|