標(biāo)題: Titlebook: Data Structures and Efficient Algorithms; Final Report on the B. Monien,Th. Ottmann Book 1992 Springer-Verlag Berlin Heidelberg 1992 algor [打印本頁] 作者: 拖累 時間: 2025-3-21 18:38
書目名稱Data Structures and Efficient Algorithms影響因子(影響力)
書目名稱Data Structures and Efficient Algorithms影響因子(影響力)學(xué)科排名
書目名稱Data Structures and Efficient Algorithms網(wǎng)絡(luò)公開度
書目名稱Data Structures and Efficient Algorithms網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Data Structures and Efficient Algorithms被引頻次
書目名稱Data Structures and Efficient Algorithms被引頻次學(xué)科排名
書目名稱Data Structures and Efficient Algorithms年度引用
書目名稱Data Structures and Efficient Algorithms年度引用學(xué)科排名
書目名稱Data Structures and Efficient Algorithms讀者反饋
書目名稱Data Structures and Efficient Algorithms讀者反饋學(xué)科排名
作者: 輕快來事 時間: 2025-3-21 21:35
Andrea Marin,Maria Grazia Vigliotti of GIS operations. The fruitfulness of this combination is based on the fact that spatial access methods efficiently provide the data at the time when computational geometry algorithms need it for processing. Additionally, this combination avoids page faults and facilitates the parallelization of t作者: Affectation 時間: 2025-3-22 03:55
Monika Grabowska,Wojciech Kot?owskiof the objects as well as efficient query processing. To support the index manager, we propose a storage method for handling arbitrary long objects, which is suitable in an environment that demands for clustering and multiple indexing.作者: Defiance 時間: 2025-3-22 06:30
Tandem Networks with Intermittent Energytial query processing, it substitutes complex computational geometry algorithms by simple and fast algorithms for simple components. In this paper, we present four different decomposition techniques for polygonal shaped objects. The second part of the paper consists of an empirical performance compa作者: MAL 時間: 2025-3-22 09:00 作者: FLASK 時間: 2025-3-22 16:14
Computer and Information Sciences III the bounding of the search overhead by the extended Young Brothers Wait Concept and the efficient use of a distributed hash table. We give a cost and gain analysis of this hash table showing its superior behavior compared to other approaches..The developed techniques have been incorparated in the d作者: FLASK 時間: 2025-3-22 20:36
The combination of spatial access methods and computational geometry in geographic database systems of GIS operations. The fruitfulness of this combination is based on the fact that spatial access methods efficiently provide the data at the time when computational geometry algorithms need it for processing. Additionally, this combination avoids page faults and facilitates the parallelization of t作者: gregarious 時間: 2025-3-22 22:01
A flexible and extensible index manager for spatial database systems,of the objects as well as efficient query processing. To support the index manager, we propose a storage method for handling arbitrary long objects, which is suitable in an environment that demands for clustering and multiple indexing.作者: 冒失 時間: 2025-3-23 01:38 作者: 致詞 時間: 2025-3-23 06:40
,Monotonous Bisector* Trees — a tool for efficient partitioning of complex scenes of geometric objec using . space. This statement still holds if we demand that the cluster radii, which appear on a path from the root down to a leaf, should generate a geometrically decreasing sequence..We report on extensive experimental results which show that Monotonous Bisector Trees support a large variety of p作者: 新義 時間: 2025-3-23 11:12 作者: Interstellar 時間: 2025-3-23 15:31
Selected topics from computational geometry, data structures and motion planning,作者: avenge 時間: 2025-3-23 18:26 作者: NOTCH 時間: 2025-3-23 22:23
Resemblance and symmetries of geometric patterns,nalysis. In particular, algorithms are described for determining the exact and approximate . of finite sets of points in the plane. This problem is generalized to polygonal curves in the plane, where variuos cases are considered depending on the set of rigid motions (translations, rotations) allowed作者: brother 時間: 2025-3-24 03:08 作者: 親密 時間: 2025-3-24 08:25 作者: Indebted 時間: 2025-3-24 14:34 作者: abreast 時間: 2025-3-24 15:55
Distributed image synthesis with breadth-first ray tracing and the ray-z-buffer,s means that first all rays of view are treated, next the set of reflection and refraction rays, then the reflection and refraction rays caused by them, and so on. The calculation of intersections for a generation of rays uses the ray-z-buffer algorithm. Like the original z-buffer algorithm, the ray作者: ingestion 時間: 2025-3-24 20:41 作者: 運氣 時間: 2025-3-25 02:57
,Monotonous Bisector* Trees — a tool for efficient partitioning of complex scenes of geometric objecal metric spaces with an efficiently computable distance function. We present a data structure called ., which can be regarded as a divisive hierarchical approach of centralized clustering methods (compare [3] and [12]). We analyze some structural properties showing that Monotonous Bisector Trees ar作者: 彈藥 時間: 2025-3-25 06:31
Learning convex sets under uniform distribution,e a set .′ is constructed which is supposed to be a good approximation of .. The algorithm may have a small probability of failing. We measure the quality of the approximation by minimizing the probability that a random test point selected under the same distribution as the sample points is classifi作者: commodity 時間: 2025-3-25 08:05
Spatial access structures for geometric databases,l access structure design decisions are traditionally based whenever efficiency is the primary goal, and we propose a more integrated view. This helps to explain phenomena that have been observed in experiments, and it lays the foundation for tailoring spatial access structures to the particular app作者: 不透氣 時間: 2025-3-25 12:07
On spanning trees with low crossing numbers,s are embedded as straight line segments). We review the proof of this result (originally proved by Bernard Chazelle and the author in a more general setting), point at some methods for constructing such a tree, and describe some algorithmic and combinatorial applications.作者: 誓言 時間: 2025-3-25 18:03 作者: Macronutrients 時間: 2025-3-25 21:17 作者: Definitive 時間: 2025-3-26 00:22 作者: Canary 時間: 2025-3-26 04:56 作者: 激怒 時間: 2025-3-26 09:30 作者: Tincture 時間: 2025-3-26 12:37
Area efficient methods to increase the reliability of circuits, question how such fault-tolerance increases the circuit layout. In general it requires at least a logarithmic factor increase of the number of gates. We design area efficient codes for the information transfer within a Boolean circuit. Using such a code two constructions are presented to make circu作者: HUMID 時間: 2025-3-26 19:55 作者: grovel 時間: 2025-3-27 00:36
Spatial access structures for geometric databases,l access structure design decisions are traditionally based whenever efficiency is the primary goal, and we propose a more integrated view. This helps to explain phenomena that have been observed in experiments, and it lays the foundation for tailoring spatial access structures to the particular application requirements.作者: 流動才波動 時間: 2025-3-27 04:12 作者: 先行 時間: 2025-3-27 06:12 作者: 一小塊 時間: 2025-3-27 12:55
Data Structures and Efficient Algorithms978-3-540-47103-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 遣返回國 時間: 2025-3-27 16:57
Tandem Networks with Intermittent Energy. We discuss methods for making object queries, computing shortest paths, and questions on restricted orientation convexity. Furthermore, we give an optimal algorithm for computing shortest paths when three arbitrary orientations are allowed for path links and obstacle edges.作者: Daily-Value 時間: 2025-3-27 20:30
Mustafa Müjdat Atanak,Atakan Do?anl access structure design decisions are traditionally based whenever efficiency is the primary goal, and we propose a more integrated view. This helps to explain phenomena that have been observed in experiments, and it lays the foundation for tailoring spatial access structures to the particular application requirements.作者: nepotism 時間: 2025-3-28 01:46 作者: 極大的痛苦 時間: 2025-3-28 03:37
Cognitive Packets in Large Virtual Networkslel algorithms. Recently, a substantial progress has been made in this area. In this survey paper, we discuss the results that have been obtained for three types of parallel random access machines (PRAMs): CREW, ROBUST and EREW.作者: extract 時間: 2025-3-28 06:20
https://doi.org/10.1007/3-540-55488-2algorithm; algorithms; computational geometry; computer; computer graphics; data structure; data structure作者: 藝術(shù) 時間: 2025-3-28 12:13
978-3-540-55488-2Springer-Verlag Berlin Heidelberg 1992作者: 外來 時間: 2025-3-28 18:30 作者: 明智的人 時間: 2025-3-28 21:56
Andrea Marin,Maria Grazia Vigliottiapplications of the very active research area named spatial database systems. Consequently following the database approach, a GIS has to be seamless, i.e. store the complete area of interest (e.g. the whole world) in one database map. For exhibiting acceptable performance a seamless GIS has to use s作者: 使乳化 時間: 2025-3-29 02:35 作者: rectocele 時間: 2025-3-29 07:08 作者: 裂縫 時間: 2025-3-29 09:47
Rafa? Wo?niak,Danuta Zakrzewskas means that first all rays of view are treated, next the set of reflection and refraction rays, then the reflection and refraction rays caused by them, and so on. The calculation of intersections for a generation of rays uses the ray-z-buffer algorithm. Like the original z-buffer algorithm, the ray作者: 沒花的是打擾 時間: 2025-3-29 15:02
Tandem Networks with Intermittent Energy. We discuss methods for making object queries, computing shortest paths, and questions on restricted orientation convexity. Furthermore, we give an optimal algorithm for computing shortest paths when three arbitrary orientations are allowed for path links and obstacle edges.作者: VOC 時間: 2025-3-29 16:13
Tayfun Kucukyilmaz,Ata Turk,Cevdet Aykanatal metric spaces with an efficiently computable distance function. We present a data structure called ., which can be regarded as a divisive hierarchical approach of centralized clustering methods (compare [3] and [12]). We analyze some structural properties showing that Monotonous Bisector Trees ar作者: Minikin 時間: 2025-3-29 22:19
https://doi.org/10.1007/978-1-4471-2155-8e a set .′ is constructed which is supposed to be a good approximation of .. The algorithm may have a small probability of failing. We measure the quality of the approximation by minimizing the probability that a random test point selected under the same distribution as the sample points is classifi作者: Felicitous 時間: 2025-3-30 03:21
Mustafa Müjdat Atanak,Atakan Do?anl access structure design decisions are traditionally based whenever efficiency is the primary goal, and we propose a more integrated view. This helps to explain phenomena that have been observed in experiments, and it lays the foundation for tailoring spatial access structures to the particular app作者: 迫擊炮 時間: 2025-3-30 07:34 作者: Estrogen 時間: 2025-3-30 11:40 作者: 絕食 時間: 2025-3-30 15:57 作者: ETHER 時間: 2025-3-30 20:22 作者: 領(lǐng)帶 時間: 2025-3-30 22:46 作者: ethnology 時間: 2025-3-31 01:40
https://doi.org/10.1007/978-1-4471-4594-3lel branch-&-bound procedure which guarantees to find the optimal solution is compard to a heuristic genetic algorithm which successively improves a set of solutions. Both algorithms were implemented on a local memory multiprocessor system of 32 transputers. Empirical results indicate that — due to 作者: 膠狀 時間: 2025-3-31 06:32 作者: 含糊其辭 時間: 2025-3-31 11:14
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263263.jpg作者: 紡織品 時間: 2025-3-31 16:27 作者: manifestation 時間: 2025-3-31 18:21
0302-9743 andefficient algorithms in1986 with the aim of encouraging collaborativeresearch onalgorithms. For a period of five years about adozenprojects were funded with an emphasis on algorithms and datastructures for geometric problems, on the one hand, andparallel and distributed algorithms, on the other.作者: Grandstand 時間: 2025-4-1 01:13
Cognitive Packets in Large Virtual Networksmple perfect hashing schemes..We further survey recent results in a very important application area of the new hash functions, namely results on simulations of parallel shared memory machines on parallel machines that only can communicate via a distributed memory.作者: MAUVE 時間: 2025-4-1 04:18
https://doi.org/10.1007/978-1-4471-4594-3et of solutions. Both algorithms were implemented on a local memory multiprocessor system of 32 transputers. Empirical results indicate that — due to the problem‘s complexity — sophisticated heuristics are the only mean to get reasonable solutions for larger problem sizes.作者: KIN 時間: 2025-4-1 06:01
Computer and Information Sciences IIIs its slowness in the worst case. Finally, in the third strategy class presented the packets are split up into subpackets which are routed along the network in a pipelined fashion. Here the balancing is achieved by local reservation of communication channels. For several variants of this method worst-case configurations are discussed.
