2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.IR2021
SDR: Efficient Neural Re-ranking using Succinct Document Representation
Nachshon Cohen, Amit Portnoy, Besnik Fetahu +1
BERT based ranking models have achieved superior performance on various information retrieval tasks. However, the large number of parameters and complex self-attention operation co…
cs.DS2013★ 2 cited
Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points
Nachshon Cohen, Zeev Nutov
We consider low connectivity variants of the Survivable Network with Minimum Number of Steiner Points (SN-MSP) problem: given a finite set of terminals in a metric space (M,d),…
cs.DS2011★ 1 cited
Approximating minimum-power edge-multicovers
Nachshon Cohen, Zeev Nutov
Given a graph with edge costs, the {\em power} of a node is themaximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by…