848 search results - page 9 / 170 » Randomness and the linear degrees of computability |
138
Voted
WG
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
110
Voted
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...
146
Voted
TC
2010
15 years 2 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
137
Voted
ICNS
2009
IEEE
15 years 10 months ago
2009
IEEE
What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is ...
118
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...