Sciweavers

2136 search results - page 98 / 428
» Improving on Expectation Propagation
Sort
View
ACCV
2010
Springer
13 years 5 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
ICASSP
2011
IEEE
13 years 1 months ago
Approximated kernel density estimation for multiple TDOA detection
The Generalized State Coherence Transform (GSCT) has been recently proposed as an efficient tool for the estimation of multidimensional TDOA of multiple sources. The transform de...
Francesco Nesta, Maurizio Omologo
INFOCOM
2011
IEEE
13 years 1 months ago
SigSag: Iterative detection through soft message-passing
—The multiple-access framework of ZigZag decoding [1] is a useful technique for combating interference via multiple repeated transmissions, and is known to be compatible with dis...
Arash Saber Tehrani, Alexandros G. Dimakis, Michae...
SIGSOFT
2008
ACM
14 years 10 months ago
Improving robustness of evolving exceptional behaviour in executable models
Executable models are increasingly being employed by development teams to implement robust software systems. Modern executable models offer powerful composition mechanisms that al...
Alessandro Garcia, Nélio Cacho, Thomas Cott...
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
14 years 4 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop