There are alternative approaches to link creation in hypermedia applications. The first distinction differs in the direct or indirect involvement of a human author in the process. The second distinction among computed links refers to when the computation is done, i.e. whether links are dynamically computed or precomputed. The aim is to investigate the relative merits of these different approach...

This paper describes BubbleDragon, an entry in the 2012 Grid-based Path-Planning Competition. We aim to solve path-finding problems in the minimum time possible by precomputing paths from states in a region to its frontiers. Experimental results show that suboptimal paths for 1024x1024 grids can be retrieved in less than 1ms on average.

Random walks can be used to search complex networks for a desired resource. To reduce the number of hops necessary to find resources, we propose a search mechanism based on building random walks connecting together partial walks that have been precomputed at each network node in an initial stage. The resources found in each partial walk are registered in its associated Bloom filter. Searches ca...

Spectral rendering takes the full visible spectrum into account when calculating light-surface interaction and can overcome the well-known deficiencies of rendering with tristimulus color models. We present a variant of the precomputed radiance transfer algorithm that is tailored towards real-time spectral rendering on modern graphics hardware. Our method renders diffuse, self-shadowing objects...

We introduce a method based on precomputed radiance transfer (PRT) that allows interactive rendering of glossy surfaces and includes shadowing effects from dynamic, “all-frequency” lighting. Specifically, source lighting is represented by a cube map at resolution nL = 6× 32× 32. We present a novel PRT formulation which factors glossy BRDFs into purely view-dependent and light-dependent parts, a...

Advances in vehicular communication technologies are expected to facilitate cooperative driving the future. Connected and Automated Vehicles (CAVs) able collaboratively plan execute maneuvers by sharing their perceptual knowledge future plans. In this paper, an architecture for autonomous navigation of tight multi-lane platoons traveling on public roads is presented. Using proposed approach, CA...

UNLABELLED Assembling and/or producing integrated knowledge of sequence features continues to be an onerous and redundant task despite a large number of existing resources. We have developed SeqDepot-a novel database that focuses solely on two primary goals: (i) assimilating known primary sequences with predicted feature data and (ii) providing the most simple and straightforward means to procu...

This thesis introduces a new acceleration heuristic for shortest path queries, called the PCD algorithm (Precomputed Cluster Distances). PCD precomputes shortest path distances between the partitions of the input graph, which can be obtained by any graph partitioning method. Since the number of partitions can be varied between one and the number of nodes, the method presents an interpolation be...