194 search results - page 14 / 39 » Computing Roundness is Easy if the Set is Almost Round |
103
click to vote
CGI
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we propose a new interpolatory subdivision scheme for generating nice-looking curvature-continuous curves of round shapes. The scheme is based on a diffusion of nor...
122
click to vote
WDAG
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
106
click to vote
JCP
2007
15 years 1 months ago
2007
Abstract— Converting a secure group key agreement protocol into password-based setting is not a trivial task. The security of a password-based scheme hinges on preventing diction...
103
click to vote
MP
2010
15 years 10 days ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
107
click to vote
EOR
2007
15 years 1 months ago
2007
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...