Results 1  10
of
2,011,262
Minimization Problem
"... $\lambda_{\Omega}(\alpha, D)=\inf_{\Omega u\in H1(0),u\not\equiv 0}\frac{\int_{\Omega}\nabla u2dx+\alpha\int_{D}ud_{X}2}{\int_{\Omega}u^{2}dx} $. (1) ..."
Abstract
 Add to MetaCart
$\lambda_{\Omega}(\alpha, D)=\inf_{\Omega u\in H1(0),u\not\equiv 0}\frac{\int_{\Omega}\nabla u2dx+\alpha\int_{D}ud_{X}2}{\int_{\Omega}u^{2}dx} $. (1)
Minimization problems for eigenvalues of the Laplacian
 JOURNAL OF EVOLUTION EQUATIONS SPECIAL
, 2003
"... This paper is a survey on classical results and open questions about minimization problems concerning the lower eigenvalues of the Laplace operator. After recalling classical isoperimetric inequalities for the two first eigenvalues, we present recent advances on this topic. In particular, we study ..."
Abstract

Cited by 40 (2 self)
 Add to MetaCart
This paper is a survey on classical results and open questions about minimization problems concerning the lower eigenvalues of the Laplace operator. After recalling classical isoperimetric inequalities for the two first eigenvalues, we present recent advances on this topic. In particular, we study
What energy functions can be minimized via graph cuts?
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2004
"... In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are co ..."
Abstract

Cited by 1047 (23 self)
 Add to MetaCart
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization
, 2007
"... The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative ..."
Abstract

Cited by 568 (23 self)
 Add to MetaCart
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
the solution to a nonlinear programming relaxation. This relaxation can be interpreted both as a semidefinite program and as an eigenvalue minimization problem. The best previously known approximation algorithms for these problems had performance guarantees of ...
Circuit Minimization Problem
 In ACM Symposium on Theory of Computing (STOC
, 1999
"... We study the complexity of the circuit minimization problem: given the truth table of a Boolean function f and a parameter s, decide whether f can be realized by a Boolean circuit of size at most s. We argue why this problem is unlikely to be in P (or even in P=poly) by giving a number of surpris ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
We study the complexity of the circuit minimization problem: given the truth table of a Boolean function f and a parameter s, decide whether f can be realized by a Boolean circuit of size at most s. We argue why this problem is unlikely to be in P (or even in P=poly) by giving a number
The graph bisection minimization problem
"... A method of determining a lower bound for the graph bisection minimization problem is described. The bound is valid for weigthed graphs with edge and node weights. The approach is based on Lagrangian relaxation and was previously used for determining an upper bound on the independence number of a gr ..."
Abstract
 Add to MetaCart
A method of determining a lower bound for the graph bisection minimization problem is described. The bound is valid for weigthed graphs with edge and node weights. The approach is based on Lagrangian relaxation and was previously used for determining an upper bound on the independence number of a
Fast approximate energy minimization via graph cuts
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy functionâ€™s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when v ..."
Abstract

Cited by 2127 (61 self)
 Add to MetaCart
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy functionâ€™s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when
The profile minimization problem in trees
 SIAM Journal on Computing
, 1994
"... Abstract. The profile minimization problem is to find a onetoone function f from the vertex set V (G) of a graph G to the set of all positive integers such that xeV(G) {f(x) minyN[x] f(y)} is as small as possible, where N[x] {x} t3 {y y is adjacent to x} is the closed neighborhood of x in G. This ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract. The profile minimization problem is to find a onetoone function f from the vertex set V (G) of a graph G to the set of all positive integers such that xeV(G) {f(x) minyN[x] f(y)} is as small as possible, where N[x] {x} t3 {y y is adjacent to x} is the closed neighborhood of x in G
Results 1  10
of
2,011,262