2520 search results - page 427 / 504 » The complexity of approximating entropy |
137
click to vote
CGF
2007
15 years 4 months ago
2007
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
160
click to vote
JAIR
2008
15 years 4 months ago
2008
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...
133
click to vote
JBI
2008
15 years 4 months ago
2008
The complexity of quantitative biomedical models, and the rate at which they are published, is increasing to a point where managing the information has become all but impossible w...
142
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
117
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We consider an information-theoretic objective function for statistical modeling of time series that embodies a parametrized trade-off between the predictive power of a model and...