Virtual environment are often populated with moving units and the paths for these units should be planned. When multiple units need to exhibit coherent behavior in a cluttered environment, current techniques often fail, i.e. the resulting paths for the units in the group lack the coherence

Motion planning for multiple entities is a challenging problem in today's virtual environments. In this paper we develop an innovative approach to motion planning for groups of entities, where coherence is taken into account. We model

“natural’ ’ correspondence with data or services that have been replicated for availability or as part of a coherent cache. They can be used to support highly available security domains, and group mechanisms fit well with an emerging generation of intelligent network and collaborative work applications.

This paper will introduce the homogeneous coordinate ring S of a toric variety X. The ring S is a polynomial ring with one variable for each one-dimensional cone in the fan ∆ determining X, and S has a natural grading determined by the monoid of effective divisor classes in the Chow group An−1(X

Abstract- This paper presents a new proposed technique to identify the coherent groups of generators using fuzzy c-means clustering algorithm (FCM). The proposed technique is based on a proposed coherency criterion introduced by using time response of the linearized power system model that reveal

thinking leads to sequences of ideas that are so tangled that their interconnections are not readily discerned. The lack of a coherent procedure to make decisions is especially troublesome when our intuition alone cannot help us to determine which of several options is the most desirable, or the least

We are interested in designing systems that support communication and collaboration among large groups of people over computer networks. We begin by asking what properties of the physical world support graceful human-human communication in face-to-face situations, and argue that it is possible

the Nyström method. This method allows one to extrapolate the complete grouping solution using only a small number of "typical" samples. In doing so, we leverage the fact that there are far fewer coherent groups in a scene than pixels.

This paper gives a construction of braid group actions on the derived category of coherent sheaves on a variety X. The motivation for this is M. Kontsevich’s homological mirror conjecture, together with the occurrence of certain braid group actions in symplectic geometry. One of the main results

the proposed estimator to the group and sparse group-Lasso comply with our theoretical results, showing consistent improvements in support recovery for sign-coherent groups. We finally propose two examples illustrating the wide applicability of the cooperative-Lasso: first to the processing of ordinal