We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
David Bremner, Timothy M. Chan, Erik D. Demaine, J...
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
This paper proposes an integrated approach to arrive at optimal build orientations, simultaneously minimizing surface roughness ‘Ra’ and build time ‘T’, for object manufac...
Particle systems have long been recognized as an essential building block for detail-rich and lively visual environments. Current implementations can handle up to 10,000 particles...
— When a database system is extended with the skyline operator, it is important to determine the most efficient way to execute a skyline query across tables with join operations...
Wen Jin, Michael D. Morse, Jignesh M. Patel, Marti...