Results 1  10
of
1,190,781
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
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 561 (20 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
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
, 1999
"... We give a strongly polynomialtime algorithm minimizing a submodular function f given by a valuegiving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle ..."
Abstract

Cited by 201 (0 self)
 Add to MetaCart
We give a strongly polynomialtime algorithm minimizing a submodular function f given by a valuegiving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle
To parcel or not to parcel: Exploring the question, weighing the merits. Structural Equation Modeling
, 2002
"... We examine the controversial practice of using parcels of items as manifest variables in structural equation modeling (SEM) procedures. After detailing arguments pro and con, we conclude that the unconsidered use of parcels is never warranted, while, at the same time, the considered use of parcels c ..."
Abstract

Cited by 286 (14 self)
 Add to MetaCart
of constructs). Prior to creating parcels, however, we recommend strongly that investigators acquire a thorough understanding of the nature and dimensionality of the items to be parceled. With this knowledge in hand, various techniques for creating parcels can be utilized to minimize potential pitfalls
Fast Global Minimization of the Active Contour/Snake Model
"... The active contour/snake model is one of the most successful variational models in image segmentation. It consists of evolving a contour in images toward the boundaries of objects. Its success is based on strong mathematical properties and efficient numerical schemes based on the level set method. ..."
Abstract

Cited by 159 (10 self)
 Add to MetaCart
The active contour/snake model is one of the most successful variational models in image segmentation. It consists of evolving a contour in images toward the boundaries of objects. Its success is based on strong mathematical properties and efficient numerical schemes based on the level set method
Definable sets in ordered structures
 Bull. Amer. Math. Soc. (N.S
, 1984
"... Abstract. This paper introduces and begins the study of a wellbehaved class of linearly ordered structures, the ^minimal structures. The definition of this class and the corresponding class of theories, the strongly ©minimal theories, is made in analogy with the notions from stability theory of m ..."
Abstract

Cited by 125 (8 self)
 Add to MetaCart
Abstract. This paper introduces and begins the study of a wellbehaved class of linearly ordered structures, the ^minimal structures. The definition of this class and the corresponding class of theories, the strongly ©minimal theories, is made in analogy with the notions from stability theory
OCB: A BlockCipher Mode of Operation for Efficient Authenticated Encryption
, 2001
"... We describe a parallelizable blockcipher mode of operation that simultaneously provides privacy and authenticity. OCB encryptsandauthenticates a nonempty string M # {0, 1} # using #M /n# + 2 blockcipher invocations, where n is the block length of the underlying block cipher. Additional ov ..."
Abstract

Cited by 203 (24 self)
 Add to MetaCart
overhead is small. OCB refines a scheme, IAPM, suggested by Jutla [20]. Desirable properties of OCB include: the ability to encrypt a bit string of arbitrary length into a ciphertext of minimal length; cheap o#set calculations; cheap session setup, a single underlying cryptographic key; no extended
Uniform Uncertainty Principle and signal recovery via Regularized Orthogonal Matching Pursuit
, 2007
"... This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements – L1minimization methods and iterative methods (Matching Pursuits). We find a simple regularized version of Orthogonal Matching Pursuit (ROMP) which has advantage ..."
Abstract

Cited by 188 (8 self)
 Add to MetaCart
This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements – L1minimization methods and iterative methods (Matching Pursuits). We find a simple regularized version of Orthogonal Matching Pursuit (ROMP) which has
Nearoptimal sensor placements: Maximizing information while minimizing communication cost
 In IPSN
, 2006
"... When monitoring spatial phenomena with wireless sensor networks, selecting the best sensor placements is a fundamental task. Not only should the sensors be informative, but they should also be able to communicate efficiently. In this paper, we present a datadriven approach that addresses the three ..."
Abstract

Cited by 151 (19 self)
 Add to MetaCart
central aspects of this problem: measuring the predictive quality of a set of sensor locations (regardless of whether sensors were ever placed at these locations), predicting the communication cost involved with these placements, and designing an algorithm with provable quality guarantees that optimizes
Using Multiple Node Types to Improve the Performance of DMP (Dynamic Multilayer Perceptron)
 Proceedings of the IASTED International Conference on Artificial Intelligence, Expert Systems and Neural Networks
, 1996
"... This paper discusses a method for training multilayer perceptron networks called DMP2 (Dynamic Multilayer Perceptron 2). The method is based upon a divide and conquer approach which builds networks in the form of binary trees, dynamically allocating nodes and layers as needed. The focus of this pa ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
This paper discusses a method for training multilayer perceptron networks called DMP2 (Dynamic Multilayer Perceptron 2). The method is based upon a divide and conquer approach which builds networks in the form of binary trees, dynamically allocating nodes and layers as needed. The focus
Results 1  10
of
1,190,781