Sciweavers

4212 search results - page 837 / 843
» On Compressible Pairings and Their Computation
Sort
View
PAMI
2010
215views more  PAMI 2010»
13 years 6 months ago
Fusion Moves for Markov Random Field Optimization
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...
RSA
2010
107views more  RSA 2010»
13 years 6 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
SIAMSC
2010
116views more  SIAMSC 2010»
13 years 6 months ago
Recursively Accelerated Multilevel Aggregation for Markov Chains
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...
Hans De Sterck, K. Miller, G. Sanders, M. Winlaw
WDAG
2010
Springer
218views Algorithms» more  WDAG 2010»
13 years 6 months ago
Anonymous Asynchronous Systems: The Case of Failure Detectors
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...
François Bonnet, Michel Raynal
BIBM
2010
IEEE
286views Bioinformatics» more  BIBM 2010»
13 years 6 months ago
Evaluation of short read metagenomic assembly
Advances in sequencing technologies have equipped researchers with the ability to sequence the collective genome of entire microbial communities commonly referred to as metagenomi...
Anveshi Charuvaka, Huzefa Rangwala