5100 search results - page 227 / 1020 » The Linear Complexity of a Graph |
165
Voted
STOC
2000
ACM
15 years 7 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
137
click to vote
TACAS
1997
Springer
15 years 7 months ago
1997
Springer
We present a highly polymorphic tool for the construction, synthesis, structuring, manipulation, investigation, and (symbolic) execution of graphs. The exibility of this tool, whic...
124
click to vote
APVIS
2007
15 years 5 months ago
2007
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit ...
119
Voted
DNA
2009
Springer
15 years 10 months ago
2009
Springer
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
140
click to vote
ACMICEC
2003
ACM
15 years 9 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...