Sciweavers

416 search results - page 38 / 84
» A Paradigm for Parallel Matrix Algorithms:
Sort
View
139
Voted
IOPADS
1996
87views more  IOPADS 1996»
15 years 5 months ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski
IMAMS
2003
93views Mathematics» more  IMAMS 2003»
15 years 5 months ago
Vector Transport for Shape-from-Shading
In this paper we describe a new shape-from-shading method. We show how the parallel transport of surface normals can be used to impose curvature consistency and also to iterativel...
Fabio Sartori, Edwin R. Hancock
AC
2008
Springer
15 years 4 months ago
Distributed Sparse Matrices for Very High Level Languages
Sparse matrices are first class objects in many VHLLs (very high level languages) used for scientific computing. They are a basic building block for various numerical and combinat...
John R. Gilbert, Steve Reinhardt, Viral Shah
CVPR
2006
IEEE
16 years 6 months ago
Surface Geometric Constraints for Stereo in Belief Propagation
Belief propagation has been shown to be a powerful inference mechanism for stereo correspondence. However the classical formulation of belief propagation implicitly imposes the fr...
Gang Li, Steven W. Zucker
141
Voted
ICDCS
2006
IEEE
15 years 10 months ago
Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks
— We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm re...
Shashidhar Gandham, Ying Zhang, Qingfeng Huang