Sciweavers

4208 search results - page 69 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
HIPC
1999
Springer
15 years 2 months ago
Memory-Optimal Evaluation of Expression Trees Involving Large Objects
The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronic structure calculations. Often, the tree node objects a...
Chi-Chung Lam, Daniel Cociorva, Gerald Baumgartner...
EUC
2004
Springer
15 years 3 months ago
On the Effects of Bandwidth Reduction Techniques in Distributed Applications
Communication optimization plays an important role in building networked distributed applications. In this paper, we systematically evaluate four bandwidth reduction algorithms, n...
Hanping Lufei, Weisong Shi, Lucia Zamorano
ECCV
2008
Springer
15 years 11 months ago
Background Subtraction on Distributions
Environmental monitoring applications present a challenge to current background subtraction algorithms that analyze the temporal variability of pixel intensities, due to the comple...
Teresa Ko, Stefano Soatto, Deborah Estrin
ICCV
2009
IEEE
16 years 2 months ago
Scene Shape Priors for Superpixel Segmentation
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for feat...
Alastair P. Moore, Simon J. D. Prince, Jonathan Wa...
PDCN
2007
14 years 11 months ago
A new robust centralized DMX algorithm
In a distributed system, process synchronization is an important agenda. One of the major duties for process synchronization is mutual exclusion. This paper presents a new central...
Moharram Challenger, Vahid Khalilpour, Peyman Baya...