Sciweavers

11381 search results - page 119 / 2277
» Connectivity
Sort
View
105
Voted
NIPS
2004
15 years 4 months ago
Large-Scale Prediction of Disulphide Bond Connectivity
The formation of disulphide bridges among cysteines is an important feature of protein structures. Here we develop new methods for the prediction of disulphide bond connectivity. ...
Pierre Baldi, Jianlin Cheng, Alessandro Vullo
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
15 years 4 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
ADHOC
2008
183views more  ADHOC 2008»
15 years 3 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
116
Voted
CORR
2008
Springer
149views Education» more  CORR 2008»
15 years 3 months ago
Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
Jialing Liu, Vikas Yadav, Hullas Sehgal, Joshua M....
133
Voted
EJC
2006
15 years 3 months ago
Counting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
Remco van der Hofstad, Joel Spencer