Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile a...
Emmanuel Agullo, Henricus Bouwmeester, Jack Dongar...
Abstract. In this paper, we study the security of 2Rschemes [17,18], which are the "minus variant" of two-round schemes. This variant consists in removing some of the n p...
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...