Sciweavers

2124 search results - page 105 / 425
» Aggregating time partitions
Sort
View
124
Voted
CASES
2003
ACM
15 years 9 months ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara
127
Voted
INFOCOM
2002
IEEE
15 years 8 months ago
A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...
Ariel Orda, Alexander Sprintson
112
Voted
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 7 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
126
Voted
GRAPHICSINTERFACE
2003
15 years 5 months ago
Texture Partitioning and Packing for Accelerating Texture-based Volume Rendering
To apply empty space skipping in texture-based volume rendering, we partition the texture space with a box-growing algorithm. Each sub-texture comprises of neighboring voxels with...
Wei Li 0004, Arie E. Kaufman
130
Voted
JMMA
2010
90views more  JMMA 2010»
14 years 10 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke