The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Social reasoning theories, whilst studied extensively in the area of multiagent systems, are hard to implement directly in agents. They often specify properties of beliefs or behav...
In this paper we formulate a conjecture which partially generalizes the Gross-Kohnen-Zagier theorem to higher weight modular forms. For f S2k(N) satisfying certain conditions, we c...
Integrated process support is highly desirable in environments where data related to a particular business process are scattered over distributed, heterogeneous information system...
Manfred Reichert, Sarita Bassil, Ralph Bobrik, Tho...
Cooperative communication with multi-antenna relays can significantly increase the reliability and speed. However, cooperative MIMO detection would impose considerable complexity o...
Kiarash Amiri, Michael Wu, Melissa Duarte, Joseph ...