1631 search results - page 95 / 327 » Uniform Distributed Synthesis |
124
Voted
COLT
1991
Springer
15 years 4 months ago
1991
Springer
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
IJSN
2007
15 years 16 days ago
2007
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...
112
Voted
TCOM
2010
14 years 11 months ago
2010
Abstract—We analyze the performance of fiber fault monitoring of a PON using a centralized, passive optical coding (OC) system. We develop an expression for the detected monitor...
129
Voted
JACM
2012
13 years 3 months ago
2012
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
96
Voted
KDD
2006
ACM
16 years 1 months ago
2006
ACM
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...