2520 search results - page 144 / 504 » The complexity of approximating entropy |
EUSFLAT
2009
14 years 8 months ago
2009
Neural Networks (NN), Type-1 Fuzzy Logic Systems (T1FLS) and Interval Type-2 Fuzzy Logic Systems (IT2FLS) are universal approximators, they can approximate any non-linear function....
STOC
2009
ACM
15 years 11 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
115
click to vote
STOC
2006
ACM
15 years 11 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
169
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
107
click to vote
PAKDD
2009
ACM
15 years 8 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...