We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
We study G/G/n + GI queues in which customer patience times are independent, identically distributed following a general distribution. When a customer’s waiting time in queue ex...
We introduce an Nth-order extension of the Riesz transform in d dimensions. We prove that this generalized transform has the following remarkable properties: shift-invariance, sca...
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
Andrew Delong, Anton Osokin, Hossam Isack, Yuri Bo...
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the...