A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
Marc Benkert, Joachim Gudmundsson, Herman J. Haver...
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
In this paper, we present an approach toward pedestrian detection and tracking from infrared imagery using joint shape and appearance cues. A layered representation is first intr...
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...