Sciweavers

288 search results - page 8 / 58
» Notes on computing minimal approximant bases
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 7 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
WIAMIS
2009
IEEE
14 years 4 months ago
3D shape from multi-camera views by error projection minimization
Traditional shape from silhouette methods compute the 3D shape as the intersection of the back-projected silhouettes in the 3D space, the so called visual hull. However, silhouett...
Gloria Haro, Montse Pardàs
DATE
2003
IEEE
105views Hardware» more  DATE 2003»
14 years 3 months ago
Approximation Approach for Timing Jitter Characterization in Circuit Simulators
A new computational concept of timing jitter is proposed that is suitable for exploitation in circuit simulators. It is based on the approximation of computed noise characteristic...
Mark M. Gourary, Sergey G. Rusakov, Sergey L. Ulya...
ICALP
2009
Springer
14 years 10 months ago
Approximating Markov Processes by Averaging
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
Philippe Chaput, Vincent Danos, Prakash Panangaden...
SIAMMAX
2011
141views more  SIAMMAX 2011»
13 years 22 days ago
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...