925 search results - page 22 / 185 » Connectivity on Complete Lattices |
115
Voted
SCN
2008
Springer
15 years 1 months ago
2008
Springer
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
120
click to vote
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
ICIP
2008
IEEE
15 years 8 months ago
2008
IEEE
The watershed segmentation is a popular tool in image processing. Starting from an initial map, the border thinning transformation produces a map whose minima constitute the catch...
121
click to vote
CLUSTER
2000
IEEE
15 years 6 months ago
2000
IEEE
To construct a large commodity clustec a hierarchical network is generally adopted for connecting the host muchines, where a Gigabit backbone switch connects a few commodity switc...
123
Voted
CP
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...