412 search results - page 50 / 83 » A New Proof of the F5 Algorithm |
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...
UAI
2003
14 years 11 months ago
2003
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
SAS
2009
Springer
15 years 10 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...