210 search results - page 40 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
PKDD
2009
Springer
14 years 11 hour ago
2009
Springer
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
MONET
2007
13 years 7 months ago
2007
— This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level conc...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
AAECC
2001
Springer
13 years 12 months ago
2001
Springer
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...