1814 search results - page 161 / 363 » Improved Results on Geometric Hitting Set Problems |
143
click to vote
GLVLSI
2009
IEEE
16 years 1 months ago
2009
IEEE
Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techni...
163
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
130
click to vote
DAM
2007
15 years 6 months ago
2007
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...
183
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
136
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...