1092 search results - page 211 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
108
click to vote
PODS
2011
ACM
14 years 10 days ago
2011
ACM
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
IACR
2011
13 years 9 months ago
2011
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
155
Voted
PODS
2009
ACM
15 years 10 months ago
2009
ACM
A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML...
89
Voted
ASIACRYPT
2007
Springer
15 years 3 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 ...
IJON
2007
14 years 9 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...