820 search results - page 86 / 164 » Inducing Temporal Graphs |
115
click to vote
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
125
Voted
VALUETOOLS
2006
ACM
15 years 8 months ago
2006
ACM
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
123
Voted
RSFDGRC
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, a new variant of Bagging named DepenBag is proposed. This algorithm obtains bootstrap samples at first. Then, it employs a causal discoverer to induce from each sam...
112
Voted
ADHOCNOW
2003
Springer
15 years 7 months ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
133
Voted
INFOCOM
2002
IEEE
15 years 7 months ago
2002
IEEE
— Recent work has shown that the node degree in the WWW induced graph and the AS-level Internet topology exhibit power laws. Since then several algorithms have been proposed to g...