Sciweavers

2743 search results - page 291 / 549
» Minimization of an M-convex Function
Sort
View
166
Voted
CVIU
2008
109views more  CVIU 2008»
15 years 6 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
ESA
1999
Springer
148views Algorithms» more  ESA 1999»
15 years 11 months ago
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
Leah Epstein, Jiri Sgall
ESANN
2006
15 years 8 months ago
Independent dynamics subspace analysis
Abstract. The paper presents an algorithm for identifying the independent subspace analysis model based on source dynamics. We propose to separate subspaces by decoupling their dyn...
Alexander Ilin
CORR
2008
Springer
93views Education» more  CORR 2008»
15 years 6 months ago
An optimization problem on the sphere
We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existen...
Andreas Maurer
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 6 months ago
Flatness of the Energy Landscape for Horn Clauses
Abstract The Little-Hopfield neural network programmed with Horn clauses is studied. We argue that the energy landscape of the system, corresponding to the inconsistency function f...
Saratha Sathasivam, Wan Ahmad Tajuddin Wan Abdulla...