3591 search results - page 294 / 719 » Typing linear constraints |
174
click to vote
SAC
2010
ACM
16 years 2 months ago
2010
ACM
We consider the design of parametric curves from geometric constraints such as distance from lines or points and tangency to lines or circles. We solve the Hermite problem with su...
221
click to vote
APPROX
2009
Springer
16 years 2 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
183
click to vote
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
198
click to vote
SMI
2005
IEEE
16 years 29 days ago
2005
IEEE
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
184
click to vote
GD
2005
Springer
16 years 27 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...