151 search results - page 19 / 31 » Computable Shell Decomposition Bounds |
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
PLILP
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Teaching introductory computing courses with Scheme elevates the intellectual level of the course and thus makes the subject more appealing to students with scienti c int...
VISSYM
2004
13 years 8 months ago
2004
This paper presents a simple approach for rendering isosurfaces of a scalar field. Using the vertex programming capability of commodity graphics cards, we transfer the cost of com...
SIAMJO
2008
13 years 7 months ago
2008
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...