標題: Titlebook: Algorithms and Data Structures; Workshop WADS ‘89, O F. Dehne,J. -R. Sack,N. Santoro Conference proceedings 1989 Springer-Verlag Berlin Hei [打印本頁] 作者: 縮寫 時間: 2025-3-21 19:30
書目名稱Algorithms and Data Structures影響因子(影響力)
書目名稱Algorithms and Data Structures影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開度
書目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Data Structures被引頻次
書目名稱Algorithms and Data Structures被引頻次學(xué)科排名
書目名稱Algorithms and Data Structures年度引用
書目名稱Algorithms and Data Structures年度引用學(xué)科排名
書目名稱Algorithms and Data Structures讀者反饋
書目名稱Algorithms and Data Structures讀者反饋學(xué)科排名
作者: 過多 時間: 2025-3-21 20:41
Fully persistent arrays,number of memory modifications. Of course, a data structure that is efficient only in the amortized sense may perform poorly if made fully persistent, because expensive operations may be replicated on many branches of the version tree.作者: CANDY 時間: 2025-3-22 01:25
Optimal channel placement for multi-terminal nets,positions of the terminals have already been fixed can be viewed as an interval extension problem. For a class of such interval extension problems, we present an efficient algorithm based on a combinatorial characterization of a density-minimizing interval extension.作者: BIAS 時間: 2025-3-22 05:51 作者: gustation 時間: 2025-3-22 10:49
Conference proceedings 1989ithm Theory. It presents current research in various areas of algorithms, computational geometry, geometric searching, VLSI placement and routing, graph algorithms, parallel algorithms, distributed algorithms, databases, and text searching.作者: 初學(xué)者 時間: 2025-3-22 16:21 作者: ETCH 時間: 2025-3-22 18:33
https://doi.org/10.1007/978-3-8350-9476-5res finding two vertices, .∈. and .∈., that are visible to each other and that are closest to each other among all such pairs. In this paper, we present an .((.+.) log log(.+.)) time algorithm; this improves upon an earlier result of Wang and Chan by an .(log(.+.)/ log log(.+.)) factor.作者: Callus 時間: 2025-3-22 21:16
https://doi.org/10.1007/978-3-8350-9476-5 adapted to solve the problem of finding the width of a set of . points in .., and the problem of finding a stabbing hyperplane for a set of . hyperspheres in .. with varying radii. The time and space complexities of the width and stabbing algorithms are seen to be the same as those of the ..-approximation algorithm.作者: 諷刺滑稽戲劇 時間: 2025-3-23 02:55
Der Produktlebenszyklus von Arzneimittelnnal nodes, height). Completing some previous results, we derive asymptotic expressions for these parameters, notably for DISCS. We conclude by indications on the domain of application of these different data structures.作者: Cabinet 時間: 2025-3-23 09:18 作者: 可觸知 時間: 2025-3-23 12:36
Weighted orthogonal linear ,,-approximation and applications, adapted to solve the problem of finding the width of a set of . points in .., and the problem of finding a stabbing hyperplane for a set of . hyperspheres in .. with varying radii. The time and space complexities of the width and stabbing algorithms are seen to be the same as those of the ..-approximation algorithm.作者: Astigmatism 時間: 2025-3-23 13:54
Discs and other related data structures,nal nodes, height). Completing some previous results, we derive asymptotic expressions for these parameters, notably for DISCS. We conclude by indications on the domain of application of these different data structures.作者: indemnify 時間: 2025-3-23 19:45
Vorgehensweise der empirischen Untersuchungptotically equal to 2 log.. where . is the number of words stored in the trie and . is a parameter of the probabilistic model. Some extensions of our basic model to other digital trees such as .-tries, tries with random number of keys (Poisson model) and suffix trees (dependent keys !) are also shortly discussed.作者: Cardioplegia 時間: 2025-3-23 22:54 作者: PAGAN 時間: 2025-3-24 05:32 作者: 書法 時間: 2025-3-24 07:28
Hindernisse und Pr?ferenzen der Partnerwahlnumber of memory modifications. Of course, a data structure that is efficient only in the amortized sense may perform poorly if made fully persistent, because expensive operations may be replicated on many branches of the version tree.作者: Ingenuity 時間: 2025-3-24 12:51 作者: Malleable 時間: 2025-3-24 18:49
https://doi.org/10.1007/978-3-8350-9476-5time algorithms for computing reachability regions (1) from solid figures bounded by convex polygons or by simple polygons with convex pockets, (2) from nonsolid figures bounded (outside) by convex polygons or by simple polygons with convex pockets, having holes bounded by convex polygons.作者: 油膏 時間: 2025-3-24 21:09 作者: bromide 時間: 2025-3-25 00:33
Freundschaftsnetzwerke und sozialer Kontextnce of .d-trees. We propose a new variation of .d-trees, to be called .d.-trees, whereby the updating procedures guarantee that any subtree of size greater than 2., .≥0, has at least . nodes on each side. Thus, .d-trees are a special case of .d.-trees with .=0. The analysis developed provides, for t作者: puzzle 時間: 2025-3-25 04:27 作者: Axillary 時間: 2025-3-25 11:02
Vorgehensweise der empirischen Untersuchungental results in both random and English text suggests that the bounds are tight. We also present a hybrid algorithm which combines the KMP and BMH algorithms, and which, in practice, is faster than the Boyer-Moore algorithm.作者: 諄諄教誨 時間: 2025-3-25 11:45
Vorgehensweise der empirischen Untersuchungl. The positions for the terminals must be chosen so that the resulting channel routing problem has minimum density. The general multi-terminal placement problem is easily proved to be NP-hard. We show that a number of variants have efficient placement algorithms. The variant in which the upper row 作者: 格子架 時間: 2025-3-25 15:53
https://doi.org/10.1007/978-3-8350-9476-5segment joining these vertices does not properly intersect any edge of these polygons. The problem of finding a closest visible pair of vertices requires finding two vertices, .∈. and .∈., that are visible to each other and that are closest to each other among all such pairs. In this paper, we prese作者: Genome 時間: 2025-3-25 22:41
Der Produktlebenszyklus von Arzneimittelnf edges in simple graphs. We show how to compute efficiently in parallel a binary tree that will be a rooted spanning tree of the claw-free graph. Every binary tree contains at least one edge whose removal partitions the tree into two subtrees of nearly equal cardinality, and this separator can be f作者: 懶鬼才會衰弱 時間: 2025-3-26 01:29 作者: VAN 時間: 2025-3-26 07:16 作者: Atheroma 時間: 2025-3-26 12:21 作者: Decimate 時間: 2025-3-26 14:10
Vorgehensweise der empirischen Untersuchunggital trees associated with this set of words. A word is defined as a random sequence of (possible infinite) symbols over a finite alphabet. A key notion of . matrix {..}.. is introduced where .. is the length of the longest string that is prefix of the .-th and the .-th word. It is proved that the 作者: Oscillate 時間: 2025-3-26 19:15 作者: DEFT 時間: 2025-3-26 21:07 作者: 變色龍 時間: 2025-3-27 04:11
Armando H?ring,Thomas Klein,Kristian StoyeFredman and Saks [1] have proved a Ω(log ./log log .) amortized time lower bound for two problems, List Indexing and Subset Rank, in the cell probe model with logarithmic word size. This paper gives algorithms for both problems that achieve the lower bound on a RAM with logarithmic word size.作者: Foolproof 時間: 2025-3-27 05:39
Bj?rn Schneider Diplom-SoziologeLet p and q be a pair of points in a set S of N points in the plane. Let d(p,q) be the Euclidean distance between p and q and let DT(p,q) be the length of the shortest path from p to q in the Delaunay triangulation of S. We show that that the ratio . independent of S and N.作者: 鎮(zhèn)壓 時間: 2025-3-27 11:06 作者: LUDE 時間: 2025-3-27 14:22
Optimal algorithms for List Indexing and Subset Rank,Fredman and Saks [1] have proved a Ω(log ./log log .) amortized time lower bound for two problems, List Indexing and Subset Rank, in the cell probe model with logarithmic word size. This paper gives algorithms for both problems that achieve the lower bound on a RAM with logarithmic word size.作者: 偉大 時間: 2025-3-27 20:50 作者: figment 時間: 2025-3-28 01:16 作者: 青春期 時間: 2025-3-28 05:58 作者: 幼兒 時間: 2025-3-28 10:05 作者: ostensible 時間: 2025-3-28 11:06
On the performance of orthogonal range queries in multiattribute and doubly chained trees,we study the effect of page size variation in a paginated tree. We show that pagination may decrease the search cost, but is liable to raise the access cost in considerable proportion with respect to the cost on a non paginated tree.作者: insincerity 時間: 2025-3-28 15:21
Conference proceedings 1989ithm Theory. It presents current research in various areas of algorithms, computational geometry, geometric searching, VLSI placement and routing, graph algorithms, parallel algorithms, distributed algorithms, databases, and text searching.作者: 廚房里面 時間: 2025-3-28 19:36
0302-9743 p on Algorithm Theory. It presents current research in various areas of algorithms, computational geometry, geometric searching, VLSI placement and routing, graph algorithms, parallel algorithms, distributed algorithms, databases, and text searching.978-3-540-51542-5978-3-540-48237-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: installment 時間: 2025-3-29 00:00 作者: 社團 時間: 2025-3-29 04:48
Rituale faschistischer Mobilmachung,hms with logarithmic expected time in the size of the text for a wide subclass of regular expressions, and sublinear expected time for any regular expression. These are the first known algorithms to achieve these time complexities.作者: FLOAT 時間: 2025-3-29 07:58 作者: 全國性 時間: 2025-3-29 14:55
Vorgehensweise der empirischen Untersuchungwe study the effect of page size variation in a paginated tree. We show that pagination may decrease the search cost, but is liable to raise the access cost in considerable proportion with respect to the cost on a non paginated tree.作者: Enervate 時間: 2025-3-29 16:14 作者: paragon 時間: 2025-3-29 20:56
978-3-540-51542-5Springer-Verlag Berlin Heidelberg 1989作者: 割讓 時間: 2025-3-30 00:34 作者: 吹牛需要藝術(shù) 時間: 2025-3-30 05:26
Analysis of ,d,-trees: ,d-trees improved by local reorganisations,nce of .d-trees. We propose a new variation of .d-trees, to be called .d.-trees, whereby the updating procedures guarantee that any subtree of size greater than 2., .≥0, has at least . nodes on each side. Thus, .d-trees are a special case of .d.-trees with .=0. The analysis developed provides, for t作者: biosphere 時間: 2025-3-30 09:42 作者: bronchiole 時間: 2025-3-30 15:54 作者: Thyroid-Gland 時間: 2025-3-30 17:43 作者: 支架 時間: 2025-3-30 22:17
Computing the minimum visible vertex distance between two polygons,segment joining these vertices does not properly intersect any edge of these polygons. The problem of finding a closest visible pair of vertices requires finding two vertices, .∈. and .∈., that are visible to each other and that are closest to each other among all such pairs. In this paper, we prese作者: machination 時間: 2025-3-31 02:31 作者: synovium 時間: 2025-3-31 08:59
Linear time algorithms for computing reachability regions from polygonal figures,e also define a . in the plane as being the compact set bounded by a Jordan curve. A . in the plane is defined as being a compact set containing .. A . is simply a solid figure or a nonsolid figure. In this paper, we study some properties of reachability regions from figures. We also present linear 作者: 口味 時間: 2025-3-31 09:58
Weighted orthogonal linear ,,-approximation and applications,The algorithm is shown to require .(.log.) time and .(.) space for .=2, and .(..) time and .(..) space for .>2. The ..-approximation algorithm will be adapted to solve the problem of finding the width of a set of . points in .., and the problem of finding a stabbing hyperplane for a set of . hypersp作者: Transfusion 時間: 2025-3-31 15:34 作者: Coeval 時間: 2025-3-31 18:33
