We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
Reynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike ...
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a c...