ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 0705.4676
  4. Cited By
Recursive n-gram hashing is pairwise independent, at best
v1v2v3v4v5v6v7v8 (latest)

Recursive n-gram hashing is pairwise independent, at best

Computer Speech and Language (CSL), 2007
31 May 2007
D. Lemire
Owen Kaser
ArXiv (abs)PDFHTML

Papers citing "Recursive n-gram hashing is pairwise independent, at best"

1 / 1 papers shown
Title
Regular and almost universal hashing: an efficient implementation
Regular and almost universal hashing: an efficient implementation
Dmytro Ivanchykhin
Sergey Ignatchenko
D. Lemire
62
4
0
30 Sep 2016
1