Sciweavers

598 search results - page 80 / 120
» A random graph model for massive graphs
Sort
View
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 6 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
TCOM
2010
109views more  TCOM 2010»
14 years 10 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik
NIPS
2004
15 years 1 months ago
Validity Estimates for Loopy Belief Propagation on Binary Real-world Networks
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....
Joris M. Mooij, Hilbert J. Kappen
BMCBI
2007
142views more  BMCBI 2007»
14 years 12 months ago
LinkHub: a Semantic Web system that facilitates cross-database queries and information retrieval in proteomics
nd: A key abstraction in representing proteomics knowledge is the notion of unique identifiers for individual entities (e.g. proteins) and the massive graph of relationships among...
Andrew K. Smith, Kei-Hoi Cheung, Kevin Y. Yip, Mar...
BMCBI
2007
265views more  BMCBI 2007»
14 years 12 months ago
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
Tobias Wittkop, Jan Baumbach, Francisco P. Lobo, S...