Sciweavers

2962 search results - page 200 / 593
» Optimizing Spatial Data Structures For Static Data
Sort
View
FPGA
1999
ACM
174views FPGA» more  FPGA 1999»
15 years 10 months ago
Reduction of Latency and Resource Usage in Bit-Level Pipelined Data Paths for FPGAs
Pipelining of data path structures increases the throughput rate at the expense of enlarged resource usage and latency unless architectures optimized towards specific applications...
Peter Kollig, Bashir M. Al-Hashimi
PLDI
2003
ACM
15 years 11 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
DYNAMO
2000
74views more  DYNAMO 2000»
15 years 7 months ago
A framework for remote dynamic program optimization
Dynamic program optimization allows programs to be generated that are highly tuned for a given environment and input data set. Optimization techniques can be applied and re-applie...
Michael Voss, Rudolf Eigenmann
CGO
2005
IEEE
15 years 12 months ago
Performance of Runtime Optimization on BLAST
Optimization of a real world application BLAST is used to demonstrate the limitations of static and profile-guided optimizations and to highlight the potential of runtime optimiz...
Abhinav Das, Jiwei Lu, Howard Chen, Jinpyo Kim, Pe...
ICCV
2001
IEEE
16 years 8 months ago
The Variable Bandwidth Mean Shift and Data-Driven Scale Selection
We present two solutions for the scale selection problem in computer vision. The rst one is completely nonparametric and is based on the the adaptive estimation of the normalized ...
Dorin Comaniciu, Visvanathan Ramesh, Peter Meer