88 search results - page 15 / 18 » Subquadratic-time factoring of polynomials over finite field... |
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
110
click to vote
EMNLP
2009
14 years 7 months ago
2009
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
JAIR
1998
14 years 9 months ago
1998
This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of fini...
ISLPED
1997
ACM
15 years 1 months ago
1997
ACM
We propose a pipelined division architecture for low-power ECC applications, which is based on partialdivision on group basis and lookahead technique exploiting the linearity in f...