標題: Titlebook: Algorithms and Computation; 26th International S Khaled Elbassioni,Kazuhisa Makino Conference proceedings 2015 Springer-Verlag Berlin Heide [打印本頁] 作者: GLOAT 時間: 2025-3-21 18:33
書目名稱Algorithms and Computation影響因子(影響力)
書目名稱Algorithms and Computation影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Computation被引頻次
書目名稱Algorithms and Computation被引頻次學(xué)科排名
書目名稱Algorithms and Computation年度引用
書目名稱Algorithms and Computation年度引用學(xué)科排名
書目名稱Algorithms and Computation讀者反饋
書目名稱Algorithms and Computation讀者反饋學(xué)科排名
作者: 種植,培養(yǎng) 時間: 2025-3-21 22:52
Competitive Local Routing with Constraintse if the straight line segment connecting them does not properly intersect any constraints. The constrained .-graph is constructed by partitioning the plane around each vertex into . disjoint cones with aperture ., and adding an edge to the ‘closest’ visible vertex in each cone. We consider how to r作者: myopia 時間: 2025-3-22 03:52 作者: Ambiguous 時間: 2025-3-22 07:26
How to Select the Top , Elements from Evolving Data? that the underlying total order evolves over time, and that the order can only be probed by pair-wise comparisons. It is assumed that at each time step, only one pair of elements can be compared. This assumption of restricted access is reasonable in the dynamic model, especially for massive data se作者: 出血 時間: 2025-3-22 09:05 作者: 地名詞典 時間: 2025-3-22 16:46 作者: Ancillary 時間: 2025-3-22 19:44 作者: gene-therapy 時間: 2025-3-22 23:01
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems-vertex undirected graph, with each edge colored with one of . colors. The goal is to find a subgraph on a minimum number of vertices which has one induced edge of each color. The problem is known to be NP-hard, and has an upper bound of . and a lower bound of . on its approximation ratio..We define作者: hardheaded 時間: 2025-3-23 03:11 作者: PALL 時間: 2025-3-23 07:16
The Secretary Problem with a Choice Functiongoal is to maximize the probability of choosing the best applicant. In this paper, we introduce the secretary problem with a choice function. The choice function represents the preference of the decision-maker. In this problem, the decision-maker hires some applicants, and the goal is to maximize th作者: 灰心喪氣 時間: 2025-3-23 11:50 作者: calorie 時間: 2025-3-23 15:19
Algorithmic Learning for Steganography: Proper Learning of ,-term DNF Formulas from Positive Samplesecurity requirements imply that the hypothesis should not contain false positives. We present such a learner for .-term DNF formulas for the uniform distribution and a generalization to .-bounded distributions. We briefly also describe how these results can be used to design a secure stegosystem.作者: Mercurial 時間: 2025-3-23 22:00
Algorithmic Learning for Steganography: Proper Learning of ,-term DNF Formulas from Positive Samplesecurity requirements imply that the hypothesis should not contain false positives. We present such a learner for .-term DNF formulas for the uniform distribution and a generalization to .-bounded distributions. We briefly also describe how these results can be used to design a secure stegosystem.作者: lymphoma 時間: 2025-3-24 00:34 作者: 債務(wù) 時間: 2025-3-24 04:02 作者: 展覽 時間: 2025-3-24 07:32
An Optimal Algorithm for Tiling the Plane with a Translated PolyominoWe give a .(.)-time algorithm for determining whether translations of a polyomino with . edges can tile the plane. The algorithm is also a .(.)-time algorithm for enumerating all regular tilings, and we prove that at most . such tilings exist.作者: Phonophobia 時間: 2025-3-24 10:42
On the Succinct Representation of Unlabeled PermutationsWe investigate the problem of succinctly representing an arbitrary unlabeled permutation ., so that . can be computed quickly for any . and any integer power .. We consider the problem in several scenarios:作者: Misgiving 時間: 2025-3-24 15:49
Khaled Elbassioni,Kazuhisa MakinoIncludes supplementary material: 作者: 帶子 時間: 2025-3-24 19:32
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153128.jpg作者: Rodent 時間: 2025-3-25 00:21 作者: humectant 時間: 2025-3-25 03:34
Zusammenfassung und Schlussbetrachtung,ecurity requirements imply that the hypothesis should not contain false positives. We present such a learner for .-term DNF formulas for the uniform distribution and a generalization to .-bounded distributions. We briefly also describe how these results can be used to design a secure stegosystem.作者: CORE 時間: 2025-3-25 10:33
https://doi.org/10.1007/978-3-662-48971-0combinatorial optimization; cryptography; online algorithms; parallel algorithms; quantum computing; algo作者: 該得 時間: 2025-3-25 14:38 作者: 淡紫色花 時間: 2025-3-25 18:53 作者: 鎮(zhèn)痛劑 時間: 2025-3-25 22:24
Andreas Maercker,Andrea B. Horne if the straight line segment connecting them does not properly intersect any constraints. The constrained .-graph is constructed by partitioning the plane around each vertex into . disjoint cones with aperture ., and adding an edge to the ‘closest’ visible vertex in each cone. We consider how to r作者: 變異 時間: 2025-3-26 03:18 作者: 勤勉 時間: 2025-3-26 07:46
Der Lebensrückblick in Therapie und Beratung that the underlying total order evolves over time, and that the order can only be probed by pair-wise comparisons. It is assumed that at each time step, only one pair of elements can be compared. This assumption of restricted access is reasonable in the dynamic model, especially for massive data se作者: 開始從未 時間: 2025-3-26 10:48 作者: Aids209 時間: 2025-3-26 14:27 作者: 租約 時間: 2025-3-26 19:32
https://doi.org/10.1007/978-3-642-57937-0 connected communication network with minimum total cost, where the cost of transmitting in range . is proportional to .. While this problem can be solved optimally in 1D, in higher dimensions it is known to be .-hard for any ...For the 1D version of the problem and ., we propose a new approach that作者: 沒有貧窮 時間: 2025-3-26 21:17
Der Lebenssinn der Industriegesellschaft-vertex undirected graph, with each edge colored with one of . colors. The goal is to find a subgraph on a minimum number of vertices which has one induced edge of each color. The problem is known to be NP-hard, and has an upper bound of . and a lower bound of . on its approximation ratio..We define作者: fibroblast 時間: 2025-3-27 01:54
https://doi.org/10.1007/978-3-322-88082-6ent sizes and fault costs. The strong .-hardness of its two important cases, the . (each page has unit fault cost) and the . (each page has the same fault cost as size) has been established. We prove that this already holds when page sizes are bounded by a?small constant: The bit and fault models ar作者: 推遲 時間: 2025-3-27 05:48
Zusammenfassung und Schlussbetrachtung,goal is to maximize the probability of choosing the best applicant. In this paper, we introduce the secretary problem with a choice function. The choice function represents the preference of the decision-maker. In this problem, the decision-maker hires some applicants, and the goal is to maximize th作者: 噱頭 時間: 2025-3-27 11:51 作者: Afflict 時間: 2025-3-27 14:36
Zusammenfassung und Schlussbetrachtung,ecurity requirements imply that the hypothesis should not contain false positives. We present such a learner for .-term DNF formulas for the uniform distribution and a generalization to .-bounded distributions. We briefly also describe how these results can be used to design a secure stegosystem.作者: 惡意 時間: 2025-3-27 20:41 作者: 劇毒 時間: 2025-3-28 00:39 作者: 偉大 時間: 2025-3-28 05:39
The Secretary Problem with a Choice Functionum size of the choice, and prove that this is the best possible. Moreover, for the non-path-independent case, we prove that the success probability goes to arbitrary small for any algorithm even if the maximum size of the choice is 2.作者: LATE 時間: 2025-3-28 06:19
The Benefit of Recombination in Noisy Evolutionary Searchficiently, regardless of the population size. Then we show that an evolutionary algorithm which does employ sexual recombination (the Compact Genetic Algorithm, short: cGA) can handle the noise using a graceful scaling of the population.作者: 友好 時間: 2025-3-28 12:30 作者: BUOY 時間: 2025-3-28 18:20 作者: 蓋他為秘密 時間: 2025-3-28 22:35 作者: 和平主義 時間: 2025-3-29 01:21
https://doi.org/10.1007/978-3-8350-5409-7ficiently, regardless of the population size. Then we show that an evolutionary algorithm which does employ sexual recombination (the Compact Genetic Algorithm, short: cGA) can handle the noise using a graceful scaling of the population.作者: Obedient 時間: 2025-3-29 04:03
Andreas Maercker,Andrea B. Hornpath has length at most 2 times the Euclidean distance between the source and destination. To the best of our knowledge, this is the first local routing algorithm in the constrained setting with guarantees on the path length.作者: 蛤肉 時間: 2025-3-29 08:59 作者: 失誤 時間: 2025-3-29 13:33
Competitive Local Routing with Constraintspath has length at most 2 times the Euclidean distance between the source and destination. To the best of our knowledge, this is the first local routing algorithm in the constrained setting with guarantees on the path length.作者: chandel 時間: 2025-3-29 17:31 作者: TEM 時間: 2025-3-29 20:55
0302-9743 ation, ISAAC 2015, held in Nagoya, Japan, inDecember 2015...The 65 revised full papers presented together with 3 invited talks were carefullyreviewed and selected from 180 submissions for inclusion in the book. The focusof the volume is on the following topics: computational geometry; datastructures作者: Insufficient 時間: 2025-3-30 01:37
Wolfgang J?nicke,Simon Forstmeier location queries in .. The running time includes the preprocessing time. Therefore, for ., our running time is only worse than the best possible bound by . per query, which is much smaller than the . query time offered by an worst-case optimal planar point location structure.作者: glisten 時間: 2025-3-30 04:40
Digitale Tools zum Lebensrückblick be some arbitrary constant. Let . be the size of the largest connected component of tetrahedra whose aspect ratios exceed .. There exists a constant . dependent on . but independent of . such that if ., the running time of our algorithm is polynomial in ., . and .. If ., the running time reduces to ..作者: PHAG 時間: 2025-3-30 10:31
Simon Forstmeier,Andreas Maerckern optimal search tree using 2-way comparisons remained open — poly-time algorithms were known only for restricted variants. We solve the general case, giving (i) an .-time algorithm and (ii) an .-time additive-3 approximation algorithm. For finding optimal ., we (iii) obtain a linear speedup and (iv) prove some previous work incorrect.作者: llibretto 時間: 2025-3-30 12:29
Adaptive Point Location in Planar Convex Subdivisions location queries in .. The running time includes the preprocessing time. Therefore, for ., our running time is only worse than the best possible bound by . per query, which is much smaller than the . query time offered by an worst-case optimal planar point location structure.作者: 是突襲 時間: 2025-3-30 17:58
Navigating Weighted Regions with Scattered Skinny Tetrahedra be some arbitrary constant. Let . be the size of the largest connected component of tetrahedra whose aspect ratios exceed .. There exists a constant . dependent on . but independent of . such that if ., the running time of our algorithm is polynomial in ., . and .. If ., the running time reduces to ..作者: 付出 時間: 2025-3-30 23:41
Optimal Search Trees with 2-Way Comparisonsn optimal search tree using 2-way comparisons remained open — poly-time algorithms were known only for restricted variants. We solve the general case, giving (i) an .-time algorithm and (ii) an .-time additive-3 approximation algorithm. For finding optimal ., we (iii) obtain a linear speedup and (iv) prove some previous work incorrect.
