Sciweavers

1185 search results - page 201 / 237
» The Equivalence of Sampling and Searching
Sort
View
CGF
2007
145views more  CGF 2007»
13 years 7 months ago
Bitmask Soft Shadows
Recently, several real-time soft shadow algorithms have been introduced which all compute a single shadow map and use its texels to obtain a discrete scene representation. The res...
Michael Schwarz, Marc Stamminger
JAIR
2008
107views more  JAIR 2008»
13 years 7 months ago
Planning with Durative Actions in Stochastic Domains
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Mausam, Daniel S. Weld
JMLR
2006
103views more  JMLR 2006»
13 years 7 months ago
MinReg: A Scalable Algorithm for Learning Parsimonious Regulatory Networks in Yeast and Mammals
In recent years, there has been a growing interest in applying Bayesian networks and their extensions to reconstruct regulatory networks from gene expression data. Since the gene ...
Dana Pe'er, Amos Tanay, Aviv Regev
JMLR
2006
117views more  JMLR 2006»
13 years 7 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
JMLR
2006
103views more  JMLR 2006»
13 years 7 months ago
On Model Selection Consistency of Lasso
Sparsity or parsimony of statistical models is crucial for their proper interpretations, as in sciences and social sciences. Model selection is a commonly used method to find such...
Peng Zhao, Bin Yu