Sciweavers

5171 search results - page 258 / 1035
» Deterministic Parallel Processing
Sort
View
130
Voted
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 2 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
ICCS
2007
Springer
15 years 8 months ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga
CVPR
2007
IEEE
16 years 4 months ago
Spatio-Temporal Markov Random Field for Video Denoising
This paper presents a novel spatio-temporal Markov random field (MRF) for video denoising. Two main issues are addressed in this paper, namely, the estimation of noise model and t...
Jia Chen, Chi-Keung Tang
ICCAD
2007
IEEE
91views Hardware» more  ICCAD 2007»
15 years 11 months ago
Variation-aware task allocation and scheduling for MPSoC
— As technology scales, the delay uncertainty caused by process variations has become increasingly pronounced in deep submicron designs. As a result, a paradigm shift from determ...
Feng Wang 0004, Chrysostomos Nicopoulos, Xiaoxia W...
131
Voted
ICALP
2004
Springer
15 years 8 months ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...