Sciweavers

274 search results - page 25 / 55
» Counting lattice vectors
Sort
View
PARBASE
1990
69views more  PARBASE 1990»
15 years 27 days ago
A Vectorization Technique of Hashing and Its Application to Several Sorting Algorithms
This paper presents a vectorized algorithm for entering data into a hash table. A program that enters multiple data could not be executed on vector processors by conventional vect...
Yasusi Kanada
108
Voted
NIPS
1998
15 years 1 months ago
Restructuring Sparse High Dimensional Data for Effective Retrieval
The task in text retrieval is to find the subset of a collection of documents relevant to a user's information request, usually expressed as a set of words. Classically, docu...
Charles Lee Isbell Jr., Paul A. Viola
ICFCA
2009
Springer
14 years 9 months ago
A Concept Lattice-Based Kernel for SVM Text Classification
Abstract. Standard Support Vector Machines (SVM) text classification relies on bag-of-words kernel to express the similarity between documents. We show that a document lattice can ...
Claudio Carpineto, Carla Michini, Raffaele Nicolus...
FOCS
2003
IEEE
15 years 5 months ago
A Lattice Problem in Quantum NP
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
Dorit Aharonov, Oded Regev
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
16 years 1 days ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai