33 search results - page 2 / 7 » Set Covering with our Eyes Closed |
ICDE
2000
IEEE
14 years 6 months ago
2000
IEEE
In this paper, we introduce dynamic histograms, which are constructed and maintained incrementally. We develop several dynamic histogram construction algorithms and show that they...
TPHOL
2003
IEEE
13 years 10 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
AGI
2011
12 years 8 months ago
2011
Abstract. Humans have the remarkable ability to generalize from binocular to monocular figure-ground segmentation of complex scenes. This is clearly evident anytime we look at a p...
BSL
2011
13 years 6 days ago
2011
show that an abstract analysis of one of these three set theoretic principles can sometimes lead us to results that do not require additional axioms at all but which could have bee...
TASE
2010
IEEE
12 years 12 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...