For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
When we have a large amount of information, we usually use categories with a hierarchy, in which all information is assigned. This paper proposes a new method of integrating two ca...
Despite recent advances in finding efficient LOD-representations for gigantic 3D objects, rendering of complex, gigabyte-sized models and environments is still a challenging tas...
Virtualization has been shown to be an attractive path to increase overall system resource utilization. The use of live virtual machine (VM) migration has enabled more effective ...