194 search results - page 7 / 39 » Connectivity in frame matroids |
TCC
2010
Springer
15 years 8 months ago
2010
Springer
The search of efficient constructions of ideal secret sharing schemes for families of nonthreshold access structures that may have useful applications has attracted a lot of atten...
121
click to vote
EUSFLAT
2009
14 years 9 months ago
2009
Connectivity analysis methodology is suitable to find representative symptoms of a disease. This methodology describes connections between symptoms in particular way and then choos...
102
click to vote
TIT
2008
14 years 11 months ago
2008
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
JACM
2000
14 years 11 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
ICIP
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we propose a distributed 3D dynamic mesh coding system. The system is based on Slepian and Wolf’s and Wyner and Ziv’s information-theoretic results. Our system ...