Sciweavers

544 search results - page 57 / 109
» On the Complexity of Loop Fusion
Sort
View
IJISEC
2008
108views more  IJISEC 2008»
13 years 9 months ago
A note on the Ate pairing
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairing-friendl...
Changan Zhao, Fangguo Zhang, Jiwu Huang
JAR
1998
60views more  JAR 1998»
13 years 8 months ago
Elimination of Self-Resolving Clauses
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
Hans Jürgen Ohlbach
ICMCS
2006
IEEE
170views Multimedia» more  ICMCS 2006»
14 years 2 months ago
A Fast Mode Selection Algorithm in H.264 Video Coding
For improvement of coding efficiency, the H.264 video coding standard uses new coding tools, such as variable block size, quarter-pixel-accuracy motion estimation, multiple refere...
Donghyung Kim, Jechang Jeong
CONCURRENCY
2010
130views more  CONCURRENCY 2010»
13 years 9 months ago
Enabling high-speed asynchronous data extraction and transfer using DART
As the complexity and scale of current scientific and engineering applications grow, managing and transporting the large amounts of data they generate is quickly becoming a signif...
Ciprian Docan, Manish Parashar, Scott Klasky
POPL
2006
ACM
14 years 9 months ago
Simplifying reductions
We present optimization techniques for high level equational programs that are generalizations of affine control loops (ACLs). Significant parts of the SpecFP and PerfectClub benc...
Gautam Gupta, Sanjay V. Rajopadhye