A randomizing algorithm for the weighted Euclidean 1-center problem is pre-xnted. The algorithm is shown to run on any problem in O (n log P I) time with high probability.

The center vortex model, capable of explaining confinement and chiral symmetry breaking, has been plagued by the lattice equivalent Gribov copies: different maxima gauge functional lead to predictions string tension. It is possible resolve this problem using regions, loops evaluating elements, as guide for fixing procedure. success approach was already shown, but algorithms came with an arbitra...

The clustering problem of big data in the era artificial intelligence has been widely studied. Because huge amount data, distributed algorithms are often used to deal with problems. computing model an attractive feature: it can handle massive datasets that cannot be put into main memory. On other hand, since many decisions made automatically by machines today's society, algorithm fairness is al...

We consider the center-focus problem for analytic families of planar vector fields having a monodromic singularity with characteristic directions. give method to compute center conditions family provided there is an inverse integrating factor whose expression in polar coordinates has exceptional divisor first blow-up as isolated zero-set. Some non-trivial examples are analyzed.