Sciweavers

791 search results - page 132 / 159
» Approximating the Maximum Sharing Problem
Sort
View
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
13 years 12 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
3DIM
1997
IEEE
13 years 12 months ago
Multi-Resolution Geometric Fusion
Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit ...
Adrian Hilton, John Illingworth
AAAI
2008
13 years 10 months ago
A General Framework for Generating Multivariate Explanations in Bayesian Networks
Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target...
Changhe Yuan, Tsai-Ching Lu
ECRTS
2008
IEEE
13 years 9 months ago
Dynamic Reconfiguration for Adaptive Multiversion Real-Time Systems
Modern real-time systems must be designed to be highly adaptable, reacting to aperiodic events in a predictable manner and exhibiting graceful degradation in overload scenarios wh...
George Lima, Eduardo Camponogara, Ana Carolina Sok...
COLING
2008
13 years 9 months ago
Authorship Attribution and Verification with Many Authors and Limited Data
Most studies in statistical or machine learning based authorship attribution focus on two or a few authors. This leads to an overestimation of the importance of the features extra...
Kim Luyckx, Walter Daelemans