503 search results - page 54 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
181
click to vote
COMGEO
2008
ACM
15 years 5 months ago
2008
ACM
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
162
click to vote
ISPD
2004
ACM
15 years 11 months ago
2004
ACM
Considering the voltage drop constraint over a distributed model for power/ground (P/G) network, we study the following two problems for physical synthesis of sleep transistors: t...
168
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
197
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
153
click to vote
ICNP
1998
IEEE
15 years 10 months ago
1998
IEEE
We formulate end-to-end congestion control as a global optimization problem. Based on this formulation, a class of minimum cost flow control (MCFC) algorithms for adjusting sessio...