Sciweavers

10997 search results - page 191 / 2200
» On the Structure of Complete Sets
Sort
View
ARSCOM
2007
191views more  ARSCOM 2007»
15 years 6 months ago
Binomial Identities Generated by Counting Spanning Trees
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
Thomas Dale Porter
CORR
2010
Springer
158views Education» more  CORR 2010»
15 years 6 months ago
A Minimal Propositional Type Theory
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
Mark Kaminski, Gert Smolka
IPPS
2000
IEEE
15 years 11 months ago
Template Based Structured Collections
Collective operations on distributed data sets foster a high-level data-parallel programming style that eases many aspects of parallel programming significantly. In this paper we...
Jörg Nolte, Mitsuhisa Sato, Yutaka Ishikawa
ADG
1998
Springer
127views Mathematics» more  ADG 1998»
15 years 11 months ago
Decomposing Algebraic Varieties
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
Dongming Wang
BMCBI
2007
140views more  BMCBI 2007»
15 years 6 months ago
Accurate prediction of protein secondary structure and solvent accessibility by consensus combiners of sequence and structure in
Background: Structural properties of proteins such as secondary structure and solvent accessibility contribute to three-dimensional structure prediction, not only in the ab initio...
Gianluca Pollastri, Alberto J. M. Martin, Catherin...