Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
Abstract. This paper describes a multi-disciplinary initiative to promote collaborative research in enactive artificial cognitive systems by developing the iCub : a open-systems 53...
The Application Service Hosting Platform (ASHP) has recently received tremendous attention from both industry and academia. An ASHP provides a shared highperformance infrastructur...
ion Abstracts Zizhan Zheng, Qianxiang Wang, Gang Huang and Hong Mei. Design and Implementation of the Load Balancing Mechanism in PKUAS (in Chinese). ACTA ELECTRONICA SINICA, 32(12...
Gang Huang, Tiancheng Liu, Hong Mei, Zizhan Zheng,...