Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
In this paper, we develop a spatially-variant (SV) mathematical morphology theory for gray-level signals and images in the euclidean space. The proposed theory preserves the geomet...
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
This paper presents an efficient technique for linking edge points in order to generate a closed-contour representation. It is based on the consecutive use of global and local sch...
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...