Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Haris, Themistoklis"'
Autor:
Haris, Themistoklis
Despite their power, Transformers face challenges with long sequences due to the quadratic complexity of self-attention. To address this limitation, methods like $k$-Nearest-Neighbor ($k$NN) attention have been introduced [Roy, Saffar, Vaswani, Grang
Externí odkaz:
http://arxiv.org/abs/2411.04013
Autor:
Chakrabarti, Amit, Haris, Themistoklis
We consider the problem of space-efficiently estimating the number of simplices in a hypergraph stream. This is the most natural hypergraph generalization of the highly-studied problem of estimating the number of triangles in a graph stream. Our inpu
Externí odkaz:
http://arxiv.org/abs/2112.11016