925 search results - page 18 / 185 » Connectivity on Complete Lattices |
104
click to vote
SIBGRAPI
1999
IEEE
15 years 4 months ago
1999
IEEE
Abstract. Mathematical morphology has become a widely used technique for image processing and computer vision. Initially designed as a set theory, it was generalized to the set of ...
77
Voted
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—In this paper, we study the problem of constructing full-coverage three dimensional networks with multiple connectivity. We design a set of patterns for full coverage and two re...
FOIS
2001
15 years 1 months ago
2001
-- Representation theorems for systems of regions have been of interest for some time, and various contexts have been used for this purpose: Mormann [17] has demonstrated the fruit...
101
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
JOC
2006
14 years 11 months ago
2006
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...