Sciweavers

1626 search results - page 209 / 326
» Hybrid computing algorithm in representing solid model
Sort
View
ICCV
2007
IEEE
16 years 5 months ago
Robust Visual Tracking Based on Incremental Tensor Subspace Learning
Most existing subspace analysis-based tracking algorithms utilize a flattened vector to represent a target, resulting in a high dimensional data learning problem. Recently, subspa...
Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang, ...
TIM
2010
144views Education» more  TIM 2010»
14 years 10 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta
CAV
2009
Springer
135views Hardware» more  CAV 2009»
16 years 3 months ago
Sliding Window Abstraction for Infinite Markov Chains
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
Thomas A. Henzinger, Maria Mateescu, Verena Wolf
RAS
2002
247views more  RAS 2002»
15 years 2 months ago
Reference scan matching for global self-localization
Especially in dynamic environments a key feature concerning the robustness of mobile robot navigation is the capability of global self-localization. This term denotes a robot'...
Joachim Weber, Lutz Franken, Klaus-Werner Jör...
UAI
2001
15 years 4 months ago
Expectation Propagation for approximate Bayesian inference
This paper presents a new deterministic approximation technique in Bayesian networks. This method, "Expectation Propagation," unifies two previous techniques: assumed-de...
Thomas P. Minka