This abstract introduces a new algorithm called the Disjoint Path Vector (DPV) algorithm for constructing a fault-tolerant topology to route data collected by sensor nodes to super nodes. In WSNs, guaranteeing k-connectivity of the communication graph is fundamental to obtain a certain degree of fault tolerance. The resulting topology is tolerant up to k-1 node […]
AS-PROJECTIVE-AS-POSSIBLE WARPS WITH MOVING DIRECT LINEAR TRANSFORMATION
Image stitching or photo stitching is the process of combining multiple photographic images with overlapping fields of view to produce a segmented panorama or high-resolution image. Commonly performed through the use of computer software, most approaches to image stitching require nearly exact overlaps between images and identical exposures to produce seamless results. We investigate projective […]
CONTINUOUS DISTRIBUTED INTERACTIVE APPLICATIONS WITH CLIENT ASSIGNMENT PROBLEM: ANALYSIS, ALGORITHMS, AND EVALUATION
Interactivity is characterized by the duration from the time when a participant issues an operation to the time when the effect of the operation is presented to the same participant or other participants. Interactivity is a primary performance measure for distributed interactive applications (DIAs) that enable participants at different locations to interact with each other […]
RELATIONAL DBMSS WITH SHORTEST PATH COMPUTING
Graph search is highly needed in applications over graphs. Specifically, graph search seeks a sub-graph(s) meeting the specific purposes, such as the shortest path between two nodes, the minimal spanning tree, the salesman traveling path, and the like. We also observe that these graphs are always exceedingly large and keep growing at a fast rate. […]