Sciweavers

1489 search results - page 9 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
SIAMJO
2008
85views more  SIAMJO 2008»
13 years 7 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao
ICIP
2008
IEEE
14 years 1 months ago
Globally optimal solution to exploit rigidity when recovering structure from motion under occlusion
Widely used SVD-based matrix factorization approaches to the recovery of 3D rigid structure from motion (SFM), require a set of feature points to be visible in a set of images. Wh...
Pedro M. Q. Aguiar, João M. F. Xavier, Mark...
ECCV
2010
Springer
13 years 10 months ago
Clustering Complex Data with Group-Dependent Feature Selection
Abstract. We describe a clustering approach with the emphasis on detecting coherent structures in a complex dataset, and illustrate its effectiveness with computer vision applicat...
APPML
2002
58views more  APPML 2002»
13 years 7 months ago
Layered clusters of tightness set functions
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
Boris Mirkin, Ilya B. Muchnik
SIAMCOMP
2012
11 years 10 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...