3008 search results - page 525 / 602 » Independence in connected graphs |
172
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
176
click to vote
IPMU
1992
Springer
15 years 10 months ago
1992
Springer
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...
140
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
178
click to vote
ASUNAM
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we present a horizontal view of social influence, more specifically a quantitative study of the influence of neighbours on the probability of a particular node to jo...
171
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
Internet interdomain routing is policy-driven, and thus physical connectivity does not imply reachability. On average, routing on today's Internet works quite well, ensuring ...