Three methods for computing the upper bound when linear cuts are performed on the uncertainty set are described. One of them is based on the computation of spherical , one involves the construction of an implicit system to implement the linear constraints, and the other reformulates the problem into a higher dimensional one such that the standard upper bound computation can be used. The quality...

Broadcasting is the process of message dissemination in a communication network in which a message originated by one processor is transmitted to all processors of the network. In this paper, we present a new lower bound of 1:7417m for broadcasting in the butterry network of dimension m. This improves the best known lower bound of 1:5621m. We also describe an algorithm which improves the upper b...

We exhibit upper bounds for the probability distribution of the generalized condition number of singular complex matrices. To this end, we develop a new technique to study volumes of tubes about projective varieties in the complex projective space. As a main outcome, we show an upper bound estimate for the volume of the intersection of a tube with an equi–dimensional projective algebraic variety.

We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...

This work establishes a new upper bound on the number of samples sufficient for PAC learning in the realizable case. The bound matches known lower bounds up to numerical constant factors. This solves a long-standing open problem on the sample complexity of PAC learning. The technique and analysis build on a recent breakthrough by Hans Simon.

A new wavelet-based L-infinite-constrained fixed and embedded coding technique is proposed in this paper. For any desired distortion bound, the embedded bit stream can be truncated at a corresponding bit-rate, for which the required upper bound on the individual elements of the reconstruction error signal is guaranteed. The original signal can also be coded up to a fixed a priori user-defined d...

The theory of local homology modules was initiated by Matlis in 1974. It is a dual version of the theory of local cohomology modules. Mohammadi and Divaani-Aazar (2012) studied the connection between local homology and Gorenstein flat modules by using Gorenstein flat resolutions. In this paper, we introduce generalized local homology modules for complexes and we give several ways for computing ...