- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
In this paper, we generalize the notion of persistence, which has been originally introduced for two-dimensional formations, to Rd for d 3, seeking to provide a theoretical framew...
Changbin Yu, Julien M. Hendrickx, Baris Fidan, Bri...
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...