Titlebook: Computing and Combinatorics; 22nd International C Thang N. Dinh,My T. Thai Conference proceedings 2016 Springer International Publishing Sw

Modify

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)

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

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

包裹

https://doi.org/10.1007/978-3-319-42634-1bioinformatics; computational complexity; cryptography; social networks; approximation algorithms; algori

browbeat

978-3-319-42633-4Springer International Publishing Switzerland 2016

首創(chuàng)精神

CURL

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

Computing and Combinatorics978-3-319-42634-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

不真

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.