Sciweavers

1270 search results - page 194 / 254
» Improving Code Density Using Compression Techniques
Sort
View
IJCV
2000
141views more  IJCV 2000»
13 years 9 months ago
Reliable Estimation of Dense Optical Flow Fields with Large Displacements
In this paper we show that a classic optical ow technique by Nagel and Enkelmann (1986) can be regarded as an early anisotropic di usion method with a di usion tensor. We introduc...
Luis Álvarez, Joachim Weickert, Javier S&aa...
CGO
2009
IEEE
14 years 4 months ago
OptiScope: Performance Accountability for Optimizing Compilers
Compilers employ many aggressive code transformations to achieve highly optimized code. However, because of complex target architectures and unpredictable optimization interaction...
Tipp Moseley, Dirk Grunwald, Ramesh Peri
OOPSLA
2009
Springer
14 years 4 months ago
Minimizing dependencies within generic classes for faster and smaller programs
Generic classes can be used to improve performance by allowing compile-time polymorphism. But the applicability of compile-time polymorphism is narrower than that of runtime polym...
Dan Tsafrir, Robert W. Wisniewski, David F. Bacon,...
SSWMC
2004
13 years 11 months ago
An informed synchronization scheme for audio data hiding
This paper deals with the problem of synchronization in the particular case of audio data hiding. In this kind of application the goal is to increase the information of an audio d...
Alejandro LoboGuerrero, Patrick Bas, Joel Lienard
CODES
2004
IEEE
14 years 1 months ago
Operation tables for scheduling in the presence of incomplete bypassing
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...