Sciweavers

1261 search results - page 140 / 253
» Approximation algorithms for aligning points
Sort
View
UAI
2004
14 years 11 months ago
On the Choice of Regions for Generalized Belief Propagation
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
Max Welling
SIAMJO
2008
117views more  SIAMJO 2008»
14 years 10 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim
IJCV
2002
188views more  IJCV 2002»
14 years 9 months ago
Scalable Extrinsic Calibration of Omni-Directional Image Networks
We describe a linear-time algorithm that recovers absolute camera orientations and positions, along with uncertainty estimates, for networks of terrestrial image nodes spanning hun...
Matthew E. Antone, Seth J. Teller
ALGORITHMICA
2011
14 years 1 months ago
Algorithms for Marketing-Mix Optimization
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...
Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid
JMLR
2008
159views more  JMLR 2008»
14 years 10 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