165 search results - page 16 / 33 » From an approximate to an exact absolute polynomial factoriz... |
NIPS
2008
13 years 9 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...
BMCBI
2007
13 years 7 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
ML
2008
ACM
13 years 7 months ago
2008
ACM
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...