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...
Database systems frequently have to execute a set of related queries, which share several common subexpressions. Multi-query optimization exploits this, by finding evaluation plan...
Nilesh N. Dalvi, Sumit K. Sanghai, Prasan Roy, S. ...
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
— Precoding is a well-known method to reach the promised performance and capacity of multiple-input multipleoutput (MIMO) systems. Recent investigations, when the transmitter has...