We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
Periodic smoothing splines appear for example as generators of closed, planar curves, and in this paper they are constructed using a controlled two point boundary value problem in...
Hiroyuki Kano, Magnus Egerstedt, Hiroyuki Fujioka,...
In this paper, we study the property of generic uniform observability for structured bilinear systems. More precisely, to check whether or not a structured bilinear system generic...
There is an amazing paucity of data that is collected directly on users' personal computers. One key reason for this is the perception among researchers that users are unwill...