Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be r...
The advent of Grid environments made feasible the solution of computational intensive problems in a reliable and cost-effective way. As workflow systems carry out more complex and...
Human interest in pictures dates back to 14,000 BC. Pictures can be drawn by hand or imaged by optical means. Over time pictures have changed from being rare and unique to ubiquit...
Off-line rendering techniques have nowadays reached an astonishing level of realism but pay the cost of long computational times. The new generation of programmable graphic hardwa...
Marco Callieri, Paul E. Debevec, J. Pair, Roberto ...