Sciweavers

1469 search results - page 242 / 294
» A New Migration Model For Distributed Genetic Algorithms
Sort
View
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 9 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
SBACPAD
2005
IEEE
176views Hardware» more  SBACPAD 2005»
14 years 2 months ago
Analyzing and Improving Clustering Based Sampling for Microprocessor Simulation
The time required to simulate a complete benchmark program using the cycle-accurate model of a microprocessor can be prohibitively high. One of the proposed methodologies, represe...
Yue Luo, Ajay Joshi, Aashish Phansalkar, Lizy Kuri...
MICCAI
2010
Springer
13 years 7 months ago
Incorporating Priors on Expert Performance Parameters for Segmentation Validation and Label Fusion: A Maximum a Posteriori STAPL
Abstract. In order to evaluate the quality of segmentations of an image and assess intra- and inter-expert variability in segmentation performance, an Expectation Maximization (EM)...
Olivier Commowick, Simon K. Warfield
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 10 months ago
Simultaneous Unsupervised Learning of Disparate Clusterings
Most clustering algorithms produce a single clustering for a given data set even when the data can be clustered naturally in multiple ways. In this paper, we address the difficult...
Prateek Jain, Raghu Meka, Inderjit S. Dhillon
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 2 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud