منابع مشابه
Billion-scale similarity search with GPUs
Similarity search finds application in specialized database systems handling complex data such as images or videos, which are typically represented by high-dimensional features and require specific indexing structures. This paper tackles the problem of better utilizing GPUs for this task. While GPUs excel at data-parallel tasks, prior approaches are bottlenecked by algorithms that expose less p...
متن کاملInapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis
The Small Set Expansion Hypothesis (SSEH) is a conjecture which roughly states that it is NPhard to distinguish between a graph with a small set of vertices whose expansion is almost zero and one in which all small sets of vertices have expansion almost one. In this work, we prove conditional inapproximability results for the following graph problems based on this hypothesis: Maximum Edge Bicli...
متن کاملCombining tabu search and graph reduction to solve the maximum balanced biclique problem
The Maximum Balanced Biclique Problem is a well-known graph model with relevant applications in diverse domains. This paper introduces a novel algorithm, which combines an effective constraint-based tabu search procedure and two dedicated graph reduction techniques. We verify the effectiveness of the algorithm on 30 classical random benchmark graphs and 25 very large real-life sparse graphs fro...
متن کاملNonnegative Factorization and The Maximum Edge Biclique Problem
Nonnegative Matrix Factorization (NMF) is a data analysis technique which allows compression and interpretation of nonnegative data. NMF became widely studied after the publication of the seminal paper by Lee and Seung (Learning the Parts of Objects by Nonnegative Matrix Factorization, Nature, 1999, vol. 401, pp. 788–791), which introduced an algorithm based on Multiplicative Updates (MU). More...
متن کاملBipartite sandwiches: bounding the size of a maximum biclique
A semidefinite relaxation σ(Γ) for the problem of finding the maximum number κ(Γ) of edges in a complete bipartite subgraph of a bipartite graph Γ = (V1 ∪ V2, E) is considered. For a large class of graphs, the relaxation is better than the LP-relaxation described in [9]. It is shown that σ(Γ) is bounded from above by the Lovász theta function θ(LQ(Γ)) of the graph LQ(Γ) related to the line grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2020
ISSN: 2150-8097
DOI: 10.14778/3397230.3397234