107 search results - page 5 / 22 » Factor cuts |
141
Voted
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
In this work we improve top-down min-cut placers in the context of timing closure. Using the concept of boosting factors, we adjust net weights according to net spans, so as to re...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
SPDP
1991
IEEE
15 years 1 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
CHI
2011
ACM
2011
ACM
TouchCuts and TouchZoom: enhanced target selection for touch displays using finger proximity sensing
14 years 1 months ago
Although touch-screen laptops are increasing in popularity, users still do not comfortably rely on touch in these environments, as current software interfaces were not designed fo...