Sciweavers

2814 search results - page 373 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
IPPS
2006
IEEE
14 years 4 months ago
Aligning traces for performance evaluation
For many performance analysis problems, the ability to reason across traces is invaluable. However, due to non-determinism in the OS and virtual machines, even two identical runs ...
Todd Mytkowicz, Amer Diwan, Matthias Hauswirth, Pe...
NOSSDAV
2005
Springer
14 years 3 months ago
Using n-trees for scalable event ordering in peer-to-peer games
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
Chris GauthierDickey, Virginia Mary Lo, Daniel Zap...
CAIP
2001
Springer
293views Image Analysis» more  CAIP 2001»
14 years 2 months ago
A Markov Random Field Image Segmentation Model Using Combined Color and Texture Features
In this paper, we propose a Markov random field (MRF) image segmentation model which aims at combining color and texture features. The theoretical framework relies on Bayesian est...
Zoltan Kato, Ting-Chuen Pong
ISPAN
2000
IEEE
14 years 2 months ago
Versatile Processor Design for Efficiency and High Performance
We present new architectural concepts for uniprocessor designs that conform to the data-driven computation paradigm. Usage of our D2 -CPU (Data-Driven processor) follows the natura...
Sotirios G. Ziavras
SPAA
1996
ACM
14 years 2 months ago
BSP vs LogP
A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, alth...
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietr...