Learn More
Disparity map generation is a significant component of vision-based driver assistance systems. This paper describes an efficient implementation of a belief propagation algorithm on a graphics card (GPU) using CUDA (Compute Uniform Device Architecture) that can be used to speed up stereo image processing by between 30 and 250 times. For evaluation purposes,(More)
Although myocyte cell transplantation studies have suggested a promising therapeutic potential for myocardial infarction, a major obstacle to the development of clinical therapies for myocardial repair is the difficulties associated with obtaining relatively homogeneous ventricular myocytes for transplantation. Human embryonic stem cells (hESCs) are a(More)
We study the problem of point-to-point distance querying for massive scale-free graphs, which is important for numerous applications. Given a directed or undirected graph, we propose to build an index for answering such queries based on a novel hop-doubling labeling technique. We derive bounds on the index size, the computation costs and I/O costs based on(More)
Shortest path is a fundamental graph problem with numerous applications. However, the concept of classic shortest path is insufficient or even flawed in a temporal graph, as the temporal information determines the order of activities along any path. In this paper, we show the shortcomings of classic shortest path in a temporal graph, and study various(More)
Active exchangers dissipate the gradient of one substrate to accumulate nutrients, export xenobiotics and maintain cellular homeostasis. Mechanistic studies have suggested that two fundamental properties are shared by all exchangers: substrate binding is antagonistic, and coupling is maintained by preventing shuttling of the empty transporter. The CLC(More)
—Maximal cliques are important substructures in graph analysis. Many algorithms for computing maximal cliques have been proposed in the literature; however, most of them are sequential algorithms that cannot scale due to the high complexity of the problem, while existing parallel algorithms for computing maximal cliques are mostly immature and especially(More)
—This paper addresses an issue of short-term traffic flow prediction in urban traffic networks with traffic signals in intersections. An effective spatial prediction approach is proposed based on a macroscopic urban traffic network model. In contrast with other time series based or spatio-temporal correlation methods, this research focuses on the(More)