Sciweavers

1429 search results - page 59 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
CVPR
2012
IEEE
13 years 6 days 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
FLAIRS
2003
14 years 11 months ago
Sample Complexity of Real-Coded Evolutionary Algorithms
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...
Jian Zhang 0007, Xiaohui Yuan, Bill P. Buckles
ECCV
2010
Springer
15 years 3 months ago
Optimizing Complex Loss Functions in Structured Prediction
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
VR
2000
IEEE
114views Virtual Reality» more  VR 2000»
15 years 1 months ago
Virtual Fekete Point Configurations: A Case Study in Perturbing Complex Systems
Virtual environments have shown great promise as a research tool in science and engineering. In this paper we study a classical problem in mathematics: that of approximating globa...
Robert van Liere, Jurriaan D. Mulder, Jason Frank,...
AAAI
2007
15 years 3 days ago
Computational Complexity of Weighted Threshold Games
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...