Sciweavers

1381 search results - page 121 / 277
» Fast Filtered Sampling
Sort
View
ICCV
2007
IEEE
15 years 10 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
WSC
2008
15 years 6 months ago
Fast simulation of equity-linked life insurance contracts with a surrender option
In this paper, we consider equity-linked life insurance contracts that give their holder the possibility to surrender their policy before maturity. Such contracts can be valued us...
Carole Bernard, Christiane Lemieux
SIMUTOOLS
2008
15 years 5 months ago
Snapshot simulation of internet traffic: fast and accurate for heavy-tailed flows
Simulations involving processes at very different time scales can be so slow to converge that starting in one state and waiting for a representative sample of the state space to b...
R. G. Addie
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
15 years 5 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law
AUTOMATICA
2007
80views more  AUTOMATICA 2007»
15 years 4 months ago
Fast, large-scale model predictive control by partial enumeration
Partial enumeration (PE) is presented as a method for treating large, linear model predictive control applications that are out of reach with available MPC methods. PE uses both a...
Gabriele Pannocchia, James B. Rawlings, Stephen J....