Hashing

Results: 1317



#Item
51Adaptive Hashing for Fast Similarity Search Fatih Cakir Stan Sclaroff Department of Computer Science Boston University, Boston, MA {fcakir,sclaroff}@cs.bu.edu

Adaptive Hashing for Fast Similarity Search Fatih Cakir Stan Sclaroff Department of Computer Science Boston University, Boston, MA {fcakir,sclaroff}@cs.bu.edu

Add to Reading List

Source URL: www.cv-foundation.org

- Date: 2015-10-24 15:11:00
    52Hashing Algorithms for Large-Scale Learning Ping Li Cornell University   Anshumali Shrivastava

    Hashing Algorithms for Large-Scale Learning Ping Li Cornell University Anshumali Shrivastava

    Add to Reading List

    Source URL: papers.nips.cc

    - Date: 2014-04-23 13:39:58
      53Discrete Graph Hashing  † Wei Liu† Cun Mu‡ Sanjiv Kumar Shih-Fu Chang‡ IBM T. J. Watson Research Center ‡ Columbia University  Google Research

      Discrete Graph Hashing † Wei Liu† Cun Mu‡ Sanjiv Kumar Shih-Fu Chang‡ IBM T. J. Watson Research Center ‡ Columbia University  Google Research

      Add to Reading List

      Source URL: www.ee.columbia.edu

      - Date: 2014-11-01 02:18:44
        54Minimal Loss Hashing for Compact Binary Codes  Mohammad Norouzi David J. Fleet Department of Computer Science, University of Toronto, Canada

        Minimal Loss Hashing for Compact Binary Codes Mohammad Norouzi David J. Fleet Department of Computer Science, University of Toronto, Canada

        Add to Reading List

        Source URL: www.cs.toronto.edu

        - Date: 2012-03-14 14:18:35
          55Approximate Nearest Neighbors Search in High Dimensions and Locality-Sensitive Hashing PAPERS Piotr Indyk, Rajeev Motwani: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality, STOC 1998.

          Approximate Nearest Neighbors Search in High Dimensions and Locality-Sensitive Hashing PAPERS Piotr Indyk, Rajeev Motwani: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality, STOC 1998.

          Add to Reading List

          Source URL: graphics.stanford.edu

          - Date: 2006-11-08 20:45:04
            56princeton univ. F’14  cos 521: Advanced Algorithm Design Lecture 5: Hashing with real numbers and their big-data applications

            princeton univ. F’14 cos 521: Advanced Algorithm Design Lecture 5: Hashing with real numbers and their big-data applications

            Add to Reading List

            Source URL: www.cs.princeton.edu

            - Date: 2014-09-25 20:13:30
              5715-854: Algorithms in the Real World (SpringLec #6: Hashing 1  January 30, 2014

              15-854: Algorithms in the Real World (SpringLec #6: Hashing 1 January 30, 2014

              Add to Reading List

              Source URL: www.cs.cmu.edu

              - Date: 2014-01-30 12:41:37
                58Hash-Based Techniques for High-Speed Packet Processing Adam Kirsch, Michael Mitzenmacher, and George Varghese Abstract Hashing is an extremely useful technique for a variety of high-speed packet-processing applications i

                Hash-Based Techniques for High-Speed Packet Processing Adam Kirsch, Michael Mitzenmacher, and George Varghese Abstract Hashing is an extremely useful technique for a variety of high-speed packet-processing applications i

                Add to Reading List

                Source URL: www.eecs.harvard.edu

                - Date: 2008-11-03 16:38:06
                  59Locality-Sensitive Hashing Scheme Based on p-Stable Distributions Mayur Datar Department of Computer Science, Stanford University

                  Locality-Sensitive Hashing Scheme Based on p-Stable Distributions Mayur Datar Department of Computer Science, Stanford University

                  Add to Reading List

                  Source URL: graphics.stanford.edu

                  - Date: 2006-09-18 17:56:26
                    60N OTES  ON LOCALITY SENSITIVE HASHING WITH p- STABLE DISTRIBUTIONS

                    N OTES ON LOCALITY SENSITIVE HASHING WITH p- STABLE DISTRIBUTIONS

                    Add to Reading List

                    Source URL: cseweb.ucsd.edu

                    - Date: 2007-02-14 21:05:30