Sciweavers

ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
13 years 7 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick
IPPS
2010
IEEE
13 years 7 months ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé
IPPS
2010
IEEE
13 years 7 months ago
Oblivious algorithms for multicores and network of processors
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
Rezaul Alam Chowdhury, Francesco Silvestri, Brando...
IPPS
2010
IEEE
13 years 7 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
IMCSIT
2010
13 years 7 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
ICPR
2010
IEEE
13 years 7 months ago
A Simulation Study on the Generative Neural Ensemble Decoding Algorithms
Brain-computer interfaces rely on accurate decoding of cortical activity to understand intended action. Algorithms for neural decoding can be broadly categorized into two groups: d...
Sung-Phil Kim, Min-Ki Kim, Gwi-Tae Park
ICPR
2010
IEEE
13 years 7 months ago
An Efficient and Stable Algorithm for Learning Rotations
This paper analyses the computational complexity and stability of an online algorithm recently proposed for learning rotations. The proposed algorithm involves multiplicative upda...
Raman Arora, William A. Sethares
ICMLA
2010
13 years 7 months ago
Heuristic Method for Discriminative Structure Learning of Markov Logic Networks
Markov Logic Networks (MLNs) combine Markov Networks and first-order logic by attaching weights to firstorder formulas and viewing them as templates for features of Markov Networks...
Quang-Thang Dinh, Matthieu Exbrayat, Christel Vrai...
ICIP
2010
IEEE
13 years 7 months ago
Preattentive co-saliency detection
This paper presents a new algorithm to solve the problem of co-saliency detection, i.e., to find the common salient objects that are present in both of a pair of input images. Unl...
Hwann-Tzong Chen
ICIP
2010
IEEE
13 years 7 months ago
Gaussian mixture models for spots in microscopy using a new split/merge em algorithm
In confocal microscopy imaging, target objects are labeled with fluorescent markers in the living specimen, and usually appear as spots in the observed images. Spot detection and ...
Kangyu Pan, Anil C. Kokaram, Jens Hillebrand, Mani...