Abstract— Neural processing of large-scale data sets containing both many input / output variables and a large number of training examples often leads to very large networks. Onc...
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Robust real-time tracking of non-rigid objects in a dynamic environment is a challenging task. Among various cues in tracking, color can provide an efficient visual cue for this t...
To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas a reactive learner predicts ba...