234 search results - page 35 / 47 » On the relative complexity of approximate counting problems |
TMI
2002
13 years 7 months ago
2002
Abstract--We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths and degrees . We apply our r...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. We present a method for learning feature descriptors using multiple images, motivated by the problems of mobile robot navigation and localization. The technique uses the ...
ICSM
2003
IEEE
14 years 23 days ago
2003
IEEE
In object oriented programming, the functionalities of a system result from the interactions (message exchanges) among the objects allocated by the system. While designing object ...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...