6142 search results - page 559 / 1229 » The Complexity of Partition Functions |
174
click to vote
IPL
2007
15 years 7 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
228
click to vote
JSAC
2007
15 years 7 months ago
2007
— A cross-layer packet scheduling scheme that streams pre-encoded video over wireless downlink packet access networks to multiple users is presented. The scheme can be used with ...
190
click to vote
MST
1998
15 years 6 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
206
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
224
click to vote
MICCAI
2010
Springer
15 years 5 months ago
2010
Springer
Due to the complex noise structure of functional magnetic resonance imaging (fMRI) data, methods that rely on information within a single subject often results in unsatisfactory fu...