149 search results - page 23 / 30 » Crossing Numbers and Parameterized Complexity |
SIAMCOMP
2000
14 years 11 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
123
click to vote
ALGORITHMICA
2004
14 years 11 months ago
2004
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
188
click to vote
DISOPT
2011
14 years 6 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
107
click to vote
JMLR
2010
14 years 6 months ago
2010
We address an approximation method for Gaussian process (GP) regression, where we approximate covariance by a block matrix such that diagonal blocks are calculated exactly while o...
100
click to vote
APPT
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance...