Sciweavers

3874 search results - page 616 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 11 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
ICASSP
2011
IEEE
14 years 7 months ago
Predictive modeling of the spatiotemporal evolution of an environmental hazard and its sensor network implementation
Predicting accurately the spatiotemporal evolution of a diffusive environmental hazard is of paramount importance for its effective containment. We approximate the front line of a...
Dimitris V. Manatakis, Elias S. Manolakos
ICASSP
2011
IEEE
14 years 7 months ago
Distributed linear discriminant analysis
Linear discriminant analysis (LDA) is a widely used feature extraction method for classification. We introduce distributed implementations of different versions of LDA, suitable ...
Sergio Valcarcel Macua, Pavle Belanovic, Santiago ...
CVPR
2012
IEEE
13 years 6 months ago
Image denoising: Can plain neural networks compete with BM3D?
Image denoising can be described as the problem of mapping from a noisy image to a noise-free image. The best currently available denoising methods approximate this mapping with c...
Harold Christopher Burger, Christian J. Schuler, S...
CVPR
2007
IEEE
16 years 6 months ago
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
Olga Veksler