Sciweavers

317 search results - page 11 / 64
» Computing and Updating the Process Number in Trees
Sort
View
ACL
2008
13 years 11 months ago
Efficient Processing of Underspecified Discourse Representations
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...
Michaela Regneri, Markus Egg, Alexander Koller
ISVC
2009
Springer
14 years 4 months ago
GPU-Based Ray Casting of Multiple Multi-resolution Volume Datasets
We developed a GPU-based volume ray casting system for rendering multiple arbitrarily overlapping multi-resolution volume data sets. Our efficient volume virtualization scheme is b...
Christopher Lux, Bernd Fröhlich
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 10 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
ICPR
2008
IEEE
14 years 4 months ago
Tree-serial dynamic programming for image processing
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...
Andrey Kopylov
JMLR
2002
102views more  JMLR 2002»
13 years 9 months ago
Efficient Algorithms for Decision Tree Cross-validation
Cross-validation is a useful and generally applicable technique often employed in machine learning, including decision tree induction. An important disadvantage of straightforward...
Hendrik Blockeel, Jan Struyf