Continuous query systems are an intuitive way for users to access data streaming data in large scale scientific applications containing hundreds if not thousands of streams. This paper focuses on optimizations for improved memory utilization under the large scale, asynchronous streams found in on-demand meteorological forecasting and other data-driven applications. Specifically, we experimental...

Full perspective mappings between D objects and D images are more complicated than weak perspective mappings which consider only rotation translation and scaling Therefore in D model based robot navigation it is important to understand how and when full perspective must be taken into account In this paper we use a probabilistic combinatorial op timization algorithm to search for an optimal matc...

We present an algorithm for tracking objects in a video sequence, based on a novel approach for motion detection. We do not estimate the velocity eld. Instead we detect only the direction of motion at edge points and thus isolate sets of points which are moving coherently. We use a Hausdor distance based matching algorithm to match point sets in local neighborhood and thus track objects in a vi...

Numerical analysts physicists and signal processing engineers have proposed algo rithms that might be called conjugate gradient for problems associated with the com putation of eigenvalues There are many variations mostly one eigenvalue at a time though sometimes block algorithms are proposed Is there a correct conjugate gradi ent algorithm for the eigenvalue problem How are the algorithms rela...

We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size of the transitive closure and generalizations of the transitive closure, and also show that for bounded degree relations, the algorithm runs in linear time. Such estimating algorithms are essential if database systems...

In this paper, we study Markov chains with innnite state block-structured transition matrix with repeated rows and rational structure. We provide an algorithmic approach to nd the stationary probability distribution based on the concepts of linear systems theory. These chains include well-known structured Markov chains such as canonical and non-canonical M/G/1 and G/M/1. We provide a truncation...

Originally studied for designing min cost connecting grid (in distribution, transportation, communication applications) to connect a set of cities. Under arc lengths > 0 min cost connecting network will bea spanning tree (ST). Earliest algo. (Boruvka's) dates back to 1926! Undirected, connected G = (N A c). To nd an uncon-strained MCST in G. c arbitrary. Constrained MCST problems (typical const...

The Set Covering Problem SCP is a main model for several important applications including crew scheduling in railway and mass transit companies In this survey we focus our attention on the most recent and e ective algo rithms for SCP considering both heuristic and exact approaches outlining their main characteristics and presenting an experimental comparison on the test bed instances of Beasley...

This paper introduces a constrained recon gurable mesh model which incorporates practical assump tions about propagation delays on large sized buses Simulations of optimal recon gurable mesh algo rithms on the constrained recon gurable mesh model are found to be non optimal Optimal solutions for the sorting and convex hull problems are then presented For the problems investigated the con strain...