標題: Titlebook: Algorithms - ESA ‘98; 6th Annual European Gianfranco Bilardi,Giuseppe F. Italiano,Geppino Pu Conference proceedings 1998 Springer-Verlag B [打印本頁] 作者: 小巷 時間: 2025-3-21 18:57
書目名稱Algorithms - ESA ‘98影響因子(影響力)
書目名稱Algorithms - ESA ‘98影響因子(影響力)學科排名
書目名稱Algorithms - ESA ‘98網(wǎng)絡公開度
書目名稱Algorithms - ESA ‘98網(wǎng)絡公開度學科排名
書目名稱Algorithms - ESA ‘98被引頻次
書目名稱Algorithms - ESA ‘98被引頻次學科排名
書目名稱Algorithms - ESA ‘98年度引用
書目名稱Algorithms - ESA ‘98年度引用學科排名
書目名稱Algorithms - ESA ‘98讀者反饋
書目名稱Algorithms - ESA ‘98讀者反饋學科排名
作者: Interregnum 時間: 2025-3-21 22:50 作者: 絆住 時間: 2025-3-22 04:04 作者: 馬籠頭 時間: 2025-3-22 07:08 作者: neutrophils 時間: 2025-3-22 11:57 作者: profligate 時間: 2025-3-22 16:21 作者: 不如樂死去 時間: 2025-3-22 17:21 作者: 寬容 時間: 2025-3-22 22:04
Computing the Edit-Distance Between Unrooted Ordered Trees two ordered trees. The . between . and . is the minimum cost of a sequence of operations (contract an edge, uncontract an edge, modify the label of an edge) needed to transform . into .. We give an .(.. log .) algorithm to compute the edit distance between two ordered trees.作者: 過去分詞 時間: 2025-3-23 03:03 作者: 感激小女 時間: 2025-3-23 08:37 作者: 不斷的變動 時間: 2025-3-23 11:43
A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numberscides whether . = 0. The algorithms has a one-sided error. If . = 0, then the algorithm will give the correct answer. If . ≠ 0, then the error probability can be made arbitrarily small. The algorithm has been implemented and is expected to be practical.作者: 表示向前 時間: 2025-3-23 16:50 作者: Decimate 時間: 2025-3-23 19:11 作者: sperse 時間: 2025-3-24 01:37 作者: 易受騙 時間: 2025-3-24 05:21 作者: 陪審團 時間: 2025-3-24 07:09 作者: 廢除 時間: 2025-3-24 10:57
https://doi.org/10.1007/978-3-531-19162-1n (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. In this tutorial, we survey the state of the art in the design and analysis of . (also known as EM algorithms or out-of-core algorithms or I/O algorithms). External memory algori作者: conjunctiva 時間: 2025-3-24 15:33 作者: forbid 時間: 2025-3-24 22:47
https://doi.org/10.1007/978-3-658-32840-5In order to beat the standard information theoretic bounds, the soft heap allows errors: occasionally, the keys of certain items are artificially raised. Given any 0 < . < 1/2 and any mixed sequence of . operations, the soft heap ensures that at most . keys are raised at any time. The amortized comp作者: 補角 時間: 2025-3-25 00:00
https://doi.org/10.1007/978-3-658-32840-5 minimal cost prefix-free code in which the encoding alphabet consists of unequal cost (length) letters, with lengths . and .. The most efficient algorithm known previously required .(..) time to construct such a minimal-cost set of . codewords. In this paper we provide an .(..) time algorithm. Our 作者: 羽毛長成 時間: 2025-3-25 07:10
,Führungshandeln auf der Individualebene, delay in delivering a message. When a transient edge failure occurs, it is important to choose a temporary replacement edge which minimizes the diameter of the new spanning tree. Such an optimal replacement is called the .. As a natural extension, the . the problem of finding the best swap for ever作者: mendacity 時間: 2025-3-25 07:53
,Strategisch-relevantes Führungshandeln,n this paper, we consider one algorithmic problem from each of these areas and present highly efficient (linear or near linear time) algorithms for both problems. Our algorithms rely on augmenting the ., a fundamental data structure in string algorithmics. The augmentations are nontrivial and they f作者: 僵硬 時間: 2025-3-25 13:36 作者: 正論 時間: 2025-3-25 16:30
TEIL I: THEORETISCHE GRUNDLEGUNG, two ordered trees. The . between . and . is the minimum cost of a sequence of operations (contract an edge, uncontract an edge, modify the label of an edge) needed to transform . into .. We give an .(.. log .) algorithm to compute the edit distance between two ordered trees.作者: 確定無疑 時間: 2025-3-25 20:51
https://doi.org/10.1007/978-3-322-81167-7e as the dual problems of interest. For the case of rooted binary trees where the symbols occur as leaf-labels and a subobject is defined by label-respecting hereditary topological containment, both of these problems are .-complete, as are the analogous problems for sequences (the well-known . and .作者: 從屬 時間: 2025-3-26 03:54
https://doi.org/10.1007/978-3-642-92737-9 to Howell form .. The nonzero rows of . give a canonical set of generators for the submodule of (..). generated by the rows of .. In this paper we present an algorithm to recover . together with an invertible transformation matrix . which satisfies . = .. The cost of the algorithm is .(..) operatio作者: 燕麥 時間: 2025-3-26 04:39
Besondere Anwendungsgebiete der Photozelle,cides whether . = 0. The algorithms has a one-sided error. If . = 0, then the algorithm will give the correct answer. If . ≠ 0, then the error probability can be made arbitrarily small. The algorithm has been implemented and is expected to be practical.作者: 否認 時間: 2025-3-26 09:29
Besondere Anwendungsgebiete der Photozelle,ing of unit size balls. For a smooth navigation in the scene we have to fulfill hard real time requirements. Therefore, we need algorithms whose running time is independent of the total number of objects in the scene and that use as small space as possible. In this work we focus on one of the basic 作者: overreach 時間: 2025-3-26 13:10 作者: 相信 時間: 2025-3-26 20:13 作者: 生命 時間: 2025-3-27 00:28
https://doi.org/10.1007/978-3-642-92737-9as the novel feature that it tunes its performance to the geometric properties of the rectangles, e.g., their aspect ratios..We have implemented our algorithm and tested its performance on real data sets. We have also systematically compared the performance of our algorithm with that of other techni作者: Deference 時間: 2025-3-27 02:04
Der linierte Graurü?ler oder Blattrandk?ferlk, that starts from a given initial solution and accepts only better points during the walk. We use a new type of analysis, that is not based on conductance, but makes use of structural geometric properties of the problem, namely the smoothness of the set of feasible points.作者: contradict 時間: 2025-3-27 09:16 作者: 嫻熟 時間: 2025-3-27 09:29
978-3-540-64848-2Springer-Verlag Berlin Heidelberg 1998作者: 向下 時間: 2025-3-27 17:27
Gianfranco Bilardi,Giuseppe F. Italiano,Geppino PuIncludes supplementary material: 作者: 傾聽 時間: 2025-3-27 19:55
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153303.jpg作者: 下邊深陷 時間: 2025-3-28 01:34
Algorithms - ESA ‘98978-3-540-68530-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 多嘴多舌 時間: 2025-3-28 02:22
0302-9743 Overview: Includes supplementary material: 978-3-540-64848-2978-3-540-68530-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: faddish 時間: 2025-3-28 10:04 作者: GUISE 時間: 2025-3-28 13:20 作者: 尖牙 時間: 2025-3-28 17:02 作者: GROSS 時間: 2025-3-28 20:45 作者: 逗留 時間: 2025-3-29 01:02
Computing the Edit-Distance Between Unrooted Ordered Trees two ordered trees. The . between . and . is the minimum cost of a sequence of operations (contract an edge, uncontract an edge, modify the label of an edge) needed to transform . into .. We give an .(.. log .) algorithm to compute the edit distance between two ordered trees.作者: MAPLE 時間: 2025-3-29 06:25
A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numberscides whether . = 0. The algorithms has a one-sided error. If . = 0, then the algorithm will give the correct answer. If . ≠ 0, then the error probability can be made arbitrarily small. The algorithm has been implemented and is expected to be practical.作者: frenzy 時間: 2025-3-29 09:53
A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)s in the plane, under the .. metric. Our algorithms are asymptotically optimal, and use only double precision arithmetic. As a side effect of our results, we solve a question left open by Katajainen [.] about the computation of relative neighborhood graphs.作者: 貪婪的人 時間: 2025-3-29 12:22
A Fast Random Greedy Algorithm for the Component Commonality Problemlk, that starts from a given initial solution and accepts only better points during the walk. We use a new type of analysis, that is not based on conductance, but makes use of structural geometric properties of the problem, namely the smoothness of the set of feasible points.作者: amygdala 時間: 2025-3-29 16:37
https://doi.org/10.1007/978-3-658-32840-5rrays are used and no numeric assumptions are made on the keys. The novelty of the data structure is that items are moved together in groups, in a data-structuring equivalent of “car pooling.” The main application of the data structure is a faster deterministic algorithm for minimum spanning trees.作者: 間諜活動 時間: 2025-3-29 23:12 作者: 鋪子 時間: 2025-3-29 23:54 作者: 得體 時間: 2025-3-30 07:50 作者: 托人看管 時間: 2025-3-30 11:11
Augmenting Suffix Trees, with Applicationsorm the technical crux of this paper. In particular, they consist of adding extra edges to suffix trees, resulting in Directed Acyclic Graphs (DAGs). Our algorithms construct these “suffix DAGs” and manipulate them to solve the two problems efficiently.作者: capillaries 時間: 2025-3-30 13:10 作者: Pruritus 時間: 2025-3-30 16:58
Constructing Binary Space Partitions for Orthogonal Rectangles in Practiceques presented in the literature. Our studies show that our algorithm constructs BSPs of near-linear size and small height in practice, has fast running times, and answers queries efficiently. It is a method of choice for constructing BSPs for orthogonal rectangles.作者: 漸變 時間: 2025-3-31 00:30 作者: 舊病復發(fā) 時間: 2025-3-31 04:41
https://doi.org/10.1007/978-3-658-32840-5improvement comes from the use of a more sophisticated modeling of the problem combined with the observation that the problem possesses a “Monge property” and that the SMAWK algorithm on monotone matrices can therefore be applied.作者: HEAVY 時間: 2025-3-31 08:54 作者: Mingle 時間: 2025-3-31 09:28 作者: 導師 時間: 2025-3-31 16:02 作者: Nonporous 時間: 2025-3-31 21:21 作者: climax 時間: 2025-4-1 01:09
Innere lichtelektrische Effekte,al time algorithm within a ratio of (1 ? .). ln . for any . > 0, unless .. TIME(..), where . is the number of triangles in the terrain. Since there exists an approximation algorithm that achieves an approximation ratio of ln .+1, our result is close to the optimum hardness result achievable for this problem.作者: 打折 時間: 2025-4-1 04:57
Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failurester of the new spanning tree. Such an optimal replacement is called the .. As a natural extension, the . the problem of finding the best swap for every edge of the MDST. Given a weighted graph . = (.), where |.| = . and |.| = ., we solve the ABS problem in . time and .(. + .) space, thus improving previous bounds for . = .(..).作者: Heart-Attack 時間: 2025-4-1 08:34 作者: 戲法 時間: 2025-4-1 14:15 作者: Truculent 時間: 2025-4-1 16:34 作者: 意外 時間: 2025-4-1 20:16
Analogs and Duals of the MAST Problem for Sequences and Treese prove that the sequence analog of MAST can be solved in polynomial time. The . problem restricted to inputs consisting of a collection of p-sequences (pSCS) remains .-complete, as does the analogous . problem restricted to p-trees (pSCT). We also show that both problems are hard for the parameteri作者: 紡織品 時間: 2025-4-2 02:13
