284 search results - page 39 / 57 » Distributed Agreement with Optimal Communication Complexity |
149
Voted
ICPADS
1998
IEEE
15 years 7 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
115
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
136
Voted
CN
1999
15 years 3 months ago
1999
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
135
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
152
Voted
PRL
2008
15 years 3 months ago
2008
This paper presents an extension of the relevance vector machine (RVM) algorithm to multivariate regression. This allows the application to the task of estimating the pose of an a...