The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
— This paper addresses the problem of optical signal-to-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general multi-lin...
A list of representative directional prepositions of the English language is investigated to develop computation models that output some general motion trajectory or goal directio...
NSF and NASA sponsored a workshop to discuss harvesting solar power in space. One solution considered was the use of a swarm of robots to form a solar reflector. How can these rob...