Sciweavers

779 search results - page 154 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
13 years 9 months ago
High-Throughput 3D Structural Homology Detection via NMR Resonance Assignment
One goal of the structural genomics initiative is the identification of new protein folds. Sequence-based structural homology prediction methods are an important means for priorit...
Christopher James Langmead, Bruce Randall Donald
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 3 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
ICDAR
2011
IEEE
12 years 4 months ago
Ternary Entropy-Based Binarization of Degraded Document Images Using Morphological Operators
—A vast number of historical and badly degraded document images can be found in libraries, public, and national archives. Due to the complex nature of different artifacts, such p...
T. Hoang Ngan Le, Tien D. Bui, Ching Y. Suen
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
13 years 10 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
JCB
2006
185views more  JCB 2006»
13 years 5 months ago
A Probabilistic Methodology for Integrating Knowledge and Experiments on Biological Networks
Biological systems are traditionally studied by focusing on a specific subsystem, building an intuitive model for it, and refining the model using results from carefully designed ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...