Sciweavers

376 search results - page 53 / 76
» On the Advice Complexity of Online Problems
Sort
View
JGTOOLS
2008
137views more  JGTOOLS 2008»
14 years 11 months ago
Robust Soft Shadow Mapping with Backprojection and Depth Peeling
Abstract. Soft shadow mapping is an attractive solution to the problem of realtime soft shadows because it works with any kind of rasterizable geometry (in particular alpha-transpa...
Louis Bavoil, Steven P. Callahan, Cláudio T...
SIGPRO
2008
106views more  SIGPRO 2008»
14 years 11 months ago
Propagator-based methods for recursive subspace model identification
The problem of the online identification of multi-input multi-output (MIMO) state-space models in the framework of discrete-time subspace methods is considered in this paper. Seve...
Guillaume Mercère, Laurent Bako, Sté...
TNN
2008
138views more  TNN 2008»
14 years 11 months ago
A Fast and Scalable Recurrent Neural Network Based on Stochastic Meta Descent
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
Zhenzhen Liu, Itamar Elhanany
AAAI
2006
15 years 1 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
CVPR
2009
IEEE
16 years 4 months ago
Tracking of a Non-Rigid Object via Patch-based Dynamic Appearance Modeling and Adaptive Basin Hopping Monte Carlo Sampling
We propose a novel tracking algorithm for the target of which geometric appearance changes drastically over time. To track it, we present a local patch-based appearance model and p...
Junseok Kwon (Seoul National University), Kyoung M...