Sciweavers

6274 search results - page 602 / 1255
» From query complexity to computational complexity
Sort
View
JMLR
2012
13 years 9 months 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
TOG
2012
215views Communications» more  TOG 2012»
13 years 9 months ago
Dual loops meshing: quality quad layouts on manifolds
We present a theoretical framework and practical method for the automatic construction of simple, all-quadrilateral patch layouts on manifold surfaces. The resulting layouts are c...
Marcel Campen, David Bommes, Leif Kobbelt
CVPR
2012
IEEE
13 years 9 months ago
Background modeling using adaptive pixelwise kernel variances in a hybrid feature space
Recent work on background subtraction has shown developments on two major fronts. In one, there has been increasing sophistication of probabilistic models, from mixtures of Gaussi...
Manjunath Narayana, Allen R. Hanson, Erik G. Learn...
DAC
2006
ACM
16 years 8 months ago
Prototyping a fault-tolerant multiprocessor SoC with run-time fault recovery
Modern integrated circuits (ICs) are becoming increasingly complex. The complexity makes it difficult to design, manufacture and integrate these high-performance ICs. The advent o...
Xinping Zhu, Wei Qin
SAC
2004
ACM
16 years 18 days ago
A cost-oriented approach for infrastructural design
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...
Danilo Ardagna, Chiara Francalanci, Marco Trubian