In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
This paper describes a simple method for significantly improving Tandem features used to train acoustic models for large-vocabulary speech recognition. The linear activations at ...
— In many computer vision related applications it is necessary to distinguish between the background of an image and the objects that are contained in it. This is a difficult pr...
Thiago C. Bellardi, Dizan Vasquez, Christian Laugi...
— We derive formulas for the energy J(n) that a station’s radio consumes when it transmits 1 MB of data in an IEEE 802.11 network with n stations. Calculations show that J(n) g...
In this paper, a novel packet classification scheme optimized for multi-core network processors is proposed. The algorithm, Explicit Cuttings (ExpCuts), adopts a hierarchical spac...