Sciweavers

1092 search results - page 69 / 219
» Convex Methods for Transduction
Sort
View
ISPD
1998
ACM
107views Hardware» more  ISPD 1998»
14 years 2 months ago
Sequence-pair based placement method for hard/soft/pre-placed modules
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
Hiroshi Murata, Ernest S. Kuh
FOCM
2002
97views more  FOCM 2002»
13 years 10 months ago
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
Yu. E. Nesterov, Michael J. Todd
MOC
2010
13 years 4 months ago
Optimizing the double description method for normal surface enumeration
Abstract. Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a con...
Benjamin A. Burton
AMC
2007
87views more  AMC 2007»
13 years 10 months ago
Generalized Clenshaw-Curtis quadrature rule with application to a collocation least-squares method
This paper deals with an extension of one-dimensional Clenshaw–Curtis quadrature rule to Rd ; d P 2 on a convex domain. As one of its applications, we apply this quadrature rule...
Changho Kim, Sang Dong Kim, Jungho Yoon
JSAC
2006
180views more  JSAC 2006»
13 years 10 months ago
A Tutorial on Decomposition Methods for Network Utility Maximization
A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the...
Daniel Pérez Palomar, Mung Chiang