標(biāo)題: Titlebook: Algorithms and Computation; 8th International Wo Sudebkumar Prasant Pal,Kunihiko Sadakane Conference proceedings 2014 Springer Internationa [打印本頁(yè)] 作者: Adentitious 時(shí)間: 2025-3-21 18:19
書目名稱Algorithms and Computation影響因子(影響力)
書目名稱Algorithms and Computation影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開(kāi)度
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Algorithms and Computation被引頻次
書目名稱Algorithms and Computation被引頻次學(xué)科排名
書目名稱Algorithms and Computation年度引用
書目名稱Algorithms and Computation年度引用學(xué)科排名
書目名稱Algorithms and Computation讀者反饋
書目名稱Algorithms and Computation讀者反饋學(xué)科排名
作者: Malcontent 時(shí)間: 2025-3-21 21:50 作者: 珊瑚 時(shí)間: 2025-3-22 01:35 作者: 中子 時(shí)間: 2025-3-22 07:29
Generalized Class Cover Problem with Axis-Parallel Stripsassociated positive penalty for every misclassified point. We study five different variants of generalized class cover problem with axis-parallel strips and half-strips in the plane, thus extending similar work by Bereg et al. [2] on the class cover problem. For each of these variants, we either sho作者: Aerophagia 時(shí)間: 2025-3-22 10:53
Top-, Manhattan Spatial Skyline Queriesinformation systems and also computational geometry for many years. In this context, we study the retrieval of relevant points with respect to a query and a scoring function: let . and . be point sets in the plane, the . of . with respect to . consists of points . for which no other point of . is cl作者: Cumbersome 時(shí)間: 2025-3-22 13:25
On Generalized Planar Skyline and Convex Hull Range Querieslem. Our solutions are in the pointer machine model, for orthogonal range queries on a static point set. We solve the planar range maxima problem for two-sided, three-sided and four-sided queries. We achieve a query time of .(log.?+?.) using .(.) space for the two-sided case, where . denotes the num作者: nonplus 時(shí)間: 2025-3-22 17:29
Boundary Labeling with Flexible Label Positionsconventional setting, the labels along a side of the map form a single stack of labels in which labels are placed consecutively one by one in a sequence, and the two end sides of a label stack must respect the sides of the map. However, such a setting may be in conflict with generation of a better b作者: Scintillations 時(shí)間: 2025-3-22 22:38 作者: 或者發(fā)神韻 時(shí)間: 2025-3-23 02:20 作者: 紀(jì)念 時(shí)間: 2025-3-23 08:44
Simple Linear Comparison of Strings in ,-Order.-comparison of two finite strings. In comparison with the previous algorithm in the literature, our algorithm is both conceptually simpler, based on recording letter positions in increasing order, and more straightforward to implement, requiring only linked lists.作者: 危機(jī) 時(shí)間: 2025-3-23 12:55
SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search in many application domains, e.g., in cheminformatics. Asymptotically optimal SAHN clustering algorithms are known for arbitrary dissimilarity measures, but their quadratic time and space complexity even in the best case still limits the applicability to small data sets. We present a new pivot base作者: prolate 時(shí)間: 2025-3-23 14:44
Optimal Serial Broadcast of Successive Chunksto exactly one node at a time. This models the delivery of a video stream in a Peer-to-Peer (P2P) network in which chunks of a stream are successively given by the media server. We propose two schemes for solving the problem. The first scheme attains an optimum broadcast time of . steps, where . is 作者: 破布 時(shí)間: 2025-3-23 19:30 作者: 兵團(tuán) 時(shí)間: 2025-3-24 01:03
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity tree with positive edge lengths and uniform edge capacity, and the vertex supply which is nonnegative value is unknown but only the interval of supply is known. A particular realization of supply to each vertex is called a scenario. Under any scenario, the cost of a sink location . is defined as th作者: LUMEN 時(shí)間: 2025-3-24 06:14
On a Class of Covering Problems with Variable Capacities in Wireless Networkshe power levels of the base stations. We model the interference due to the increased power usage resulting in greater serving radius, as capacities that are non-increasing with respect to the covering radius. We consider three models. In the first model the location of the base stations and the clie作者: 珠寶 時(shí)間: 2025-3-24 06:50 作者: obstruct 時(shí)間: 2025-3-24 13:13
Some Results on Point Visibility Graphstate new properties of point visibility graphs along with some known properties that are important in understanding point visibility graphs. For planar point visibility graphs, we present a complete characterization which leads to a linear time recognition and reconstruction algorithm.作者: squander 時(shí)間: 2025-3-24 18:51 作者: 上腭 時(shí)間: 2025-3-24 19:33
I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs(.)) on the number of I/Os is shown for the problem, where . is the number of vertices and . is the number of edges. Then the following are presented, for .?=?Ω(..), (1)?a minimum cut algorithm that uses . I/Os; here MSF(.,.) is the number of I/Os needed to compute a minimum spanning tree of the gra作者: 放大 時(shí)間: 2025-3-25 00:34 作者: CRACY 時(shí)間: 2025-3-25 06:40 作者: 向下五度才偏 時(shí)間: 2025-3-25 10:01
elektronische datenverarbeitung.-comparison of two finite strings. In comparison with the previous algorithm in the literature, our algorithm is both conceptually simpler, based on recording letter positions in increasing order, and more straightforward to implement, requiring only linked lists.作者: 不透明 時(shí)間: 2025-3-25 13:34
https://doi.org/10.1007/978-3-658-40417-8tate new properties of point visibility graphs along with some known properties that are important in understanding point visibility graphs. For planar point visibility graphs, we present a complete characterization which leads to a linear time recognition and reconstruction algorithm.作者: 頭腦冷靜 時(shí)間: 2025-3-25 17:26
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153130.jpg作者: 束以馬具 時(shí)間: 2025-3-25 20:15
The Happy End Theorem and Related Resultson a line, contains . points which are vertices of a convex .-gon. It is a classical result both in combinatorial geometry and in Ramsey theory. Sometimes it is called the Happy End(ing) Theorem (a name given by Paul Erd?s), since George Szekeres later married Eszter Klein who proposed a question answered by the theorem.作者: Implicit 時(shí)間: 2025-3-26 03:38 作者: BANAL 時(shí)間: 2025-3-26 07:45
Some Results on Point Visibility Graphstate new properties of point visibility graphs along with some known properties that are important in understanding point visibility graphs. For planar point visibility graphs, we present a complete characterization which leads to a linear time recognition and reconstruction algorithm.作者: ASSET 時(shí)間: 2025-3-26 10:10
https://doi.org/10.1007/978-3-658-41473-3brium prices. Chapters 5 and 6 of [NRTV07] are an excellent introduction into the algorithmic theory of market models. In Walrus’ model, each person comes to the market with a set of goods and a utility function for bundles of goods. At a set of prices, a person will only buy goods that give him max作者: 浮夸 時(shí)間: 2025-3-26 14:29
https://doi.org/10.1007/978-3-658-41473-3problems, some new, some a couple of decades old, and others open for up to a half century. The first is that of sorting and the Ford-Johnson Merge-Insertion algorithm [8] of 1959, which remains the “best”, at least for the “best and worst” values of n. Is it optimal, or are its extra .028.. . or so作者: Canyon 時(shí)間: 2025-3-26 18:02
https://doi.org/10.1007/978-3-476-02755-9on a line, contains . points which are vertices of a convex .-gon. It is a classical result both in combinatorial geometry and in Ramsey theory. Sometimes it is called the Happy End(ing) Theorem (a name given by Paul Erd?s), since George Szekeres later married Eszter Klein who proposed a question an作者: TIA742 時(shí)間: 2025-3-27 00:35
,Die Herkunft des Wortes ?libertin?,associated positive penalty for every misclassified point. We study five different variants of generalized class cover problem with axis-parallel strips and half-strips in the plane, thus extending similar work by Bereg et al. [2] on the class cover problem. For each of these variants, we either sho作者: 震驚 時(shí)間: 2025-3-27 02:26
Die Methoden der Liquorentnahme,information systems and also computational geometry for many years. In this context, we study the retrieval of relevant points with respect to a query and a scoring function: let . and . be point sets in the plane, the . of . with respect to . consists of points . for which no other point of . is cl作者: 愚蠢人 時(shí)間: 2025-3-27 08:14
Die Methoden der Liquorentnahme,lem. Our solutions are in the pointer machine model, for orthogonal range queries on a static point set. We solve the planar range maxima problem for two-sided, three-sided and four-sided queries. We achieve a query time of .(log.?+?.) using .(.) space for the two-sided case, where . denotes the num作者: 正論 時(shí)間: 2025-3-27 12:14
,Der Lochstreifen als Informationstr?ger,conventional setting, the labels along a side of the map form a single stack of labels in which labels are placed consecutively one by one in a sequence, and the two end sides of a label stack must respect the sides of the map. However, such a setting may be in conflict with generation of a better b作者: 蹣跚 時(shí)間: 2025-3-27 16:19 作者: 移動(dòng) 時(shí)間: 2025-3-27 18:25 作者: MOTTO 時(shí)間: 2025-3-28 00:47 作者: 玉米棒子 時(shí)間: 2025-3-28 05:28
Gunnar D. Hansson,Lukas Dettwiler in many application domains, e.g., in cheminformatics. Asymptotically optimal SAHN clustering algorithms are known for arbitrary dissimilarity measures, but their quadratic time and space complexity even in the best case still limits the applicability to small data sets. We present a new pivot base作者: llibretto 時(shí)間: 2025-3-28 09:04 作者: CAGE 時(shí)間: 2025-3-28 14:28 作者: Armory 時(shí)間: 2025-3-28 17:36 作者: 似少年 時(shí)間: 2025-3-28 21:43 作者: HILAR 時(shí)間: 2025-3-29 02:00
https://doi.org/10.1007/978-3-658-40417-8blem is to find an outer-connected dominating set of minimum cardinality of the input graph .. Given a positive integer . and a graph .?=?(.,.), the . problem is to decide whether . has an outer-connected dominating set of cardinality at most .. The . problem is known to be NP-complete for bipartite作者: 帳單 時(shí)間: 2025-3-29 05:10
https://doi.org/10.1007/978-3-658-40417-8tate new properties of point visibility graphs along with some known properties that are important in understanding point visibility graphs. For planar point visibility graphs, we present a complete characterization which leads to a linear time recognition and reconstruction algorithm.作者: Occlusion 時(shí)間: 2025-3-29 08:29
https://doi.org/10.1007/978-3-658-40417-8ow the problem domain and compute the bottleneck of the entire network in .(.log.) time, where . and . are the number of edges and vertices in the graph, respectively. Secondly we enlarge the domain and compute the shortest paths for all possible bottleneck amounts. We present a combinatorial algori作者: Horizon 時(shí)間: 2025-3-29 11:50 作者: 極端的正確性 時(shí)間: 2025-3-29 18:11 作者: Palter 時(shí)間: 2025-3-29 22:36 作者: 虛度 時(shí)間: 2025-3-30 03:33 作者: 的’ 時(shí)間: 2025-3-30 08:06
0302-9743 e papers are organized in topical sections on computational geometry, algorithms and approximations, distributed computing and networks, graph algorithms, complexity and bounds, and graph embeddings and drawings..978-3-319-04656-3978-3-319-04657-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Humble 時(shí)間: 2025-3-30 08:35 作者: 傻 時(shí)間: 2025-3-30 14:59
https://doi.org/10.1007/978-3-662-41232-9his problem generalizing the crown decomposition technique [2]. Using our global rule, we achieve a kernel with size bounded by 2(.???.) for the .-.-Packing with .-Overlap problem when .?=?.???2 and . is a clique of size ..作者: 感激小女 時(shí)間: 2025-3-30 20:31 作者: Analogy 時(shí)間: 2025-3-30 21:13 作者: Instrumental 時(shí)間: 2025-3-31 04:44
Gunnar D. Hansson,Lukas Dettwileres, as it needs only a linear number of exact distance computations. In extensive experimental evaluations on real-world and synthetic data sets, we compare our approach to exact state-of-the-art SAHN algorithms in terms of quality and running time. The evaluations show a subquadratic running time in practice and a very low memory footprint.作者: CALL 時(shí)間: 2025-3-31 08:56
https://doi.org/10.1007/978-3-658-40417-8gorithm computes a minimum cut in .(. log. (MSF(.,.)?+?Sort(.))) I/Os. (2)?a randomized algorithm that computes minimum cut with high probability in . I/Os. (3)?a (2?+?.)-minimum cut algorithm that requires .((./.) MSF(.,.)) I/Os and performs better on sparse graphs than our exact minimum cut algorithm.作者: cataract 時(shí)間: 2025-3-31 11:28
Algorithms for Equilibrium Prices in Linear Market Modelsmes with a predetermined amount of money. Market clearing prices are also called .. Walrus and Fisher took it for granted that equilibrium prices exist. Fisher designed a hydromechanical computing machine that would compute the prices in a market with three buyers, three goods, and linear utilities [BS00].作者: Coeval 時(shí)間: 2025-3-31 17:25 作者: 恃強(qiáng)凌弱 時(shí)間: 2025-3-31 18:35 作者: infringe 時(shí)間: 2025-4-1 01:34
I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphsgorithm computes a minimum cut in .(. log. (MSF(.,.)?+?Sort(.))) I/Os. (2)?a randomized algorithm that computes minimum cut with high probability in . I/Os. (3)?a (2?+?.)-minimum cut algorithm that requires .((./.) MSF(.,.)) I/Os and performs better on sparse graphs than our exact minimum cut algorithm.作者: Left-Atrium 時(shí)間: 2025-4-1 03:41 作者: Introvert 時(shí)間: 2025-4-1 07:30 作者: Incisor 時(shí)間: 2025-4-1 13:10
,Die Herkunft des Wortes ?libertin?,ps and half-strips in the plane, thus extending similar work by Bereg et al. [2] on the class cover problem. For each of these variants, we either show that they are in P, or prove that they are NP-complete and give constant factor approximation algorithms.作者: Sigmoidoscopy 時(shí)間: 2025-4-1 16:05
