標題: Titlebook: WALCOM: Algorithms and Computation; 12th International C M. Sohel Rahman,Wing-Kin Sung,Ryuhei Uehara Conference proceedings 2018 Springer I [打印本頁] 作者: 徽章 時間: 2025-3-21 16:42
書目名稱WALCOM: Algorithms and Computation影響因子(影響力)
書目名稱WALCOM: Algorithms and Computation影響因子(影響力)學科排名
書目名稱WALCOM: Algorithms and Computation網絡公開度
書目名稱WALCOM: Algorithms and Computation網絡公開度學科排名
書目名稱WALCOM: Algorithms and Computation被引頻次
書目名稱WALCOM: Algorithms and Computation被引頻次學科排名
書目名稱WALCOM: Algorithms and Computation年度引用
書目名稱WALCOM: Algorithms and Computation年度引用學科排名
書目名稱WALCOM: Algorithms and Computation讀者反饋
書目名稱WALCOM: Algorithms and Computation讀者反饋學科排名
作者: evanescent 時間: 2025-3-21 20:51
Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph,ill be as small as possible. The existing protocol, called the st-flow protocol, achieves this, but the specific probability that Eve knows the generated secret key is unknown. In this study, we answer this problem by showing the exact leak probability as a polynomial in . for any number . of players.作者: indecipherable 時間: 2025-3-22 03:48
Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph,ill be as small as possible. The existing protocol, called the st-flow protocol, achieves this, but the specific probability that Eve knows the generated secret key is unknown. In this study, we answer this problem by showing the exact leak probability as a polynomial in . for any number . of players.作者: synovitis 時間: 2025-3-22 08:34
Boosting over Non-deterministic ZDDs,generalization of the ZDD by incorporating non-determinism. For the learning algorithm to be employed, we consider boosting algorithm called AdaBoost. and its precursor AdaBoost. In this work, we give efficient implementations of the boosting algorithms whose running times (per iteration) are linear in the size of the given ZDD.作者: 分離 時間: 2025-3-22 12:46 作者: CBC471 時間: 2025-3-22 14:36
A Simple Algorithm for r-gatherings on the Line,d . are on the line an . time algorithm and an . time algorithm to solve the .-gathering problem are known. In this paper we give a simple . time algorithm to solve the .-gathering problem. Since in typical case . holds our new algorithm is faster than the known algorithms.作者: bleach 時間: 2025-3-22 19:21 作者: Cosmopolitan 時間: 2025-3-23 00:09 作者: otic-capsule 時間: 2025-3-23 03:38
Faster Network Algorithms Based on Graph Decomposition,the graph, say?.. Our algorithms run faster than known algorithms if . is small. The maximum flow problem can be solved in . time, which is faster than the best known . algorithm [Orlin 2013] if ., where . and . are the numbers of vertices and edges, respectively.作者: reception 時間: 2025-3-23 07:15
Two New Schemes in the Bitprobe Model,ments using four queries in the non-adaptive bitprobe model. The previous scheme to store such a configuration was a non-explicit scheme due to Alon and Fiege?[.], and we provide an explicit scheme for the same.作者: OGLE 時間: 2025-3-23 13:47 作者: absolve 時間: 2025-3-23 16:24 作者: 謙虛的人 時間: 2025-3-23 19:26 作者: Nibble 時間: 2025-3-24 01:42
Online Facility Assignment,mers appear anywhere on the line. We describe a greedy algorithm with competitive ratio 4|.| and another one with competitive ratio |.|. Finally, we consider a variant in which the facilities are placed on the vertices of a graph and two algorithms in that setting.作者: Chivalrous 時間: 2025-3-24 06:09
Online Facility Assignment,mers appear anywhere on the line. We describe a greedy algorithm with competitive ratio 4|.| and another one with competitive ratio |.|. Finally, we consider a variant in which the facilities are placed on the vertices of a graph and two algorithms in that setting.作者: amplitude 時間: 2025-3-24 10:03 作者: 惹人反感 時間: 2025-3-24 11:50
Approximating Partially Bounded Degree Deletion on Directed Graphs,ed within ., and (2) although it becomes NP-hard to approximate PBDD better than . (even on . graphs) once unbounded vertices are allowed, it can be within . when only in-degrees (and none of out-degrees) are partially bounded by ..作者: KIN 時間: 2025-3-24 15:47 作者: Ebct207 時間: 2025-3-24 21:41 作者: 間諜活動 時間: 2025-3-25 01:34 作者: configuration 時間: 2025-3-25 05:59
A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison,our algorithm with the state of the art algorithms and the results are found to be excellent. In particular, our algorithm runs almost twice as fast than the state of the art. Much of the efficiency of our algorithm can be attributed to its filters that are effective but extremely simple and lightweight.作者: 擔心 時間: 2025-3-25 07:33
FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models, One of them counts the number of Eulerian orientations for a general graph in . time and . memory consumption, and the other calculates the partition function of a general ice-type model for a 4-regular graph in . time and . memory consumption where, for an input graph, . is the carving-width and . is the size of the vertex set.作者: 政府 時間: 2025-3-25 12:38 作者: angina-pectoris 時間: 2025-3-25 17:43 作者: finite 時間: 2025-3-25 22:29 作者: 難聽的聲音 時間: 2025-3-26 03:34
Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph,ependently with a fixed probability . (and, thus, is perfectly secure with a probability of .). Using these pre-shared, possibly leaked keys, we want two designated players to share a common one-bit secret key in cooperation with other players so that Eve’s knowledge about the generated secret key w作者: essential-fats 時間: 2025-3-26 06:22 作者: 江湖騙子 時間: 2025-3-26 09:16
Approximating Partially Bounded Degree Deletion on Directed Graphs,y remaining vertex . is no larger than .(.). It is a classic problem in graph theory and various results have been obtained including an approximation ratio of .?[.], where . is the maximum degree bound..This paper considers BDD on . graphs containing . vertices, which we call .. Despite such a natu作者: 行為 時間: 2025-3-26 13:22
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs,to enumerate only non-isomorphic graphs in a graph class. Applying this framework to the classes of interval graphs and permutation graphs, we give efficient enumeration algorithms for these graph classes such that each element in the class is output in a polynomial time delay. The experimental resu作者: Sedative 時間: 2025-3-26 17:22 作者: macrophage 時間: 2025-3-26 21:11
Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph,ependently with a fixed probability . (and, thus, is perfectly secure with a probability of .). Using these pre-shared, possibly leaked keys, we want two designated players to share a common one-bit secret key in cooperation with other players so that Eve’s knowledge about the generated secret key w作者: 適宜 時間: 2025-3-27 01:26 作者: 發(fā)怨言 時間: 2025-3-27 06:38
Approximating Partially Bounded Degree Deletion on Directed Graphs,y remaining vertex . is no larger than .(.). It is a classic problem in graph theory and various results have been obtained including an approximation ratio of .?[.], where . is the maximum degree bound..This paper considers BDD on . graphs containing . vertices, which we call .. Despite such a natu作者: 軌道 時間: 2025-3-27 13:07 作者: 跳動 時間: 2025-3-27 16:09 作者: 希望 時間: 2025-3-27 18:04 作者: 公共汽車 時間: 2025-3-28 01:11 作者: alcoholism 時間: 2025-3-28 04:15
Two New Schemes in the Bitprobe Model,e literature. One such scheme is to store three elements using two queries in the adaptive bitprobe model. Previously, the maximum number of elements that can be handled using two queries in the adaptive model is two, which is due to Radhakrishnan .?[.]. A corollary of this result is an explicit sch作者: BLOT 時間: 2025-3-28 06:32
Random Popular Matchings with Incomplete Preference Lists,e problem of matching every person with a unique?item. A?matching . is . if for any other matching ., the number of people who prefer . to . is not less than the number of those who prefer . to .. For given . and ., consider the probability of existence of a popular matching when each person’s prefe作者: 鍍金 時間: 2025-3-28 11:22
Faster Network Algorithms Based on Graph Decomposition,ata structures) from a given graph, then use them for solving the problems. A basic problem is an all pairs maximum flow problem, which consists of two stages. In a preprocessing stage we construct an index, and in a query stage we process the query using the index. We can solve all pairs maximum fl作者: JIBE 時間: 2025-3-28 15:17 作者: Triglyceride 時間: 2025-3-28 20:15
Random Popular Matchings with Incomplete Preference Lists,e problem of matching every person with a unique?item. A?matching . is . if for any other matching ., the number of people who prefer . to . is not less than the number of those who prefer . to .. For given . and ., consider the probability of existence of a popular matching when each person’s prefe作者: Delude 時間: 2025-3-28 23:41
Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian parallel identical machines and the second stage consists of a single machine processing jobs in the predefined batches. Motivated by applications where unloading and loading occur when the means of transportation are changed, the processing of the jobs, constituting a batch, can commence only if t作者: 靈敏 時間: 2025-3-29 05:16 作者: FIN 時間: 2025-3-29 08:11 作者: cancellous-bone 時間: 2025-3-29 13:43
A Note on Online Colouring Problems in Overlap Graphs and Their Complements,e intervals presented in non-decreasing order of the left endpoints. We consider the usual colouring problem as well as .-bounded colouring and the same problems in the complement graph. We also consider the case where at most . intervals of the same colour can include the same element. For these ve作者: painkillers 時間: 2025-3-29 16:14
Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement,s under the . model. We study the fundamental . problem of repositioning . robots on a plane so that each robot is visible to all others. We assume . under which a robot cannot see another robot if a third robot is positioned between them on the straight line connecting them. We are interested in . 作者: 憤怒歷史 時間: 2025-3-29 20:32
Online Facility Assignment,n an online manner. We must assign customer . to facility . before the next customer . arrives. The cost of this assignment is the distance between . and .. The total number of customers is at most |.|. and each customer must be assigned to a facility. The objective is to minimize the sum of all ass作者: MAOIS 時間: 2025-3-30 01:29 作者: Gossamer 時間: 2025-3-30 07:45 作者: chondromalacia 時間: 2025-3-30 09:12 作者: Bridle 時間: 2025-3-30 14:28
A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison,resting problem in many biological contexts. Traditional algorithms for measuring approximation in sequence comparison are based on the notions of distance or similarity, and are generally computed through sequence alignment techniques. The circular sequence comparison (CSC) problem consists in find作者: Parameter 時間: 2025-3-30 18:05
On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract), we address the problem of finding common motifs with gaps that are present in all strings of a finite set. We prove that the problem is NP-hard by reducing the multiple longest common subsequence (MLCS) problem to it. We also provide a branch and bound algorithm for MLCS and show how the algorithm 作者: Constituent 時間: 2025-3-30 22:15 作者: 冰雹 時間: 2025-3-31 01:20 作者: cavity 時間: 2025-3-31 07:31 作者: 鋼盔 時間: 2025-3-31 09:43 作者: ARCH 時間: 2025-3-31 17:16
Conference proceedings 2018ch 2018..The 22 full papers presented were?carefully reviewed and selected from 50 submissions. The papers cover diverse areas of algorithms and computation, such as approximation algorithms, computational geometry, combinatorial algorithms, computational biology, computational complexity, data stru作者: 高腳酒杯 時間: 2025-3-31 19:43
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs,ficient enumeration algorithms for these graph classes such that each element in the class is output in a polynomial time delay. The experimental results are also provided. The catalogs of graphs in these graph classes are also provided.作者: drusen 時間: 2025-4-1 01:42
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs,ficient enumeration algorithms for these graph classes such that each element in the class is output in a polynomial time delay. The experimental results are also provided. The catalogs of graphs in these graph classes are also provided.作者: 違抗 時間: 2025-4-1 04:51
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases,ut points. In this paper, we are interested in particular in annuli of three different shapes: circular, square, and rectangular annuli. For the three cases, we present first and improved algorithms to the problem.作者: 性上癮 時間: 2025-4-1 09:58
Minimum-Width Square Annulus Intersecting Polygons,.. We also present an algorithm for computing a minimum-width square annulus for . convex polygons of total complexity .. The running times are . for possibly overlapping convex polygons and . for pairwise disjoint convex polygons.作者: 果仁 時間: 2025-4-1 13:06
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases,ut points. In this paper, we are interested in particular in annuli of three different shapes: circular, square, and rectangular annuli. For the three cases, we present first and improved algorithms to the problem.作者: lipoatrophy 時間: 2025-4-1 16:48
Minimum-Width Square Annulus Intersecting Polygons,.. We also present an algorithm for computing a minimum-width square annulus for . convex polygons of total complexity .. The running times are . for possibly overlapping convex polygons and . for pairwise disjoint convex polygons.作者: separate 時間: 2025-4-1 22:13 作者: NOCT 時間: 2025-4-2 01:40
On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract),ducing the multiple longest common subsequence (MLCS) problem to it. We also provide a branch and bound algorithm for MLCS and show how the algorithm can be extended to give an algorithm for finding common motifs with gaps after common factors that occur in all the strings have been identified.作者: progestin 時間: 2025-4-2 03:31 作者: 固定某物 時間: 2025-4-2 10:04 作者: construct 時間: 2025-4-2 11:29 作者: Strength 時間: 2025-4-2 17:37
WALCOM: Algorithms and Computation978-3-319-75172-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: probate 時間: 2025-4-2 20:04 作者: 凹室 時間: 2025-4-3 02:21 作者: Etching 時間: 2025-4-3 04:04
An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem,We propose a simple idea for improving the randomized algorithm of Hertli for the Unique 3SAT problem. Using recently developed techniques, we can derive from this algorithm the currently the fastest randomized algorithm for the general 3SAT problem.作者: entice 時間: 2025-4-3 10:31 作者: 抒情短詩 時間: 2025-4-3 14:14
