We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Abstract. We propose an independence criterion based on the eigenspectrum of covariance operators in reproducing kernel Hilbert spaces (RKHSs), consisting of an empirical estimate ...
Arthur Gretton, Olivier Bousquet, Alex J. Smola, B...
For over a century, citizen scientists have volunteered to collect huge quantities of data for professional scientists to analyze. We designed Pathfinder, an online environment th...
Kurt Luther, Scott Counts, Kristin B. Stecher, Aar...
—Distributed systems, especially time-triggered ones, are implementing clock synchronization algorithms to provide and maintain a common view of time among the different nodes. S...
—We investigate an architecture for multi-Gigabit outdoor mesh networks operating in the unlicensed 60 GHz “millimeter (mm) wave” band. In this band, the use of narrow beams ...