Sciweavers

725 search results - page 70 / 145
» Bounding Degrees on RPL
Sort
View
118
Voted
COMGEO
2006
ACM
15 years 22 days ago
On the sizes of Delaunay meshes
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...
Siu-Wing Cheng
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 21 days ago
Complexity of Data Flow Analysis for Non-Separable Frameworks
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 ...
Bageshri Karkare, Uday P. Khedker
111
Voted
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 21 days ago
Quasi-friendly sup-interpretations
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...
Jean-Yves Marion, Romain Péchoux
CORR
2007
Springer
141views Education» more  CORR 2007»
15 years 20 days ago
Joint Source-Channel Codes for MIMO Block Fading Channels
—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...
Deniz Gündüz, Elza Erkip
CORR
2007
Springer
155views Education» more  CORR 2007»
15 years 20 days ago
Low-density graph codes that are optimal for source/channel coding and binning
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-...
Martin J. Wainwright, Emin Martinian