Sciweavers

3757 search results - page 427 / 752
» The overlap number of a graph
Sort
View
IJNSEC
2007
127views more  IJNSEC 2007»
15 years 6 months ago
Markov Chain Modelling of the Probabilistic Packet Marking Algorithm
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
Tsz-Yeung Wong, John Chi-Shing Lui, Man Hon Wong
DIAGRAMS
2004
Springer
16 years 3 days ago
Individual Differences in Graphical Reasoning
People sometimes appear to build analogical representations in order to reason about graphical information. In this paper we consider the extent to which the tendency to represent ...
Aidan Feeney, John Adams, Lara Webber, Michael R. ...
224
Voted
ISPAN
2002
IEEE
15 years 11 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
ISMB
2000
15 years 8 months ago
Search for a New Description of Protein Topology and Local Structure
A novel description of protein structure in terms of the generalized secondary structure elements (GSSE) is proposed. GSSE's are defined as fragments of the protein structure...
Lukasz Jaroszewski, Adam Godzik
APPML
2005
68views more  APPML 2005»
15 years 6 months ago
A note on edge fault tolerance with respect to hypercubes
In the previous studies on k-edge fault tolerance with respect to hypercubes Qn, matrices for generating linear k-EFT(Qn) graphs were used. Let EFTL(n, k) denote the set of matric...
Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu