Accuracy-aware optimization of approximate programs

The optimization problem for approximate query evaluation seems to be much harder than commonly known exact query opti- mization: in addition to selection of one of equivalent

We have seen that the Fisher vectors of our non-iid image mod- els provide significantly better image classification performance compared to the Fisher vectors of the corresponding

Analyses of workforce data about the number of pediatric specialists in the USA and Australia show that data sets representing physicians often represent

The common idea of many algorithms is to guess an approximate solution of the problem, and then to improve the accuracy and precision of the solution.. In this paper, we propose

To assess performances of the combination of Fitted-Q with LWPR in environment with irrelevant inputs, we compute the average length of trajectories following the policy returned

In fact, the reader may note that the null-controllability property strongly depends on the initial mode (through the computation of V 0 0 as last step). Second, according to

As a result, Theorem 1 gives no information about the control time if the controls are allowed to be arbitrarily large; in particular, it does not preclude the possibility

From this considération it foliows that, according to equality (4), the absolute différence between the cardinality of an approximate solution and the cardinality of the