Sciweavers

946 search results - page 163 / 190
» Maximizing data locality in distributed systems
Sort
View
ICCV
2005
IEEE
14 years 2 months ago
Learning the Probability of Correspondences without Ground Truth
We present a quality assessment procedure for correspondence estimation based on geometric coherence rather than ground truth. The procedure can be used for performance evaluation...
Qingxiong Yang, R. Matt Steele, David Nisté...
LCPC
2001
Springer
14 years 28 days ago
Strength Reduction of Integer Division and Modulo Operations
Integer division, modulo, and remainder operations are expressive and useful operations. They are logical candidates to express complex data accesses such as the wrap-around behav...
Jeffrey Sheldon, Walter Lee, Ben Greenwald, Saman ...
ASPLOS
1996
ACM
14 years 19 days ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...
USENIX
1996
13 years 9 months ago
Transparent Fault Tolerance for Parallel Applications on Networks of Workstations
This paper describes a new method for providingtransparent fault tolerance for parallel applications on a network of workstations. We have designed our method in the context of sh...
Daniel J. Scales, Monica S. Lam
MSWIM
2009
ACM
14 years 3 months ago
On providing location privacy for mobile sinks in wireless sensor networks
Wireless sensor networks have attracted increasing attentions considering their potentials for being widely adopted in both emerging civil and military applications. A common prac...
Edith C.-H. Ngai, Ioana Rodhe