This paper describes an online handwritten Japanese character string recognition system based on conditional random fields, which integrates the information of character recogniti...
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
—In this paper, we propose new “low-overhead” network monitoring techniques to detect violations of path-level QoS guarantees like end-to-end delay, loss, etc. Unlike existin...
K. V. M. Naidu, Debmalya Panigrahi, Rajeev Rastogi
Processors that can simultaneously execute multiple paths of execution will only exacerbate the fetch bandwidth problem already plaguing conventional processors. On a multiple-pat...
Control-flow misprediction penalties are a major impediment to high performance in wide-issue superscalar processors. In this paper we present Selective Eager Execution (SEE), an ...