Sciweavers

26 search results - page 4 / 6
» Stieltjes moment problem via fractional moments
Sort
View
VTC
2008
IEEE
125views Communications» more  VTC 2008»
13 years 11 months ago
A General Formula for Log-MGF Computation: Application to the Approximation of Log-Normal Power Sum via Pearson Type IV Distribu
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
Marco Di Renzo, Fabio Graziosi, Fortunato Santucci
APPROX
2009
Springer
118views Algorithms» more  APPROX 2009»
13 years 11 months ago
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
T. S. Jayram
ICCAD
1999
IEEE
101views Hardware» more  ICCAD 1999»
13 years 9 months ago
Efficient model reduction of interconnect via approximate system gramians
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
Jing-Rebecca Li, Jacob White
ACSC
2007
IEEE
13 years 11 months ago
Jooj: Real-Time Support For Avoiding Cyclic Dependencies
The design guideline avoid dependency cycles among modules was first alluded to by Parnas in 1978. Many tools have since been built to detect cyclic dependencies among a program...
Hayden Melton, Ewan D. Tempero
BMCBI
2005
150views more  BMCBI 2005»
13 years 5 months ago
Approaching the taxonomic affiliation of unidentified sequences in public databases - an example from the mycorrhizal fungi
Background: During the last few years, DNA sequence analysis has become one of the primary means of taxonomic identification of species, particularly so for species that are minut...
R. Henrik Nilsson, Erik Kristiansson, Martin Ryber...