Our branch predictor proposed for the Championship Branch Prediction (CBP) contest is a hybrid/mutation of many different ideas previously proposed in the literature, combined with a few new techniques. The mix of traces requires the predictor to handle both capacity (large tables) and deep correlation extraction (long branch histories), both made difficult by the relatively small hardware budg...

Let C1, ..., Cd+1 be d+ 1 point sets in R, each containing the origin in its convex hull. A subset C of ⋃d+1i=1 Ciis called a colorful choice (or rainbow) for C1, . . . ,Cd+1, if it contains exactly one point from each set Ci. Thecolorful Carathéodory theorem states that there always exists a colorful choice for C1, . . . , Cd+1 that has theorigin in its convex hull. Thi...

Given a grayscale photograph as input, this paper attacks the problem of hallucinating a plausible color version of the photograph. This problem is clearly underconstrained, so previous approaches have either relied on significant user interaction or resulted in desaturated colorizations. We propose a fully automatic approach that produces vibrant and realistic colorizations. We embrace the und...

How the displays of bowerbirds have evolved has attracted widespread interest. Endler et al. (2005) analyzed color use in display in a subset of bowerbird species and generalized their results to all bowerbirds. Here we discuss problems with their analysis that calls into question their conclusions. For example, they state that bowerbirds do not use decorations that match their background, but ...

Fragmentation trees are a technique for identifying molecular formulas and deriving some chemical properties of metabolites small organic molecules solely from mass spectral data. Computing these trees involves nding exact solutions to the NP-hard Maximum Colorful Subtree problem. Existing solvers struggle to solve the large instances involved fast enough to keep up with instrument throughput, ...

A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that a colored graph lacks colorful cycles iff it is Gallai, i.e., lacks colorful triangles. We then show that, under the operation m◦n ≡ m+n−2, the omitted lengths of colorful cycles in a colored graph form a monoid isomorp...