Sciweavers

1064 search results - page 37 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
IJCNN
2006
IEEE
15 years 9 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
RECOMB
2007
Springer
16 years 4 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
DAC
1999
ACM
16 years 4 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
JSCIC
2010
178views more  JSCIC 2010»
14 years 10 months ago
A Compact Fourth Order Scheme for the Helmholtz Equation in Polar Coordinates
In many problems, one wishes to solve the Helmholtz equation in cylindrical or spherical coordinates which introduces variable coefficients within the differentiated terms. Fourth ...
S. Britt, S. Tsynkov, Eli Turkel
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
15 years 7 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann