The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
Experiences with the use of the MSC language for complex system specifications have shown that certain extensions are necessary in order to arrive at sufficiently transparent and m...
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...