Sciweavers

5699 search results - page 13 / 1140
» Alternating model trees
Sort
View
ECSQARU
2003
Springer
15 years 3 months ago
Computational-Workload Based Binarization and Partition of Qualitative Markov Trees for Belief Combination
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
Weiru Liu, Xin Hong, Kenneth Adamson
WSCG
2000
107views more  WSCG 2000»
15 years 23 hour ago
Faster ASV Decomposition for Orthogonal Polyhedra, Using the Extreme Vertices Model (EVM)
The alternating sum of volumes (ASV) decomposition is a widely used technique for converting a b-rep into a CSG model, with all its implicit uses and advantages -like form feature...
Antonio Aguilera, Dolors Ayala
FSS
2008
69views more  FSS 2008»
14 years 10 months ago
A methodology for automated fuzzy model generation
In this paper we propose a generic methodology for the automated generation of fuzzy models. The methodology is realized in three stages. Initially, a crisp model is created and i...
Markos G. Tsipouras, Themis P. Exarchos, Dimitrios...
IADIS
2003
15 years 2 days ago
Generating Guided Tours over Indexed Information Resources
This article proposes an approach to the generation of guided tours over indexed information resources on user demand. It represents an alternative to more sophisticated hyperdocu...
Benjamin Buffereau, Pierre Duchet, Philippe Picoue...
COLING
2010
14 years 5 months ago
Joint Parsing and Translation
Tree-based translation models, which exploit the linguistic syntax of source language, usually separate decoding into two steps: parsing and translation. Although this separation ...
Yang Liu, Qun Liu