1213 search results - page 15 / 243 » Approximation in quantale-enriched categories |
JUCS
2008
13 years 6 months ago
2008
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
JACM
1998
13 years 6 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
DAC
2005
ACM
14 years 7 months ago
2005
ACM
System-level design methods specifically targeted towards multimedia applications have recently received a lot of attention. Multimedia workloads are known to have a high degree o...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
COMPGEOM
2004
ACM
14 years 5 days ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...