Sciweavers

2477 search results - page 247 / 496
» Approximate extended formulations
Sort
View
COCOON
2010
Springer
15 years 10 months ago
A Three-String Approach to the Closest String Problem
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
Zhi-Zhong Chen, Bin Ma, Lusheng Wang
BMVC
2002
15 years 9 months ago
Blending Images for Texturing 3D Models
This paper describes a novel system for building seamless texture maps for a surface of arbitrary topology from real images of the object taken with a standard digital camera and ...
Adam Baumberg
IPCO
2007
98views Optimization» more  IPCO 2007»
15 years 8 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
NIPS
2008
15 years 8 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie
NIPS
2007
15 years 8 months ago
Bayes-Adaptive POMDPs
Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning...
Stéphane Ross, Brahim Chaib-draa, Joelle Pi...