Sciweavers

76 search results - page 9 / 16
» Fast approximation of convex hull
Sort
View
JMLR
2010
141views more  JMLR 2010»
13 years 4 months ago
FastInf: An Efficient Approximate Inference Library
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
Ariel Jaimovich, Ofer Meshi, Ian McGraw, Gal Elida...
MP
2006
119views more  MP 2006»
13 years 9 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey
PAMI
2012
12 years 7 days ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens
ICCSA
2004
Springer
14 years 3 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
SCALESPACE
2007
Springer
14 years 3 months ago
Fuzzy Region Competition: A Convex Two-Phase Segmentation Framework
This paper introduces a new framework for two-phase image segmentation, namely the Fuzzy Region Competition. A generic formulation is developed that extends in a convex way several...
Benoit Mory, Roberto Ardon