6045 search results - page 273 / 1209 » Computable Linearizations of Well-partial-orderings |
179
click to vote
JGTOOLS
2006
15 years 7 months ago
2006
In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a...
196
click to vote
FCT
1993
Springer
15 years 11 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
205
click to vote
ICCAD
2007
IEEE
2007
IEEE
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
15 years 11 months ago
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
155
click to vote
WSCG
2003
15 years 8 months ago
2003
In the classical shading algorithm according to Phong, the normal is interpolated across the scanline, requiring a computationally expensive normalization in the inner loop. In th...
204
click to vote
CCGRID
2010
IEEE
15 years 7 months ago
2010
IEEE
—Despite extensive research focused on enabling QoS for grid users through economic and intelligent resource provisioning, no consensus has emerged on the most promising strategi...