1640 search results - page 124 / 328 » Conditional Independence Trees |
178
click to vote
JAL
2002
15 years 6 months ago
2002
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...
161
click to vote
FOCM
2010
15 years 4 months ago
2010
B-series are a fundamental tool in practical and theoretical aspects of numerical integrators for ordinary differential equations. A composition law for B-series permits an elega...
183
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
166
click to vote
FOCS
2005
IEEE
15 years 12 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
136
click to vote
DCC
2004
IEEE
16 years 5 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...