14704 search results - page 2797 / 2941 » computing 2007 |
141
Voted
ASIACRYPT
2007
Springer
15 years 9 months 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 ...
112
Voted
ASIACRYPT
2007
Springer
15 years 9 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
136
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
124
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
137
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
Determining the provenance of data, i.e. the process that led to that data, is vital in many disciplines. For example, in science, the process that produced a given result must be...