3244 search results - page 236 / 649 » On convex complexity measures |
145
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
147
click to vote
NIPS
2000
15 years 8 months ago
2000
The Bayesian paradigm apparently only sometimes gives rise to Occam's Razor; at other times very large models perform well. We give simple examples of both kinds of behaviour...
162
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
This work proposes a graph mining based approach to mine a taxonomy of events from activities for complex videos which are represented in terms of qualitative spatio-temporal relat...
180
click to vote
MP
2008
15 years 6 months ago
2008
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
153
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We consider source coding with fixed lag side information at the decoder. We focus on the special case of perfect side information with unit lag corresponding to source coding wit...