Results 1 
4 of
4
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
, 1992
"... We present a new piv otbased algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension. The algorithm has the following prope ..."
Abstract

Cited by 193 (29 self)
 Add to MetaCart
We present a new piv otbased algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension. The algorithm has the following properties: (a) Virtually no additional storage is required beyond the input data; (b) The output list produced is free of duplicates; (c) The algorithm is extremely simple, requires no data structures, and handles all degenerate cases; (d) The running time is output sensitive for nondegenerate inputs; (e) The algorithm is easy to efficiently parallelize. For example, the algorithm finds the v vertices of a polyhedron in R d defined by a nondegenerate system of n inequalities (or dually, the v facets of the convex hull of n points in R d,where each facet contains exactly d given points) in time O(ndv) and O(nd) space. The v vertices in a simple arrangement of n hyperplanes in R d can be found in O(n 2 dv) time and O(nd) space complexity. The algorithm is based on inverting finite pivot algorithms for linear programming.
Binary Choice Models with Discrete Regressors: Identification and Misspecification
, 2009
"... In semiparametric binary response models, support conditions on the regressors are required to guarantee point identification of the parameter of interest. For example, one regressor is usually assumed to have continuous support conditional on the other regressors. In some instances, such conditions ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In semiparametric binary response models, support conditions on the regressors are required to guarantee point identification of the parameter of interest. For example, one regressor is usually assumed to have continuous support conditional on the other regressors. In some instances, such conditions have precluded the use of these models; in others, practitioners have failed to consider whether the conditions are satisfied in their data. This paper explores the inferential question in these semiparametric models when the continuous support condition is not satisfied and all regressors have discrete support. I suggest a recursive procedure that finds sharp bounds on the parameter of interest and outline several applications. After deriving closedform bounds on the parameter, I show how these formulas can help analyze cases where one regressor’s support becomes increasingly dense. Furthermore, I investigate asymptotic properties of estimators of the identification set. I also propose three approaches to address the problem of empty identification sets when a model is misspecified. Finally, I present a Monte Carlo experiment and an empirical illustration to compare several estimation techniques.
Optimization of Number of Processors in VLSI Arrays
, 1994
"... Since the work of Kung[1], the systolic architectures have proven their efficiency to deal with many scientific algorithms (LUdecomposition, GaussJordan elimination, ...). Since the early eighties, many works have been made in the area of automatic derivation of systolic architectures. In the gene ..."
Abstract
 Add to MetaCart
Since the work of Kung[1], the systolic architectures have proven their efficiency to deal with many scientific algorithms (LUdecomposition, GaussJordan elimination, ...). Since the early eighties, many works have been made in the area of automatic derivation of systolic architectures. In the general case, there are numerous solutions to the same problem. The final choice of the architecture is often done by comparison of performances. There are several criteria which can be considered: global time of computation, number of processors, latency of the circuit ... In this article we are especially interested with the number of processors of the final architecture for which we present a heuristic method.