Sciweavers

6045 search results - page 58 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
SC
2009
ACM
14 years 2 months ago
Dynamic task scheduling for linear algebra algorithms on distributed-memory multicore systems
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...
Fengguang Song, Asim YarKhan, Jack Dongarra
ICCSA
2003
Springer
14 years 1 months ago
The Role of Multi-method Linear Solvers in PDE-based Simulations
The solution of large-scale, nonlinear PDE-based simulations typically depends on the performance of sparse linear solvers, which may be invoked at each nonlinear iteration. We pre...
Sanjukta Bhowmick, Lois C. McInnes, Boyana Norris,...
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
14 years 5 days ago
Structural Properties and Tractability Results for Linear Synteny
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
David Liben-Nowell, Jon M. Kleinberg
IPPS
2006
IEEE
14 years 1 months ago
Memory minimization for tensor contractions using integer linear programming
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
A. Allam, J. Ramanujam, Gerald Baumgartner, P. Sad...
CVPR
2007
IEEE
14 years 9 months ago
Linear and Quadratic Subsets for Template-Based Tracking
We propose a method that dramatically improves the performance of template-based matching in terms of size of convergence region and computation time. This is done by selecting a ...
Selim Benhimane, Alexander Ladikos, Vincent Lepeti...