582 search results - page 45 / 117 » Analysis of Grain's Initialization Algorithm |
EOR
2008
13 years 8 months ago
2008
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
PODS
2006
ACM
14 years 9 months ago
2006
ACM
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
ISSAC
1992
Springer
14 years 25 days ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
VISSYM
2007
13 years 11 months ago
2007
One of the most common visualization tasks is the extraction of significant boundaries, often performed with isosurfaces or level set segmentation. Isosurface extraction is simple...