Sciweavers

2477 search results - page 115 / 496
» Approximate extended formulations
Sort
View
125
Voted
ICCV
1999
IEEE
15 years 8 months ago
Bayesian Structure from Motion
:We formulate structure from motion as a Bayesian inference problem, and use a Markov chain Monte Carlo sampler to sample the posterior on this problem. This results in a method th...
David A. Forsyth, Sergey Ioffe, John A. Haddon
EDBTW
2006
Springer
15 years 7 months ago
Constructing Optimal Wavelet Synopses
The wavelet decomposition is a proven tool for constructing concise synopses of massive data sets and rapid changing data streams, which can be used to obtain fast approximate, wit...
Dimitris Sacharidis
EVOW
2008
Springer
15 years 5 months ago
Metaheuristics for the Bi-objective Ring Star Problem
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, r...
Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basse...
147
Voted
COLOGNETWENTE
2008
15 years 5 months ago
Reformulations in Mathematical Programming: Definitions
Abstract. A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are i...
Leo Liberti
RSS
2007
134views Robotics» more  RSS 2007»
15 years 5 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha