Sciweavers

903 search results - page 21 / 181
» On the reduction of a random basis
Sort
View
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
16 years 2 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
ICIP
2010
IEEE
14 years 12 months ago
Randomly driven fuzzy key extraction of unclonable images
In this paper, we develop an adjustable Fuzzy Extractor using the Physical Unclonable Functions (PUF) obtained by a common laser engraving method to sign physical objects. In part...
Saloomeh Shariati, Laurent Jacques, Françoi...
ACL
2008
15 years 3 months ago
Efficient, Feature-based, Conditional Random Field Parsing
Discriminative feature-based methods are widely used in natural language processing, but sentence parsing is still dominated by generative methods. While prior feature-based dynam...
Jenny Rose Finkel, Alex Kleeman, Christopher D. Ma...
CALC
2001
Springer
145views Cryptology» more  CALC 2001»
15 years 6 months ago
Fast Reduction of Ternary Quadratic Forms
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
Friedrich Eisenbrand, Günter Rote
93
Voted
ACL
2003
15 years 3 months ago
Uncertainty Reduction in Collaborative Bootstrapping: Measure and Algorithm
This paper proposes the use of uncertainty reduction in machine learning methods such as co-training and bilingual bootstrapping, which are referred to, in a general term, as ‘c...
Yunbo Cao, Hang Li, Li Lian