Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
Reducing the error of quantum algorithms is often achieved by applying a primitive called amplitude amplification. Its use leads in many instances to quantum algorithms that are q...
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
Because of its excellent bit-error-rate performance, the Low-Density Parity-Check (LDPC) decoding algorithm is gaining increased attention in communication standards and literatur...
This paper investigates the agreement of relevance assessments between official TREC judgments and those generated from an interactive IR experiment. Results show that 63% of docu...