Sciweavers

402 search results - page 17 / 81
» Complexity of Decision Problems for Simple Regular Expressio...
Sort
View
ICCV
2009
IEEE
15 years 15 days ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs
ICALP
2005
Springer
14 years 1 months ago
Recursive Markov Decision Processes and Recursive Stochastic Games
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
Kousha Etessami, Mihalis Yannakakis
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 11 days ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
IJCAI
2001
13 years 9 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
JMLR
2010
101views more  JMLR 2010»
13 years 2 months ago
Classification Using Geometric Level Sets
A variational level set method is developed for the supervised classification problem. Nonlinear classifier decision boundaries are obtained by minimizing an energy functional tha...
Kush R. Varshney, Alan S. Willsky