Sciweavers

683 search results - page 84 / 137
» Graph Annotations in Modeling Complex Network Topologies
Sort
View
BMCBI
2010
98views more  BMCBI 2010»
14 years 9 months ago
An optimized TOPS+ comparison method for enhanced TOPS models
nd: Although methods based on highly abstract descriptions of protein structures, such as VAST and TOPS, can perform very fast protein structure comparison, the results can lack a...
Mallika Veeramalai, David Gilbert, Gabriel Valient...
COMPGEOM
2011
ACM
14 years 1 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
INFOCOM
2009
IEEE
15 years 4 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
PODC
2009
ACM
15 years 4 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
VTC
2006
IEEE
121views Communications» more  VTC 2006»
15 years 3 months ago
Location-Dependent Parameterization of a Random Direction Mobility Model
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...
Bernd Gloss, Michael Scharf, Daniel Neubauer