標(biāo)題: Titlebook: Algorithms and Computation; 5th International Sy Ding-Zhu Du,Xiang-Sun Zhang Conference proceedings 1994 Springer-Verlag Berlin Heidelberg [打印本頁(yè)] 作者: Intimidate 時(shí)間: 2025-3-21 16:44
書(shū)目名稱Algorithms and Computation影響因子(影響力)
書(shū)目名稱Algorithms and Computation影響因子(影響力)學(xué)科排名
書(shū)目名稱Algorithms and Computation網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Algorithms and Computation網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Algorithms and Computation被引頻次
書(shū)目名稱Algorithms and Computation被引頻次學(xué)科排名
書(shū)目名稱Algorithms and Computation年度引用
書(shū)目名稱Algorithms and Computation年度引用學(xué)科排名
書(shū)目名稱Algorithms and Computation讀者反饋
書(shū)目名稱Algorithms and Computation讀者反饋學(xué)科排名
作者: 容易做 時(shí)間: 2025-3-21 20:34
Hamiltonian abstract Voronoi diagrams in linear time,or .(.), where . and . are in ., intersects . only once. We show that such a “Hamiltonian” diagram .(.) can be constructed in linear time, given the order of Voronoi regions of .(.) along .. This result generalizes the linear time algorithm for the Voronoi diagram of the vertices of a convex polygon作者: 斷言 時(shí)間: 2025-3-22 03:43 作者: Epithelium 時(shí)間: 2025-3-22 05:40
The traveling cameraman problem, with applications to automatic optical inspection,rs of all the unit squares in the cover. Our objective is to minimize the length of this path. The problem arises in the automatic optical inspection of printed circuit boards and other assemblies..We show that a natural heuristic yields a path of length at most a constant times optimal, whenever th作者: 焦慮 時(shí)間: 2025-3-22 10:55 作者: 全神貫注于 時(shí)間: 2025-3-22 15:30 作者: 禮節(jié) 時(shí)間: 2025-3-22 19:19
Verifying the determinant in parallel, computation is equivalent to the determinant. We observe that for a few problems there exist an easy (..) verification algorithm. To characterize the harder ones, we define under two different reductions the class of problems which are reducible to the verification of the determinant and establish 作者: 雪上輕舟飛過(guò) 時(shí)間: 2025-3-22 22:29 作者: Subdue 時(shí)間: 2025-3-23 03:23 作者: 斜 時(shí)間: 2025-3-23 09:30 作者: 繞著哥哥問(wèn) 時(shí)間: 2025-3-23 12:06 作者: 領(lǐng)帶 時(shí)間: 2025-3-23 17:03
Analysis of the convergency of topology preserving neural networks on learning,n to produce convergent feature maps for uniformly distributed inputs. As a special example, the Kohonen‘s self organizing networks are also proven to be convergent. This paper revises and extends the products in existance and provids a new method for further studying the convergence properties of s作者: QUAIL 時(shí)間: 2025-3-23 21:39 作者: 開(kāi)花期女 時(shí)間: 2025-3-23 22:41 作者: Neuropeptides 時(shí)間: 2025-3-24 02:25 作者: 瑣事 時(shí)間: 2025-3-24 08:07 作者: Inflated 時(shí)間: 2025-3-24 14:20 作者: Distribution 時(shí)間: 2025-3-24 16:45
On random hard sets for NP,The problem of whether NP has a random hard set (i.e., a set in RAND) is investigated. We show that for all recursive oracle . such that P. ≠ NP., NP. has no hard set in RAND. On the other hand, we also show that for almost all oracle ., P. ≠ NP. and NP. has a hard set in RAND.作者: 使高興 時(shí)間: 2025-3-24 20:40 作者: minimal 時(shí)間: 2025-3-25 01:05
Every set of disjoint line segments admits a binary tree,each line segment is an edge of the tree, the tree has no crossing edges, and the maximum vertex degree of the tree is 3. Furthermore, there exist configurations of line segments where any such tree requires at least degree 3. We provide an .(. log .) time algorithm for constructing such a tree, and show that this is optimal.作者: 不可比擬 時(shí)間: 2025-3-25 05:15
Computing solutions uniquely collapses the polynomial hierarchy,al hierarchy collapses to its second level. As the existence of such a function is known to be equivalent to the statement “every NP function has an NP refinement with unique outputs,” our result provides the strongest evidence yet that NP functions cannot be refined.作者: poliosis 時(shí)間: 2025-3-25 09:32
Analysis of the convergency of topology preserving neural networks on learning,n to produce convergent feature maps for uniformly distributed inputs. As a special example, the Kohonen‘s self organizing networks are also proven to be convergent. This paper revises and extends the products in existance and provids a new method for further studying the convergence properties of self organizing neural networks.作者: 妨礙議事 時(shí)間: 2025-3-25 11:43
Algorithms and Computation978-3-540-48653-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 搖擺 時(shí)間: 2025-3-25 16:41
https://doi.org/10.1007/978-3-642-91355-6each line segment is an edge of the tree, the tree has no crossing edges, and the maximum vertex degree of the tree is 3. Furthermore, there exist configurations of line segments where any such tree requires at least degree 3. We provide an .(. log .) time algorithm for constructing such a tree, and show that this is optimal.作者: 承認(rèn) 時(shí)間: 2025-3-25 20:01 作者: Dictation 時(shí)間: 2025-3-26 03:40
https://doi.org/10.1007/978-3-7091-8001-3n to produce convergent feature maps for uniformly distributed inputs. As a special example, the Kohonen‘s self organizing networks are also proven to be convergent. This paper revises and extends the products in existance and provids a new method for further studying the convergence properties of self organizing neural networks.作者: 項(xiàng)目 時(shí)間: 2025-3-26 05:41 作者: 山頂可休息 時(shí)間: 2025-3-26 08:33
https://doi.org/10.1007/3-540-58325-4Boolean function; Computation; Erfüllbarkeitsproblem der Aussagenlogik; Public Key; algorithms; automata; 作者: ineluctable 時(shí)間: 2025-3-26 14:49
978-3-540-58325-7Springer-Verlag Berlin Heidelberg 1994作者: cajole 時(shí)間: 2025-3-26 20:50 作者: 影響 時(shí)間: 2025-3-26 23:54
https://doi.org/10.1007/978-3-642-91277-1or .(.), where . and . are in ., intersects . only once. We show that such a “Hamiltonian” diagram .(.) can be constructed in linear time, given the order of Voronoi regions of .(.) along .. This result generalizes the linear time algorithm for the Voronoi diagram of the vertices of a convex polygon作者: white-matter 時(shí)間: 2025-3-27 01:23
https://doi.org/10.1007/978-3-642-91355-6each line segment is an edge of the tree, the tree has no crossing edges, and the maximum vertex degree of the tree is 3. Furthermore, there exist configurations of line segments where any such tree requires at least degree 3. We provide an .(. log .) time algorithm for constructing such a tree, and作者: 智力高 時(shí)間: 2025-3-27 05:42 作者: 小步走路 時(shí)間: 2025-3-27 12:04
Hermann Burger,Magnus Wieland,Simon Zumstegs congruent to .. First, this paper presents a randomized algorithm which works in .(..(log.).) time. This improves the previous result (an .(..) log .) time deterministic algorithm). The birthday paradox, which is a well-known property in combinatorics, is used effectively in our algorithm. Next, t作者: 爭(zhēng)吵 時(shí)間: 2025-3-27 16:45 作者: LEVY 時(shí)間: 2025-3-27 19:00
https://doi.org/10.1007/978-3-7091-7997-0 computation is equivalent to the determinant. We observe that for a few problems there exist an easy (..) verification algorithm. To characterize the harder ones, we define under two different reductions the class of problems which are reducible to the verification of the determinant and establish 作者: 繁重 時(shí)間: 2025-3-27 22:22
https://doi.org/10.1007/978-3-7091-7998-7ee (which implies maximal fault-tolerance) and/or allow stronger adversaries. They also have low complexity. We give the first wait-free protocol achieving optimal key space range. (This is impossible for deterministic wait-free methods, so we use randomization.) We also introduce a novel wait-free 作者: 中子 時(shí)間: 2025-3-28 04:40
https://doi.org/10.1007/978-3-7091-7998-7(.) is ≥ the number of processors (.)..Our deterministic algorithm runs on any network in time .(. log log . + .. log .), where .. is the time needed for sorting . keys using . processors (assuming that broadcast and prefix computations take time less than or equal to ..). As an example, our algorit作者: 教義 時(shí)間: 2025-3-28 08:23 作者: 特別容易碎 時(shí)間: 2025-3-28 13:29 作者: 劇毒 時(shí)間: 2025-3-28 15:06
https://doi.org/10.1007/978-3-7091-8001-3n to produce convergent feature maps for uniformly distributed inputs. As a special example, the Kohonen‘s self organizing networks are also proven to be convergent. This paper revises and extends the products in existance and provids a new method for further studying the convergence properties of s作者: 商品 時(shí)間: 2025-3-28 21:18
https://doi.org/10.1007/978-3-7091-8001-3utation of robust probabilistic oracle machines. We obtain upper bounds for languages in FewEXP and for sparse sets in NP. Further, interactive protocols with provers that are reducible to sets of low information content are considered. Specifically, if the verifier communicates only with provers in作者: hurricane 時(shí)間: 2025-3-28 23:18
Abgasenergie und Abgastemperaturnd . literals per clause, the average run time of the .1.2 algorithm is .(....) for .≥3 and .≤.2./., where .<. is a constant. Real algorithm executions indicate that the .1.2 algorithm is much more efficient than the well known Davis-Putnam algorithm for certain classes of . formulas with small .. T作者: 丑惡 時(shí)間: 2025-3-29 06:50 作者: Inflamed 時(shí)間: 2025-3-29 07:39
https://doi.org/10.1007/978-3-7091-7998-7 our algorithm runs in an expected .((. + √.) log log .) time, a significant improvement over the deterministic algorithm..We have implemented our randomized algorithm on the Connection Machine CM2. Experimental results obtained are promising. In this paper we also report our implementation details.作者: AND 時(shí)間: 2025-3-29 12:43 作者: 畏縮 時(shí)間: 2025-3-29 19:24 作者: 激怒 時(shí)間: 2025-3-29 21:18 作者: Engulf 時(shí)間: 2025-3-30 02:55
Hardness of approximating graph transformation problem,作者: initiate 時(shí)間: 2025-3-30 07:11 作者: GOUGE 時(shí)間: 2025-3-30 09:09 作者: 燈泡 時(shí)間: 2025-3-30 15:38 作者: archetype 時(shí)間: 2025-3-30 19:01 作者: hallow 時(shí)間: 2025-3-30 22:56 作者: investigate 時(shí)間: 2025-3-31 01:08 作者: Insubordinate 時(shí)間: 2025-3-31 06:18
Hamiltonian abstract Voronoi diagrams in linear time,rder of Voronoi regions of .(.) along .. This result generalizes the linear time algorithm for the Voronoi diagram of the vertices of a convex polygon. We also provide, for any . > log. 2, an ..)-time parallelization of the construction of the .(.) optimal in the time-processor product sense.作者: orthopedist 時(shí)間: 2025-3-31 09:28 作者: Orgasm 時(shí)間: 2025-3-31 14:00 作者: Canary 時(shí)間: 2025-3-31 21:14 作者: 脊椎動(dòng)物 時(shí)間: 2025-3-31 22:22
https://doi.org/10.1007/978-3-7091-7998-7upon a failure of a processor all of the processor‘s incoming messages are transferred to the outgoing link belonging to this ring. We present a general transformation, that modifies any algorithm, that is designed for an ordinary fault-free asynchronous network, to run on such networks.作者: Medicaid 時(shí)間: 2025-4-1 05:12 作者: 西瓜 時(shí)間: 2025-4-1 08:38 作者: 輪流 時(shí)間: 2025-4-1 11:55
https://doi.org/10.1007/978-3-642-91355-6h the regions may be covered by squares of different sizes, and for each input region we are given an upper bound on the size of the permissible square. We show that a simple extension of our heuristic is provably good in this case as well.作者: intoxicate 時(shí)間: 2025-4-1 17:21
https://doi.org/10.1007/978-3-7091-7997-0nant. We show in the Boolean case that none of the complete problems can be recognized in .. unless .=.. On the other hand we show that even for problems which are hard to verify there exists an .. checker and that they can be extended into problems whose verification is easy.
