Sciweavers

560 search results - page 61 / 112
» Level-set methods for convex optimization
Sort
View
ICCV
2009
IEEE
16 years 8 months ago
Optimizing Parametric Total Variation Models
One of the key factors for the success of recent energy minimization methods is that they seek to compute global solutions. Even for non-convex energy functionals, optimization ...
Petter Strandmark, Fredrik Kahl, Niels Chr. Overga...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 9 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
ICML
2007
IEEE
16 years 4 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...
122
Voted
HAPTICS
2002
IEEE
15 years 8 months ago
Six-Degree-of-Freedom Haptic Display Using Localized Contact Computations
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...
Young J. Kim, Miguel A. Otaduy, Ming C. Lin, Dines...
CGF
2008
126views more  CGF 2008»
15 years 3 months ago
Maximum Entropy Coordinates for Arbitrary Polytopes
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
K. Hormann, N. Sukumar