標(biāo)題: Titlebook: Algorithms and Computation; 14th International S Toshihide Ibaraki,Naoki Katoh,Hirotaka Ono Conference proceedings 2003 Springer-Verlag Ber [打印本頁(yè)] 作者: 頻率 時(shí)間: 2025-3-21 19:15
書(shū)目名稱(chēng)Algorithms and Computation影響因子(影響力)
書(shū)目名稱(chēng)Algorithms and Computation影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Algorithms and Computation網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Algorithms and Computation網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Algorithms and Computation被引頻次
書(shū)目名稱(chēng)Algorithms and Computation被引頻次學(xué)科排名
書(shū)目名稱(chēng)Algorithms and Computation年度引用
書(shū)目名稱(chēng)Algorithms and Computation年度引用學(xué)科排名
書(shū)目名稱(chēng)Algorithms and Computation讀者反饋
書(shū)目名稱(chēng)Algorithms and Computation讀者反饋學(xué)科排名
作者: stress-response 時(shí)間: 2025-3-21 22:26
Voronoi Diagram in the Flow Fieldnstructed. The method is a modification of a so-called fast marching method originally proposed for the eikonal equation. Computational experiments show the efficiency and the stableness of the proposal method.作者: 威脅你 時(shí)間: 2025-3-22 00:45
Finding the Maximum Common Subgraph of a Partial ,-Tree and a Graph with a Polynomially Bounded Numbn connected induced subgraph is generated in polynomial time since a subgraph of a partial .-tree is also a partial .-tree. Among all of these candidates, we can find the maximum common connected induced subgraph for .. and ...作者: dissent 時(shí)間: 2025-3-22 07:07
Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problemhe subtrees covers all vertices in ., where the objective is to minimize the maximum weight of the subtrees. In this paper, we propose an .(...) time .-approximation algorithm to the first problem, and an . time (2+.)-approximation algorithm to the second problem, where .>?0 is a prescribed constant.作者: Ferritin 時(shí)間: 2025-3-22 12:28 作者: GLUE 時(shí)間: 2025-3-22 14:39
Risikoberichterstattung im Lagebericht,n linear time. We also give an algorithm to approximate . with a function consisting of the minimum number of single-peaked pieces under the condition that each single-peaked piece is within a fixed .. distance from the corresponding portion of ..作者: gregarious 時(shí)間: 2025-3-22 17:13 作者: FAZE 時(shí)間: 2025-3-22 22:09
https://doi.org/10.1007/978-3-540-85251-3omplexity of an entangled quantum state by determining (i) how hard to approximate it from a fixed classical state and (ii) how hard to distinguish it from all partially separable states. We further consider the Kolmogorovian-style descriptive complexity of approximation and distinction of partial entanglement.作者: 神圣不可 時(shí)間: 2025-3-23 03:45 作者: peak-flow 時(shí)間: 2025-3-23 07:56 作者: Genteel 時(shí)間: 2025-3-23 09:45
Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curven linear time. We also give an algorithm to approximate . with a function consisting of the minimum number of single-peaked pieces under the condition that each single-peaked piece is within a fixed .. distance from the corresponding portion of ..作者: HEED 時(shí)間: 2025-3-23 17:47 作者: justify 時(shí)間: 2025-3-23 18:59
Computational Complexity Measures of Multipartite Quantum Entanglementomplexity of an entangled quantum state by determining (i) how hard to approximate it from a fixed classical state and (ii) how hard to distinguish it from all partially separable states. We further consider the Kolmogorovian-style descriptive complexity of approximation and distinction of partial entanglement.作者: 殘廢的火焰 時(shí)間: 2025-3-23 22:49 作者: 變量 時(shí)間: 2025-3-24 03:13 作者: NOCT 時(shí)間: 2025-3-24 08:12 作者: 規(guī)范就好 時(shí)間: 2025-3-24 10:55
https://doi.org/10.1007/978-3-540-85251-3obtained from the decomposition of ., and is less than the number of states of an NFA obtained by the trivial translation (that is, the translation using Thompson construction). In addition, we will show an application to an approximate SERE matching problem.作者: Complement 時(shí)間: 2025-3-24 17:52
Interactive Proofs for Quantum Computationshow that several classical interactive proof theorems have analogs in such models. For example, we show that any quantum state computable in quantum polynomial space has a 2-prover quantum interactive proof. Open questions will be discussed.作者: Pert敏捷 時(shí)間: 2025-3-24 20:32 作者: 花爭(zhēng)吵 時(shí)間: 2025-3-25 01:05
Conference proceedings 20037 December 2003. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), and Vancouver (2002). ISAACisanannualinternationalsymposiumthat作者: 解凍 時(shí)間: 2025-3-25 05:46
Risikoberichterstattung im Lagebericht, this model, we propose a dynamic dictionary, supporting insert, delete, and search for keys drawn from a linearly ordered set. As an application we show that the dictionary can be used in computing the trapezoidal map of a set of line segments.作者: 暴露他抗議 時(shí)間: 2025-3-25 09:35 作者: 我要威脅 時(shí)間: 2025-3-25 15:00
https://doi.org/10.1007/978-3-540-85251-3n connected induced subgraph is generated in polynomial time since a subgraph of a partial .-tree is also a partial .-tree. Among all of these candidates, we can find the maximum common connected induced subgraph for .. and ...作者: Dorsal 時(shí)間: 2025-3-25 17:06
https://doi.org/10.1007/978-3-540-85251-3he subtrees covers all vertices in ., where the objective is to minimize the maximum weight of the subtrees. In this paper, we propose an .(...) time .-approximation algorithm to the first problem, and an . time (2+.)-approximation algorithm to the second problem, where .>?0 is a prescribed constant.作者: 擦試不掉 時(shí)間: 2025-3-25 21:25 作者: Armory 時(shí)間: 2025-3-26 03:14 作者: arterioles 時(shí)間: 2025-3-26 05:46
https://doi.org/10.1007/978-3-540-85251-3ass of circuits. We first show that a lower bound shown by Santha and Wilson becomes an extension of Markov’s lower bound by a small refinement. Then, we present tight upper bounds on the number of negations for computing an arbitrary collection of Boolean functions.作者: 匯總 時(shí)間: 2025-3-26 10:30
https://doi.org/10.1007/978-3-540-85251-3h allows us to present a simple algorithm of running time .(1.194. + .) for the parameterized . problem on degree-3 graphs, and a simple algorithm of running time .(1.1254.) for the . problem on degree-3 graphs. Both algorithms improve the previous best algorithms for the problems.作者: 耕種 時(shí)間: 2025-3-26 13:05
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphss time complexity matches the best known time bound for minimal triangulation, using a totally new vertex incremental approach. In opposition to previous algorithms, our process adds each new vertex without reconsidering any choice made at previous steps, and without requiring any knowledge of the vertices that might be added at further steps.作者: Spongy-Bone 時(shí)間: 2025-3-26 18:21 作者: 音樂(lè)學(xué)者 時(shí)間: 2025-3-26 23:32 作者: 脫毛 時(shí)間: 2025-3-27 02:38 作者: Anterior 時(shí)間: 2025-3-27 06:31 作者: Employee 時(shí)間: 2025-3-27 10:35 作者: Encephalitis 時(shí)間: 2025-3-27 16:21 作者: Capitulate 時(shí)間: 2025-3-27 19:18 作者: 哥哥噴涌而出 時(shí)間: 2025-3-27 23:17
,Ausdrucksm??ige Anwendung des Technischen,such a way that the water surface is partitioned into regions belonging to the nearest harbors with respect to this distance. The problem of computing this Voronoi diagram is reduced to a boundary value problem of a partial differential equation, and a numerical method for solving this problem is co作者: 通情達(dá)理 時(shí)間: 2025-3-28 06:04 作者: 大門(mén)在匯總 時(shí)間: 2025-3-28 08:49 作者: Allodynia 時(shí)間: 2025-3-28 10:44
https://doi.org/10.1007/978-3-540-85251-3e maximum common connected induced subgraph of two bounded degree graphs .. and .., where .. is a partial .-tree and .. is a graph whose possible spanning trees are polynomially bounded. The key idea of our algorithm is that for each spanning tree generated from .., a candidate for the maximum commo作者: 整體 時(shí)間: 2025-3-28 17:10 作者: cyanosis 時(shí)間: 2025-3-28 18:47 作者: COLON 時(shí)間: 2025-3-29 02:50 作者: APNEA 時(shí)間: 2025-3-29 05:51
https://doi.org/10.1007/978-3-540-85251-3cible if, for infinitely many ., the value .(.) can be computed by querying . only at places . ≠ .. For all other ., the computation outputs a special symbol to signal that the reduction is undefined. It is shown that for polynomial time Turing and truth-table autoreducibility there are sets ., ., .作者: 剝削 時(shí)間: 2025-3-29 08:31
https://doi.org/10.1007/978-3-540-85251-3 ??=??log(.?+?1) ?. Santha and Wilson [SIAM Journal of Computing 22(2):294–302 (1993)] showed that in some classes of bounded-depth circuits ? negation gates are no longer sufficient for some explicitly defined Boolean function. In this paper, we consider a general class of bounded-depth circuits in作者: flutter 時(shí)間: 2025-3-29 15:00 作者: Endoscope 時(shí)間: 2025-3-29 17:09 作者: 朦朧 時(shí)間: 2025-3-29 21:02
https://doi.org/10.1007/978-3-540-85251-3 . subtrees such that the union of the subtrees covers all vertices in ., where the objective is to minimize the maximum weight of the subtrees. Given a root . in ., the minmax rooted-subtree cover problem asks to find a set of . subtrees such that each subtree contains the root . and the union of t作者: FLIC 時(shí)間: 2025-3-30 03:09 作者: Dissonance 時(shí)間: 2025-3-30 05:50 作者: Ondines-curse 時(shí)間: 2025-3-30 08:57
https://doi.org/10.1007/978-3-531-19508-7 . variables and . inequalities. To investigate lower bounds we formulate a . claw problem corresponding to 0-1 Knapsack. For this problem we establish a lower bound of ?(2.) for its quantum query complexity and an ?(2.) upper bound. We also give a 2. quantum algorithm for satisfiability of CNF form作者: Excitotoxin 時(shí)間: 2025-3-30 15:31
Algorithms and Computation978-3-540-24587-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 殺子女者 時(shí)間: 2025-3-30 18:40 作者: 無(wú)節(jié)奏 時(shí)間: 2025-3-30 21:03 作者: single 時(shí)間: 2025-3-31 01:00 作者: 體貼 時(shí)間: 2025-3-31 06:38 作者: 踉蹌 時(shí)間: 2025-3-31 12:18
https://doi.org/10.1007/b94771AAC; algorithms; combinatorial optimization; complexity; computational geometry; data structures; game the作者: Counteract 時(shí)間: 2025-3-31 17:26
978-3-540-20695-8Springer-Verlag Berlin Heidelberg 2003作者: Substance 時(shí)間: 2025-3-31 18:43
Toshihide Ibaraki,Naoki Katoh,Hirotaka OnoIncludes supplementary material: 作者: 事先無(wú)準(zhǔn)備 時(shí)間: 2025-4-1 00:56
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153126.jpg作者: 混沌 時(shí)間: 2025-4-1 04:35 作者: 是他笨 時(shí)間: 2025-4-1 06:45
Drawing Plane Graphswing methods, such as the straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing, have come out [8,9,3,4,5,6,7, 10,11,14,16,23,29,33]. In this talk we survey the recent results on these drawings of plane graphs.
