Sciweavers

3875 search results - page 624 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
CVGIP
2007
136views more  CVGIP 2007»
15 years 5 months ago
Contour-based surface reconstruction using MPU implicit models
This paper presents a technique for creating a smooth, closed surface from a set of 2D contours, which have been extracted from a 3D scan. The technique interprets the pixels that...
Ilya Braude, Jeffrey Marker, Ken Museth, Jonathan ...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 6 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 5 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
ICIP
2007
IEEE
16 years 7 months ago
Compressed Sensing Image Reconstruction Via Recursive Spatially Adaptive Filtering
We introduce a new approach to image reconstruction from highly incomplete data. The available data are assumed to be a small collection of spectral coef?cients of an arbitrary li...
Karen O. Egiazarian, Alessandro Foi, Vladimir Katk...
163
Voted
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 9 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...