Sciweavers

1469 search results - page 128 / 294
» Characterizing the Structural Complexity of Real-World Compl...
Sort
View
ICNP
2007
IEEE
15 years 10 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
BMCBI
2007
227views more  BMCBI 2007»
15 years 3 months ago
Growing functional modules from a seed protein via integration of protein interaction and gene expression data
Background: Nowadays modern biology aims at unravelling the strands of complex biological structures such as the protein-protein interaction (PPI) networks. A key concept in the o...
Ioannis A. Maraziotis, Konstantina Dimitrakopoulou...
CIKM
1997
Springer
15 years 8 months ago
Learning Belief Networks from Data: An Information Theory Based Approach
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
Jie Cheng, David A. Bell, Weiru Liu
ADHOC
2006
115views more  ADHOC 2006»
15 years 3 months ago
Routing characteristics of ad hoc networks with unidirectional links
Unidirectional links in an ad hoc network can result from factors such as heterogeneity of receiver and transmitter hardware, power control or topology control algorithms, or diff...
Jorjeta G. Jetcheva, David B. Johnson
APPINF
2003
15 years 5 months ago
Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
Gur Saran Adhar