336 search results - page 15 / 68 » Analytic Cut Trees |
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
103
click to vote
STOC
1996
ACM
15 years 3 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
132
click to vote
EOR
2007
14 years 11 months ago
2007
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
ICCAD
1996
IEEE
15 years 3 months ago
1996
IEEE
Elmore delay has been widely used as an analytical estimate of interconnect delays in the performance-driven synthesis and layout of VLSI routing topologies. However,for typical R...
113
click to vote
HICSS
2009
IEEE
15 years 6 months ago
2009
IEEE
We describe a platform for performing text and radiology analytics (TARA). We integrate commercially available hardware and middleware components to construct an environment which...