Sciweavers

2354 search results - page 307 / 471
» Randomness, Stochasticity and Approximations
Sort
View
AI
2005
Springer
15 years 6 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo
BMCBI
2004
146views more  BMCBI 2004»
15 years 6 months ago
Multivariate search for differentially expressed gene combinations
Background: To identify differentially expressed genes, it is standard practice to test a twosample hypothesis for each gene with a proper adjustment for multiple testing. Such te...
Yuanhui Xiao, Robert D. Frisina, Alexander Gordon,...
CVPR
2005
IEEE
16 years 8 months ago
Estimating Disparity and Occlusions in Stereo Video Sequences
We propose an algorithm for estimating disparity and occlusion in stereo video sequences. The algorithm defines a prior on sequences of disparity maps using a 3D Markov random fie...
Oliver M. C. Williams, Michael Isard, John MacCorm...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
16 years 1 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
FOCS
2008
IEEE
16 years 20 days ago
Linear Level Lasserre Lower Bounds for Certain k-CSPs
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
Grant Schoenebeck