35 search results - page 5 / 7 » Improved LP Lower Bounds for Difference Triangle Sets |
CORR
2011
Springer
13 years 1 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
ISPD
2004
ACM
14 years 3 days ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
COMPGEOM
2004
ACM
14 years 3 days ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
VLDB
2007
ACM
14 years 6 months ago
2007
ACM
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...