210 search results - page 6 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
SODA
2012
ACM
11 years 11 months ago
2012
ACM
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...
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
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...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
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...
EDBT
2009
ACM
13 years 12 months ago
2009
ACM
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 ...
DCFS
2011
12 years 8 months ago
2011
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...