Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...
In numerous applications of image processing, e.g. astronomical and medical imaging, data-noise is well-modeled by a Poisson distribution. This motivates the use of the negative-lo...
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
Saurabh K. Tiwary, Anubhav Gupta, Joel R. Phillips...
This work presents a distributed method for control centers in a power network to estimate the operating condition of the power plant, and to ultimately determine the occurrence o...