1686 search results - page 124 / 338 » Programs as polygraphs: computability and complexity |
109
click to vote
SIAMJO
2008
15 years 3 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
163
click to vote
CODES
2005
IEEE
15 years 9 months ago
2005
IEEE
The growing number of information security breaches in electronic and computing systems calls for new design paradigms that consider security as a primary design objective. This i...
141
Voted
IFL
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
177
Voted
BMCBI
2002
15 years 3 months ago
2002
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
110
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we report results of an extensive evaluation of people's ability to reproduce the strategies they use in simple real-life settings. Having the ability to reliab...