Sciweavers

3874 search results - page 413 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
ICCSA
2005
Springer
16 years 6 days ago
Comparison of Global Optimization Methods for Drag Reduction in the Automotive Industry
Various global optimization methods are compared in order to find the best strategy to solve realistic drag reduction problems in the automotive industry. All the methods consist ...
Laurent Dumas, Vincent Herbert, Frédé...
COLT
2006
Springer
15 years 10 months ago
Unifying Divergence Minimization and Statistical Inference Via Convex Duality
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
Yasemin Altun, Alexander J. Smola
ACSAC
2001
IEEE
15 years 10 months ago
Mining Alarm Clusters to Improve Alarm Handling Efficiency
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...
Klaus Julisch
RTA
2010
Springer
15 years 8 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
16 years 7 days ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...