Results 1  10
of
3,205
Dictionary of protein secondary structure: pattern recognition of hydrogenbonded and geometrical features
 Biopolymers
, 1983
"... structure ..."
Turbulence statistics in fully developed channel flow at low Reynolds number
 J. Fluid Mech
, 1987
"... A direct numerical simulation of a turbulent channel flow is performed. The unsteady NavierStokes equations are solved numerically at a Reynolds number of 3300, based on thc mean centreline velocity and channel halfwidth, with about 4 x los grid points (192 x 129 x 160 in 2, y, 2). All essential t ..."
Abstract

Cited by 373 (14 self)
 Add to MetaCart
A direct numerical simulation of a turbulent channel flow is performed. The unsteady NavierStokes equations are solved numerically at a Reynolds number of 3300, based on thc mean centreline velocity and channel halfwidth, with about 4 x los grid points (192 x 129 x 160 in 2, y, 2). All essential
CP Conserving and CP Violating Asymmetries in e + e − → t¯tνe¯νe at the NLC: Application to Determining the Higgs Width
, 1996
"... Abstract: The polarization asymmetries of t, ¯t quarks can be used in the reaction e + e − → t¯tνe¯νe to measure the Higgs width, in the Standard Model or in its extensions, and to search for nonstandard CP violating phases. As an application of the CPT theorem the Higgs width is monitored through ..."
Abstract
 Add to MetaCart
Abstract: The polarization asymmetries of t, ¯t quarks can be used in the reaction e + e − → t¯tνe¯νe to measure the Higgs width, in the Standard Model or in its extensions, and to search for nonstandard CP violating phases. As an application of the CPT theorem the Higgs width is monitored
NLC2 decomposition in polynomial time
 In Proceedings of GraphTheoretical Concepts in Computer Science, volume 1665 of LNCS
, 1999
"... NLCk is a family of algebras on vertexlabeled graphs introduced by Wanke. An NLCdecomposition of a graph is a derivation of this graph from single vertices using the operations in question. The width of the decomposition is the number of labels used, and the NLCwidth of the graph is the smallest ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
NLCk is a family of algebras on vertexlabeled graphs introduced by Wanke. An NLCdecomposition of a graph is a derivation of this graph from single vertices using the operations in question. The width of the decomposition is the number of labels used, and the NLCwidth of the graph is the smallest
log napproximative NLC_kdecomposition in O(n^(2k+1)) time (Extended Abstract)
 GRAPHTHEORETIC CONCEPTS IN COMPUTER SCIENCE (BOLTENHAGEN
, 2001
"... NLC_k for k = 1,... is a family of algebras on vertexlabeled graphs introduced by Wanke. An NLCdecomposition of a graph is a derivation of this graph from single vertices using the operations in question. The width of such a decomposition is the number of labels used, and the NLCwidth of a graph ..."
Abstract
 Add to MetaCart
NLC_k for k = 1,... is a family of algebras on vertexlabeled graphs introduced by Wanke. An NLCdecomposition of a graph is a derivation of this graph from single vertices using the operations in question. The width of such a decomposition is the number of labels used, and the NLCwidth of a graph
On The Granularity And Clustering Of Directed Acyclic Task Graphs
 IEEE Transactions on Parallel and Distributed Systems
, 1990
"... Clustering has been used as a compile time preprocessing step in the scheduling of task graphs on parallel architectures. A special case of the clustering problem arises in scheduling an unbounded number of completely connected processors. Using a generalization of Stone's granularity definiti ..."
Abstract

Cited by 110 (22 self)
 Add to MetaCart
definition, the impact of the granularity on clustering strategies is analyzed. A clustering is called linear if every cluster is one simple directed path in the task graph; otherwise is called nonlinear. For coarse grain directed acyclic task graphs (DAGs), a completely connected architecture with unbounded
Graph operations characterizing rankwidth and balanced graph expressions
, 2007
"... Graph complexity measures like treewidth, cliquewidth, NLCwidth and rankwidth are important because they yield Fixed Parameter Tractable algorithms. Rankwidth is based on ranks of adjacency matrices of graphs over GF(2). We propose here algebraic operations on graphs that characterize rankwidt ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Graph complexity measures like treewidth, cliquewidth, NLCwidth and rankwidth are important because they yield Fixed Parameter Tractable algorithms. Rankwidth is based on ranks of adjacency matrices of graphs over GF(2). We propose here algebraic operations on graphs that characterize rankwidth
The Anatomy of Electro–Weak Symmetry Breaking, III: The Higgs sector
 in models beyond the SM and MSSM benchmarks, in preparation
"... The second part of this review is devoted to the Higgs sector of the Minimal Supersymmetric Standard Model. The properties of the neutral and charged Higgs bosons of the extended Higgs sector are summarized and their decay modes and production mechanisms at hadron colliders and at future lepton coll ..."
Abstract

Cited by 152 (1 self)
 Add to MetaCart
colliders are discussed. The total decay widths of the neutral and charged MSSM Higgs bosons and their production cross sections at the LHC and at a 500 GeV e + e − collider in the main channels. Contents Préambule 5 1 The Higgs sector of the MSSM 13
Results 1  10
of
3,205