2638 search results - page 342 / 528 » Random Geometric Complexes |
181
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
155
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
166
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
151
click to vote
LCN
1997
IEEE
15 years 10 months ago
1997
IEEE
W e investigate packet discarding schemes for TCP over ATM with UBR service. In doing so, we tested the eflective throughput of two existing schemes, Partial Pnwlcet Discard(PPD) ...
181
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...