3244 search results - page 209 / 649 » On convex complexity measures |
179
click to vote
ASPDAC
2005
ACM
16 years 3 days ago
2005
ACM
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
165
click to vote
GD
2005
Springer
16 years 2 days ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
151
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
163
click to vote
COLT
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We consider the problem of estimating an unknown probability distribution from samples using the principle of maximum entropy (maxent). To alleviate overfitting with a v...
146
click to vote
IMR
2004
Springer
15 years 12 months ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...