Results 1  10
of
6,656
Semiparametric Minimumdistance Estimation
, 1991
"... Semiparametric minimumdistance estimation methods are introduced for the estimation of parametric or semiparametric econometric models. The semiparametric minimumdistance estimation methods share some familiar properties of the classical minimumdistance estimation method. However, they can be app ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Semiparametric minimumdistance estimation methods are introduced for the estimation of parametric or semiparametric econometric models. The semiparametric minimumdistance estimation methods share some familiar properties of the classical minimumdistance estimation method. However, they can
Convexity and Minimum Distance Energy
"... We look at the problem of reducing the minimum distance energy of polygonal knots as an isoperimetric problem. Building on techniques used to show that a regular ngon maximizes area for a given perimeter, we have been able to prove that convex figures minimize the minimum distance energy for all po ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We look at the problem of reducing the minimum distance energy of polygonal knots as an isoperimetric problem. Building on techniques used to show that a regular ngon maximizes area for a given perimeter, we have been able to prove that convex figures minimize the minimum distance energy for all
Fingerprinting with Minimum Distance Decoding
, 710
"... This work adopts an information theoretic framework for the design of collusionresistant coding/decoding schemes for digital fingerprinting. More specifically, the minimum distance decision rule is used to identify 1 out of t pirates. Achievable rates, under this detection rule, are characterized i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This work adopts an information theoretic framework for the design of collusionresistant coding/decoding schemes for digital fingerprinting. More specifically, the minimum distance decision rule is used to identify 1 out of t pirates. Achievable rates, under this detection rule, are characterized
Minimum Distance and Robust Estimation
 J. American Statistical Assoc, vol
, 1980
"... for any purpose of the United States Government This document has been approved for public release U) and sale; its distribution is unlimited ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
for any purpose of the United States Government This document has been approved for public release U) and sale; its distribution is unlimited
The Minimum Distance Energy for Polygonal
"... This paper investigates the energy UMD of polygonal unknots. It provides equations for finding the energy for any planar regular ngon and for any mgon, where the vertices lie on the vertices of a regular m 2gon and on the midpoints of each edge. In addition, we show that a regular 4gon minimizes ..."
Abstract
 Add to MetaCart
This paper investigates the energy UMD of polygonal unknots. It provides equations for finding the energy for any planar regular ngon and for any mgon, where the vertices lie on the vertices of a regular m 2gon and on the midpoints of each edge. In addition, we show that a regular 4gon minimizes the energy for any quadrilateral. Finally, this paper includes a proof showing that if we have a regular ngon, Rn, inscribed in a circle and can move only one vertex of Rn, v, along the circle between its two adjacent vertices, then the UMD is minimized when v is a vertex on Rn. 1
On Minimum Distances and the Quadrangle Criterion
, 2002
"... We give a new proof of the theorem of Joszef Denes: If L 1 and L 2 are distinct latin squares of order n 2, n / 6}, that satisfy the quadrangle criterion, then L 1 and L 2 differ in at least 2n entries. ..."
Abstract
 Add to MetaCart
We give a new proof of the theorem of Joszef Denes: If L 1 and L 2 are distinct latin squares of order n 2, n / 6}, that satisfy the quadrangle criterion, then L 1 and L 2 differ in at least 2n entries.
Randomized algorithms for minimum distance localization
 In Proc. Workshop on Algorithmic Foundations of Robotics
, 2004
"... Abstract. We address the problem of minimum distance localization in environments that may contain selfsimilarities. A mobile robot is placed at an unknown location inside a ¢¤£ selfsimilar polygonal environment ¥. The robot has a map of ¥ and can compute visibility data through sensing. However, ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Abstract. We address the problem of minimum distance localization in environments that may contain selfsimilarities. A mobile robot is placed at an unknown location inside a ¢¤£ selfsimilar polygonal environment ¥. The robot has a map of ¥ and can compute visibility data through sensing. However
TESTING VARIANTS OF MINIMUM DISTANCE CONTROLLED TABULAR ADJUSTMENT
"... Testing variants of minimum distance controlled tabular adjustment. ..."
MINIMUM DISTANCE APPROACH TO INFERENCE WITH MANY INSTRUMENTS∗
, 2015
"... Minimum distance approach to inference with many instruments ..."
A Framework For Efficient Minimum Distance Computations
, 1998
"... In this paper we present a framework for minimum distance computations that allows efficient solution of minimum distance queries on a variety of surface representations, including sculptured surfaces. The framework depends on geometric reasoning rather than numerical methods and can be implemented ..."
Abstract

Cited by 74 (11 self)
 Add to MetaCart
In this paper we present a framework for minimum distance computations that allows efficient solution of minimum distance queries on a variety of surface representations, including sculptured surfaces. The framework depends on geometric reasoning rather than numerical methods and can be implemented
Results 1  10
of
6,656