Sciweavers

77 search results - page 8 / 16
» A note on single-linkage equivalence
Sort
View
CORR
2010
Springer
74views Education» more  CORR 2010»
14 years 9 months ago
Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids
We study matroidal networks introduced by Dougherty et al., who showed that if a network is scalar-linearly solvable over some finite field, then the network is a matroidal network...
Anthony Kim, Muriel Médard
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
14 years 29 days ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
15 years 1 months ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....
ISTCS
1993
Springer
15 years 1 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag
KRDB
1998
83views Database» more  KRDB 1998»
14 years 10 months ago
Semantic Query Optimisation and Rule Graphs
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...
Jerome Robinson, Barry G. T. Lowden