1403 search results - page 92 / 281 » About Approximations of Exponentials |
97
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
—In this work, we study the effects of finite buffers on the throughput and delay of line networks with erasure links. We identify the calculation of performance parameters such...
113
click to vote
JMLR
2010
14 years 7 months ago
2010
A continuous time Bayesian network (CTBN) uses a structured representation to describe a dynamic system with a finite number of states which evolves in continuous time. Exact infe...
105
Voted
JMLR
2010
14 years 7 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
141
Voted
SIAMNUM
2010
14 years 7 months ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
138
Voted
SDM
2011
SIAM
14 years 3 months ago
2011
SIAM
Multi-instance (MI) learning is a variant of supervised learning where labeled examples consist of bags (i.e. multi-sets) of feature vectors instead of just a single feature vecto...