Sciweavers

1640 search results - page 185 / 328
» Conditional Independence Trees
Sort
View
MANSCI
2006
63views more  MANSCI 2006»
13 years 9 months ago
Multiplicative Background Risk
Although there has been much attention in recent years on the effects of additive background risks, the same is not true for its multiplicative counterpart. We consider random wea...
Günter Franke, Harris Schlesinger, Richard C....
TIP
2008
109views more  TIP 2008»
13 years 8 months ago
Iterative Rate-Distortion Optimization of H.264 With Constant Bit Rate Constraint
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. Th...
Cheolhong An, Truong Q. Nguyen
TIT
2008
79views more  TIT 2008»
13 years 8 months ago
Outage Capacity of MIMO Poisson Fading Channels
The information outage probability of a shot-noise limited direct detection multiple-input multipleoutput (MIMO) optical channel subject to block fading is considered. Information...
Kaushik Chakraborty, Subhrakanti Dey, Massimo Fran...
ADCM
1999
49views more  ADCM 1999»
13 years 8 months ago
Dyadic Hermite interpolation on a rectangular mesh
: Given f and rf at the vertices of a rectangular mesh, we build an interpolating function f by a subdivision algorithm. The construction on each elementary rectangle is independen...
Serge Dubuc, Jean-Louis Merrien
DM
1998
100views more  DM 1998»
13 years 8 months ago
Upper domination and upper irredundance perfect graphs
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...
Gregory Gutin, Vadim E. Zverovich