A visible k nearest neighbor (Vk NN) query retrieves k objects that are visible and nearest to the query object, where “visible”means that there is no obstacle between an object and the query object. Existing studies on the Vk NN query have focused on static data objects. In this paper we investigate how to process the query on moving objects continuously. We queries. We exploit spatial proximi...

Cluster analysis is one of the prominent techniques in the field of data mining and k-means is one of the most well known popular and partitioned based clustering algorithms. K-means clustering algorithm is widely used in clustering. The performance of k-means algorithm will affect when clustering the continuous data. In this paper, a novel approach for performing k-means clustering on continuo...

Bichromatic Reverse k-Nearest-Neighbor (BRkNN) query is a variant of the Reverse k-Nearest-Neighbor (RkNN) query that involves a set of service sites (e.g. gas stations) and a set of customer points (e.g. vehicles). It has many applications in Location-Based Services, in particular in mobile advertising. This paper investigates the processing of continuous BRkNN (CBRkNN) queries where the point...

A syntactic approach of the well-known N-grams models, the K-Testable Language in the Strict Sense (K-TSS), is used in this work to be integrated in a Continuous Speech Recognition (CSR) system. The use of smoothed K-TSS regular grammars allowed to obtain a deterministic Stochastic Finite State Automaton (SFSA) integrating K k-TSS models into a selfcontained model. An efficient representation o...

In this work, the continuously controlled assembly map in algebraic K-theory, as developed by Carlsson and Pedersen, is proved to be a split injection for groups Γ that satisfy certain geometric conditions. The group Γ is allowed to have torsion, generalizing a result of Carlsson and Pedersen. Combining this with a result of John Moody, K0(kΓ) is proved to be isomorphic to the colimit of K0(kH)...

Given a k-linear operator T from a product of C(K) spaces into a Banach space X, our main result proves the equivalence between T being completely continuous, T having an X-valued separately ω∗ − ω∗ continuous extension to the product of the biduals and T having a regular associated polymeasure. It is well known that, in the linear case, these are also equivalent to T being weakly compact, and ...

In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the maximal/maximum cliques of G. In this work we generalize the Motzkin-Straus theorem to k-uniform hypergraphs, establishing an isomorphism between local/global minimizers of a particular function over ∆ and the maximal/maximum cliqu...

discussed in the accompanying article, involve datasets so large that their direct manipulation is impractical. Some method of data compression or consolidation must first be applied to reduce the size of the dataset without losing the essential character of the data. All consolidation methods sacrifice some detail; the most desirable methods are computationally efficient and yield results that...