Energy Efficient Wall Enclosing Structures

Configurable energy-efficient co-processors to scale the utilization wall

OF THE DISSERTATION Configurable Energy-efficient Co-processors to Scale the Utilization Wall

Efficient Algorithms for the Smallest Enclosing Ball Problem

Consider the problem of computing the smallest enclosing ball of a set of m balls in 30. In this paper we develop two algorithms that are particularly suitable for problems where n is large. The first algorithm is based on log-exponential aggregation of the maximum function and reduces the problem into an unconstrained convex program....

Efficient Approximation Algorithms for Minimum Enclosing Convex Shapes

We address the problem of Minimum Enclosing Ball (MEB) and its generalization to Minimum Enclosing Convex Polytope (MECP). Given n points in a d dimensional Euclidean space, we give a O(nd/ √ ) algorithm for producing an enclosing ball whose radius is at most away from the optimum. In the case of MECP our algorithm takes O(1/ ) iterations to converge. In both cases we improve the existing resul...

Efficient Algorithms for the Smallest Enclosing Cylinder Problem

Limiting Domain Wall Energy

We study the asymptotic limit of a family of functionals related to the theory of micromagnetism in two dimensions. We prove a compactness result for families of uniformly bounded energy. After studying the corresponding one-dimensional prooles, we exhibit the ?-limit (\wall-energy") which is a variational problem on the folding of solutions of the eikonal equation jrgj = 1. We prove that the m...