Results 1  10
of
923,174
Minimizing Symmetric Set Functions Faster
, 2006
"... We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi [Riz00], constructs a non trivial set S minimizing d(S,V \ S). This includes the possibility for the minimization of symmetric submodular functions. The prese ..."
Abstract
 Add to MetaCart
We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi [Riz00], constructs a non trivial set S minimizing d(S,V \ S). This includes the possibility for the minimization of symmetric submodular functions
STANDARD MONOMIALS OF SOME SYMMETRIC SETS
, 2005
"... We give a new description of the vanishing ideal of some symmetric sets S ⊆{0, 1} n over the field of complex numbers. As an application we determine the deglexstandard monomials for S over C. It turns out that the standard monomials can be described in terms of certain generalized ballot sequences ..."
Abstract
 Add to MetaCart
We give a new description of the vanishing ideal of some symmetric sets S ⊆{0, 1} n over the field of complex numbers. As an application we determine the deglexstandard monomials for S over C. It turns out that the standard monomials can be described in terms of certain generalized ballot
Symmetric Sets of Curves and Combinatorial Arrays
"... Abstract. Let V be an algebraic curve. P is a set of points on V. C is a set of curves each of which intersects V at some points of P. We denote IP (C, V) as the intersection multiplicity of C ∈ C with V at the point P ∈ P. If (V, P, C) satisfies the following conditions, we call it a symmetric set ..."
Abstract
 Add to MetaCart
Abstract. Let V be an algebraic curve. P is a set of points on V. C is a set of curves each of which intersects V at some points of P. We denote IP (C, V) as the intersection multiplicity of C ∈ C with V at the point P ∈ P. If (V, P, C) satisfies the following conditions, we call it a symmetric set
Sets with large additive energy and symmetric sets
, 2010
"... We show that for any set A in a finite Abelian group G that has at least cA  3 solutions to a1 + a2 = a3 + a4, ai ∈ A there exist sets A ′ ⊆ A and Λ ⊆ G, Λ = {λ1,...,λt}, t ≪ c−1logA such that A ′ { ∑t is contained in j=1εjλj}  εj ∈ {0,−1,1} and A ′ has ≫ cA  3 solutions to a ′ 1 +a ′ 2 = a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
′ 3 +a ′ 4, a ′ i ∈ A ′. We also study so–called symmetric sets or, in other words, sets of large values of convolution.
Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones
, 1998
"... SeDuMi is an addon for MATLAB, that lets you solve optimization problems with linear, quadratic and semidefiniteness constraints. It is possible to have complex valued data and variables in SeDuMi. Moreover, large scale optimization problems are solved efficiently, by exploiting sparsity. This pape ..."
Abstract

Cited by 1334 (4 self)
 Add to MetaCart
SeDuMi is an addon for MATLAB, that lets you solve optimization problems with linear, quadratic and semidefiniteness constraints. It is possible to have complex valued data and variables in SeDuMi. Moreover, large scale optimization problems are solved efficiently, by exploiting sparsity. This paper describes how to work with this toolbox.
An Extended Set of Fortran Basic Linear Algebra Subprograms
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1986
"... This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers. ..."
Abstract

Cited by 526 (72 self)
 Add to MetaCart
This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers.
GENERALISATIONS OF THE EINSTEIN–STRAUS MODEL TO CYLINDRICALLY SYMMETRIC SETTINGS
, 2004
"... We study generalisations of the Einstein–Straus model in cylindrically symmetric settings by considering the matching of a static spacetime to a nonstatic spatially homogeneous spacetime, preserving the symmetry. We find that such models possess severe restrictions, such as constancy of one of th ..."
Abstract
 Add to MetaCart
We study generalisations of the Einstein–Straus model in cylindrically symmetric settings by considering the matching of a static spacetime to a nonstatic spatially homogeneous spacetime, preserving the symmetry. We find that such models possess severe restrictions, such as constancy of one
A standardized set of 260 pictures: Norms for name agreement, image agreement, familiarity, and visual complexity
 JOURNAL OF EXPERIMENTAL PSYCHOLOGY: HUMAN LEARNING AND MEMORY
, 1980
"... In this article we present a standardized set of 260 pictures for use in experiments investigating differences and similarities in the processing of pictures and words. The pictures are blackandwhite line drawings executed according to a set of rules that provide consistency of pictorial represent ..."
Abstract

Cited by 615 (1 self)
 Add to MetaCart
In this article we present a standardized set of 260 pictures for use in experiments investigating differences and similarities in the processing of pictures and words. The pictures are blackandwhite line drawings executed according to a set of rules that provide consistency of pictorial
Good ErrorCorrecting Codes based on Very Sparse Matrices
, 1999
"... We study two families of errorcorrecting codes defined in terms of very sparse matrices. "MN" (MacKayNeal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The ..."
Abstract

Cited by 741 (23 self)
 Add to MetaCart
. The decoding of both codes can be tackled with a practical sumproduct algorithm. We prove that these codes are "very good," in that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit. This result holds not only for the binarysymmetric channel
Entity Authentication and Key Distribution
, 1993
"... Entity authentication and key distribution are central cryptographic problems in distributed computing  but up until now, they have lacked even a meaningful definition. One consequence is that incorrect and inefficient protocols have proliferated. This paper provides the first treatment of these p ..."
Abstract

Cited by 580 (13 self)
 Add to MetaCart
of these problems in the complexitytheoretic framework of modern cryptography. Addressed in detail are two problems of the symmetric, twoparty setting: mutual authentication and authenticated key exchange. For each we present a definition, protocol, and proof that the protocol meets its goal, assuming
Results 1  10
of
923,174