Hashing

Results: 1317



#Item
71DSH: Data Sensitive Hashing for High-Dimensional k-NN Search Jinyang Gao† , H. V. Jagadish§ , Wei Lu† , Beng Chin Ooi† †

DSH: Data Sensitive Hashing for High-Dimensional k-NN Search Jinyang Gao† , H. V. Jagadish§ , Wei Lu† , Beng Chin Ooi† †

Add to Reading List

Source URL: www.comp.nus.edu.sg

- Date: 2014-04-07 19:18:12
    72SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding Ruei-Sung Lin David A. Ross Google Inc. Mountain View, CA 94043

    SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding Ruei-Sung Lin David A. Ross Google Inc. Mountain View, CA 94043

    Add to Reading List

    Source URL: www.cs.toronto.edu

    - Date: 2010-04-01 18:31:57
      73History-Independent Cuckoo Hashing Moni Naor∗‡ Gil Segev†‡  Udi Wieder§

      History-Independent Cuckoo Hashing Moni Naor∗‡ Gil Segev†‡ Udi Wieder§

      Add to Reading List

      Source URL: www.wisdom.weizmann.ac.il

      - Date: 2008-04-22 13:39:01
        74POIsketch: Semantic Place Labeling over User Activity Streams 1 Dingqi Yang1 , Bin Li2 , Philippe Cudr´e-Mauroux1 eXascale Infolab, University of Fribourg, 1700 Fribourg, Switzerland 2

        POIsketch: Semantic Place Labeling over User Activity Streams 1 Dingqi Yang1 , Bin Li2 , Philippe Cudr´e-Mauroux1 eXascale Infolab, University of Fribourg, 1700 Fribourg, Switzerland 2

        Add to Reading List

        Source URL: exascale.info

        Language: English - Date: 2016-08-17 10:09:29
        75The Politics of Cryptography: Bitcoin and The Ordering Machines

        The Politics of Cryptography: Bitcoin and The Ordering Machines

        Add to Reading List

        Source URL: iqdupont.com

        Language: English - Date: 2015-12-03 10:50:31
        76Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing

        Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing

        Add to Reading List

        Source URL: web.cse.ohio-state.edu

        Language: English - Date: 2015-08-14 19:41:23
        77Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define

        Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define

        Add to Reading List

        Source URL: www-tcs.cs.uni-sb.de

        Language: English - Date: 2016-03-06 16:06:05
        78Indifferentiable Hashing to Elliptic and Hyperelliptic Curves Mehdi Tibouchi NTT Secure Platform Laboratories  ECC Workshop 2013, 2013–09–17

        Indifferentiable Hashing to Elliptic and Hyperelliptic Curves Mehdi Tibouchi NTT Secure Platform Laboratories ECC Workshop 2013, 2013–09–17

        Add to Reading List

        Source URL: www.cosic.esat.kuleuven.be

        Language: English - Date: 2013-10-09 09:45:18
        79Introduction to Smalltalk - Chapter 9 - Sets, bags, and dictionaries  Ivan TomekChapter 9 - Sets, bags, and dictionaries Overview This chapter presents the remaining frequently used collections - sets, bags,

        Introduction to Smalltalk - Chapter 9 - Sets, bags, and dictionaries  Ivan TomekChapter 9 - Sets, bags, and dictionaries Overview This chapter presents the remaining frequently used collections - sets, bags,

        Add to Reading List

        Source URL: sdmeta.gforge.inria.fr

        Language: English - Date: 2014-10-09 10:38:17
        80Real-Time Community Detection in Large Social Networks on a Laptop Ben Chamberlain Clive Humby

        Real-Time Community Detection in Large Social Networks on a Laptop Ben Chamberlain Clive Humby

        Add to Reading List

        Source URL: www.mlgworkshop.org

        Language: English - Date: 2016-08-14 01:22:56