1749 search results - page 210 / 350 » Conditional colorings of graphs |
169
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper presents a novel approach of multiple target tracking from multiple collaborative cameras. Firstly, particle filtering for conditional density propagation on graphs to...
206
click to vote
CC
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
169
Voted
ISSS
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
180
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
176
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning...