Sciweavers

52 search results - page 8 / 11
» Open Questions in The Theory of Spaces of Orderings
Sort
View
PODC
2012
ACM
11 years 10 months ago
The cost of fault tolerance in multi-party communication complexity
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...
PAMI
2008
121views more  PAMI 2008»
13 years 7 months ago
Theoretical Foundations of Spatially-Variant Mathematical Morphology Part II: Gray-Level Images
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...
Nidhal Bouaynaya, Dan Schonfeld
PODS
1995
ACM
139views Database» more  PODS 1995»
13 years 11 months ago
Normalizing Incomplete Databases
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...
Leonid Libkin
JEI
2007
144views more  JEI 2007»
13 years 7 months ago
Cost-based closed-contour representations
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...
Angel Domingo Sappa, Boris Xavier Vintimilla
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 6 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
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 ...
Paul W. Goldberg