Sciweavers

400 search results - page 20 / 80
» Extended formulations in combinatorial optimization
Sort
View
TIT
2008
81views more  TIT 2008»
14 years 11 months ago
Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints
Abstract--In this paper, the Lagrangian formulation of variablerate vector quantization is extended to quantization with simultaneous constraints on entropy and codebook size, incl...
Robert M. Gray, Tamás Linder, John T. Gill ...
JMLR
2008
159views more  JMLR 2008»
14 years 11 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
JACM
2007
115views more  JACM 2007»
14 years 11 months ago
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
Éric Colin de Verdière, Francis Laza...
CVPR
2004
IEEE
16 years 1 months ago
Approximation of Canonical Sets and Their Applications to 2D View Simplification
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
Trip Denton, Jeff Abrahamson, Ali Shokoufandeh
ATMOS
2008
187views Optimization» more  ATMOS 2008»
15 years 1 months ago
Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
Karl Nachtigall, Jens Opitz