Sciweavers

92 search results - page 2 / 19
» On Maximal S-Free Convex Sets
Sort
View
ICCV
2009
IEEE
13 years 3 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
CVPR
2009
IEEE
15 years 19 days ago
Continuous Maximal Flows and Wulff Shapes: Application to MRFs
Convex and continuous energy formulations for low level vision problems enable efficient search procedures for the corresponding globally optimal solutions. In this work we exte...
Christopher Zach (UNC Chapel Hill), Marc Niethamme...
ISIPTA
2003
IEEE
110views Mathematics» more  ISIPTA 2003»
13 years 10 months ago
Extensions of Expected Utility Theory and Some Limitations of Pairwise Comparisons
We contrast three decision rules that extend Expected Utility to contexts where a convex set of probabilities is used to depict uncertainty: Γ-Maximin, Maximality, and E-admissib...
Mark J. Schervish, Teddy Seidenfeld, Joseph B. Kad...
CCCG
2009
13 years 6 months ago
Optimal Empty Pseudo-Triangles in a Point Set
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher
ASAP
2008
IEEE
105views Hardware» more  ASAP 2008»
13 years 7 months ago
Fast custom instruction identification by convex subgraph enumeration
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...
Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. &Ou...