2520 search results - page 500 / 504 » The complexity of approximating entropy |
KAIS
2011
13 years 4 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
SIAMCOMP
2011
13 years 4 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
TCS
2011
13 years 4 months ago
2011
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
WWW
2011
ACM
13 years 4 months ago
2011
ACM
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
WWW
2011
ACM
13 years 4 months ago
2011
ACM
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...