Sciweavers

3008 search results - page 131 / 602
» Independence in connected graphs
Sort
View
NIPS
2004
15 years 7 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
EDBT
2004
ACM
133views Database» more  EDBT 2004»
16 years 6 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum
WCNC
2008
IEEE
16 years 24 days ago
Connectivity-Aware Network Maintenance via Relays Deployment
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...
Ahmed S. Ibrahim, Karim G. Seddik, K. J. Ray Liu
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
16 years 17 days ago
Pricing Tree Access Networks with Connected Backbones
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. R...
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
16 years 17 days ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel