標(biāo)題: Titlebook: Algorithms and Computation; 7th International Sy Tetsuo Asano,Yoshihide Igarashi,Subhash Suri Conference proceedings 1996 Springer-Verlag B [打印本頁(yè)] 作者: Helmet 時(shí)間: 2025-3-21 19:39
書目名稱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é)科排名
作者: Pruritus 時(shí)間: 2025-3-21 23:46 作者: 全等 時(shí)間: 2025-3-22 01:04
Der Lebenszyklus von Hedgefondsnot bounded by any polynomial in ., and ., incremental convex hull algorithms cannot in any reasonable sense be considered output sensitive. It turns out the same families of polytopes are also hard for the other main types of convex hull algorithms known.作者: 剛開始 時(shí)間: 2025-3-22 06:52
Der Leistenschmerz aus neurologischer Sicht, within a logarithmic factor. This extends a similar recent result for the so-called simple patterns. For substring patterns the running time of the algorithm is ., where . is the number and . the total lenght of the sequences.作者: blithe 時(shí)間: 2025-3-22 11:01 作者: enormous 時(shí)間: 2025-3-22 16:58 作者: intimate 時(shí)間: 2025-3-22 19:34 作者: Dorsal 時(shí)間: 2025-3-22 23:24
Incremental convex hull algorithms are not output sensitive,not bounded by any polynomial in ., and ., incremental convex hull algorithms cannot in any reasonable sense be considered output sensitive. It turns out the same families of polytopes are also hard for the other main types of convex hull algorithms known.作者: 反饋 時(shí)間: 2025-3-23 05:07 作者: BATE 時(shí)間: 2025-3-23 05:34 作者: Cabg318 時(shí)間: 2025-3-23 12:26
Computing fair and bottleneck matchings in geometric graphs,tching problem in higher dimensions. We extend the planar results of Chang et al. [4] and Su and Chang [22], and show that given a set . of 2. points in .-space, it is possible to compute a bottleneck matching of . in roughly .(..) time, for .≤6, and in sub quadratic time, for .>6.作者: Defiance 時(shí)間: 2025-3-23 15:44 作者: thalamus 時(shí)間: 2025-3-23 19:04
W. Overbeck (Ehem. Direktor),W. Franzcomplexity of both problems on all interesting special classes of trees. We also present the first approximation algorithm with non-trivial approximation ratios. In particular, we achieve a ratio of log.., where . is the number of vertices in the trees.作者: 破布 時(shí)間: 2025-3-24 01:00 作者: FLINT 時(shí)間: 2025-3-24 02:29 作者: farewell 時(shí)間: 2025-3-24 08:50 作者: Distribution 時(shí)間: 2025-3-24 11:12
Interval finding and its application to data mining,ction is either . or ., and the conditional functions are additive, where a function . is additive . extending a function . on ., and quotient if it is represented as a quotient of two additive functions. We use computational-geometric methods such as convex hull, range searching, and multidimensional divide-and-conquer.作者: 陳舊 時(shí)間: 2025-3-24 16:14 作者: 誘拐 時(shí)間: 2025-3-24 21:53
Two-dimensional dynamic dictionary matching,rison with the previously best scheme [AFI.93] (which is non-suffix-tree based), our new solution can perform an update more efficiently, without trading the searching time bound. Our work also gives a clue to improve the solution to the static dictionary matching problem [AF92].作者: 健談 時(shí)間: 2025-3-25 01:48 作者: senile-dementia 時(shí)間: 2025-3-25 05:47
OBDDs of a monotone function and of its prime implicants, In other words, we cannot obtain the OBDD of the prime implicant set of a monotone function in an output-size sensitive manner, once we have constructed the OBDD of that function as in [3], in the worst case. A positive result is also given for a meaningful class of matroid functions.作者: Flawless 時(shí)間: 2025-3-25 09:49
Recursively divisible problems,-divisible in a work-optimal way. On the other hand, we also provide some results of lower bound type. For example, ideally divisible problems appear to be a proper subclass of the functional complexity class . of sequentially feasible problems. Finally, we also give some extensions and variations of the concept of (.)-divisibility.作者: 小說(shuō) 時(shí)間: 2025-3-25 13:49
0302-9743 pan, in December 1996..The 43 revised full papers were selected from a total of 119 submissions; also included are an abstract of one invited talk and a full version of a second. Among the topics covered are computational geometry, graph theory, graph algorithms, combinatorial optimization, searchin作者: 發(fā)源 時(shí)間: 2025-3-25 19:37 作者: 全面 時(shí)間: 2025-3-25 23:07 作者: Limited 時(shí)間: 2025-3-26 01:05 作者: ineptitude 時(shí)間: 2025-3-26 07:53 作者: eustachian-tube 時(shí)間: 2025-3-26 11:02
https://doi.org/10.1007/978-3-8350-5409-7diameter of . and the length of the shortest line segment is bounded by a constant. We also give an .(. log .)-time algorithm to determine a set of lines shattering ., improving (for this setting) the .(.. log .) time algorithm of Freimer, Mitchell and Piatko.作者: 臆斷 時(shí)間: 2025-3-26 14:05
https://doi.org/10.1007/978-3-642-79619-7ction is either . or ., and the conditional functions are additive, where a function . is additive . extending a function . on ., and quotient if it is represented as a quotient of two additive functions. We use computational-geometric methods such as convex hull, range searching, and multidimensional divide-and-conquer.作者: GIDDY 時(shí)間: 2025-3-26 18:41 作者: Urea508 時(shí)間: 2025-3-26 22:42
https://doi.org/10.1007/978-3-642-79619-7rison with the previously best scheme [AFI.93] (which is non-suffix-tree based), our new solution can perform an update more efficiently, without trading the searching time bound. Our work also gives a clue to improve the solution to the static dictionary matching problem [AF92].作者: BRAVE 時(shí)間: 2025-3-27 05:08 作者: Gnrh670 時(shí)間: 2025-3-27 05:21
https://doi.org/10.1007/978-3-642-81354-2 In other words, we cannot obtain the OBDD of the prime implicant set of a monotone function in an output-size sensitive manner, once we have constructed the OBDD of that function as in [3], in the worst case. A positive result is also given for a meaningful class of matroid functions.作者: 敲竹杠 時(shí)間: 2025-3-27 11:27 作者: 材料等 時(shí)間: 2025-3-27 13:55
Der Lebenszyklus von Hedgefondse pairs with mutually nonintersecting paths that have useful geometric properties. We first consider matching . red and . blue disjoint isothetic rectangles and connecting the . matched rectangle pairs with nonintersecting monotone rectilinear paths; each such path consists of . segments and is not 作者: saturated-fat 時(shí)間: 2025-3-27 20:28 作者: adequate-intake 時(shí)間: 2025-3-27 23:19 作者: 情感脆弱 時(shí)間: 2025-3-28 04:05 作者: Pamphlet 時(shí)間: 2025-3-28 07:40
https://doi.org/10.1007/978-3-642-79619-7}. Consider an objective function ., conditional functions ..(I) on ., and define an optimization problem of finding the interval . maximizing . subject to ..(I) > .. for given real numbers .. (i=1, 2,., .). We propose efficient algorithms to solve the above optimization problem if the objective fun作者: 鈍劍 時(shí)間: 2025-3-28 10:50
W. Overbeck (Ehem. Direktor),W. Franzt .-restricted Steiner tree problem in phylogeny is APX-complete for .≥4, and (iii) the .-Steiner ratio for the Steiner tree problem in phylogeny matches the corresponding ratio for metric spaces defined on graphs. The results are significant because .-restricted trees are used in various approximat作者: 討好美人 時(shí)間: 2025-3-28 15:47 作者: 進(jìn)取心 時(shí)間: 2025-3-28 19:10
https://doi.org/10.1007/978-3-642-79619-7ching for all occurrences of the patterns in a given text. The dictionary has to be updated efficiently when a pattern is inserted or deleted. The contribution of this paper is an improvement to the existing suffix-tree based solution [Gi93] as regards both the update and search algorithms. In compa作者: 極大的痛苦 時(shí)間: 2025-3-29 00:59
Der Leistenschmerz aus neurologischer Sicht,where each variable symbol can appear only once, and to the substring patterns, which is a subclass of regular patterns of the type ., where . and . are variables and . is a string of constant symbols. We present an algorithm that, given a set of strings, finds a good collection of patterns covering作者: intellect 時(shí)間: 2025-3-29 04:05 作者: STENT 時(shí)間: 2025-3-29 08:32
Der Leistungsbedarf und seine Deckung the shortest edge, the length of the longest edge, and the sum of the lengths of the edges of . respectively. The . problem (also called the . problem, or the . problem) is to find .., a matching that minimizes max(.) ? min(.). A .. is a matching that minimizes (1/.). ? min(.). We present algorithm作者: 放牧 時(shí)間: 2025-3-29 12:46
Lastgang und Verbrauchersteuerunglly distinct placements of . with respect to . under translations is .(..+..+min(..+..m)), and we give an example showing that this bound is tight in the worst case. Second, we present an O((.) log(.)) algorithm for determining a translation of . that maximizes the area of overlap of . and ...We als作者: neutrophils 時(shí)間: 2025-3-29 15:37
https://doi.org/10.1007/978-3-642-81354-2er discusses relationship between the two OBDDs of a monotone function and of its prime implicant set to clarify the complexity of this practically efficient method. We show that there exists a monotone function which has an . size sum-of-products but cannot be represented by a polynomial size OBDD.作者: Integrate 時(shí)間: 2025-3-29 20:11 作者: 勉強(qiáng) 時(shí)間: 2025-3-30 03:18 作者: PAD416 時(shí)間: 2025-3-30 04:24 作者: Misgiving 時(shí)間: 2025-3-30 08:51
Ger?tetechnik zur H?chstlastoptimierungWe define an ordering of vertices of a chordal bipartite graph. By using this ordering, we give a linear time algorithm for the maximum matching problem and an .(..) time algorithm for the minimum fill-in problem on chordal bipartite graphs improving previous results.作者: CAJ 時(shí)間: 2025-3-30 15:25
Ger?tetechnik zur H?chstlastoptimierungTwo variations of the graph searching problem, edge searching and node searching, are studied on several classes of chordal graphs, which include split graphs, interval graphs and .-starlike graphs.作者: IST 時(shí)間: 2025-3-30 18:11
Der Leistungsbegriff in der Sozialen Arbeit,We present an efficient algorithm for computing the vertex ranking number of an asteroidal triple-free graph. Its running time is bounded by a polynomial in the number of vertices and the number of minimal separators of the input graph.作者: ingenue 時(shí)間: 2025-3-30 21:46 作者: morale 時(shí)間: 2025-3-31 04:02 作者: Stagger 時(shí)間: 2025-3-31 05:04
Vertex ranking of asteroidal triple-free graphs,We present an efficient algorithm for computing the vertex ranking number of an asteroidal triple-free graph. Its running time is bounded by a polynomial in the number of vertices and the number of minimal separators of the input graph.作者: incite 時(shí)間: 2025-3-31 11:54
https://doi.org/10.1007/BFb0009475Algorithmische Geometrie; Graph-Algorithmen; Kombinatorik; Komplexit?tstheorie; Netzwerkbetrieb; Routing; 作者: 異端邪說(shuō)2 時(shí)間: 2025-3-31 15:22
978-3-540-62048-8Springer-Verlag Berlin Heidelberg 1996作者: Nomogram 時(shí)間: 2025-3-31 21:14
Algorithms and Computation978-3-540-49633-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 大包裹 時(shí)間: 2025-3-31 23:35
Applications of a numbering scheme for polygonal obstacles in the plane,e pairs with mutually nonintersecting paths that have useful geometric properties. We first consider matching . red and . blue disjoint isothetic rectangles and connecting the . matched rectangle pairs with nonintersecting monotone rectilinear paths; each such path consists of . segments and is not 作者: 警告 時(shí)間: 2025-4-1 05:30
Incremental convex hull algorithms are not output sensitive, (extreme points) .. The . problem is to convert from the vertex representation to the halfspace representation or (equivalently by geometric duality) vice-versa. Given an ordering .. ... .. of the input vertices, after some initialization an incremental convex hull algorithm constructs halfspace de作者: coltish 時(shí)間: 2025-4-1 10:02
Separating and shattering long line segments,s of .. A set . of lines is said to . if each line of . is a separator for ., and every two objects of . are separated by at least one line of .. We give a simple algorithm to construct the set of all separators for a given set . of . line segments in time .(. log .), provided the ratio between the 作者: nephritis 時(shí)間: 2025-4-1 13:27 作者: GEAR 時(shí)間: 2025-4-1 15:40
Interval finding and its application to data mining,}. Consider an objective function ., conditional functions ..(I) on ., and define an optimization problem of finding the interval . maximizing . subject to ..(I) > .. for given real numbers .. (i=1, 2,., .). We propose efficient algorithms to solve the above optimization problem if the objective fun作者: euphoria 時(shí)間: 2025-4-1 21:58 作者: fender 時(shí)間: 2025-4-1 23:51 作者: 得罪人 時(shí)間: 2025-4-2 05:44
Two-dimensional dynamic dictionary matching,ching for all occurrences of the patterns in a given text. The dictionary has to be updated efficiently when a pattern is inserted or deleted. The contribution of this paper is an improvement to the existing suffix-tree based solution [Gi93] as regards both the update and search algorithms. In compa
