725 search results - page 70 / 145 » Bounding Degrees on RPL |
COMGEO
2006
ACM
13 years 11 months ago
2006
ACM
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
—We consider transmission of a continuous amplitude source over an L-block Rayleigh-fading Mt 2 Mr multiple-input multiple-output (MIMO) channel when the channel state informatio...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...