395 search results - page 46 / 79 » Positive Versions of Polynomial Time |
123
Voted
ICLP
1992
Springer
15 years 8 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
158
click to vote
NIPS
2008
15 years 5 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
145
Voted
WG
2010
Springer
15 years 2 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
118
Voted
SCHEDULING
2008
15 years 3 months ago
2008
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
127
click to vote
COLT
2004
Springer
15 years 9 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...