We introduce two new bootstraps for exchangeable random graphs. One, the “empirical graphon bootstrap”, is based purely on resampling, while other, “histogram a model-based “sieve” bootstrap. show that both of them accurately approximate sampling distributions motif densities, i.e., normalized counts number times fixed subgraphs appear in network. These densities characterize distribution (infi...

A bstract The study of conformal boundary conditions for two-dimensional field theories (CFTs) has a long history, ranging from the description impurities in one-dimensional quantum chains to formulation D-branes string theory. Nevertheless, landscape boundaries is largely unknown, including rational CFTs, where local operator data completely determined. We initiate systematic bootstrap 2d CFTs...

Gentry’s “bootstrapping” technique (STOC 2009) constructs a fully homomorphic encryption (FHE) scheme from a “somewhat homomorphic” one that is powerful enough to evaluate its own decryption function. To date, it remains the only known way of obtaining unbounded FHE. Unfortunately, bootstrapping is computationally very expensive, despite the great deal of effort that has been spent on improving...

This paper refines the analysis of cotraining, defines and evaluates a new co-training algorithm that has theoretical justification, gives a theoretical justification for the Yarowsky algorithm, and shows that co-training and the Yarowsky algorithm are based on different independence assumptions.

The pixel bootstrapping method is successful to be applied to implement the dot inversion without addition complex controls in LCoS with frame buffer pixels. The relations of common voltage modulation method and bootstrapping method are analyzed. The dot inversion in frame-by-frame addressing method is explained. The dot inversion and the data voltage loss compensation are implemented by bootst...