Sciweavers

2609 search results - page 251 / 522
» Optimizing for parallelism and data locality
Sort
View
RSP
2005
IEEE
164views Control Systems» more  RSP 2005»
16 years 6 days ago
High Level Synthesis for Data-Driven Applications
Abstract— John von Neumann proposed his famous architecture in a context where hardware was very expensive and bulky. His goal was to maximize functionality with minimal hardware...
Etienne Bergeron, Xavier Saint-Mleux, Marc Feeley,...
SCIA
2007
Springer
149views Image Analysis» more  SCIA 2007»
16 years 22 days ago
Triangulation of Points, Lines and Conics
The problem of reconstructing 3D scene features from multiple views with known camera motion and given image correspondences is considered. This is a classical and one of the most...
Klas Josephson, Fredrik Kahl
CLOUD
2010
ACM
15 years 11 months ago
Nephele/PACTs: a programming model and execution framework for web-scale analytical processing
We present a parallel data processor centered around a programming model of so called Parallelization Contracts (PACTs) and the scalable parallel execution engine Nephele [18]. Th...
Dominic Battré, Stephan Ewen, Fabian Hueske...
POPL
2002
ACM
16 years 7 months ago
An efficient profile-analysis framework for data-layout optimizations
Data-layout optimizations rearrange fields within objects, objects within objects, and objects within the heap, with the goal of increasing spatial locality. While the importance ...
Rastislav Bodík, Shai Rubin, Trishul M. Chi...
JMLR
2012
13 years 9 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss