標題: Titlebook: Automata, Languages and Programming; 36th International C Susanne Albers,Alberto Marchetti-Spaccamela,Wolfga Conference proceedings 2009 Sp [打印本頁] 作者: 阿諛奉承 時間: 2025-3-21 19:10
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學科排名
書目名稱Automata, Languages and Programming網(wǎng)絡公開度
書目名稱Automata, Languages and Programming網(wǎng)絡公開度學科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學科排名
作者: temperate 時間: 2025-3-21 23:53
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphsis sublinear in terms of the maximum or average degree of the hypergraph. We extend this to the weighted case and give a . bound, where . is the average weighted degree in a hypergraph, matching the best bounds known for the special case of graphs. Our approach is to use an semi-definite technique t作者: Pseudoephedrine 時間: 2025-3-22 01:50 作者: Encumber 時間: 2025-3-22 06:17
Sorting and Selection with Imprecise Comparisonse method requires performing all . comparisons then sorting elements according to the number of wins. The large number of comparisons is performed to counter the potentially faulty decision-making of the human subject, who acts as an imprecise comparator..We consider a simple model of the imprecise 作者: Stagger 時間: 2025-3-22 09:58
Fast ,derandomized by slightly increasing the running time. To derandomize our algorithm we construct a new kind of universal hash functions, that we coin .. For integers .,. and ., a family . of functions from [.] to [.] is called a universal (.,.,.)-coloring family if for any graph . on the set of verti作者: faucet 時間: 2025-3-22 15:02
Bounds on the Size of Small Depth Circuits for Approximating Majoritytes Majority function on . variables is exp(.(..)). The lower bound for every .?≥?2 and the upper bound for .?=?2 have been previously shown by O’Donnell and Wimmer [ICALP’07], and the contribution of this paper is to give a matching upper bound for .?≥?3.作者: 蘑菇 時間: 2025-3-22 20:55 作者: LUDE 時間: 2025-3-22 23:50
External Samplingand the algorithm is charged a unit cost for each block access. This model is well-studied, since it reflects the computational issues occurring when the (massive) input is stored on a disk. Since each block access operates on . data elements in parallel, many problems have external memory algorithm作者: DUST 時間: 2025-3-23 03:11
Functional Monitoring without Monotonicityproblems arising in distributed systems, especially sensor networks. In this model, each of . sites reads a stream of tokens and is in communication with a central coordinator, who wishes to continuously monitor some function . of ., the union of the . streams. The goal is to minimize the number of 作者: Iatrogenic 時間: 2025-3-23 05:59 作者: ANA 時間: 2025-3-23 10:32
Towards a Study of Low-Complexity Graphsuce the element of . in models of large scale social networks. This viewpoint may also provide interesting new classes of graphs for which to design algorithms..We focus largely on the case where the “l(fā)ow complexity” computation is ... We show that this is already a rich class of graphs that include作者: 鎮(zhèn)壓 時間: 2025-3-23 15:56 作者: Induction 時間: 2025-3-23 18:26 作者: Yag-Capsulotomy 時間: 2025-3-23 23:13
Competitive Analysis of Aggregate Max in Windowed Streaming. of recent observations. Unlike previous approaches, we use the competitive analysis framework and compare the performance of the online streaming algorithm against an optimal adversary that knows the entire sequence in advance. We consider the problem of maximizing the ., i.e., the sum of the valu作者: 傲慢物 時間: 2025-3-24 03:43
Faster Regular Expression Matchingstance, the .. and . commands, scripting languages such as . and ., programs for analyzing massive data streams, etc. We show how to solve this ubiquitous task in linear space and .(.(loglog.)/(log.).?+?.?+?.) time where . is the length of the expression and . the length of the string. This is the f作者: oracle 時間: 2025-3-24 09:57 作者: 爆炸 時間: 2025-3-24 14:25
Unconditional Lower Bounds against Advicenown even whether .???./... For the probabilistic classes, no lower bounds for uniform exponential time against advice were known before..We also consider the question of whether these lower bounds can be made to work on almost all input lengths rather than on infinitely many. We give an oracle rela作者: 橢圓 時間: 2025-3-24 17:54 作者: 環(huán)形 時間: 2025-3-24 20:46 作者: 宮殿般 時間: 2025-3-25 00:38 作者: 直覺沒有 時間: 2025-3-25 05:13 作者: 商談 時間: 2025-3-25 11:05 作者: condone 時間: 2025-3-25 14:13 作者: 使厭惡 時間: 2025-3-25 16:06
Mario Cimoli,Gabriel Porcile,Elisa Calzaoperations. Specifically, for any sequence of polynomially many operations, with overwhelming probability over the randomness of the initialization phase, each operation is performed in constant time. In addition, we present a general approach for proving that the performance guarantees are preserve作者: 樣式 時間: 2025-3-25 23:18 作者: Foolproof 時間: 2025-3-26 00:39
Getting Dialogic Teaching into Classroomsshow a tight competitive ratio that depends on the maximum value of the stream. We further prove negative results for the closely related problem of maintaining the aggregate minimum and for the generalized version of the aggregate max problem in which every item comes with an individual window.作者: Expand 時間: 2025-3-26 04:45 作者: 雀斑 時間: 2025-3-26 11:20 作者: dagger 時間: 2025-3-26 13:23 作者: Ambulatory 時間: 2025-3-26 20:44 作者: cortex 時間: 2025-3-27 00:55
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Resultsoperations. Specifically, for any sequence of polynomially many operations, with overwhelming probability over the randomness of the initialization phase, each operation is performed in constant time. In addition, we present a general approach for proving that the performance guarantees are preserve作者: 向前變橢圓 時間: 2025-3-27 04:24
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root RuleMOS based processors, and many other types of devices, .=?3, that is, they satisfy the cube-root rule. When .=?3, we show that qOA is 6.7-competitive, improving upon the previous best guarantee of 27 achieved by the algorithm Optimal Available (OA). So when the cube-root rule holds, our results redu作者: 慢跑鞋 時間: 2025-3-27 07:54 作者: 拔出 時間: 2025-3-27 12:46
Susanne Albers,Alberto Marchetti-Spaccamela,Wolfga作者: debunk 時間: 2025-3-27 14:52
Conference proceedings 2009management. ..LNCS 5555 contains?62 contributions of track A selected from 223 submissions as well as 2 invited lectures...This two-volume set lauches the new subline of Lecture Notes in Computer Science, entitled LNCS Advanced Research in Computing and Software Science (ARCoSS)..作者: 泄露 時間: 2025-3-27 21:17 作者: 與野獸博斗者 時間: 2025-3-27 23:32
Getting Dialogic Teaching into Classroomsre different, e.g., |.|?=?|.|.???. for .>?1, where . denotes the number of variables. Furthermore, we show that, for several interesting well-known classes of monotone CNFs . such as bounded degree, clause-size, and intersection-size, our parallel algorithm runs polylogarithmic time by using polynomially many processors.作者: 模仿 時間: 2025-3-28 03:59
Decidability of Conjugacy of Tree-Shifts of Finite Type and in-amalgamations. We prove that the conjugacy problem is decidable for tree-shifts of finite type. This result makes the class of tree-shifts closer to the class of one-sided shifts of dimension one than to the class of two-sided ones. Our proof uses the notion of bottom-up tree automata.作者: MURKY 時間: 2025-3-28 06:50
A Fast and Simple Parallel Algorithm for the Monotone Duality Problemre different, e.g., |.|?=?|.|.???. for .>?1, where . denotes the number of variables. Furthermore, we show that, for several interesting well-known classes of monotone CNFs . such as bounded degree, clause-size, and intersection-size, our parallel algorithm runs polylogarithmic time by using polynomially many processors.作者: deficiency 時間: 2025-3-28 10:40 作者: Dedication 時間: 2025-3-28 16:15
Towards a Study of Low-Complexity Graphss examples of lossless expanders and power-law graphs. We give evidence that even such low complexity graphs present a formidable challenge to algorithms designers. On the positive side, we show that many algorithms from property testing and data sketching can be adapted to give meaningful results for low-complexity graphs.作者: pus840 時間: 2025-3-28 20:01 作者: 消音器 時間: 2025-3-29 00:11
https://doi.org/10.1057/9781137333117s examples of lossless expanders and power-law graphs. We give evidence that even such low complexity graphs present a formidable challenge to algorithms designers. On the positive side, we show that many algorithms from property testing and data sketching can be adapted to give meaningful results for low-complexity graphs.作者: 混亂生活 時間: 2025-3-29 06:02
David Frodsham,Heinrich Liechtensteincluding the recent algorithm of Bj?rklund, Husfeldt and Koivisto for computing the chromatic polynomial, the classical algorithm of Kohn, Gottlieb, Kohn, and Karp for counting Hamiltonian cycles, Ryser’s formula for counting perfect matchings of a bipartite graph, and color coding based algorithms of Alon, Yuster, and Zwick.作者: Solace 時間: 2025-3-29 10:53 作者: Enzyme 時間: 2025-3-29 14:26
Conference proceedings 2009amming, ICALP 2009, held in Rhodes, Greece, in July 2009...The 126 revised full papers (62 papers for track A, 24 for track B, and 22 for track C) presented were carefully reviewed and selected from a total of?370 submissions. The papers are grouped in three major tracks on algorithms, automata, com作者: blithe 時間: 2025-3-29 16:19
0302-9743 and Programming, ICALP 2009, held in Rhodes, Greece, in July 2009...The 126 revised full papers (62 papers for track A, 24 for track B, and 22 for track C) presented were carefully reviewed and selected from a total of?370 submissions. The papers are grouped in three major tracks on algorithms, aut作者: spondylosis 時間: 2025-3-29 22:08 作者: AGATE 時間: 2025-3-30 02:45 作者: Extricate 時間: 2025-3-30 07:54
Understanding Teaching-Learning Practicetous task in linear space and .(.(loglog.)/(log.).?+?.?+?.) time where . is the length of the expression and . the length of the string. This is the first improvement for the dominant .(./log.) term in Myers’ .(./log.?+?(.?+?.)log.) bound [JACM 1992]. We also get improved bounds for external memory.作者: MENT 時間: 2025-3-30 10:17
Investment Liquidity and Valuationider the question of whether these lower bounds can be made to work on almost all input lengths rather than on infinitely many. We give an oracle relative to which .???.., which provides evidence that this is not possible with current techniques.作者: 妨礙 時間: 2025-3-30 15:55 作者: 玩忽職守 時間: 2025-3-30 16:55
Assigning Papers to Refereese PC chair typically bases her decision on input from the PC, her knowledge of submissions and PC members, or scores that are computed automatically from keywords provided by authors and PC members. From now on, we call PC members reviewers or ..作者: Alcove 時間: 2025-3-30 21:41 作者: COLIC 時間: 2025-3-31 02:27
Faster Regular Expression Matchingtous task in linear space and .(.(loglog.)/(log.).?+?.?+?.) time where . is the length of the expression and . the length of the string. This is the first improvement for the dominant .(./log.) term in Myers’ .(./log.?+?(.?+?.)log.) bound [JACM 1992]. We also get improved bounds for external memory.作者: 開始發(fā)作 時間: 2025-3-31 08:28 作者: 小鹿 時間: 2025-3-31 12:13
Approximating Decision Trees with Multiway Branchesttribute values such that the average number of tests is minimized. The previously best known approximation ratio for this problem was .(log..). In this paper, we present a new greedy heuristic that yields an improved approximation ratio of .(log.).作者: 排他 時間: 2025-3-31 13:42
Gettering Defects in Semiconductorsain responsibility of the PC chair is to organize the review process, in particular, to decide which papers are assigned to which member of the PC. The PC chair typically bases her decision on input from the PC, her knowledge of submissions and PC members, or scores that are computed automatically f作者: 圓木可阻礙 時間: 2025-3-31 21:12
Gettering Defects in Semiconductorsis sublinear in terms of the maximum or average degree of the hypergraph. We extend this to the weighted case and give a . bound, where . is the average weighted degree in a hypergraph, matching the best bounds known for the special case of graphs. Our approach is to use an semi-definite technique t作者: 取之不竭 時間: 2025-3-31 23:32
Springer Series in Advanced Microelectronicsy similarity function between element pairs. Their setting is agnostic in the sense that a ground truth clustering is not assumed to exist, and the cost of a solution is computed against the input similarity function. This problem has been studied in theory and in practice and has been subsequently 作者: Introduction 時間: 2025-4-1 02:10
Techniques for high-temperature gettering,e method requires performing all . comparisons then sorting elements according to the number of wins. The large number of comparisons is performed to counter the potentially faulty decision-making of the human subject, who acts as an imprecise comparator..We consider a simple model of the imprecise 作者: 真 時間: 2025-4-1 07:15
Introduction to Stochastic Homogenization,derandomized by slightly increasing the running time. To derandomize our algorithm we construct a new kind of universal hash functions, that we coin .. For integers .,. and ., a family . of functions from [.] to [.] is called a universal (.,.,.)-coloring family if for any graph . on the set of verti作者: 占卜者 時間: 2025-4-1 13:24
Leonid Berlyand,Volodymyr Rybalkotes Majority function on . variables is exp(.(..)). The lower bound for every .?≥?2 and the upper bound for .?=?2 have been previously shown by O’Donnell and Wimmer [ICALP’07], and the contribution of this paper is to give a matching upper bound for .?≥?3.
