#### Filter Results:

- Full text PDF available (29)

#### Publication Year

1972

2015

- This year (0)
- Last 5 years (5)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- C . EISENSTAT, HOWARD C . ELMANt, Martin H. Schultz

We consider a class of iterative algorithms for solving systems of linear equations where the coefficient matrix is nonsymmetric with positive-definite symmetric part. The algorithms are modelled after the conjugate gradient method, and are well suited for large sparse systems. They do not make use of any associated symmetric problems. Convergence results… (More)

- S. Muthukrishnan, Bhaskar Ghosh, Martin H. Schultz
- Theory of Computing Systems
- 1998

We consider the following general problem modeling load balancing in a variety of distributed settings. Given an arbitrary undirected connected graph G=(V,E) and a weight distribution w 0 on the nodes, determine a schedule to move weights across edges in each step so as to (approximately) balance the weights on the nodes. We focus on diffusive schedules for… (More)

- Yousef Saad, Martin H. Schultz
- J. Parallel Distrib. Comput.
- 1989

- Yousef Saad, Martin H. Schultz
- Parallel Computing
- 1989

- Jan L W Rademaker, Frank J. Louws, +4 authors Frans J de Bruijn
- Phytopathology
- 2005

ABSTRACT A comprehensive classification framework was developed that refines the current Xanthomonas classification scheme and provides a detailed assessment of Xanthomonas diversity at the species, subspecies, pathovar, and subpathovar levels. Polymerase chain reaction (PCR) using primers targeting the conserved repetitive sequences BOX, enterobacterial… (More)

- Ashish Deshpande, Martin H. Schultz
- Scientific Programming
- 1992

Linda a’s a coordination language invented by David Gelernter at Yale University [7], which, when combined wdh a computation language (like C) yieids a high-level paratlel programming language for MIMD machines. Linda is based on a virtual shared associative memory containing objects called tuples. Skeptics have long ciaimed that Linda programs could noi be… (More)

- Bhaskar Ghosh, S. Muthukrishnan, Martin H. Schultz
- SPAA
- 1996

We consider the following general problem modeling load balancing in a variety of distributed settings. Given an arbitrary undirected connected graph G = (V. E) and a weight distribution W“ on the nodes, determine a schedule to move weights in each step across edges so as to (approximately) balance the weights on the nodes. We focus on dtflusivr schedules… (More)

- Kevin Y. Yip, Peishen Qi, Martin H. Schultz, David Wai-Lok Cheung, Kei-Hoi Cheung
- Pacific Symposium on Biocomputing
- 2006

Clustering is a popular method for analyzing microarray data. Given the large number of clustering algorithms being available, it is difficult to identify the most suitable ones for a particular task. It is also difficult to locate, download, install and run the algorithms. This paper describes a matchmaking system, SemBiosphere, which solves both problems.… (More)

Time dependent partial di erential equations are often solved using algorithms which parallelize the solution process in the spatial domain. However, as the number of processors increases, the parallel e ciency is limited by the increasing communication/computation ratio. Recently, several researchers have proposed algorithms incorporating temporal domain… (More)

- Andrew K. Smith, Kei-Hoi Cheung, Kevin Y. Yip, Martin H. Schultz, Mark B Gerstein
- BMC Bioinformatics
- 2007

A key abstraction in representing proteomics knowledge is the notion of unique identifiers for individual entities (e.g. proteins) and the massive graph of relationships among them. These relationships are sometimes simple (e.g. synonyms) but are often more complex (e.g. one-to-many relationships in protein family membership). We have built a software… (More)