1740 search results - page 124 / 348 » Minimal structures for stories |
153
Voted
CRYPTO
2005
Springer
15 years 9 months ago
2005
Springer
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
126
Voted
DAS
2006
Springer
15 years 7 months ago
2006
Springer
Engineering diagnosis often involves analyzing complex records of system states printed to large, textual log files. Typically the logs are designed to accommodate the widest debug...
131
Voted
VL
1995
IEEE
15 years 7 months ago
1995
IEEE
Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. ...
129
click to vote
CHARME
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Automatic formal verification techniques generally require exponential resources with respect to the number of primary inputs of a netlist. In this paper, we present sev...
169
Voted
ETVC
2008
15 years 5 months ago
2008
In a seminal paper, Amari (1998) proved that learning can be made more efficient when one uses the intrinsic Riemannian structure of the algorithms' spaces of parameters to po...