Alternatives and similar repositories for IR-unipi:

Users that are interested in IR-unipi are comparing it to the libraries listed below

• and-gue / NeaTS
  ☆10Updated 3 weeks ago
• md-cs-student-unipi / Exams
  Collection of oral questions and exam material
  ☆31Updated last year
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆33Updated 2 months ago
• md-cs-student-unipi / Materials
  🎓Collection of useful repositories
  ☆144Updated 3 months ago
• rossanoventurini / qwt
  A Rust implementation of the Quad Wavelet Tree
  ☆40Updated last week
• rossanoventurini / adsds
  Page of the course "Algorithms and Data Structures (for Data Science)" at Department of Computer Science, University of Pisa
  ☆64Updated last week
• rossanoventurini / CompetitiveProgramming
  Page of the course "Competitive Programming and Contests" at Department of Computer Science, University of Pisa
  ☆229Updated last year
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 11 months ago
• ferragina / AlgorithmEngineering
  This is the material for the course on Algorithm Engineering at the University of Pisa
  ☆9Updated 7 months ago
• lucacorbucci / Appunti
  🎓Appunti - Corso di laurea in Informatica @ UniPi
  ☆7Updated 4 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• md-cs-student-unipi / ICT-Infrastructures
  Notes of ICT Infrastructures course - University of Pisa (Italy)
  ☆29Updated 3 years ago
• flandolfi / ALE-exercises
  Exercises for the Algorithm Engineering (ALE) course at University of Pisa
  ☆14Updated 6 years ago
• fastflow / fastflow
  FastFlow pattern-based parallel programming framework (formerly on sourceforge)
  ☆291Updated 2 weeks ago
• marcocosta97 / grafite
  Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
  ☆13Updated 4 months ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆17Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 7 months ago
• intel / ScalableVectorSearch
  ☆151Updated this week
• NinhPham / FalconnPP
  Falconn++ is a locality-sensitive filtering (LSF) approach, built on top of cross-polytope LSH (FalconnLib) to answer approximate nearest…
  ☆13Updated 8 months ago
• gaoj0017 / RaBitQ
  [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
  ☆90Updated this week
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• magemma / Notes-on-Computational-Mathematics
  Notes from the Computational Mathematics course held by professor Antonio Frangioni and professor Federico Poloni at University of Pisa
  ☆12Updated 3 years ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆113Updated 11 months ago
• IntelLabs / VectorSearchDatasets
  ☆24Updated 2 months ago
• mti-lab / rnn-descent
  ☆21Updated last year
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆11Updated 9 months ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆58Updated last week