Poster Session (encompasses coffee break)
Beidi Chen ⋅ Borja Balle ⋅ Daniel Lee ⋅ iuri frosio ⋅ Jitendra Malik ⋅ Jan Kautz ⋅ Ke Li ⋅ Masashi Sugiyama ⋅ Miguel A. Carreira-Perpinan ⋅ Ramin Raziperchikolaei ⋅ Theja Tulabandhula ⋅ Yung-Kyun Noh ⋅ Adams Wei Yu
2017 Poster Session
in
Workshop: Nearest Neighbors for Modern Applications with Massive Data: An Age-old Solution with New Challenges
in
Workshop: Nearest Neighbors for Modern Applications with Massive Data: An Age-old Solution with New Challenges
Abstract
- Learning Supervised Binary Hashing without Binary Code Optimization (Miguel Carreira-Perpinan; Ramin Raziperchikolaei)
- Sub-linear Privacy-preserving Search with Unsecured Server and Semi-honest Parties (Beidi Chen)
- On Nearest Neighbors in Non Local Means Denoising (Iuri Frosio; Kautz Jan)
- Fast k-Nearest Neighbour Search via Prioritized DCI (Ke Li; Jitendra Malik)
- Generative Local Metric Learning for Nearest Neighbor Methods (Yung-Kyun Noh; Masashi Sugiyama; Daniel D Lee)
- Private Document Classification in Federated Databases (Phillipp Schoppmann; Adria Gascon; Borja Balle)
- Optimizing Revenue Over Data-Driven Assortments (Deeksha Sinha; Theja Tulabandula)
- Fast Distance Metric Learning for Multi-Task Large Margin Nearest Neighbor Classification (Adams Yu)
Chat is not available.
Successful Page Load