4843 search results - page 249 / 969 » The Shortcut Problem - Complexity and Approximation |
175
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
136
Voted
ECML
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present first experiments using Support Vector Regression as function approximator for an on-line, sarsa-like reinforcement learner. To overcome the batch nature of S...
126
Voted
VMCAI
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
147
Voted
COMPGEOM
2000
ACM
15 years 8 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
137
Voted
CIARP
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...