作者: GLOSS 時(shí)間: 2025-3-22 00:01 作者: Deceit 時(shí)間: 2025-3-22 00:47 作者: 愚蠢人 時(shí)間: 2025-3-22 06:04
The K-Gabriel graphs and their applications, set in .(...) time. The .-Gabriel graphs are also used to improve the running time of solving the Euclidean bottleneck biconnected edge subgraph problem from .(..) to 0(.), and that of solving the Euclidean bottleneck matching problem from .(..) to .(.....).作者: EXULT 時(shí)間: 2025-3-22 09:29 作者: 激怒 時(shí)間: 2025-3-22 13:30
Local tournaments and proper circular arc graphs,irable properties of tournaments. We illustrate this by giving .(.+. log.) algorithms to find a hamiltonian path and cycle in a local tournament. We mention several characterizations and recognition algorithms of graphs orientable as local tournaments. It turns out that they are precisely the graphs作者: 發(fā)怨言 時(shí)間: 2025-3-22 18:18
Two probabilistic results on merging,he worst case is significantly faster than any deterministic one in the range 1.618<.≤3. We extend it into a simple general algorithm which performs well for any ratio .. In particular, for .>1.618 it is significantly faster than binary merge. We also prove an average case lower bound for a wide cla作者: CULP 時(shí)間: 2025-3-22 23:56
On the construction of abstract voronoi diagrams, II, ó‘ Dúnlaing [MMO] showed how to construct such diagrams in time .(. log .) by a randomized algorithm if the bisecting curves are in general position. In this paper we drop the general position assumption. Moreover, we show that the only geometric operation in the algoithm is the construction of a V作者: 人工制品 時(shí)間: 2025-3-23 02:29 作者: Nebulizer 時(shí)間: 2025-3-23 07:08 作者: engrossed 時(shí)間: 2025-3-23 10:06
https://doi.org/10.1007/3-540-52921-7algorithm; algorithms; complexity; complexity theory; computational geometry; computer; computer science; d作者: heckle 時(shí)間: 2025-3-23 14:23
978-3-540-52921-7Springer-Verlag Berlin Heidelberg 1990作者: 清楚說(shuō)話 時(shí)間: 2025-3-23 18:35
Herleitung des eigenen Akzeptanzmodells, interior point method for linear programming, and make full use of the planarity of networks in solving a system of linear equations in sequential and parallel ways. For the planar minimum cost flow problem with . vertices and integer costs and capacities on edges whose absolute values are bounded 作者: prosperity 時(shí)間: 2025-3-23 23:43
https://doi.org/10.1007/978-3-8349-6126-6 first analyze upper bounds of the complexity of inverse functions by using complexity classes of functions. We prove the following: (1) NP/bit (the class of functions whose . bit is NP computable) is an upper bound for inverting honest and . functions, and (2) relative to almost all oracle, the cla作者: Ataxia 時(shí)間: 2025-3-24 05:09 作者: vertebrate 時(shí)間: 2025-3-24 10:25
E-Business im supply management, set in .(...) time. The .-Gabriel graphs are also used to improve the running time of solving the Euclidean bottleneck biconnected edge subgraph problem from .(..) to 0(.), and that of solving the Euclidean bottleneck matching problem from .(..) to .(.....).作者: notice 時(shí)間: 2025-3-24 13:57
Wirkungsbeziehungen im E-Procurement,has at most . elements for a given .), and 3) all partitions of the set. The algorithms are based on a simple model of parallel computation which assumes the existence of . individual processors operating synchronously without need to communicate among themselves. Parallel ranking and unranking proc作者: vasospasm 時(shí)間: 2025-3-24 16:16 作者: 治愈 時(shí)間: 2025-3-24 20:00 作者: indemnify 時(shí)間: 2025-3-24 23:11 作者: PLIC 時(shí)間: 2025-3-25 03:27
Betriebswirtschaftliche Studiennary predicates of the inputs. It is shown that Θ(.+.|.|) unary predicate evaluations are necessary and sufficient, in the worst case. Results are applied to i) the problem of determining approximate extrema of a set of real numbers, in the same model, and ii) the multiparty broadcast communication 作者: Expertise 時(shí)間: 2025-3-25 10:52 作者: Derogate 時(shí)間: 2025-3-25 15:32 作者: Archipelago 時(shí)間: 2025-3-25 17:56 作者: Myosin 時(shí)間: 2025-3-25 22:50
Two probabilistic results on merging,he worst case is significantly faster than any deterministic one in the range 1.618<.≤3. We extend it into a simple general algorithm which performs well for any ratio .. In particular, for .>1.618 it is significantly faster than binary merge. We also prove an average case lower bound for a wide class of merging algorithms, when 1<.<.+1.作者: 人類學(xué)家 時(shí)間: 2025-3-26 02:22 作者: sparse 時(shí)間: 2025-3-26 05:20
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153048.jpg作者: magnanimity 時(shí)間: 2025-3-26 08:47
Algorithms978-3-540-47177-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: hysterectomy 時(shí)間: 2025-3-26 16:12 作者: 營(yíng)養(yǎng) 時(shí)間: 2025-3-26 17:31
E-Business im supply management, set in .(...) time. The .-Gabriel graphs are also used to improve the running time of solving the Euclidean bottleneck biconnected edge subgraph problem from .(..) to 0(.), and that of solving the Euclidean bottleneck matching problem from .(..) to .(.....).作者: obligation 時(shí)間: 2025-3-26 23:07 作者: JAMB 時(shí)間: 2025-3-27 03:24
Zur Bewertung von Informationename question can also be asked without specifying the direction, in which case the minimum translation over all directions is sought. These are fundamental problems that arise in robotics and computer vision. We develop techniques for implicitly building and searching convolutions and apply them to derive efficient algorithms for these problems.作者: 啜泣 時(shí)間: 2025-3-27 05:37 作者: prostate-gland 時(shí)間: 2025-3-27 11:14
Problemstellung und konzeption der arbeit,In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: (1) in simple, robust and efficient broadcast protocols; (2) in the maintenance of replicated databases.作者: 領(lǐng)導(dǎo)權(quán) 時(shí)間: 2025-3-27 15:31
Der Einsatz von EntscheidungsgremienThis paper shows a necessary and sufficient condition for a family of . many Equally Spaced Polynomial (.) to be irreducible over .(2) and the . of irreducible ESP‘s over .(2), i.e., there exist no distinct irreducible ESP‘s of the same degree. It is worth noting that these results in this paper . characterize all irreducible ESP‘s.作者: 機(jī)械 時(shí)間: 2025-3-27 20:29 作者: 修飾 時(shí)間: 2025-3-28 00:16 作者: 表示向前 時(shí)間: 2025-3-28 02:46
Characterization for a family of infinitely many irreducible Equally Spaced Polynomials,This paper shows a necessary and sufficient condition for a family of . many Equally Spaced Polynomial (.) to be irreducible over .(2) and the . of irreducible ESP‘s over .(2), i.e., there exist no distinct irreducible ESP‘s of the same degree. It is worth noting that these results in this paper . characterize all irreducible ESP‘s.作者: cavity 時(shí)間: 2025-3-28 07:03 作者: geometrician 時(shí)間: 2025-3-28 13:30
Computing edge-connectivity in multiple and capacitated graphs,作者: Stagger 時(shí)間: 2025-3-28 16:37 作者: 拍翅 時(shí)間: 2025-3-28 19:10
0302-9743 -18, 1990. SIGAL (Special Interest Group on Algorithms) was organized within the Information Processing Society of Japan in 1988 to encourage research in the field of discrete algorithms, and held 6-8 research meetings each year. This symposium is the first international symposium organized by SIGAL作者: 暫時(shí)別動(dòng) 時(shí)間: 2025-3-29 01:42 作者: cauda-equina 時(shí)間: 2025-3-29 03:40
Betriebswirtschaftliche Studienlied to i) the problem of determining approximate extrema of a set of real numbers, in the same model, and ii) the multiparty broadcast communication complexity of determining the extrema of a set of integers held by distinct processors.作者: Malaise 時(shí)間: 2025-3-29 07:40
Parallel algorithms for generating subsets and set partitions,mes the existence of . individual processors operating synchronously without need to communicate among themselves. Parallel ranking and unranking procedures for each case are also presented. Applications of the parallel subset generation algorithm to subset-sum, knapsack and base-enumeration problems are subsequently presented.作者: 專橫 時(shí)間: 2025-3-29 14:17
Finding extrema with unary predicates,lied to i) the problem of determining approximate extrema of a set of real numbers, in the same model, and ii) the multiparty broadcast communication complexity of determining the extrema of a set of integers held by distinct processors.作者: 一個(gè)攪動(dòng)不安 時(shí)間: 2025-3-29 17:14
Wirkungsbeziehungen im E-Procurement, previously studied as proper circular arc graphs. Thus we obtain new recognition algorithms for proper circular arc graphs. We also give a more detailed structural characterization of chordal graphs that are orientable as local tournaments, i.e., that are proper circular arc graphs.作者: 萬(wàn)神殿 時(shí)間: 2025-3-29 23:02 作者: Mercantile 時(shí)間: 2025-3-30 03:20
Local tournaments and proper circular arc graphs, previously studied as proper circular arc graphs. Thus we obtain new recognition algorithms for proper circular arc graphs. We also give a more detailed structural characterization of chordal graphs that are orientable as local tournaments, i.e., that are proper circular arc graphs.作者: 蛛絲 時(shí)間: 2025-3-30 05:28
Conference proceedings 1990ymposium also included 5 invited lectures and 10 invited presentations. The subjects of the papers range widely in the field of discrete algorithms in theoretical computer science. Keywords for these subjects are: computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing, and computational algebra.作者: sigmoid-colon 時(shí)間: 2025-3-30 12:10 作者: 車床 時(shí)間: 2025-3-30 13:12 作者: 一個(gè)攪動(dòng)不安 時(shí)間: 2025-3-30 17:56
Herleitung des eigenen Akzeptanzmodells,..) processors. These algorithms are currently best for γ=poly(.). These results can be generalized to the minimum cost flow problem on .(.)-separable networks such as three-dimensional grid networks.作者: Aphorism 時(shí)間: 2025-3-30 21:03 作者: implore 時(shí)間: 2025-3-31 04:11 作者: Bone-Scan 時(shí)間: 2025-3-31 09:05
Structural analyses on the complexity of inverting functions,est functions. Next we investigate relative complexity of inverse functions by using polynomial-time reducibility of functions. We prove that an honest function is NP/bit invertible if the class of its inverse functions possesses the least element under polynomial-time non-adaptive one-query reducibility.作者: granite 時(shí)間: 2025-3-31 11:54 作者: Optimum 時(shí)間: 2025-3-31 13:36
Managing Marine Resources: The Role of GIS in EEZ Managemento selected EEZs, this chapter examines the actual and potential resource conflicts, and proposes Geographical Information Systems (GIS) as a key tool for the integrated and sustainable management of these zones.
