Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-22174-8_6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

An Efficient Recommender System Using Locality Sensitive Hashing

2018English

Instance-Based Matching of Large Ontologies Using Locality-Sensitive Hashing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

How to Calculate Shortest Vectors in a Lattice

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1975English

Lshsim: A Locality Sensitive Hashing Based Method for Multiple-Point Geostatistics

English

Accelerating Large Scale Centroid-Based Clustering With Locality Sensitive Hashing

2016English

Faster 64-Bit Universal Hashing Using Carry-Less Multiplications

Journal of Cryptographic Engineering
Computer NetworksSoftwareCommunications
2015English

Shortest Integer Vectors

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
1993English

A Fast Online Learning Algorithm of Radial Basis Function Network With Locality Sensitive Hashing

Evolving Systems
ControlSystems EngineeringOptimizationSimulationComputer Science ApplicationsModeling
2016English

Efficient Query-By-Content Audio Retrieval by Locality Sensitive Hashing and Partial Sequence Comparison

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy