Results 1  10
of
1,068,107
Topological minimal sets and their applications
 Preprint, Université de ParisSud 11
, 2011
"... In this article we introduce a definition of topological minimal sets, which is a generalization of that of MumfordShahminimal sets. We prove some general properties as well as two existence theorems for topological minimal sets. As an application we prove the topological minimality of the union o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this article we introduce a definition of topological minimal sets, which is a generalization of that of MumfordShahminimal sets. We prove some general properties as well as two existence theorems for topological minimal sets. As an application we prove the topological minimality of the union
Establishing theoretical minimal sets of mutants
 in International Conference on Software Testing, Verification and Validation
"... Establishing theoretical minimal sets of mutants ..."
COUNTEREXAMPLES IN −a MINIMAL SETS*
"... Abstract – Several tables have been given due to −a minimal sets. Our main aim in this paper is to complete these tables by employing several examples. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract – Several tables have been given due to −a minimal sets. Our main aim in this paper is to complete these tables by employing several examples.
MINIMAL SETS FOR RANDOM FLOWS
"... The main purpose of this work is to study some of the classical concepts of topological dynamics in the special context of random dynamical systems, in particular minimal sets. Random dynamical systems is a kind of skewproduct flow, where the base flow is a metric dynamical ..."
Abstract
 Add to MetaCart
The main purpose of this work is to study some of the classical concepts of topological dynamics in the special context of random dynamical systems, in particular minimal sets. Random dynamical systems is a kind of skewproduct flow, where the base flow is a metric dynamical
The minimal set of Ingleton inequalities
, 2008
"... Abstract — The IngletonLP bound is an outer bound for the multicast capacity region, assuming the use of linear network codes. Computation of the bound is performed on a polyhedral cone obtained by taking the intersection of halfspaces induced by the basic (Shannontype) inequalities and Ingleton ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
inequalities. This paper simplifies the characterization of this cone, by obtaining the unique minimal set of Ingleton inequalities. As a result, the effort required for computation of the IngletonLP bound can be greatly reduced. I.
Minimal Sets of Quality Metrics
 Proceedings of the 2nd International Conference on Evolutionary Multicriterion Optimization (EMO 2003), Lecture Notes in Computer Science
, 2003
"... Abstract. Numerous quality assessment metrics have been developed by researchers to compare the performance of different multiobjective evolutionary algorithms. These metrics show different properties and address various aspects of solution set quality. In this paper, we propose a conceptual framew ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
framework for selection of a handful of these metrics such that all desired aspects of quality are addressed with minimum or no redundancy. Indeed, we prove that such sets of metrics, referred to as ‘minimal sets’, must be constructed based on a onetoone correspondence with those aspects of quality
DMP IN STRONGLY MINIMAL SETS
"... Abstract. We construct a strongly minimal set which is not a finite cover of one with DMP. We also prove that for a strongly minimal theory T generic automorphisms exist iff T has DMP, thus proving a conjecture of Kikyo and Pillay. Recall that a strongly minimal theory T has the Definable Multiplici ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We construct a strongly minimal set which is not a finite cover of one with DMP. We also prove that for a strongly minimal theory T generic automorphisms exist iff T has DMP, thus proving a conjecture of Kikyo and Pillay. Recall that a strongly minimal theory T has the Definable
Minimal sets and varieties
 TRANS. AMER. MATH. SOC
, 1998
"... The aim of this paper is twofold. First some machinery is established to reveal the structure of abelian congruences. Then we describe all minimal, locally finite, locally solvable varieties. For locally solvable varieties, this solves problems 9 and 10 of Hobby and McKenzie. We generalize part of t ..."
Abstract

Cited by 14 (12 self)
 Add to MetaCart
The aim of this paper is twofold. First some machinery is established to reveal the structure of abelian congruences. Then we describe all minimal, locally finite, locally solvable varieties. For locally solvable varieties, this solves problems 9 and 10 of Hobby and McKenzie. We generalize part
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 2120 (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
Results 1  10
of
1,068,107