標題: Titlebook: Computing and Combinatorics; 22nd International C Thang N. Dinh,My T. Thai Conference proceedings 2016 Springer International Publishing Sw [打印本頁] 作者: 反抗日本 時間: 2025-3-21 18:08
書目名稱Computing and Combinatorics影響因子(影響力)
書目名稱Computing and Combinatorics影響因子(影響力)學科排名
書目名稱Computing and Combinatorics網(wǎng)絡公開度
書目名稱Computing and Combinatorics網(wǎng)絡公開度學科排名
書目名稱Computing and Combinatorics被引頻次
書目名稱Computing and Combinatorics被引頻次學科排名
書目名稱Computing and Combinatorics年度引用
書目名稱Computing and Combinatorics年度引用學科排名
書目名稱Computing and Combinatorics讀者反饋
書目名稱Computing and Combinatorics讀者反饋學科排名
作者: engagement 時間: 2025-3-21 23:54 作者: 出沒 時間: 2025-3-22 04:10 作者: formula 時間: 2025-3-22 05:48 作者: ALE 時間: 2025-3-22 11:26
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Threetains bounded tree-width graphs. We give a polynomial time graph isomorphism algorithm for graphs with clique-width at most three. Our work is independent of the work by Grohe and Schweitzer [.] showing that the isomorphism problem for graphs of bounded clique-width is polynomial time.作者: 影響帶來 時間: 2025-3-22 15:51 作者: 影響帶來 時間: 2025-3-22 20:31 作者: 原來 時間: 2025-3-23 00:23 作者: 似少年 時間: 2025-3-23 02:52
Locality-Sensitive Hashing Without False Negatives for ,nts within a given radius . in . dimensional space equipped with . norm when .. Furthermore, we show how to use these hash functions to solve the .-approximate nearest neighbor search problem without false negatives. Namely, if there is a point at distance ., we will certainly report it and points a作者: figure 時間: 2025-3-23 09:00
Improved Space Efficient Algorithms for BFS, DFS and Applicationse space complexity. Elmasry et al. gave, among others, implementations of breadth first search (BFS) and depth first search (DFS) in a graph on . vertices and . edges, taking . time using .(.) and . bits of space respectively improving the naive .(We use . to denote logarithm to the base 2.) bits im作者: Modify 時間: 2025-3-23 11:04
Frequent-Itemset Mining Using Locality-Sensitive Hashingtion involved, and the number of candidates it generates. We investigate the role of LSH techniques to overcome these problems, without adding much computational overhead. We propose randomized variations of Apriori that are based on asymmetric LSH defined over Hamming distance and Jaccard similarit作者: 滋養(yǎng) 時間: 2025-3-23 15:21
On the Hardness of Switching to a Small Number of Edgesping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other one by a sequence of switches..Jelínková et al. [DMTCS 13, no. 2, 2011] presented a proof that it is NP-complete to decide if the input graph can be switched to contain at most作者: BILK 時間: 2025-3-23 20:22
On Hard Instances of Non-Commutative Permanentve settled the complexity of non-commutative determinant with respect to the structure of the underlying algebra. Continuing the research further, we look to obtain more insights on hard instances of non-commutative permanent and determinant..We show that any Algebraic Branching Program (ABP) comput作者: CAJ 時間: 2025-3-23 22:43 作者: 包裹 時間: 2025-3-24 03:49
https://doi.org/10.1007/978-3-319-42634-1bioinformatics; computational complexity; cryptography; social networks; approximation algorithms; algori作者: browbeat 時間: 2025-3-24 08:36
978-3-319-42633-4Springer International Publishing Switzerland 2016作者: 首創(chuàng)精神 時間: 2025-3-24 12:47 作者: CURL 時間: 2025-3-24 15:12
Metric 1-Median Selection: Query Complexity vs. Approximation RatioConsider the problem of finding a point in a metric space . with the minimum average distance to other points. We show that this problem has no deterministic .-query .-approximation algorithms for any constants . and ..作者: Ingredient 時間: 2025-3-24 19:32
Computing and Combinatorics978-3-319-42634-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 不真 時間: 2025-3-24 23:49
5.2.1.3.1 Normal incidence of the beam,tains bounded tree-width graphs. We give a polynomial time graph isomorphism algorithm for graphs with clique-width at most three. Our work is independent of the work by Grohe and Schweitzer [.] showing that the isomorphism problem for graphs of bounded clique-width is polynomial time.作者: 按時間順序 時間: 2025-3-25 05:30
5.1.2.2 Changes of surface magnetization,tion involved, and the number of candidates it generates. We investigate the role of LSH techniques to overcome these problems, without adding much computational overhead. We propose randomized variations of Apriori that are based on asymmetric LSH defined over Hamming distance and Jaccard similarity.作者: Pde5-Inhibitors 時間: 2025-3-25 10:18
Thang N. Dinh,My T. ThaiIncludes supplementary material: 作者: macular-edema 時間: 2025-3-25 11:56
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234785.jpg作者: 是剝皮 時間: 2025-3-25 16:03
Thin Film Structures in Energy Applicationsjected immediately. Each bidder has a valuation for being allocated the good and a preemption price. Sold goods can be bought back from the bidders for a preemption price. We allow unbounded valuations and preemption prices independent from each other. We study the clairvoyant model, a model sitting作者: 歡笑 時間: 2025-3-25 20:51 作者: Throttle 時間: 2025-3-26 00:45 作者: Orchiectomy 時間: 2025-3-26 06:23 作者: gusher 時間: 2025-3-26 09:36 作者: GET 時間: 2025-3-26 13:05 作者: Optimum 時間: 2025-3-26 18:24 作者: 間接 時間: 2025-3-26 21:26 作者: Ornament 時間: 2025-3-27 04:08
5.1.3.1 Surface hyperfine interactions,nts within a given radius . in . dimensional space equipped with . norm when .. Furthermore, we show how to use these hash functions to solve the .-approximate nearest neighbor search problem without false negatives. Namely, if there is a point at distance ., we will certainly report it and points a作者: 他日關稅重重 時間: 2025-3-27 07:27 作者: 星星 時間: 2025-3-27 11:17
5.1.2.2 Changes of surface magnetization,tion involved, and the number of candidates it generates. We investigate the role of LSH techniques to overcome these problems, without adding much computational overhead. We propose randomized variations of Apriori that are based on asymmetric LSH defined over Hamming distance and Jaccard similarit作者: Fermentation 時間: 2025-3-27 16:23
5.1.2.2 Changes of surface magnetization,ping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other one by a sequence of switches..Jelínková et al. [DMTCS 13, no. 2, 2011] presented a proof that it is NP-complete to decide if the input graph can be switched to contain at most作者: Androgen 時間: 2025-3-27 20:54 作者: Facilities 時間: 2025-3-27 23:29 作者: 絕食 時間: 2025-3-28 04:26 作者: synchronous 時間: 2025-3-28 07:36 作者: Repatriate 時間: 2025-3-28 11:11 作者: choroid 時間: 2025-3-28 16:07
5.1.2.2 Changes of surface magnetization,private. For multiple machines, we?present an optimal truthful algorithm for the unweighted case. For the weighted-multiple-machines case, we propose a truthful randomized algorithm which is .-approximate in expectation based on preventive preemption. For the model ., we prove that there is no optim作者: cruise 時間: 2025-3-28 22:15 作者: Talkative 時間: 2025-3-28 22:59
5.1.3.1 Surface hyperfine interactions,Later, we further improve the space requirement of BFS to at most . bits albeit with a slight increase in running time to . time where .(.) is any extremely slow growing function of .. These improve the space by a constant factor from earlier representations..We demonstrate the use of our data struc作者: Laconic 時間: 2025-3-29 03:08 作者: HUMP 時間: 2025-3-29 10:23
5.1.6 Magnetic surface anisotropies,each round, and the . ., which is the maximum size of these messages. We show that the space between the unicast and broadcast congested clique models is very rich and interesting. For instance, we show that the round complexity of the pairwise set-disjointness function . is completely sensitive to 作者: senile-dementia 時間: 2025-3-29 14:53 作者: MODE 時間: 2025-3-29 17:06
Truthfulness for the Sum of Weighted Completion Timesprivate. For multiple machines, we?present an optimal truthful algorithm for the unweighted case. For the weighted-multiple-machines case, we propose a truthful randomized algorithm which is .-approximate in expectation based on preventive preemption. For the model ., we prove that there is no optim作者: Initial 時間: 2025-3-29 21:55
A Parameterized Algorithm for Bounded-Degree Vertex Deletion. Our result answers this challenging open problem affirmatively for a special case. Furthermore, our algorithm also gets a running time bound of . for the case that ., improving the previous deterministic bound of ..作者: 阻塞 時間: 2025-3-30 02:55 作者: 濕潤 時間: 2025-3-30 07:26
On Hard Instances of Non-Commutative Permanents within each component are not far apart from each other in the Cayley ordering. This gives a tight upper and lower bound for size of ABPs computing the permanent of disjoint two-cycles. Finally, we exhibit more families of non-commutative polynomial evaluation problems that are complete for ...Our作者: Systemic 時間: 2025-3-30 12:06 作者: 培養(yǎng) 時間: 2025-3-30 15:33 作者: carotid-bruit 時間: 2025-3-30 18:10 作者: Hay-Fever 時間: 2025-3-30 22:34
Conference proceedings 2016l Complexity; Approximation Algorithms; Cryptography; Network and Algorithms; Graph Theory and Algorithms; Computational Geometry; Scheduling Algorithms and Circuit Complexity; Computational Geometry and Computational Biology; and Logic, Algebra and Automata..作者: 債務 時間: 2025-3-31 04:08
