A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this po...