1082 search results - page 161 / 217 » Approximation Algorithms for Spreading Points |
APVIS
2008
13 years 10 months ago
2008
by the abstracting, focusing and explanatory qualities of diagram drawing in art, in this paper we propose a novel seeding strategy to generate representative and illustrative str...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
ALGORITHMICA
2011
13 years 4 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
ICPR
2002
IEEE
14 years 10 months ago
2002
IEEE
This paper proposes the fractional component analysis (FCA), whose goal is to decompose the observed signal into component signals and recover their fractions. The uniqueness of o...