Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2009

Highly Cited

2009

The supernodal method for sparse Cholesky factorization represents the factor L as a set of supernodes, each consisting of a… Expand

Highly Cited

2008

Highly Cited

2008

Interactive segmentation is often performed on images that have been stored on disk (e.g., a medical image server) for some time… Expand

Highly Cited

2007

Highly Cited

2007

Abstract
Interior-point methods are among the most efficient approaches for solving large-scale nonlinear programming problems… Expand

Highly Cited

2006

Highly Cited

2006

Despite its popularity, relatively little is known about the traffic characteristics of the Skype VoIP system and how they differ… Expand

Highly Cited

2006

Highly Cited

2006

This paper discusses new pivoting factorization methods for solving sparse symmetric indenite sys- tems. As opposed to many… Expand

Highly Cited

2004

Highly Cited

2004

Supernode partitioning for unsymmetric matrices together with complete block diagonal supernode pivoting and asynchronous… Expand

Highly Cited

1999

Highly Cited

1999

We investigate several ways to improve the performance of sparse LU factorization with partial pivoting, as used to solve… Expand

Highly Cited

1993

Highly Cited

1993

Hill-climbing, simulated annealing and genetic algorithms are search techniques that can be applied to most combinatorial… Expand

Highly Cited

1988

Highly Cited

1988

Supercompilers must reschedule computations defined by nested DO-loops in order to make an efficient use of supercomputer… Expand

Highly Cited

1987

Highly Cited

1987

This paper summarizes progress in the use of direct methods for solving very large sparse symmetric positive definite systems of… Expand