Sciweavers

4057 search results - page 333 / 812
» Linear combination of transformations
Sort
View
ICCS
2005
Springer
16 years 4 days ago
Generating Parallel Algorithms for Cluster and Grid Computing
We revisit and use the dependence transformation method to generate parallel algorithms suitable for cluster and grid computing. We illustrate this method in two applications: to o...
Ulisses Kendi Hayashida, Kunio Okuda, Jairo Panett...
199
Voted
CVPR
1998
IEEE
15 years 11 months ago
Mosaics of Scenes with Moving Objects
Image mosaics are useful for a variety of tasks in vision and computer graphics. A particularly convenient way to generate mosaics is by `stitching' together many ordinary ph...
James Davis
ICS
1999
Tsinghua U.
15 years 11 months ago
An experimental evaluation of tiling and shackling for memory hierarchy management
On modern computers, the performance of programs is often limited by memory latency rather than by processor cycle time. To reduce the impact of memory latency, the restructuring ...
Induprakas Kodukula, Keshav Pingali, Robert Cox, D...
ASPLOS
1992
ACM
15 years 10 months ago
Access Normalization: Loop Restructuring for NUMA Compilers
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...
Wei Li, Keshav Pingali
ECCV
2006
Springer
15 years 10 months ago
Trace Quotient Problems Revisited
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
Shuicheng Yan, Xiaoou Tang