In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
Jason V. Davis, Brian Kulis, Prateek Jain, Suvrit ...
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Transmitting compressed data can reduce inter-processor communication traffic and create new opportunities for DVS (dynamic voltage scaling) in distributed embedded systems. Howe...
We consider networked, embedded real-time systems that operate under run-time uncertainties on activity execution times and arrivals, node failures, and message losses. We consider...
Sherif Fadel Fahmy, Binoy Ravindran, E. Douglas Je...
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...