2520 search results - page 163 / 504 » The complexity of approximating entropy |
108
Voted
TAMC
2009
Springer
15 years 3 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
97
Voted
STOC
1993
ACM
15 years 3 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
81
Voted
WOTUG
2007
15 years 2 days ago
2007
Abstract. A fine-grained massively-parallel process-oriented model of platelets (potentially artificial) within a blood vessel is presented. This is a CSP inspired design, expres...
88
Voted
ICISC
2008
2008
A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Round Serpent
15 years 10 days ago
Abstract. In this paper, we present a new technique for Matsui's algorithm 2 using multidimensional linear approximation. We show that the data complexity of the attack can be...
183
click to vote
ICDT
2009
ACM
15 years 11 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...