1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2020★ 1 cited
Approximation algorithms for hitting subgraphs
Noah Brüstle, Tal Elbaz, Hamed Hatami +2
Let be a fixed undirected graph on vertices. The -hitting set problem asks for deleting a minimum number of vertices from a given graph in such a way that the result…
cs.IR2019
Deep Cross-Modal Hashing with Hashing Functions and Unified Hash Codes Jointly Learning
Rong-Cheng Tu, Xian-Ling Mao, Bing Ma +4
Due to their high retrieval efficiency and low storage cost, cross-modal hashing methods have attracted considerable attention. Generally, compared with shallow cross-modal hashing…