Sciweavers

2492 search results - page 420 / 499
» On the General Signature Trees
Sort
View
IPPS
2000
IEEE
14 years 1 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
FOCS
1999
IEEE
14 years 1 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl
ISIPTA
1999
IEEE
139views Mathematics» more  ISIPTA 1999»
14 years 1 months ago
Rational Decision Making With Imprecise Probabilities
Decision criteria based on an imprecise probability representation of uncertainty have been criticized, from the normative point of view, on the grounds that they make the decisio...
Jean-Yves Jaffray
ICLP
1999
Springer
14 years 1 months ago
Algebra of Logic Programming
A declarative programming language has two kinds of semantics. The tract helps in reasoning about speci cations and correctness, while an operational semantics determines the mann...
Silvija Seres, J. Michael Spivey, C. A. R. Hoare
VLDB
1999
ACM
131views Database» more  VLDB 1999»
14 years 1 months ago
High-Performance Extensible Indexing
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
Marcel Kornacker