標(biāo)題: Titlebook: ; [打印本頁] 作者: JAR 時間: 2025-3-21 19:05
書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)
書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science年度引用
書目名稱Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名
作者: 牢騷 時間: 2025-3-21 22:15 作者: SHRIK 時間: 2025-3-22 03:53 作者: surmount 時間: 2025-3-22 07:04 作者: squander 時間: 2025-3-22 12:42 作者: 榨取 時間: 2025-3-22 13:42 作者: 榨取 時間: 2025-3-22 19:25 作者: 1分開 時間: 2025-3-23 00:01
Restructuring aspect graphs into aspect- and cell-equivalence classes for use in computer vision,d present a method of using them to restructure a data base of aspect graphs. This process identifies an interconnected set of equivalence classes which we use to form an Equivalence Class Graph (ECG).作者: 喚起 時間: 2025-3-23 04:28 作者: intolerance 時間: 2025-3-23 09:35 作者: Rebate 時間: 2025-3-23 12:01
Graph languages defined by systems of forbidden structures: A survey,ir complexity, and set theoretic closure properties are scetched. A normal form, the minimal systems, are given. Finally the influence of the different kinds of forbidden structures on the descriptive power of the systems is shown.作者: d-limonene 時間: 2025-3-23 15:27
Priority search trees in secondary memory (extended abstract), set of points to be stored is fixed. For the dynamic case we present data structures derived from B-trees and from a generalized version of red-black trees. The latter are interesting in the internal case, too, since they are better balanced than standard red-black trees, in that the ratio longest 作者: 嚴(yán)重傷害 時間: 2025-3-23 21:05 作者: carotid-bruit 時間: 2025-3-24 00:47 作者: 的是兄弟 時間: 2025-3-24 05:22
Designing gamma-acyclic database schemes using decomposition and augmentation techniques,cently introduced various degrees of acyclicity..In this paper, a method is given for designing database schemes that enjoy these properties. This method is based on the decomposition algorithm of Fagin, cf. /Ul 82/, and on the surrogate concept, called L-augmentation, of Kandzia and Mangelmann, cf.作者: 虛情假意 時間: 2025-3-24 09:22
Graph-theoretical tools and their use in a practical distributed operating system design case,ints that are not to be found in theoretical discussions when dealing with the abstract mirror image of the original problems. In this paper we report on part of our . experience with the Theory of Interaction Systems which we used for designing the resource management of the completely distributed 作者: 泥沼 時間: 2025-3-24 14:34 作者: Halfhearted 時間: 2025-3-24 16:11 作者: ABHOR 時間: 2025-3-24 21:06 作者: 薄荷醇 時間: 2025-3-25 02:38
https://doi.org/10.1007/978-1-4899-1872-7ed parallelism theorem provides a bijective correspondence between distributed local derivations and parallel derivations of corresponding global states. This result holds for strict interface preserving derivations while in general distributed derivations are not reducible to global state derivatio作者: synovial-joint 時間: 2025-3-25 07:03 作者: diabetes 時間: 2025-3-25 09:12
Living reference work 20200th editionir complexity, and set theoretic closure properties are scetched. A normal form, the minimal systems, are given. Finally the influence of the different kinds of forbidden structures on the descriptive power of the systems is shown.作者: 食道 時間: 2025-3-25 12:57
Molecular Magnets Recent Highlights set of points to be stored is fixed. For the dynamic case we present data structures derived from B-trees and from a generalized version of red-black trees. The latter are interesting in the internal case, too, since they are better balanced than standard red-black trees, in that the ratio longest 作者: Myelin 時間: 2025-3-25 18:35 作者: 寬敞 時間: 2025-3-25 20:28 作者: 鍵琴 時間: 2025-3-26 00:51 作者: 講個故事逗他 時間: 2025-3-26 07:07 作者: 馬具 時間: 2025-3-26 08:49
https://doi.org/10.1007/978-1-4684-2895-7the different generalizations in Section 3.1 are both operational provided implementations of the underlying data structures for vertices, graphs, and sets are given..If these implementations are too inefficient or are not available at all, transformations of the data structures would have to follow作者: Addictive 時間: 2025-3-26 16:06 作者: Canary 時間: 2025-3-26 18:23 作者: 有惡臭 時間: 2025-3-26 23:53
Designing gamma-acyclic database schemes using decomposition and augmentation techniques,e final result is an L-augmentation of the universal relation scheme and a lossless, γ-acyclic 4NF database scheme for the L-augmented relation scheme..This method can be specialized, such that the number of relation schemes in the database scheme is linear in the number of original attributes.作者: Scintillations 時間: 2025-3-27 02:53 作者: Cloudburst 時間: 2025-3-27 06:06 作者: Folklore 時間: 2025-3-27 12:09
https://doi.org/10.1007/978-981-16-1974-8e final result is an L-augmentation of the universal relation scheme and a lossless, γ-acyclic 4NF database scheme for the L-augmented relation scheme..This method can be specialized, such that the number of relation schemes in the database scheme is linear in the number of original attributes.作者: 性滿足 時間: 2025-3-27 17:34 作者: nocturia 時間: 2025-3-27 20:22
https://doi.org/10.1007/978-1-4684-2895-7es may lead to algorithms of different complexity. But on the other hand, the example also demonstrates that different sequences of design decisions can yield the same result..Since the derivation of algorithms is a complex and creative task, there is no a priori recipe to determine which strategy o作者: RECUR 時間: 2025-3-28 00:34 作者: 高興去去 時間: 2025-3-28 05:10 作者: 榮幸 時間: 2025-3-28 09:40
Automatic crystal chemical classification of silicates using direction-labeled graphs,作者: Armada 時間: 2025-3-28 11:55
https://doi.org/10.1007/978-1-4899-1872-7ed parallelism theorem provides a bijective correspondence between distributed local derivations and parallel derivations of corresponding global states. This result holds for strict interface preserving derivations while in general distributed derivations are not reducible to global state derivations.作者: Badger 時間: 2025-3-28 16:19
Living reference work 20200th editionir complexity, and set theoretic closure properties are scetched. A normal form, the minimal systems, are given. Finally the influence of the different kinds of forbidden structures on the descriptive power of the systems is shown.作者: 階層 時間: 2025-3-28 22:27 作者: cortisol 時間: 2025-3-29 00:58
https://doi.org/10.1007/978-1-4899-0215-3For a specific multilayer grid structure, we perform a worst case analysis. A first step towards an average case analysis of grid structures is presented, where random intervals in a randomly divided data space are investigated.作者: 雪白 時間: 2025-3-29 07:01
Distributed parallelism of graph transformations,ed parallelism theorem provides a bijective correspondence between distributed local derivations and parallel derivations of corresponding global states. This result holds for strict interface preserving derivations while in general distributed derivations are not reducible to global state derivations.作者: 反省 時間: 2025-3-29 07:56 作者: 同步信息 時間: 2025-3-29 14:52
Priority search trees in secondary memory (extended abstract), set of points to be stored is fixed. For the dynamic case we present data structures derived from B-trees and from a generalized version of red-black trees. The latter are interesting in the internal case, too, since they are better balanced than standard red-black trees, in that the ratio longest path/shortest path is smaller.作者: 箴言 時間: 2025-3-29 17:41
On the analysis of grid structures for spatial objects of non-zero size,For a specific multilayer grid structure, we perform a worst case analysis. A first step towards an average case analysis of grid structures is presented, where random intervals in a randomly divided data space are investigated.作者: aristocracy 時間: 2025-3-29 21:01 作者: 翅膀拍動 時間: 2025-3-30 03:19 作者: 使成整體 時間: 2025-3-30 04:55 作者: 輕浮女 時間: 2025-3-30 09:51 作者: Cryptic 時間: 2025-3-30 14:19
https://doi.org/10.1007/978-981-15-1185-1Algorithms for generating internal data structures for networks are given. Data bases for networks can be partitioned hierarchically. Nodes of lower class networks may also be in the interior of a higher class arc which will be split if it is included into the final network. Naming is based either on nodes or on arcs.作者: Instinctive 時間: 2025-3-30 18:28
A PrT-net representation of graph grammars,Formal methods to represent graph grammars using PrT-nets are studied. A transformation procedure from a graph production to a PrT-subnet is given. Moreover, a method to generate a PrT-net that accurately simulates a sequential graph grammar is described.作者: 緊張過度 時間: 2025-3-30 20:58
A sweepcircle algorithm for Voronoi diagrams,The Voronoi diagram of n sites on the surface of a cone has a combinatorial structure rather different from the planar one. We present a sweepcircle algorithm that enables its computation within optimal time O(n log n), using linear storage.作者: triptans 時間: 2025-3-31 03:38 作者: 口音在加重 時間: 2025-3-31 07:48
On chaotic behaviour of some np-complete problems,The paper deals with a structural relations between chaotic dynamical systems on the one hand and np-complete problems, in particular: knap-sack, on the other hand.作者: ZEST 時間: 2025-3-31 12:34 作者: 男生戴手銬 時間: 2025-3-31 13:55
Graph-Theoretic Concepts in Computer Science978-3-540-39264-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 隱語 時間: 2025-3-31 18:14 作者: 一個攪動不安 時間: 2025-3-31 21:50 作者: growth-factor 時間: 2025-4-1 02:25 作者: finale 時間: 2025-4-1 06:42
Discovering Visual Deficiencies in?Pilots Candidates Using Data Miningt. The results of the analysis were satisfactory for the team of specialists due to the confidence margin obtained. These preliminary results allow us to demonstrate the usefulness of the proposed technological tool and to continue with its development.作者: 壓艙物 時間: 2025-4-1 12:10 作者: Connotation 時間: 2025-4-1 15:48
The Model-View-Controller Architecture,hat eine neue Generation so viele Auswirkungen auf Wirtschaft, Arbeitsleben und Talent-Management gehabt. Die Bedeutung einer durchdachten und lebendigen Strategie für Personalmanagement und Employer Branding steigt, die Schwierigkeiten, gute Talente zu finden, ebenfalls. Auch eine Konjunkturflaute,作者: Painstaking 時間: 2025-4-1 20:35 作者: Decongestant 時間: 2025-4-2 01:35
