7311 search results - page 146 / 1463 » Time in State Machines |
128
click to vote
IACR
2011
14 years 4 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
134
click to vote
INFORMATICALT
2006
15 years 4 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
153
click to vote
TCC
2005
Springer
15 years 10 months ago
2005
Springer
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also co...
137
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: Modelling of time series data should not be an approximation of input data profiles, but rather be able to detect and evaluate dynamical changes in the time series dat...
125
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
We consider the task of learning to accurately follow a trajectory in a vehicle such as a car or helicopter. A number of dynamic programming algorithms such as Differential Dynami...