Online Metric Learning and Fast Similarity Search
暂无分享,去创建一个
Inderjit S. Dhillon | Prateek Jain | Kristen Grauman | Brian Kulis | Prateek Jain | I. Dhillon | K. Grauman | B. Kulis
[1] Alan L. Selman,et al. Reductions on NP and P-Selective Sets , 1982, Theor. Comput. Sci..
[2] Timothy J. Long,et al. Quantitative Relativizations of Complexity Classes , 1984, SIAM J. Comput..
[3] Yacov Yacobi,et al. The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..
[4] Alan L. Selman,et al. Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..
[5] Mark W. Krentel. The Complexity of Optimization Problems , 1988, J. Comput. Syst. Sci..
[6] Osamu Watanabe,et al. On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets , 1991, SIAM J. Comput..
[7] Luc Longpré,et al. On Reductions of NP Sets to Sparse Sets , 1994, J. Comput. Syst. Sci..
[8] Alexander A. Razborov,et al. On provably disjoint NP-pairs , 1994, Electron. Colloquium Comput. Complex..
[9] Lane A. Hemaspaandra,et al. Computing Solutions Uniquely Collapses the Polynomial Hierarchy , 1996, SIAM J. Comput..
[10] Edith Hemaspaandra,et al. P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility , 1996, J. Comput. Syst. Sci..
[11] Manfred K. Warmuth,et al. Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..
[12] Piotr Indyk,et al. Similarity Search in High Dimensions via Hashing , 1999, VLDB.
[13] Jochen Messner,et al. Is the Standard Proof System for SAT P-Optimal? , 2000, FSTTCS.
[14] Aduri Pavan,et al. Separation of NP-Completeness Notions , 2001, SIAM J. Comput..
[15] Pavel Pudlák,et al. On reducibility and symmetry of disjoint NP pairs , 2003, Theor. Comput. Sci..
[16] Zenon Sadowski,et al. On an optimal propositional proof system and the structure of easy subsets of TAUT , 2002, Theor. Comput. Sci..
[17] Moses Charikar,et al. Similarity estimation techniques from rounding algorithms , 2002, STOC '02.
[18] Michael I. Jordan,et al. Distance Metric Learning with Application to Clustering with Side-Information , 2002, NIPS.
[19] Thorsten Joachims,et al. Learning a Distance Metric from Relative Comparisons , 2003, NIPS.
[20] Jacobo Torán,et al. Optimal proof systems imply complete sets for promise classes , 2003, Inf. Comput..
[21] Nicole Immorlica,et al. Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.
[22] Yoram Singer,et al. Online and batch learning of pseudo-metrics , 2004, ICML.
[23] Christian Glaßer,et al. Disjoint NP-Pairs , 2004, SIAM J. Comput..
[24] Kilian Q. Weinberger,et al. Distance Metric Learning for Large Margin Nearest Neighbor Classification , 2005, NIPS.
[25] Amir Globerson,et al. Metric Learning by Collapsing Classes , 2005, NIPS.
[26] Alan L. Selman,et al. P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP , 1979, Mathematical systems theory.
[27] Yoram Singer,et al. Online Learning Meets Optimization in the Dual , 2006, COLT.
[28] Dale Schuurmans,et al. implicit Online Learning with Kernels , 2006, NIPS.
[29] Steven M. Seitz,et al. Photo tourism: exploring photo collections in 3D , 2006, ACM Trans. Graph..
[30] Jitendra Malik,et al. Image Retrieval and Classification Using Local Distance Functions , 2006, NIPS.
[31] Gang Hua,et al. Discriminant Embedding for Local Image Descriptors , 2007, 2007 IEEE 11th International Conference on Computer Vision.
[32] Inderjit S. Dhillon,et al. Information-theoretic metric learning , 2006, ICML '07.
[33] Prateek Jain,et al. Fast image search for learned metrics , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.