In spatio-temporal reasoning, granularity is one of the factors to be considered when aiming at an effective and efficient representation of space and time. There is a large body of work which addresses the issue of granularity by representing space and time on a qualitative level. Other approaches use a predefined scale which implicitly determines granularity (e.g., seconds, minutes, hours, da...

In this paper, a multiple prototype based filter bank is proposed for variable granularity bands. This method makes use of channel combiners for variable granularity bands from a cosine modulated filter bank. In the proposed method, the filter bank is generated from proper choice of prototype filters and different bandwidth combinations are generated from different prototypes, where M determine...

Any phenomenon can be seen under a more or less precise granularity, depending on the kind of details which are perceivable. This can be applied to time. A characteristic of abstract spaces such as the one used for representing time is their granularity independence, i.e. the fact that they have the same structure at different granularities. So, time “places” and their relationship can be seen ...

Granularity control is a method to improve parallel execution performance by limiting excessive parallelism. The general idea is that if the gain obtained by executing a task in parallel is less than the overheads required to support parallel execution, then the task is better executed sequentially. Traditionally, in logic programming task size is estimated from the sequential time-complexity o...

Granular computing aims to develop a granular view for interpreting and solving problems. The model of neighborhood rough sets is one of effective tools for granular computing. This model can deal with complex tasks of classification learning. Despite the success of the neighborhood model in attribute reduction and rule learning, it still suffers from the issue of granularity selection. Namely,...

Granularity control is a method to improve parallel execution performance by limiting excessive parallelism. The general idea is that if the gain obtained by executing a task in parallel is less than the overheads required to support parallel execution, then the task is better executed sequentially. Traditionally, in logic programming, task size is estimated from the sequential time-complexity ...

Granularity of knowledge attracted attention of many researchers recently. This paper concerns this issue from the rough set perspective. Granularity is inherently connected with foundation of rough set theory. The concept of the rough set hinges on classification of objects of interest into similarity classes, which form elementary building blocks (atoms, granules) of knowledge. These granules...

In the last few years, the concept of time granularity has been deened by several researchers, and a glossary of time granularity concepts has been published. These deenitions often view a time granularity as a (mostly innnite) sequence of time granules. Although this view is conceptually clean, it is extremely ineecient or even practically impossible to represent a time granularity in this man...

We examine various versions of oriented cohomology and BorelMoore homology theories in algebraic geometry and put these two together in the setting of an “oriented duality theory”, a generalization of Bloch-Ogus twisted duality theory. We apply this to give a Borel-Moore homology version MGL ∗,∗ of Voevodsky’s MGL-theory, and a natural map θ : Ω∗ → MGL 2∗,∗ , where Ω∗ is the algebraic cobordism...

To evaluate a query it is necessary to split it to subqueries. It can be done in several different ways resulted in various granularity. The problem about estimating influence of subquery granularity on evaluating a query to remote XML store is posed in this work. Granularity reduction algorithm is suggested. Minimizing of network node interconnections is the goal of the algorithm. Work is on i...