Sciweavers

544 search results - page 71 / 109
» On the Complexity of Loop Fusion
Sort
View
IJRR
2010
113views more  IJRR 2010»
13 years 7 months ago
On the Topology of Discrete Strategies
This paper explores a topological perspective of planning in the presence of uncertainty, focusing on tasks specified by goal states in discrete spaces. The paper introduces stra...
Michael Erdmann
ICIP
2002
IEEE
14 years 10 months ago
Efficient and universal scalable video coding
This paper proposes a unified efficient and universal scalable video coding framework that supports different scalabilities, such as fine granularity quality, temporal, spatial an...
Feng Wu, Shipeng Li, Rong Yan, Xiaoyan Sun, Ya-Qin...
ICCD
2000
IEEE
93views Hardware» more  ICCD 2000»
14 years 5 months ago
Cheap Out-of-Order Execution Using Delayed Issue
In superscalar architectures, out-of-order issue mechanisms increase performance by dynamically rescheduling instructions that cannot be statically reordered by the compiler. Whil...
J. P. Grossman
AFRICACRYPT
2010
Springer
14 years 3 months ago
Avoiding Full Extension Field Arithmetic in Pairing Computations
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
IEEEPACT
2009
IEEE
14 years 3 months ago
Automatic Tuning of Discrete Fourier Transforms Driven by Analytical Modeling
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
Basilio B. Fraguela, Yevgen Voronenko, Markus P&uu...