— For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput ...
David Julian, Mung Chiang, Daniel O'Neill, Stephen...
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...
Motivation: Analysis and intervention in the dynamics of gene regulatory networks is at the heart of emerging efforts in the development of modern treatment of numerous ailments i...
Nidhal Bouaynaya, Roman Shterenberg, Dan Schonfeld
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...