Sciweavers

3192 search results - page 538 / 639
» The minimum latency problem
Sort
View
TIT
2008
87views more  TIT 2008»
13 years 10 months ago
Coding Theorems on the Threshold Scheme for a General Source
In this paper, coding theorems on the (t; m)-threshold scheme for a general source are discussed, where m means the number of the shares and t means a threshold. The (t; m)-thresho...
Hiroki Koga
JCC
2007
131views more  JCC 2007»
13 years 10 months ago
An extended dead-end elimination algorithm to determine gap-free lists of low energy states
: Proteins are flexible systems and commonly populate several functionally important states. To understand protein function, these states and their energies have to be identified...
Edda Kloppmann, G. Matthias Ullmann, Torsten Becke...
TMI
2008
122views more  TMI 2008»
13 years 10 months ago
Tractography Gone Wild: Probabilistic Fibre Tracking Using the Wild Bootstrap With Diffusion Tensor MRI
Diffusion tensor magnetic resonance imaging (DT-MRI) permits the noninvasive assessment of tissue microstructure and, with fibre-tracking algorithms, allows for the 3-D trajectorie...
D. K. Jones
JCT
2007
96views more  JCT 2007»
13 years 10 months ago
Co-degree density of hypergraphs
For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (r − 1)-sets of vertices of H, and d(S) is the number of vertices v such that S ∪ {v} is an edge of...
Dhruv Mubayi, Yi Zhao
JGT
2007
68views more  JGT 2007»
13 years 10 months ago
Forcing highly connected subgraphs
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
Maya Jakobine Stein