Sciweavers

2609 search results - page 473 / 522
» Optimizing for parallelism and data locality
Sort
View
ISAAC
2007
Springer
70views Algorithms» more  ISAAC 2007»
15 years 4 months ago
Kinetic Maintenance of Mobile k-Centres on Trees
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
Stephane Durocher, Christophe Paul
SCALESPACE
2007
Springer
15 years 4 months ago
A Geometric Variational Framework for Simultaneous Registration and Parcellation of Homologous Surfaces
In clinical applications where structural asymmetries between homologous shapes have been correlated with pathology, the questions of definition and quantification of ‘asymmetr...
Nicholas A. Lord, Jeffrey Ho, Baba C. Vemuri, Step...
TRIDENTCOM
2006
IEEE
15 years 4 months ago
Cross-layer multi-hop wireless routing for inter-vehicle communication
— Ad-hoc networking provides a cost-effective support structure for inter-vehicle communication. A decentralized peerto-peer information dissemination architecture is well suited...
Jatinder Pal Singh, Nicholas Bambos, Bhaskar Srini...
63
Voted
PLDI
2005
ACM
15 years 3 months ago
Formal loop merging for signal transforms
A critical optimization in the domain of linear signal transforms, such as the discrete Fourier transform (DFT), is loop merging, which increases data locality and reuse and thus ...
Franz Franchetti, Yevgen Voronenko, Markus Pü...
76
Voted
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
15 years 3 months ago
XCS for robust automatic target recognition
A primary strength of the XCS approach is its ability to create maximally accurate general rules. In automatic target recognition (ATR) there is a need for robust performance beyo...
B. Ravichandran, Avinash Gandhe, Robert E. Smith