We consider the problem of non-preemptive scheduling to minimize average (weighted) completion time, allowing for release dates, parallel machines, and precedence constraints. Recent work has led toâ€¦ (More)

Code scheduling to exploit instruction level parallelism (ILP) is a critical problem in compiler optimization research in light of the increased use of long-instruction-word machines. Unfortunatelyâ€¦ (More)

VLIW scheduling, profile driven scheduling, superblocks, hyperblocks Code scheduling to exploit instruction level parallelism (lLP) is a central problem in compiler optimization research, in light ofâ€¦ (More)

robust, watermarking, invisible This paper addresses the problem of watermarking a digital image, in order to detect or verify ownership. An invisible and resilient watermark is one that is notâ€¦ (More)

learning theory, noise, non-linear filters An Occam approximation is an algorithm that takes as input a set of samples of a function and a tolerance e, and produces as output a compact representationâ€¦ (More)

Software pipelining is a technique that reforms the loop to improve execution time. Iterations are executed in overlapped fashion to increase parallelism. Modulo scheduling places each operation soâ€¦ (More)

This paper concerns algorithms that "learn functions from examples. Functions on strings of a finite alphabet are considered and the notion of dimensionality defined for families of such functions.â€¦ (More)

VLIW scheduling, register allocation This paper concerns the problem of spill-free scheduling of acyclic precedence graphs on a processor with multiple functional units and a limited number ofâ€¦ (More)