Sciweavers

439 search results - page 53 / 88
» Choiceless Computation and Symmetry
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
SWARM: A Parallel Programming Framework for Multicore Processors
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
David A. Bader, Varun Kanade, Kamesh Madduri
ECCV
2010
Springer
15 years 2 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
IPPS
1999
IEEE
15 years 2 months ago
Parallel Algorithms for 3D Reconstruction of Asymmetric Objects from Electron Micrographs
We present new parallel algorithms for 3D reconstruction of objects from 2D projections and their application for the determination of the structure of macromolecules from electro...
Robert E. Lynch, Dan C. Marinescu, Hong Lin, Timot...
EOR
2008
125views more  EOR 2008»
14 years 9 months ago
Shapley mappings and the cumulative value for n-person games with fuzzy coalitions
In this paper we prove the existence and uniqueness of a solution concept for n-person games with fuzzy coalitions, which we call the Shapley mapping. The Shapley mapping, when it...
Dan Butnariu, Tomás Kroupa
IWC
2000
99views more  IWC 2000»
14 years 9 months ago
Effective information visualisation: a study of graph drawing aesthetics and algorithms
Information visualisation systems which generate diagrams representing discrete relational information must consider potential users if they are to be effective. Many algorithms w...
Helen C. Purchase