Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...
Thread counting algorithms seek to determine from x-ray images the vertical and horizontal thread counts (frequencies) of the canvas weave comprising a painting’s support. Our s...
Don H. Johnson, Lucia Sun, C. Richard Johnson Jr.,...
While the emerging field of privacy preserving data mining (PPDM) will enable many new data mining applications, it suffers from several practical difficulties. PPDM algorithms are...
Jimmy Secretan, Anna Koufakou, Michael Georgiopoul...
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...