2312 search results - page 207 / 463 » The complexity of estimating min-entropy |
214
click to vote
JMLR
2012
13 years 9 months ago
2012
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
178
click to vote
CASES
2003
ACM
15 years 12 months ago
2003
ACM
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
177
click to vote
IPSN
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a distributed algorithm for environmental monitoring of a scalar field (such as temperature, intensity of light, atmospheric pressure, etc.) using a random se...
164
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
153
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...