1282 search results - page 80 / 257 » Signing on signing off |
JCO
2010
13 years 7 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
JCT
2010
13 years 7 months ago
2010
A k-signed r-set on [n] = {1, ..., n} is an ordered pair (A, f), where A is an rsubset of [n] and f is a function from A to [k]. Families A1, ..., Ap are said to be cross-intersec...
JOCN
2010
13 years 7 months ago
2010
PR
2010
13 years 7 months ago
2010
SMI
2010
IEEE
13 years 7 months ago
2010
IEEE
We present a method to compute the medial axis of a smooth curve or surface by using PHT-spline (polynomial splines over hierarchical T-meshes) hierarchical approximation. In part...