1552 search results - page 105 / 311 » On the Complexity of Constant Propagation |
190
click to vote
VLSI
2010
Springer
15 years 4 months ago
2010
Springer
—In this paper, we introduce a design methodology to implement low-complexity and high-speed digital Finite Impulse Response (FIR) filters. Since FIR filters suffer from a larg...
206
click to vote
TIP
2011
15 years 1 months ago
2011
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...
160
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
180
click to vote
ICPP
1992
IEEE
15 years 10 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
164
click to vote
TIT
2008
15 years 6 months ago
2008
A new wavelet-based methodology for representing data on regular grids is introduced and studied. The main attraction of this new L-CAMP methodology is in the way it scales with th...