Sciweavers

1088 search results - page 23 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
CORR
2011
Springer
220views Education» more  CORR 2011»
13 years 2 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
DIS
2009
Springer
14 years 2 months ago
A Dialectic Approach to Problem-Solving
We analyze the dynamics of problem-solving in a framework which captures two key features of that activity. The first feature is that problem-solving is a social game where a numb...
Éric Martin, Jean Sallantin
STACS
2005
Springer
14 years 29 days ago
Roundings Respecting Hard Constraints
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
Benjamin Doerr
DISOPT
2007
93views more  DISOPT 2007»
13 years 7 months ago
A feasibility pump heuristic for general mixed-integer problems
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
Livio Bertacco, Matteo Fischetti, Andrea Lodi
ICIP
2007
IEEE
14 years 9 months ago
The Hough Transform's Implicit Bayesian Foundation
This paper shows that the basic Hough transform is implicitly a Bayesian process--that it computes an unnormalized posterior distribution over the parameters of a single shape giv...
Neil Toronto, Bryan S. Morse, Dan Ventura, Kevin D...