Sciweavers

2527 search results - page 83 / 506
» Discrete optimization in computer vision
Sort
View
MP
1998
109views more  MP 1998»
14 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
CVIU
2007
125views more  CVIU 2007»
14 years 9 months ago
Graph regularization for color image processing
Nowadays color image processing is an essential issue in computer vision. Variational formulations provide a framework for color image restoration, smoothing and segmentation prob...
Olivier Lezoray, Abderrahim Elmoataz, Sébas...
COMPGEOM
1991
ACM
15 years 1 months ago
The Two Guards Problem
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
Christian Icking, Rolf Klein
TIT
1998
81views more  TIT 1998»
14 years 9 months ago
Fast Iterative Coding Techniques for Feedback Channels
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
James M. Ooi, Gregory W. Wornell
SODA
2010
ACM
163views Algorithms» more  SODA 2010»
15 years 7 months ago
Geometric optimization and sums of algebraic functions
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
Antoine Vigneron