Sciweavers

1618 search results - page 302 / 324
» Testing random number generators
Sort
View
BIOINFORMATICS
2007
151views more  BIOINFORMATICS 2007»
13 years 11 months ago
A new protein-protein docking scoring function based on interface residue properties
Motivation: Protein–protein complexes are known to play key roles in many cellular processes. However, they are often not accessible to experimental study because of their low s...
Julie Bernauer, Jérôme Azé, Jo...
DM
2006
128views more  DM 2006»
13 years 11 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
BMCBI
2007
141views more  BMCBI 2007»
13 years 11 months ago
Using structural motif descriptors for sequence-based binding site prediction
Background: Many protein sequences are still poorly annotated. Functional characterization of a protein is often improved by the identification of its interaction partners. Here, ...
Andreas Henschel, Christof Winter, Wan Kyu Kim, Mi...
CCR
2005
76views more  CCR 2005»
13 years 10 months ago
Simplifying the synthesis of internet traffic matrices
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
Matthew Roughan
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 9 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...