Sciweavers

1578 search results - page 177 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
CGF
2010
189views more  CGF 2010»
13 years 10 months ago
Real-time Depth of Field Rendering via Dynamic Light Field Generation and Filtering
We present a new algorithm for efficient rendering of high-quality depth-of-field (DoF) effects. We start with a single rasterized view (reference view) of the scene, and sample t...
Xuan Yu, Rui Wang, Jingyi Yu
IANDC
2008
122views more  IANDC 2008»
13 years 10 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
ICASSP
2011
IEEE
13 years 1 months ago
Acceleration of adaptive proximal forward-backward splitting method and its application to sparse system identification
In this paper, we propose an acceleration technique of the adaptive filtering scheme called adaptive proximal forward-backward splitting method. For accelerating the convergence ...
Masao Yamagishi, Masahiro Yukawa, Isao Yamada
CEC
2010
IEEE
13 years 1 months ago
Revisiting Evolutionary Information Filtering
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
Nikolaos Nanas, Stefanos Kodovas, Manolis Vavalis
JMLR
2012
12 years 17 days ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski