Sciweavers

3422 search results - page 350 / 685
» Random Subset Optimization
Sort
View
SPAA
2009
ACM
16 years 5 months ago
Brief announcement: selfishness in transactional memory
In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI),...
Raphael Eidenbenz, Roger Wattenhofer
150
Voted
ICASSP
2009
IEEE
15 years 11 months ago
Time-space-sequential algorithms for distributed Bayesian state estimation in serial sensor networks
We consider distributed estimation of a time-dependent, random state vector based on a generally nonlinear/non-Gaussian state-space model. The current state is sensed by a serial ...
Ondrej Hlinka, Franz Hlawatsch
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
15 years 11 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
ICIP
2008
IEEE
15 years 11 months ago
MAP-MRF approach for binarization of degraded document image
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
Jung Gap Kuk, Nam Ik Cho, Kyoung Mu Lee
FOCI
2007
IEEE
15 years 11 months ago
Faster Evolutionary Algorithms by Superior Graph Representation
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
Benjamin Doerr, Christian Klein, Tobias Storch