19700 search results - page 27 / 3940 » DNA-Based Computation Times |
104
click to vote
INFORMATICALT
2000
15 years 19 days ago
2000
Abstract. The paper presents new method for sequential classification of the time series observations. Methods and algorithms of sequential recognition are obtained on the basis of...
130
click to vote
ASIACRYPT
2011
Springer
14 years 25 days ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
122
Voted
TMC
2011
14 years 7 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
100
Voted
WCET
2010
14 years 10 months ago
2010
Computing tight WCET bounds in the presence of timing anomalies
109
click to vote
JFP
2000
15 years 18 days ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...