ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1507.05910
  4. Cited By
Clustering is Efficient for Approximate Maximum Inner Product Search

Clustering is Efficient for Approximate Maximum Inner Product Search

21 July 2015
Alex Auvolat
Sarath Chandar
Pascal Vincent
Hugo Larochelle
Yoshua Bengio
ArXivPDFHTML

Papers citing "Clustering is Efficient for Approximate Maximum Inner Product Search"

2 / 2 papers shown
Title
A$^3$: Accelerating Attention Mechanisms in Neural Networks with
  Approximation
A3^33: Accelerating Attention Mechanisms in Neural Networks with Approximation
Tae Jun Ham
Sungjun Jung
Seonghak Kim
Young H. Oh
Yeonhong Park
...
Jung-Hun Park
Sanghee Lee
Kyoung Park
Jae W. Lee
D. Jeong
24
213
0
22 Feb 2020
A Bandit Approach to Maximum Inner Product Search
A Bandit Approach to Maximum Inner Product Search
Rui Liu
Tianyi Wu
Barzan Mozafari
8
15
0
15 Dec 2018
1