We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
—We propose to use multiscale entropy analysis in characterisation of network traffic and spectrum usage. We show that with such analysis one can quantify complexity and predict...
Abstract. To understand the effect of code complexity on static analysis, thirty-five format string vulnerabilities were studied. We analyzed two code samples for each vulnerabilit...
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to ...
Varun Gulshan, Carsten Rother, Antonio Criminisi, ...
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...