Sciweavers

1612 search results - page 138 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
EUROPAR
2006
Springer
15 years 8 months ago
On-Line Adaptive Parallel Prefix Computation
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
Jean-Louis Roch, Daouda Traoré, Julien Bern...
158
Voted
DCAI
2008
15 years 6 months ago
Solving the Oil Spill Problem Using a Combination of CBR and a Summarization of SOM Ensembles
. In this paper, a forecasting system is presented. It predicts the presence of oil slicks in a certain area of the open sea after an oil spill using Case-Based Reasoning methodolo...
Aitor Mata, Emilio Corchado, Bruno Baruque
168
Voted
JMLR
2010
115views more  JMLR 2010»
15 years 3 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
CVIU
2006
76views more  CVIU 2006»
15 years 5 months ago
Homeostatic image perception: An artificial system
This paper describes how a visual system can automatically define features of interest from the observation of a large enough number of natural images. The principle complements t...
Thomas Feldman, Laurent Younes
150
Voted
ICPADS
2008
IEEE
15 years 11 months ago
Integrity-Preserving Replica Coordination for Byzantine Fault Tolerant Systems
The use of good random numbers is essential to the integrity of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious i...
Wenbing Zhao