Sciweavers

151 search results - page 17 / 31
» Computable Shell Decomposition Bounds
Sort
View
JC
2011
87views more  JC 2011»
13 years 2 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
ISVC
2009
Springer
14 years 1 months ago
GPU-Based Ray Casting of Multiple Multi-resolution Volume Datasets
We developed a GPU-based volume ray casting system for rendering multiple arbitrarily overlapping multi-resolution volume data sets. Our efficient volume virtualization scheme is b...
Christopher Lux, Bernd Fröhlich
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 6 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
IWPEC
2004
Springer
14 years 23 days ago
Online Problems, Pathwidth, and Persistence
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
Rodney G. Downey, Catherine McCartin
ICASSP
2008
IEEE
14 years 1 months ago
Blind source separation using monochannel overcomplete dictionaries
We propose a new approach to underdetermined Blind Source Separation (BSS) using sparse decomposition over monochannel dictionary atoms and compare it to multichannel dictionary a...
B. Vikrham Gowreesunker, Ahmed H. Tewfik