Sciweavers

2609 search results - page 101 / 522
» Optimizing for parallelism and data locality
Sort
View
MICCAI
2009
Springer
16 years 1 months ago
Task-Optimal Registration Cost Functions
Abstract. In this paper, we propose a framework for learning the parameters of registration cost functions ? such as the tradeoff between the regularization and image similiarity t...
B. T. Thomas Yeo, Mert R. Sabuncu, Polina Gollan...
105
Voted
IWCM
2004
Springer
15 years 6 months ago
Wiener-Optimized Discrete Filters for Differential Motion Estimation
Abstract. Differential motion estimation is based on detecting brightness changes in local image structures. Filters approximating the local gradient are applied to the image seque...
Kai Krajsek, Rudolf Mester
WAW
2010
Springer
306views Algorithms» more  WAW 2010»
14 years 10 months ago
Finding and Visualizing Graph Clusters Using PageRank Optimization
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
Fan Chung Graham, Alexander Tsiatas
99
Voted
HPCA
2009
IEEE
16 years 1 months ago
PageNUCA: Selected policies for page-grain locality management in large shared chip-multiprocessor caches
As the last-level on-chip caches in chip-multiprocessors increase in size, the physical locality of on-chip data becomes important for delivering high performance. The non-uniform...
Mainak Chaudhuri
PODC
2005
ACM
15 years 6 months ago
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
We propose a scheme for building peer-to-peer overlay networks for broadcasting using network coding. The scheme addresses many practical issues such as scalability, robustness, c...
Kamal Jain, László Lovász, Ph...