We consider a new model for computing with uncertainty. It is desired to compute a function fX1; : : : ; Xn where X1; : : : ; Xn are unknown, but guaranteed to lie in speci ed i...
In this paper we propose an efficient transient test generation method to comprehensively test analog circuits using minimum test time. A divide and conquer strategy is formulated...
Consider the problem of tting a nite Gaussian mixture, with an unknown number of components, to observed data. This paper proposes a new minimum description length (MDL) type crite...
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...