Sciweavers

274 search results - page 23 / 55
» Counting lattice vectors
Sort
View
ALT
2007
Springer
15 years 8 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
IJACT
2008
158views more  IJACT 2008»
14 years 11 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
STACS
2009
Springer
15 years 6 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
ICML
2004
IEEE
16 years 16 days ago
Distribution kernels based on moments of counts
Many applications in text and speech processing require the analysis of distributions of variable-length sequences. We recently introduced a general kernel framework, rational ker...
Corinna Cortes, Mehryar Mohri
ICONIP
2008
15 years 1 months ago
Automatic Particle Detection and Counting by One-Class SVM from Microscope Image
Asbestos-related illnesses become a nationwide problem in Japan. Now human inspectors check whether asbestos is contained in building material or not. To judge whether the specimen...
Hinata Kuba, Kazuhiro Hotta, Haruhisa Takahashi