720 search results - page 34 / 144 » Linear k-arboricities on trees |
KR
1998
Springer
14 years 26 days ago
1998
Springer
We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globallycomplete probabilistic deduction with conditional constraints ...
CAD
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
DGCI
2009
Springer
13 years 12 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
CATS
2007
13 years 10 months ago
2007
Financial derivatives are contracts concerning rights and obligations to engage in future transactions on some underlying financial instrument. A major concern in financial mark...
PAA
2002
13 years 8 months ago
2002
: Recently bagging, boosting and the random subspace method have become popular combining techniques for improving weak classifiers. These techniques are designed for, and usually ...