1612 search results - page 87 / 323 » Analysing Randomized Distributed Algorithms |
135
click to vote
COLT
1991
Springer
15 years 5 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}....
ICDCS
2007
IEEE
15 years 8 months ago
2007
IEEE
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
125
click to vote
TSP
2010
14 years 9 months ago
2010
Except in the case of normal (i.e Gaussian) distribution, it is very difficult to calculate the marginal probability distribution of ARMA signals. By using a particular form of mo...
122
click to vote
ICML
2002
IEEE
16 years 3 months ago
2002
IEEE
We study generalization properties of linear learning algorithms and develop a data dependent approach that is used to derive generalization bounds that depend on the margin distr...
114
Voted
ISSTA
2006
ACM
15 years 8 months ago
2006
ACM
Testing with random inputs can give surprisingly good results if the distribution of inputs is spread out evenly over the input domain; this is the intuition behind Adaptive Rando...