In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
IT service providers are increasingly required to orientate their service portfolio towards the IT support of their consumer’s business processes. This enables diversification a...
Jurisdictions across the globe are implementing CO2 emissions reduction policies. These policies typically ignore most locational issues, probably because the consequences of gree...
Abstract— Developing a full-fledged cost-based XQuery optimizer is a fairly complex task. Nowadays, there is little knowledge concerning suitable cost formulae and optimization ...