260 search results - page 29 / 52 » Range and Set Abstraction using SAT |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
ISVC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Expanding on our previously developed method for inserting synthetic objects into clinical computed tomography (CT) data, we model a set of eight clinical tumors that spa...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— This paper describes an efficient method for retrieving the 3-dimensional shape associated to novelties in the environment of an autonomous robot, which is equipped wi...
MIRAGE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We describe an algorithm for fitting a Catmull-Clark subdivision surface model to an unstructured, incomplete and noisy data set. We complete the large missing data regi...
IISWC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—Transactional Memory (TM) is emerging as a promising technology to simplify parallel programming. While several TM systems have been proposed in the research literature,...