標(biāo)題: Titlebook: Algorithm Theory - SWAT ‘94; 4th Scandianvian Wor Erik M. Schmidt,Sven Skyum Conference proceedings 1994 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: 中間時期 時間: 2025-3-21 16:33
書目名稱Algorithm Theory - SWAT ‘94影響因子(影響力)
書目名稱Algorithm Theory - SWAT ‘94影響因子(影響力)學(xué)科排名
書目名稱Algorithm Theory - SWAT ‘94網(wǎng)絡(luò)公開度
書目名稱Algorithm Theory - SWAT ‘94網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithm Theory - SWAT ‘94被引頻次
書目名稱Algorithm Theory - SWAT ‘94被引頻次學(xué)科排名
書目名稱Algorithm Theory - SWAT ‘94年度引用
書目名稱Algorithm Theory - SWAT ‘94年度引用學(xué)科排名
書目名稱Algorithm Theory - SWAT ‘94讀者反饋
書目名稱Algorithm Theory - SWAT ‘94讀者反饋學(xué)科排名
作者: 漫不經(jīng)心 時間: 2025-3-21 21:41 作者: 有罪 時間: 2025-3-22 02:48 作者: 有惡意 時間: 2025-3-22 08:37
Werte-Bildung und Politische Bildungd point . (the origin), plus a sequence of triples<..,p.,r.> where .. is a point of .. specifies the first moment in which the request is ready to be served, and .. represents the moment in which the request is known. A server located at point . at time 0 that moves at constant unit speed must serve作者: 不可比擬 時間: 2025-3-22 12:47
Werte-Bildung und Politische Bildungrunning time . n. log .), where . is the order of the B-tree. These algorithms are based on dynamic programming and use step by step construction of larger trees from optimal smaller trees. We present a new algorithm, which has running time ..), with α=2+log 2/log(.+1). This is a substantial improve作者: 鍵琴 時間: 2025-3-22 15:16 作者: 炸壞 時間: 2025-3-22 20:00
https://doi.org/10.1007/978-3-531-90585-3 log ./ log .) processors in the CRCW PRAM model. The concurrent write is used only by an integer sorting subroutine. We also obtain an .(log .)-time and . log log ./ log .)-processor CRCW PRAM algorithm for the construction of the medial axis of a convex polygon. Our algorithms use the solution to 作者: ventilate 時間: 2025-3-22 21:36
https://doi.org/10.1007/978-3-531-90585-3 from the areas of graph algorithms and computational geometry. In this paper we consider the triangulation problem for planar graphs under the constraint that four-connectivity has to be satisfied..Our first result states that triangulating embedded planar graphs without introducing new separating 作者: 闡釋 時間: 2025-3-23 03:07 作者: colostrum 時間: 2025-3-23 08:39
Rituale als performative Praktiken,) there exists a line which separates one translate from at least . translates, for some constant . that depends on the “shape” of the translates and 2) there is a function . such that there exists a line with orientation . or . which separates one translate from at least ?3.?/4-4 translates, for an作者: 彎腰 時間: 2025-3-23 10:49
Demokratiep?dagogik und Verantwortungslernen Golumbic and Pinter [DGP]. They propose an .(..) algorithm for chromatic number and a less efficient algorithm for maximum clique on trapezoid graphs. Based on a geometric representation of trapezoid graphs by boxes in the plane we design optimal, i.e., . log .), algorithms for chromatic number, we作者: 束縛 時間: 2025-3-23 14:02
https://doi.org/10.1007/978-3-531-90492-4include subgraph isomorphism and topological embedding, known to be NP-complete for general partial .-trees. As well as contributing to our understanding of the types of graphs for which these problems are tractable, this paper introduces methods for solving problems on graphs. In particular, we mak作者: Hemoptysis 時間: 2025-3-23 20:54 作者: 男學(xué)院 時間: 2025-3-24 01:04
Demokratief?higkeit und Bürgerkompetenzenximate solutions, and obtain several improved performance ratios..The first is a subgraph removal schema introduced in our previous paper. Using better component algorithms, we obtain an efficient method with a ./.(1+.(1)) performance ratio. We then produce an implementation of a theorem of Ajtai et作者: 熄滅 時間: 2025-3-24 05:00
Demokratief?higkeit und Bürgerkompetenzen it is desirable to factor the cost of links into the cost of distributed computation. Assume that associated with each link is a positive . representing the cost of sending one message along the link and the cost of an algorithm executed on a . network is the sum of the costs of all messages sent d作者: Dictation 時間: 2025-3-24 10:02 作者: Intend 時間: 2025-3-24 11:51
Algorithm Theory - SWAT ‘94978-3-540-48577-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 謊言 時間: 2025-3-24 18:16
https://doi.org/10.1007/978-3-531-90585-3actical situations. In particular, we construct linear size binary space partitions for sets of fat objects, for sets of line segments where the ratio between the lengths of the longest and shortest segment is bounded by a constant, and for homothetic objects. For all cases we also show how to turn the existence proofs into efficient algorithms.作者: 國家明智 時間: 2025-3-24 20:59
https://doi.org/10.1007/3-540-58218-5Algorithmen; Computer-Geometrie; Datenstrukturen; Graph Algorithms; Graph-Algorithmen; Voronoi Diagrams; V作者: 愛國者 時間: 2025-3-25 00:28 作者: 百靈鳥 時間: 2025-3-25 03:37
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152839.jpg作者: Aggrandize 時間: 2025-3-25 08:35 作者: Plaque 時間: 2025-3-25 13:20
Demokratiep?dagogik und VerantwortungslernenMaintaining a monotonic labeling of an ordered list during the insertion of . items requires . log .) individual relabelings, in the worst case, if the number of usable labels is only polynomial in .. This follows from a lower bound for a new problem, ..作者: ARM 時間: 2025-3-25 15:52 作者: sigmoid-colon 時間: 2025-3-25 21:00 作者: Crepitus 時間: 2025-3-26 01:07 作者: 追逐 時間: 2025-3-26 06:10 作者: 健談的人 時間: 2025-3-26 10:26
Tim Gensheimer,Rolf Frankenbergera set of . convex and simply-shaped objects whose .-projections are all ‘fat’ and their sizes are within a constant ratio from one another, then a depth order for . can be computed in time ...) (.) log..), where . is the maximum number of intersections between the .-projections of the boundaries of any pair of objects in ..作者: beta-cells 時間: 2025-3-26 15:05
https://doi.org/10.1007/978-3-662-24615-3hbor of .. for every .; . is an appropriate constant. This algorithm is considerably faster than the one based on a row-selection algorithm for monotone matrices. If the points of . are arbitrary, then the .. nearest neighbor of .., for all ., can be computed in time .. log..), which also improves upon the previously best-known result.作者: 古代 時間: 2025-3-26 19:54 作者: Allowance 時間: 2025-3-26 21:54 作者: vibrant 時間: 2025-3-27 02:52
Rituale als performative Praktiken,y orientation . (f is defined only by the “shape” of the translate). We also present an . log (.) time algorithm for finding a translate which can be separated from the maximum number of translates amongst sets of . pairwise disjoint translates of convex .-gons.作者: 報復(fù) 時間: 2025-3-27 08:37
https://doi.org/10.1007/978-3-531-90492-4me aggregated in disjoint groups and one is interested in the disjoint groups that are intersected). The solutions are based on geometric transformations, simplex compositions, persistence, and, for the generalized problem, on a method to progressively eliminate groups that cannot possibly be intersected.作者: Favorable 時間: 2025-3-27 12:35 作者: cathartic 時間: 2025-3-27 14:07 作者: Foam-Cells 時間: 2025-3-27 19:52
https://doi.org/10.1007/978-3-531-90585-3eparating triangles is NP-complete. A linear time algorithm for this problem is presented, yielding a solution with at most twice the optimal number. Several related remarks and results are included as well.作者: 裂縫 時間: 2025-3-28 01:52 作者: 怎樣才咆哮 時間: 2025-3-28 03:58
On triangulating planar graphs under the four-connectivity constraint,eparating triangles is NP-complete. A linear time algorithm for this problem is presented, yielding a solution with at most twice the optimal number. Several related remarks and results are included as well.作者: malign 時間: 2025-3-28 08:06 作者: 報復(fù) 時間: 2025-3-28 13:41 作者: 地名表 時間: 2025-3-28 17:55 作者: Palter 時間: 2025-3-28 19:48 作者: peritonitis 時間: 2025-3-29 01:45
Computing depth orders and related problems,a set of . convex and simply-shaped objects whose .-projections are all ‘fat’ and their sizes are within a constant ratio from one another, then a depth order for . can be computed in time ...) (.) log..), where . is the maximum number of intersections between the .-projections of the boundaries of any pair of objects in ..作者: 演繹 時間: 2025-3-29 05:58
Selection in monotone matrices and computing ,, nearest neighbors,hbor of .. for every .; . is an appropriate constant. This algorithm is considerably faster than the one based on a row-selection algorithm for monotone matrices. If the points of . are arbitrary, then the .. nearest neighbor of .., for all ., can be computed in time .. log..), which also improves upon the previously best-known result.作者: medieval 時間: 2025-3-29 07:47
New on-line algorithms for the page replication problem,orm large classes of .-competitive algorithms for trees into 2.-competitive algorithms for rings. As a result we obtain a randomized on-line algorithm for rings that is 3.16-competitive. We also derive two 4-competitive on-line algorithms for rings which are either deterministic or memoryless.作者: TOM 時間: 2025-3-29 12:06 作者: Inelasticity 時間: 2025-3-29 19:08
Separating translates in the plane: Combinatorial bounds and an algorithm,y orientation . (f is defined only by the “shape” of the translate). We also present an . log (.) time algorithm for finding a translate which can be separated from the maximum number of translates amongst sets of . pairwise disjoint translates of convex .-gons.作者: 軍械庫 時間: 2025-3-29 22:22 作者: 不幸的人 時間: 2025-3-30 02:21 作者: Matrimony 時間: 2025-3-30 06:29
Conference proceedings 1994Stockholm), and Ketan Mulmuley (Chicago). The contributions cover algorithms and data structures in all areas of computer science and in discrete mathematics, particularly including graph theory, computational geometry, and databases.作者: galley 時間: 2025-3-30 09:43 作者: irreparable 時間: 2025-3-30 14:33 作者: Hallmark 時間: 2025-3-30 19:38 作者: 可商量 時間: 2025-3-30 22:04 作者: 禁止,切斷 時間: 2025-3-31 02:32
Parallel and sequential approximation of shortest superstrings,atio and the approximation ratio. The well known and practical approximation algorithm is the sequential algorithm GREEDY. It approximates the shortest superstring with the compression ratio of 1/2 and with the approximation ratio of 4. Our main results are:作者: 一起 時間: 2025-3-31 07:20
Sequential and parallel algorithms for embedding problems on classes of partial ,-trees,ing of the types of graphs for which these problems are tractable, this paper introduces methods for solving problems on graphs. In particular, we make use of the tree-decomposition of the graph to apply techniques used to solve problems on trees to solve problems on partial .-trees.作者: 腫塊 時間: 2025-3-31 09:20
Conference proceedings 1994 events are organized each even year and alternate with the WADS meetings (Workshops on Algorithms and Data Structures) held each odd year in North America..The volume contains 31 papers selected from a total of 100 submissions and 3 invited presentations by Michael Fredman (Rutgers), Johan Hastad (作者: expository 時間: 2025-3-31 16:57
Computing depth orders and related problems, lies vertically below . then .. We present a new technique for computing depth orders, and apply it to several special classes of objects. Our results include: (i) If . is a set of . triangles whose .-projections are all ‘fat’, then a depth order for . can be computed in time . log... (ii) If . is 作者: heterodox 時間: 2025-3-31 19:09 作者: MOAT 時間: 2025-4-1 01:38 作者: 發(fā)源 時間: 2025-4-1 02:32 作者: Inertia 時間: 2025-4-1 09:42 作者: nutrition 時間: 2025-4-1 12:25
New results on binary space partitions in the plane (extended abstract),actical situations. In particular, we construct linear size binary space partitions for sets of fat objects, for sets of line segments where the ratio between the lengths of the longest and shortest segment is bounded by a constant, and for homothetic objects. For all cases we also show how to turn 作者: 不出名 時間: 2025-4-1 16:33
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon, log ./ log .) processors in the CRCW PRAM model. The concurrent write is used only by an integer sorting subroutine. We also obtain an .(log .)-time and . log log ./ log .)-processor CRCW PRAM algorithm for the construction of the medial axis of a convex polygon. Our algorithms use the solution to 作者: chapel 時間: 2025-4-1 19:59
On triangulating planar graphs under the four-connectivity constraint, from the areas of graph algorithms and computational geometry. In this paper we consider the triangulation problem for planar graphs under the constraint that four-connectivity has to be satisfied..Our first result states that triangulating embedded planar graphs without introducing new separating 作者: 中止 時間: 2025-4-1 23:32
Parallel and sequential approximation of shortest superstrings,In this paper we examine the complexity of approximating a shortest superstring. There are two basic measures of the approximations: the compression ratio and the approximation ratio. The well known and practical approximation algorithm is the sequential algorithm GREEDY. It approximates the shortes作者: 固定某物 時間: 2025-4-2 06:19
