Sciweavers

663 search results - page 21 / 133
» A Parallel Algorithm for Enumerating Combinations
Sort
View
CP
2006
Springer
15 years 5 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter
ACL
2006
15 years 3 months ago
A Term Recognition Approach to Acronym Recognition
We present a term recognition approach to extract acronyms and their definitions from a large text collection. Parenthetical expressions appearing in a text collection are identif...
Naoaki Okazaki, Sophia Ananiadou
92
Voted
PARA
1994
Springer
15 years 5 months ago
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
José M. Badía, Antonio M. Vidal
ECSQARU
2003
Springer
15 years 7 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
ML
2000
ACM
144views Machine Learning» more  ML 2000»
15 years 1 months ago
MultiBoosting: A Technique for Combining Boosting and Wagging
MultiBoosting is an extension to the highly successful AdaBoost technique for forming decision committees. MultiBoosting can be viewed as combining AdaBoost with wagging. It is abl...
Geoffrey I. Webb