標題: Titlebook: Automata, Languages and Programming; 34th International C Lars Arge,Christian Cachin,Andrzej Tarlecki Conference proceedings 2007 Springer- [打印本頁] 作者: Spouse 時間: 2025-3-21 19:21
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學科排名
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度學科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學科排名
作者: colony 時間: 2025-3-21 21:41 作者: palpitate 時間: 2025-3-22 04:02 作者: motivate 時間: 2025-3-22 06:33 作者: 附錄 時間: 2025-3-22 12:28
https://doi.org/10.1007/978-3-663-02501-6gorithm among the family of . algorithms—which also includes the previous fastest algorithms—by tightening the known lower bound of .(..log..)?[4] to .(..), matching our algorithm’s running time. Furthermore, we obtain matching upper and lower bounds of . when the two trees have sizes . and . where .?
作者: CAMEO 時間: 2025-3-22 12:58 作者: 規(guī)范要多 時間: 2025-3-22 19:13
An Optimal Decomposition Algorithm for Tree Edit Distancegorithm among the family of . algorithms—which also includes the previous fastest algorithms—by tightening the known lower bound of .(..log..)?[4] to .(..), matching our algorithm’s running time. Furthermore, we obtain matching upper and lower bounds of . when the two trees have sizes . and . where .?
作者: plasma 時間: 2025-3-23 00:34 作者: 使出神 時間: 2025-3-23 05:02 作者: 并排上下 時間: 2025-3-23 09:19 作者: 大看臺 時間: 2025-3-23 10:24
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
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
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 作者: 燈絲 時間: 2025-3-24 05:45
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
,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 作者: acolyte 時間: 2025-3-24 18:32 作者: 繼而發(fā)生 時間: 2025-3-24 22:36
,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 作者: reject 時間: 2025-3-25 04:54 作者: Flavouring 時間: 2025-3-25 11:06 作者: 紡織品 時間: 2025-3-25 12:02
A “proof-reading” of Some Issues in Cryptography 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-25 17:25 作者: Outmoded 時間: 2025-3-25 23:16
Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minimaablishing probabilistic single exponential time algorithms for them. The result generalize and extend previous results of Ajtai, Kumar and Sivakumar. The results on . and . are new for all norms. The results on . and . generalize previous results of Ajtai et al. for the ?. norm to arbitrary ?. norms.作者: 抗生素 時間: 2025-3-26 00:27
Labeling Schemes for Vertex Connectivityt . 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..作者: UNT 時間: 2025-3-26 07:19
A Lower Bound on Entanglement-Assisted Quantum Communication ComplexityAs an application of this bound, we give a very simple proof of the statement that almost all Boolean functions on .?+?. bits have communication complexity linear in ., even in the presence of unlimited entanglement.作者: Biomarker 時間: 2025-3-26 10:07
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problemse prove lower bounds, and analyze efficient strategies for both cases. These problems model real-life stochastic integral planning problems such as commodity trading, reservation systems and scheduling under uncertainty.作者: landmark 時間: 2025-3-26 13:55
Competitive Algorithms for Due Date Scheduling This result extends to the case that each job has a weight and the objective is weighted quoted lead time..We then introduce the following general setting: there is a non- increasing profit function ..(.) associated with each job ... If the customer for job .. is quoted a due date of .., then the p作者: 吃掉 時間: 2025-3-26 18:11
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexityit function which has .(loglog.) randomized complexity for private coins but only constant complexity for public coins..It follows from our existential result that any function that is complete for the class of functions with polylogarithmic nondeterministic .-party communication complexity does not作者: Mammal 時間: 2025-3-26 23:02 作者: 臭了生氣 時間: 2025-3-27 03:37 作者: 鉤針織物 時間: 2025-3-27 07:57 作者: Temporal-Lobe 時間: 2025-3-27 11:44 作者: Engulf 時間: 2025-3-27 15:32
Automata, Languages and Programming978-3-540-73420-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 我們的面粉 時間: 2025-3-27 18:09
0302-9743 Overview: 978-3-540-73419-2978-3-540-73420-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: BOOST 時間: 2025-3-27 22:56 作者: 樸素 時間: 2025-3-28 02:30 作者: 手勢 時間: 2025-3-28 07:03 作者: 幻影 時間: 2025-3-28 13:54 作者: debble 時間: 2025-3-28 18:04 作者: 偽善 時間: 2025-3-28 22:10 作者: Dysplasia 時間: 2025-3-29 00:12
978-3-540-73419-2Springer-Verlag Berlin Heidelberg 2007作者: 男生戴手銬 時間: 2025-3-29 04:28
https://doi.org/10.1007/978-3-662-11879-5s. Computing with massive data sets, data streaming, coping with uncertainty, priced computation, property testing, and sublinear algorithms are all parts of the story. So is the growing trend toward using algorithms as modeling tools for natural phenomena. I will discuss some of these developments;作者: Adrenal-Glands 時間: 2025-3-29 08:23 作者: vanquish 時間: 2025-3-29 14:04
,Schneidst?hle zum Gewindeschneiden,consists of two main steps: first find a branch- (or tree-) decomposition of the input graph whose width is bounded by a sublinear function of the parameter and, second, use this decomposition to solve the problem in time that is single exponential to this bound. The main tool for the first step is 作者: organism 時間: 2025-3-29 17:02
,Schneideisen und Selbst?ffner,company must quote a due date to the customer. To satisfy the customer, the company must produce the good by the due date. The company must have an online algorithm with two components: The first component sets the due dates, and the second component schedules the resulting jobs with the goal of mee作者: terazosin 時間: 2025-3-29 23:37
,Schneideisen und Selbst?ffner,nd of 2???1/. for any fractional truthful mechanism, while we propose a truthful mechanism that achieves approximation of 1?+?(.???1)/2, for . machines. We also focus on an interesting family of allocation algorithms, the . algorithms. We give a lower bound of 1?+?(.???1)/2, that holds for every (no作者: 窗簾等 時間: 2025-3-30 03:22 作者: COLIC 時間: 2025-3-30 04:33
,Schneidst?hle zum Gewindeschneiden,s. We also describe polynomial time reductions for four classical problems from the geometry of numbers, the .., the .., the .., and the ... to ., establishing probabilistic single exponential time algorithms for them. The result generalize and extend previous results of Ajtai, Kumar and Sivakumar. 作者: 卡死偷電 時間: 2025-3-30 10:39 作者: 系列 時間: 2025-3-30 13:01
,Schneideisen und Selbst?ffner,e graph is such a way that given the labels of two nodes . and ., one can decide whether . and . are .-vertex connected in ., i.e., whether there exist . 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 作者: 不公開 時間: 2025-3-30 17:27 作者: 不發(fā)音 時間: 2025-3-30 23:05 作者: 背帶 時間: 2025-3-31 01:15
,Schneidst?hle zum Gewindeschneiden, logarithmic communication complexity for randomized protocols with a one-sided error probability of 1/3 but which has linear communication complexity for deterministic protocols. The result is true for .?=?.. players, where . is the number of bits on each players’ forehead. This separates the analo作者: theta-waves 時間: 2025-3-31 06:32 作者: 鍵琴 時間: 2025-3-31 10:22 作者: ventilate 時間: 2025-3-31 14:56
Zur mitarbeiterbezogenen Kapitalbeteiligung, the uncertainty is in the second stage costs of the edges, in the other version the uncertainty is in the set of vertices that needs to be matched. We prove lower bounds, and analyze efficient strategies for both cases. These problems model real-life stochastic integral planning problems such as co作者: 宣稱 時間: 2025-3-31 21:32
https://doi.org/10.1007/978-3-322-84449-1e sense that any circuit of size . must disagree with . on at least . fraction of inputs. Then the hard-core set lemma says that . must have a hard-core set . of density . on which it is “extremely hard”, in the sense that any circuit of size.s’= . must disagree with . on at least (1???.)/2 fraction作者: 相符 時間: 2025-3-31 23:25
Gewinn- und Verlustrechnung (GuV),s about approximation by DNF and other small-depth circuits:.(1) For every constant 0?
作者: 節(jié)省 時間: 2025-4-1 04:50 作者: 郊外 時間: 2025-4-1 06:03 作者: minimal 時間: 2025-4-1 12:34 作者: sulcus 時間: 2025-4-1 15:01
Competitive Algorithms for Due Date Schedulingcompany must quote a due date to the customer. To satisfy the customer, the company must produce the good by the due date. The company must have an online algorithm with two components: The first component sets the due dates, and the second component schedules the resulting jobs with the goal of mee作者: restrain 時間: 2025-4-1 22:30
Mechanism Design for Fractional Scheduling on Unrelated Machinesnd of 2???1/. for any fractional truthful mechanism, while we propose a truthful mechanism that achieves approximation of 1?+?(.???1)/2, for . machines. We also focus on an interesting family of allocation algorithms, the . algorithms. We give a lower bound of 1?+?(.???1)/2, that holds for every (no
