Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
Antonina Kolokolova, Yongmei Liu, David G. Mitchel...
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
Abstract--This paper addresses practical implementation issues of resource allocation in OFDMA networks: inaccuracy of channel state information (CSI) available to the resource all...
We improve the promising Colour by Correlation method for computational colour constancy by modifying it to work in a three dimensional colour space. The previous version of the al...