Sciweavers

1391 search results - page 129 / 279
» Optimally Sparse Frames
Sort
View
NIPS
2007
15 years 5 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
CAD
2000
Springer
15 years 4 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier
205
Voted
CVPR
2009
IEEE
16 years 11 months ago
Large Displacement Optical Flow
The literature currently provides two ways to establish point correspondences between images with moving objects. On one side, there are energy minimization methods that yield v...
Thomas Brox (University of California, Berkeley), ...
AIPS
2009
15 years 5 months ago
Lower Bounding Klondike Solitaire with Monte-Carlo Planning
Despite its ubiquitous presence, very little is known about the odds of winning the simple card game of Klondike Solitaire. The main goal of this paper is to investigate the use o...
Ronald Bjarnason, Alan Fern, Prasad Tadepalli
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 4 months ago
Compressed Sensing with Coherent and Redundant Dictionaries
This article presents novel results concerning the recovery of signals from undersampled data in the common situation where such signals are not sparse in an orthonormal basis or ...
Emmanuel J. Candès, Yonina C. Eldar, Deanna...