4843 search results - page 452 / 969 » The Shortcut Problem - Complexity and Approximation |
142
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
Asian options are path-dependent derivatives. How to price them efficiently and accurately has been a longstanding research and practical problem. Asian options can be priced on t...
133
click to vote
NIPS
2003
15 years 6 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
159
click to vote
GD
2008
Springer
15 years 6 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
126
click to vote
ICA
2010
Springer
15 years 5 months ago
2010
Springer
The problem of estimating a sparse channel, i.e. a channel with a few non-zero taps, appears in many fields of communication including acoustic underwater or wireless transmissions...
146
click to vote
CGF
2010
15 years 5 months ago
2010
We present a closed-form solution for the symmetrization problem, solving for the optimal deformation that reconciles a set of local bilateral symmetries. Given as input a set of ...