Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
Background: Paralog reduction, the loss of duplicate genes after whole genome duplication (WGD) is a pervasive process. Whether this loss proceeds gene by gene or through deletion...
Cache hierarchies in future many-core processors are expected to grow in size and contribute a large fraction of overall processor power and performance. In this paper, we postula...
Niti Madan, Li Zhao, Naveen Muralimanohar, Anirudd...
Multicast-based inference has been proposed as a method of estimating average loss rates of internal network links, using end-to-end loss measurements of probes sent over a multic...
In this paper we discuss the important practical problem of customer wallet estimation, i.e., estimation of potential spending by customers (rather than their expected spending). ...
Claudia Perlich, Saharon Rosset, Richard D. Lawren...