標(biāo)題: Titlebook: Algorithms and Computation; 16th International S Xiaotie Deng,Ding-Zhu Du Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 200 [打印本頁] 作者: 類屬 時間: 2025-3-21 18:35
書目名稱Algorithms and Computation影響因子(影響力)
書目名稱Algorithms and Computation影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Computation被引頻次
書目名稱Algorithms and Computation被引頻次學(xué)科排名
書目名稱Algorithms and Computation年度引用
書目名稱Algorithms and Computation年度引用學(xué)科排名
書目名稱Algorithms and Computation讀者反饋
書目名稱Algorithms and Computation讀者反饋學(xué)科排名
作者: noxious 時間: 2025-3-21 23:17 作者: Gentry 時間: 2025-3-22 02:41 作者: 吞沒 時間: 2025-3-22 07:48
The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentationns challenging in many medical image analysis applications. In this paper, we study several . problems captured by an interesting type of geometric graphs called . in the .-D discrete space (. ≥ 3). The LNS problems model the simultaneous detection of multiple mutually related surfaces in three or h作者: 手銬 時間: 2025-3-22 10:42 作者: 觀察 時間: 2025-3-22 13:58
Casting an Object with a Coreng directions. To manufacture more complicated objects, the cast may also have a side core to be removed in a direction skewed to the parting directions. In this paper, given an object and the parting and side core directions, we give necessary and sufficient conditions to verify whether a cast can 作者: 致敬 時間: 2025-3-22 18:22 作者: 拋媚眼 時間: 2025-3-22 21:36 作者: Carcinoma 時間: 2025-3-23 01:40
Minimizing a Monotone Concave Function with Laminar Covering Constraintsmand function . →?., and a monotone concave cost function ., we consider the problem of finding a minimum-cost . such that .(.)≥ .(.) for all .. Here we do not assume that the cost function . is differentiable or even continuous. We show that the problem can be solved in O(...) time if . can be deco作者: ureter 時間: 2025-3-23 08:08
Almost Optimal Solutions for Bin Coloring Problemsotivated from several applications in networking. For the MinBC problem, we first show that it is NP-complete, and then present two near linear time approximation algorithms to achieve almost optimal solutions, i.e., no more than .+2 and .+1 respectively, where . is the optimal solution. For the OMa作者: exigent 時間: 2025-3-23 12:13 作者: 口味 時間: 2025-3-23 14:55
Simultaneous Matchingsatching problem, which has applications in constraint programming: Given a bipartite graph as above and a collection . of . subsets of ., find a subset .???. of the edges such that for each ., the edge set . ∩ (.× .) is a .-perfect matching in . (or report that no such set exists). We show that the 作者: archaeology 時間: 2025-3-23 18:26
An Optimization Problem Related to VoD Broadcastingresents a schedule in which each page assigned to a leaf under node . (1≤ . ≤ .) appears with period ... By varying ., we want to maximize the total number . = ... of pages assigned to the leaves with the following constraints: for 1≤ .≤ ., ., where . is a given integer parameter. This problem arise作者: Devastate 時間: 2025-3-24 01:17 作者: Kidney-Failure 時間: 2025-3-24 06:12 作者: Detain 時間: 2025-3-24 07:00 作者: Inscrutable 時間: 2025-3-24 13:37
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphsl minimal edge sets .???. such that every vertex pair (.,.) ∈ . is disconnected in ., generalizing well-known efficient algorithms for enumerating all minimal .-. cuts, for a given pair .,. ∈ . of vertices. We also present an incremental polynomial time algorithm for enumerating all minimal subsets 作者: 大酒杯 時間: 2025-3-24 17:10
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bendsine segments, and any two edges do not cross except at their common end. A bend is a point where an edge changes its direction. A drawing of . is called an optimal orthogonal drawing if the number of bends is minimum among all orthogonal drawings of .. In this paper we give an algorithm to find an o作者: ellagic-acid 時間: 2025-3-24 19:16
Bisecting a Four-Connected Graph with Three Resource Setswhere |..| is even for each .. The partition problem with . resource sets asks to find a partition .. and .. of the node set . such that the graphs induced by .. and .. are both connected and |.. ∩ ..|=|.. ∩ ..|=|..|/2 holds for each .=1,2,...,.. The problem of testing whether such a bisection exist作者: 富饒 時間: 2025-3-24 23:51
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153122.jpg作者: CYN 時間: 2025-3-25 06:47
Embedding Point Sets into Plane Graphs of Small Dilationints evenly placed on the circle, this question seems hard to answer; it is not even clear if there exists a lower bound >1. In this paper we provide the first upper and lower bounds for the embedding problem.作者: Phenothiazines 時間: 2025-3-25 10:26 作者: 死貓他燒焦 時間: 2025-3-25 12:23 作者: Measured 時間: 2025-3-25 18:45 作者: Texture 時間: 2025-3-25 20:48
0302-9743 Overview: 978-3-540-30935-2978-3-540-32426-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Iatrogenic 時間: 2025-3-26 01:12
,Kugelblitze: Berichte von?Beobachtern,ints evenly placed on the circle, this question seems hard to answer; it is not even clear if there exists a lower bound >1. In this paper we provide the first upper and lower bounds for the embedding problem.作者: 排他 時間: 2025-3-26 05:52 作者: dithiolethione 時間: 2025-3-26 10:31 作者: 慢跑鞋 時間: 2025-3-26 15:54 作者: conference 時間: 2025-3-26 19:25 作者: 記憶 時間: 2025-3-26 21:31
Elemente und Strukturen des Kriminalromans,rastructure. Wireless ad hoc networks have gained much attention in recent years because their potential wide applications such as environmental monitoring and emergency disaster relief. Some of the key design issues for wireless ad hoc networks include power management, network connectivity and rou作者: 不舒服 時間: 2025-3-27 02:40
L. Poplawsky (K?niglichem Aichmeister)se activity recently in the study of such systems [2,3,10,11,13,14,15,16,17]. The primary motivation comes from the analysis of probabilistic programs with procedures. Probability can arise either due to randomizing steps in the program, or it may reflect statistical assumptions on the behaviour of 作者: COM 時間: 2025-3-27 06:42 作者: 命令變成大炮 時間: 2025-3-27 13:13
Die Suche nach fotografischen Beweisen,ns challenging in many medical image analysis applications. In this paper, we study several . problems captured by an interesting type of geometric graphs called . in the .-D discrete space (. ≥ 3). The LNS problems model the simultaneous detection of multiple mutually related surfaces in three or h作者: 加劇 時間: 2025-3-27 16:40 作者: 包租車船 時間: 2025-3-27 20:09 作者: granite 時間: 2025-3-28 00:31
https://doi.org/10.1007/978-3-662-02221-4s, and dilation .(. / (. + 1)) can be computed in time .(. log .). We also construct .–point sets for which any geometric graph with . – 1 + . edges has dilation Ω(. / (. + 1)); a slightly weaker statement holds if the points of . are required to be in convex position.作者: Defraud 時間: 2025-3-28 05:32
https://doi.org/10.1007/978-3-662-02221-4ard dynamic programming algorithm. We then present a novel fast algorithm that runs in time .(. log.). Here, . denotes the number of vertices in the polygon, and . is the total number of vertices in the . polylines that are matched against the polygon. The effectiveness of the similarity measure has作者: Compassionate 時間: 2025-3-28 08:56 作者: fluoroscopy 時間: 2025-3-28 11:43 作者: OMIT 時間: 2025-3-28 18:19 作者: 膽小鬼 時間: 2025-3-28 19:58 作者: 結(jié)合 時間: 2025-3-29 01:42 作者: strain 時間: 2025-3-29 03:51 作者: FLOAT 時間: 2025-3-29 10:51
Der Kunde als Innovationspartnerees, Gavoille . [7] proved that for any such distance labelling scheme, the maximum label length is at least . bits. They also gave a separator-based labelling scheme that has the optimal label length ., where ..(.) is the height of the tree. In this paper, we present two new distance labelling sche作者: Badger 時間: 2025-3-29 12:13 作者: reflection 時間: 2025-3-29 15:40 作者: 幻影 時間: 2025-3-29 21:57
Situationsanalyse — die wichtigste Vorarbeitine segments, and any two edges do not cross except at their common end. A bend is a point where an edge changes its direction. A drawing of . is called an optimal orthogonal drawing if the number of bends is minimum among all orthogonal drawings of .. In this paper we give an algorithm to find an o作者: Immunotherapy 時間: 2025-3-30 00:38 作者: 公共汽車 時間: 2025-3-30 04:22
The Layered Net Surface Problems in Discrete Geometry and Medical Image SegmentationD weighted voxel grid. The NSV problems find applications in medical image segmentation and data mining. Our techniques yield the first polynomial time exact algorithms for several high dimensional medical image segmentation problems. The practical efficiency and accuracy of the algorithms are showc作者: 秘密會議 時間: 2025-3-30 09:07 作者: Flirtatious 時間: 2025-3-30 12:28 作者: justify 時間: 2025-3-30 18:07
Der Kulturbund in der SBZ und in der DDRlso make improvements in complexity results for source location and edge-connectivity augmentation problems in undirected networks. Finally, we show that in general our problem requires . time when . is given implicitly by an oracle, and that it is NP-hard if . is given explicitly.作者: 你不公正 時間: 2025-3-31 00:37 作者: chemoprevention 時間: 2025-3-31 04:40 作者: AVID 時間: 2025-3-31 05:27 作者: AGONY 時間: 2025-3-31 12:17 作者: Endemic 時間: 2025-3-31 15:53
Der Kugeldruckversuch nach Brinell,. is the object size. If the test result is positive, a cast with complexity .(..) can be constructed within the same time bound. We also present an example to show that a cast may have Θ(..) complexity in the worst case. Thus, the complexity of our cast is worst-case optimal.作者: languid 時間: 2025-3-31 20:29
Ralf Reichwald,Anton Meyer,Dominik Walcherg it with ideas from mathematical programming, we propose an efficient algorithm for arbitrary .. We prove the convergence of our algorithm and compare it with previously known algorithms. We point out that our algorithm is also applicable to a more general class of constrained optimization problems.作者: Prognosis 時間: 2025-3-31 22:57
Das Argument — kein Versuchsballon matroids: given a matroid . on ground set .=. ∪ ., enumerate all minimal subsets .???. such that no element . ∈ . is spanned by .. Unlike the above special cases, corresponding to the cycle and cocycle matroids of the graph (.,. ∪ .), the enumeration of cut conjunctions for vectorial matroids turns out to be NP-hard.作者: A簡潔的 時間: 2025-4-1 04:26
Casting an Object with a Core. is the object size. If the test result is positive, a cast with complexity .(..) can be constructed within the same time bound. We also present an example to show that a cast may have Θ(..) complexity in the worst case. Thus, the complexity of our cast is worst-case optimal.作者: 無效 時間: 2025-4-1 06:35
GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Cg it with ideas from mathematical programming, we propose an efficient algorithm for arbitrary .. We prove the convergence of our algorithm and compare it with previously known algorithms. We point out that our algorithm is also applicable to a more general class of constrained optimization problems.作者: 空中 時間: 2025-4-1 10:49
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs matroids: given a matroid . on ground set .=. ∪ ., enumerate all minimal subsets .???. such that no element . ∈ . is spanned by .. Unlike the above special cases, corresponding to the cycle and cocycle matroids of the graph (.,. ∪ .), the enumeration of cut conjunctions for vectorial matroids turns out to be NP-hard.
