Sciweavers

2569 search results - page 244 / 514
» Approximate Objects and Approximate Theories
Sort
View
QUESTA
2007
170views more  QUESTA 2007»
15 years 6 months ago
Priority queueing systems: from probability generating functions to tail probabilities
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to inve...
Tom Maertens, Joris Walraevens, Herwig Bruneel
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 5 months ago
Distributed Detection over Time Varying Networks: Large Deviations Analysis
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...
Dragana Bajovic, Dusan Jakovetic, João Xavi...
JCC
2010
74views more  JCC 2010»
15 years 5 months ago
A first-order system least-squares finite element method for the Poisson-Boltzmann equation
The Poisson-Boltzmann equation is an important tool in modeling solvent in biomolecular systems. In this paper, we focus on numerical approximations to the electrostatic potential...
Stephen D. Bond, Jehanzeb Hameed Chaudhry, Eric C....
DPHOTO
2009
154views Hardware» more  DPHOTO 2009»
15 years 4 months ago
Optimal color filter array design: quantitative conditions and an efficient search procedure
Most digital cameras employ a spatial subsampling process, implemented as a color filter array (CFA), to capture color images. The choice of CFA patterns has a great impact on the...
Yue M. Lu, Martin Vetterli
SIAMMAX
2010
103views more  SIAMMAX 2010»
15 years 1 months ago
On Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
Vance Faber, Jörg Liesen, Petr Tichý