1541 search results - page 284 / 309 » Analysis of Random Noise and Random Walk Algorithms |
JMLR
2012
11 years 10 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
BMCBI
2008
13 years 8 months ago
2008
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...
JAR
2000
13 years 7 months ago
2000
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...
ANTS
2000
Springer
14 years 9 days ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...