2814 search results - page 373 / 563 » Competitive Analysis of Distributed Algorithms |
155
click to vote
IPPS
2006
IEEE
16 years 14 days ago
2006
IEEE
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 ...
165
click to vote
NOSSDAV
2005
Springer
15 years 12 months ago
2005
Springer
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...
218
click to vote
CAIP
2001
Springer
15 years 11 months ago
2001
Springer
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...
176
click to vote
ISPAN
2000
IEEE
15 years 10 months ago
2000
IEEE
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...
170
click to vote
SPAA
1996
ACM
15 years 10 months ago
1996
ACM
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...