Mitsunori Ogihara

activity

19982026

most citedMP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS in

L_{1}

Distance

1 citations · 2 across the 8 of their papers we have counts for

collaborators

Showing cs.DBShow all

3 papers · 1 filter

cs.DB2025

High-dimensional Regret Minimization

Junyu Liao, Ashwin Lall, Mitsunori Ogihara +1

Multi-criteria decision making in large databases is very important in real world applications. Recently, an interactive query has been studied extensively in the database literatu…

cs.DB2021★ 1 cited

MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS in $L_{1}$ Distance

Huayi Wang, Jingfan Meng, Long Gong +2

Approximate Nearest Neighbor Search (ANNS) is a fundamental algorithmic problem, with numerous applications in many areas of computer science. Locality-sensitive hashing (LSH) is o…

cs.DB2020

Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)

Long Gong, Ziheng Liu, Liang Liu +3

Set reconciliation is a fundamental algorithmic problem that arises in many networking, system, and database applications. In this problem, two large sets A and B of objects (bitco…

High-dimensional Regret Minimization

MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS in L1​ Distance

Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)

MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS in $L_{1}$ Distance