Sciweavers

3244 search results - page 25 / 649
» On convex complexity measures
Sort
View
LPAR
2004
Springer
15 years 4 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
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...
Dietmar Berwanger, Erich Grädel
INFOCOM
2009
IEEE
15 years 5 months ago
Measuring Complexity and Predictability in Networks with Multiscale Entropy Analysis
—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...
Janne Riihijärvi, Matthias Wellens, Petri M&a...
ESSOS
2009
Springer
15 years 3 months ago
Idea: Measuring the Effect of Code Complexity on Static Analysis Results
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...
James Walden, Adam Messer, Alex Kuhl
CVPR
2010
IEEE
1171views Computer Vision» more  CVPR 2010»
15 years 8 months ago
Geodesic Star Convexity for Interactive Image Segmentation
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, ...
ICASSP
2009
IEEE
15 years 3 months ago
Design of robust superdirective beamformers as a convex optimization problem
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...
Edwin Mabande, Adrian Schad, Walter Kellermann