5372 search results - page 906 / 1075 » complexity 2007 |
153
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
165
Voted
EMMCVPR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The complexity of visual representations is substantially limited by the compositional nature of our visual world which, therefore, renders learning structured object mod...
133
Voted
EMSOFT
2007
Springer
15 years 10 months ago
2007
Springer
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
143
click to vote
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
169
click to vote
FC
2007
Springer
15 years 10 months ago
2007
Springer
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...