Sciweavers

1651 search results - page 20 / 331
» Measuring the Complexity of Classification Problems
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori
CSL
2010
Springer
13 years 8 months ago
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
Barnaby Martin, Jos Martin
CVPR
2009
IEEE
15 years 2 months ago
Image Registration by Minimization of Residual Complexity
Accurate denition of similarity measure is a key component in image registration. Most commonly used intensitybased similarity measures rely on the assumptions of independence ...
Andriy Myronenko, Xubo B. Song
CCS
2008
ACM
13 years 9 months ago
Is complexity really the enemy of software security?
Software complexity is often hypothesized to be the enemy of software security. We performed statistical analysis on nine code complexity metrics from the JavaScript Engine in the...
Yonghee Shin, Laurie Williams
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 1 months ago
Computing the epistasis variance of large-scale traveling salesman problems
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
Dong-il Seo, Byung Ro Moon