標(biāo)題: Titlebook: WALCOM: Algorithms and Computation; 7th International Wo Subir Kumar Ghosh,Takeshi Tokuyama Conference proceedings 2013 Springer-Verlag Ber [打印本頁] 作者: 吸收 時(shí)間: 2025-3-21 18:40
書目名稱WALCOM: Algorithms and Computation影響因子(影響力)
書目名稱WALCOM: Algorithms and Computation影響因子(影響力)學(xué)科排名
書目名稱WALCOM: Algorithms and Computation網(wǎng)絡(luò)公開度
書目名稱WALCOM: Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱WALCOM: Algorithms and Computation被引頻次
書目名稱WALCOM: Algorithms and Computation被引頻次學(xué)科排名
書目名稱WALCOM: Algorithms and Computation年度引用
書目名稱WALCOM: Algorithms and Computation年度引用學(xué)科排名
書目名稱WALCOM: Algorithms and Computation讀者反饋
書目名稱WALCOM: Algorithms and Computation讀者反饋學(xué)科排名
作者: FUSC 時(shí)間: 2025-3-21 21:09
Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographsur main result. As a by-product of our proofs, we obtain a min-max theorem, which is worth of interest in itself, stating equality between the rank of a tree and the minimum height its path partitions.作者: 公共汽車 時(shí)間: 2025-3-22 02:00
0302-9743 national Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algori作者: 自負(fù)的人 時(shí)間: 2025-3-22 08:13
Shared-Memory Parallel Frontier-Based Searche-based approach performs best and achieves seven-fold speedup with 32 CPU cores, while the others suffer from severe synchronization overhead due to locks, resulting in performance saturation with more than 12 cores.作者: amenity 時(shí)間: 2025-3-22 12:09 作者: 運(yùn)動(dòng)性 時(shí)間: 2025-3-22 16:20 作者: 全等 時(shí)間: 2025-3-22 19:37 作者: 高原 時(shí)間: 2025-3-23 00:13 作者: NATAL 時(shí)間: 2025-3-23 02:32
A Competitive Strategy for Distance-Aware Online Shape Allocationicular, the problem of determining the “optimal shape of a city”, i.e., allocating a ... has been studied, both in a continuous and a discrete setting. We present an online strategy, based on an analysis of space-filling curves; for continuous shapes, we prove a factor of 1.8092, and 1.7848 for discrete point sets.作者: Interferons 時(shí)間: 2025-3-23 07:53
A Competitive Strategy for Distance-Aware Online Shape Allocationicular, the problem of determining the “optimal shape of a city”, i.e., allocating a ... has been studied, both in a continuous and a discrete setting. We present an online strategy, based on an analysis of space-filling curves; for continuous shapes, we prove a factor of 1.8092, and 1.7848 for discrete point sets.作者: 不易燃 時(shí)間: 2025-3-23 12:21 作者: 側(cè)面左右 時(shí)間: 2025-3-23 17:24
Base Location Problems for Base-Monotone Regionsl grid. We also present an .(..)-time 2-approximation algorithm for this problem. We then study two related problems, the . base-segment problem and the quad-decomposition problem, and present some complexity results for them.作者: Aqueous-Humor 時(shí)間: 2025-3-23 21:23
Exact and Approximation Algorithms for Densest ,-Subgraphiders as parameter the treewidth of the input graph and uses exponential space, while the second is parameterized by the size of the minimum vertex cover and uses polynomial space. Finally, we propose several approximation algorithms running in moderately exponential or parameterized time.作者: scotoma 時(shí)間: 2025-3-23 22:32
Exact and Approximation Algorithms for Densest ,-Subgraphiders as parameter the treewidth of the input graph and uses exponential space, while the second is parameterized by the size of the minimum vertex cover and uses polynomial space. Finally, we propose several approximation algorithms running in moderately exponential or parameterized time.作者: 課程 時(shí)間: 2025-3-24 02:29
Approximation Algorithms for the Partition Vertex Cover Problemhm is based on a novel LP relaxation for this problem. This LP relaxation is obtained by adding knapsack cover inequalities to a natural LP relaxation of the problem. We show that this LP has integrality gap of .(log.), where . is the number of sets in the partition of the edge set. We also extend our result to more general settings.作者: 客觀 時(shí)間: 2025-3-24 09:17 作者: MITE 時(shí)間: 2025-3-24 10:59 作者: 用肘 時(shí)間: 2025-3-24 17:11 作者: micronized 時(shí)間: 2025-3-24 22:48
Adversarial Prediction: Lossless Predictors and Fractal Like Adversariesis trying to predict the future bit(s) from the past bits. This is like gambling on the future bits which involves the risk of making mistakes while shooting for profit from right predictions. Say the algorithm gets a payoff of 1 on a right prediction and ??1 on wrong predictions (and is also make f作者: 控訴 時(shí)間: 2025-3-25 01:41
Adversarial Prediction: Lossless Predictors and Fractal Like Adversariesis trying to predict the future bit(s) from the past bits. This is like gambling on the future bits which involves the risk of making mistakes while shooting for profit from right predictions. Say the algorithm gets a payoff of 1 on a right prediction and ??1 on wrong predictions (and is also make f作者: Eviction 時(shí)間: 2025-3-25 07:01 作者: Parley 時(shí)間: 2025-3-25 08:54
A Novel Efficient Approach for Solving the Art Gallery ProblemThe AGP is known to be NP-hard even for very restricted special cases. This paper describes a primal-dual algorithm based on continuous optimization techniques for solving large-scale instances of the Art Gallery Problem. More precisely, the algorithm is a combination of methods from computational g作者: 青春期 時(shí)間: 2025-3-25 14:39
Fixed-Orientation Equilateral Triangle Matching of Point Setsd only if there is some . containing both . and . but no other points from .. We study ..(.) graphs where ? is the class of downward equilateral triangles (ie. equilateral triangles with one of their sides parallel to the .-axis and the corner opposite to this side below that side). For point sets i作者: FRET 時(shí)間: 2025-3-25 17:04 作者: airborne 時(shí)間: 2025-3-25 21:08
Online Exploration and Triangulation in Orthogonal Polygonal Regionsygonal region ., the Online Minimum Relay Triangulation Problem (OMRTP) asks for an exploration strategy that maintains a triangulation with limited edge length and achieves a minimum number of robots (relays), such that the triangulation covers .; for a given number . of robots, the Online Maximum 作者: OFF 時(shí)間: 2025-3-26 02:27 作者: 意外的成功 時(shí)間: 2025-3-26 04:25
A Competitive Strategy for Distance-Aware Online Shape Allocationon .. of previously unassigned area .. in .. The objective is to make these regions compact in a distance-aware sense: minimize the maximum (normalized) average Manhattan distance between points from the same set ... Related location problems have received a considerable amount of attention; in part作者: 不如屎殼郎 時(shí)間: 2025-3-26 10:03
A Competitive Strategy for Distance-Aware Online Shape Allocationon .. of previously unassigned area .. in .. The objective is to make these regions compact in a distance-aware sense: minimize the maximum (normalized) average Manhattan distance between points from the same set ... Related location problems have received a considerable amount of attention; in part作者: GORGE 時(shí)間: 2025-3-26 13:54
Base Location Problems for Base-Monotone Regionsn pixel grid and baselines, one can compute in polynomial time a maximum-weight region that can be decomposed into disjoint base-monotone regions [Chun et al. ISAAC 2009]. We continue this line of research and show the NP-hardness of the problem of optimally locating . baselines in a given . ×. pixe作者: circumvent 時(shí)間: 2025-3-26 18:18
Base Location Problems for Base-Monotone Regionsn pixel grid and baselines, one can compute in polynomial time a maximum-weight region that can be decomposed into disjoint base-monotone regions [Chun et al. ISAAC 2009]. We continue this line of research and show the NP-hardness of the problem of optimally locating . baselines in a given . ×. pixe作者: 明智的人 時(shí)間: 2025-3-26 22:43
Counting Maximal Points in a Query Orthogonal Rectangle problem has been previously studied in [3]and [5]. To the best of our knowledge, this is the first sub-logarithmic query time solution for the problem. Our model of computation is the word RAM with word size of Θ(log.) bits.作者: Outspoken 時(shí)間: 2025-3-27 01:40 作者: 許可 時(shí)間: 2025-3-27 06:04 作者: BLAND 時(shí)間: 2025-3-27 13:15
Voronoi Game on Graphscing their facilities. The objective of each player is to maximize the region occupied on the underlying space. In this paper we consider one round . with two players. Here the underlying space is a road network, which is modeled by a graph embedded on ?.. In this game each of the players places a s作者: 昆蟲 時(shí)間: 2025-3-27 17:00 作者: Foment 時(shí)間: 2025-3-27 20:31 作者: magnanimity 時(shí)間: 2025-3-27 22:22 作者: 斗志 時(shí)間: 2025-3-28 02:16 作者: Hallowed 時(shí)間: 2025-3-28 09:19
Exact and Approximation Algorithms for Densest ,-Subgraphrch among the subsets of . vertices of . one inducing a maximum number of edges. In this paper, we present algorithms for finding exact solutions of .-SUBGRAPH improving the trivial exponential time complexity of?..(2.) and using polynomial space. Two?FPT algorithms are also proposed; the first cons作者: Canary 時(shí)間: 2025-3-28 10:25 作者: Vasoconstrictor 時(shí)間: 2025-3-28 14:46
Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs of cographs is unbounded but is always dominated by .(log.), where . is the number of vertices of the graph. And we prove that this bound is tight in the sense that there exists a family of cographs on . vertices whose contiguity is Ω(log.). In addition to these results on the worst-case contiguity作者: 評論性 時(shí)間: 2025-3-28 22:11
Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs of cographs is unbounded but is always dominated by .(log.), where . is the number of vertices of the graph. And we prove that this bound is tight in the sense that there exists a family of cographs on . vertices whose contiguity is Ω(log.). In addition to these results on the worst-case contiguity作者: 颶風(fēng) 時(shí)間: 2025-3-29 00:44 作者: anthropologist 時(shí)間: 2025-3-29 06:59 作者: LINES 時(shí)間: 2025-3-29 10:30 作者: Exuberance 時(shí)間: 2025-3-29 13:55
Daemon Conversions in Distributed Self-stabilizing Algorithmsare several daemons, and several possible attributes of those daemons, and it is customary to detail the choice of daemon one is using in designing a specific self-stabilizing algorithm. The choice of daemon plays an important role in designing self-stabilizing algorithm in terms of correctness and 作者: 假設(shè) 時(shí)間: 2025-3-29 17:45
Broadcasting in Conflict-Aware Multi-channel Networksct-aware multi-channel networks. These networks can be modeled as undirected graphs in which each edge is labeled with a set of available channels to transmit data between its endpoints. Each node can send and receive data through any channel on its incident edges, with the restriction that it canno作者: archetype 時(shí)間: 2025-3-29 23:05
Broadcasting in Conflict-Aware Multi-channel Networksct-aware multi-channel networks. These networks can be modeled as undirected graphs in which each edge is labeled with a set of available channels to transmit data between its endpoints. Each node can send and receive data through any channel on its incident edges, with the restriction that it canno作者: 儲(chǔ)備 時(shí)間: 2025-3-30 00:11 作者: trigger 時(shí)間: 2025-3-30 05:16 作者: 易碎 時(shí)間: 2025-3-30 08:22 作者: Arthritis 時(shí)間: 2025-3-30 12:41 作者: 謙卑 時(shí)間: 2025-3-30 18:35 作者: conference 時(shí)間: 2025-3-30 21:22
Voronoi Game on Graphsnstant number of facilities and provided an algorithm for the same. Next we have proved that finding the optimal placement of . facilities by Player 2 is .-hard where . is given. Lastly we presented a 1.58 factor approximation algorithm for the above mentioned problem.作者: 挑剔為人 時(shí)間: 2025-3-31 00:57
Voronoi Game on Graphsnstant number of facilities and provided an algorithm for the same. Next we have proved that finding the optimal placement of . facilities by Player 2 is .-hard where . is given. Lastly we presented a 1.58 factor approximation algorithm for the above mentioned problem.作者: Communal 時(shí)間: 2025-3-31 06:49 作者: Allowance 時(shí)間: 2025-3-31 11:30
Approximation Schemes for Covering and Packingmportant problem where one has to find a minimum-cardinality subset of a given set of disks (of varying radii) that covers a given set of points, and apply it to a class cover problem (studied in [3]) to obtain an improved solution.作者: 仔細(xì)檢查 時(shí)間: 2025-3-31 14:14
Daemon Conversions in Distributed Self-stabilizing Algorithmsm to any other daemon when needed. We give the first (full) proof that, provided there are IDs, any algorithm that self-stabilizes only under a fair central daemon can be converted to one that self-stabilizes under an unfair read/write daemon.作者: gentle 時(shí)間: 2025-3-31 18:09 作者: tackle 時(shí)間: 2025-4-1 00:28
Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and ,-Planar GraphsWe consider the question whether the edges of a graph can be partitioned into a set of triangles. We propose a linear-time algorithm to partition the edges of a planar graph into triangles. We also obtain a polynomial-time algorithm for toroidal graphs. On the other hand, we show that it is NP-complete for .-planar graphs, where .?≥?8.作者: 東西 時(shí)間: 2025-4-1 02:42
Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and ,-Planar GraphsWe consider the question whether the edges of a graph can be partitioned into a set of triangles. We propose a linear-time algorithm to partition the edges of a planar graph into triangles. We also obtain a polynomial-time algorithm for toroidal graphs. On the other hand, we show that it is NP-complete for .-planar graphs, where .?≥?8.作者: 遭受 時(shí)間: 2025-4-1 07:04
Subir Kumar Ghosh,Takeshi TokuyamaState-of-the-art research.Fast-track conference proceedings.Unique visibility作者: interference 時(shí)間: 2025-4-1 11:07
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/w/image/1020031.jpg作者: 憤慨一下 時(shí)間: 2025-4-1 15:44
https://doi.org/10.1007/978-3-642-36065-7competitive analysis; error correction; linear programming; parallelization; space-filling curves; algori作者: 過分自信 時(shí)間: 2025-4-1 19:16
978-3-642-36064-0Springer-Verlag Berlin Heidelberg 2013作者: 壓艙物 時(shí)間: 2025-4-1 22:43
WALCOM: Algorithms and Computation978-3-642-36065-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 先驅(qū) 時(shí)間: 2025-4-2 03:20 作者: 口訣 時(shí)間: 2025-4-2 10:01
Counting Maximal Points in a Query Orthogonal Rectangle problem has been previously studied in [3]and [5]. To the best of our knowledge, this is the first sub-logarithmic query time solution for the problem. Our model of computation is the word RAM with word size of Θ(log.) bits.作者: 夾克怕包裹 時(shí)間: 2025-4-2 14:15
Conference proceedings 2013 in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing.作者: 水汽 時(shí)間: 2025-4-2 18:34
in den Bereichen Konstruktion und Arbeitsvorbereitung Test- und Prüffunktionen eingesetzt, die jedoch Unsicherheiten belassen, da in heutigen Realisierungen aus Kostengründen die Algorithmen proze?naher Steuerungsger?te nicht genügend einbezogen und die Auswirkungen auf die Maschine nicht umfassend 作者: SNEER 時(shí)間: 2025-4-2 22:33 作者: visceral-fat 時(shí)間: 2025-4-3 00:02
Rina Panigrahynciples for the survival of implants when reconstructing the edentulous maxillae using the zygoma implant...: Comprehensive search of studies published from 1983 to December 2015 listed in the PubMed/MEDLINE databases was performed. Relevant studies were selected according to predetermined inclusion作者: Humble 時(shí)間: 2025-4-3 03:46 作者: 協(xié)奏曲 時(shí)間: 2025-4-3 11:26 作者: Outwit 時(shí)間: 2025-4-3 16:02
Jasine Babu,Ahmad Biniaz,Anil Maheshwari,Michiel Smid text. The story deployed elements and processes associated with several genres, including the espionage thriller, the comedy of manners, and the romantic comedy. For those intent on appreciating the story specifically as a Greene novel, many of the semantic elements from his earlier work reappeared
