Ninh Pham

27 papers A* 8A 3B 1C 1Journal 11Unranked 3
YearRankTypeTitle / Venue / Authors
2025 A* conf
On Finding Hubs in High Dimensions with Sampling.
AAAI
Huiwen Dong, Linghan Zeng, Zhiwen Zhao, Francesco Silvestri, Ninh Pham
2025 J jnl
Scalable Varied-Density Clustering via Graph Propagation.
CoRR
Ninh Pham, Yingtao Zheng, Hugo Phibbs
2025 J jnl
Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation.
CoRR
Ninh Pham, Rasmus Pagh
2024 A* conf
Scalable DBSCAN with Random Projections.
NeurIPS
Haochuan Xu, Ninh Pham
2024 J jnl
Scalable Density-based Clustering with Random Projections.
CoRR
Haochuan Xu, Ninh Pham
2023 — conf
A Transductive Forest for Anomaly Detection with Few Labels.
ECML/PKDD (1)
Jingrui Zhang, Ninh Pham, Gillian Dobbie
2023 C conf
On Deploying Mobile Deep Learning to Segment COVID-19 PCR Test Tube Images.
PSIVT
Ting Xiang, Richard Dean, Jiawei Zhao, Ninh Pham
2022 J jnl
An Efficient Hashing-based Ensemble Method for Collaborative Outlier Detection.
CoRR
Kitty Li, Ninh Pham
2022 A* conf
Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search.
NeurIPS
Ninh Pham, Tao Liu
2022 J jnl
Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search.
CoRR
Ninh Pham, Tao Liu
2021 A* conf
Revisiting Wedge Sampling for Budgeted Maximum Inner Product Search (Extended Abstract).
IJCAI
Stephan Sloth Lorenzen, Ninh Pham
2021 A* conf
Simple Yet Efficient Algorithms for Maximum Inner Product Search via Extreme Order Statistics.
KDD
Ninh Pham
2020 — conf
Revisiting Wedge Sampling for Budgeted Maximum Inner Product Search.
ECML/PKDD (1)
Stephan Sloth Lorenzen, Ninh Pham
2020 J jnl
Sublinear Maximum Inner Product Search using Concomitants of Extreme Order Statistics.
CoRR
Ninh Pham
2019 J jnl
Revisiting Wedge Sampling for Budgeted Maximum Inner Product Search.
CoRR
Stephan Sloth Lorenzen, Ninh Pham
2018 — conf
L1-Depth Revisited: A Robust Angle-Based Outlier Factor in High-Dimensional Space.
ECML/PKDD (1)
Ninh Pham
2017 B conf
Hybrid LSH: Faster Near Neighbors Reporting in High-dimensional Space.
EDBT
Ninh Pham
2017 J jnl
I/O-Efficient Similarity Join.
Algorithmica
Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel
2016 J jnl
Hybrid LSH: Faster Near Neighbors Reporting in High-dimensional Space.
CoRR
Ninh Pham
2016 A conf
Scalability and Total Recall with Fast CoveringLSH.
CIKM
Ninh Pham, Rasmus Pagh
2016 J jnl
Scalability and Total Recall with Fast CoveringLSH.
CoRR
Ninh Pham, Rasmus Pagh
2015 A conf
I/O-Efficient Similarity Join.
ESA
Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel
2015 J jnl
I/O-Efficient Similarity Join.
CoRR
Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel
2014 A* conf
Efficient estimation for high similarities using odd sketches.
WWW
Michael Mitzenmacher, Rasmus Pagh, Ninh Pham
2013 A* conf
Fast and scalable polynomial kernels via explicit feature maps.
KDD
Ninh Pham, Rasmus Pagh
2012 A* conf
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data.
KDD
Ninh Pham, Rasmus Pagh
2011 A conf
Online Discovery of Top-k Similar Motifs in Time Series Data.
SDM
Hoang Thanh Lam, Toon Calders, Ninh Pham