787 search results - page 134 / 158 » Polynomial Constants are Decidable |
158
Voted
FOCS
2009
IEEE
16 years 27 days ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
184
click to vote
ASIACRYPT
2007
Springer
16 years 10 days ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
259
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
204
click to vote
EMSOFT
2004
Springer
15 years 11 months ago
2004
Springer
In current embedded systems, one of the major concerns is energy conservation. The dynamic voltage-scheduling (DVS) framework, which involves dynamically adjusting the voltage and...
169
Voted
STOC
1993
ACM
15 years 10 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...