Sciweavers

67 search results - page 6 / 14
» Representing the space of linear programs as the Grassmann m...
Sort
View
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 3 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King
PAMI
2007
125views more  PAMI 2007»
13 years 8 months ago
Matching by Linear Programming and Successive Convexification
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
Hao Jiang, Mark S. Drew, Ze-Nian Li
IPMI
2007
Springer
14 years 9 months ago
Inter and Intra-modal Deformable Registration: Continuous Deformations Meet Efficient Optimal Linear Programming
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
Ben Glocker, Nikos Komodakis, Nikos Paragios, Geor...
COR
2002
90views more  COR 2002»
13 years 8 months ago
Extremist vs. centrist decision behavior: quasi-convex utility functions for interactive multi-objective linear programming prob
This paper presents the fundamental theory and algorithms for identifying the most preferred alternative for a decision maker (DM) having a non-centrist (or extremist) preferentia...
Behnam Malakooti, Jumah E. Al-alwani
IJCNN
2007
IEEE
14 years 2 months ago
Branching Principal Components: Elastic Graphs, Topological Grammars and Metro Maps
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...