Sciweavers

613 search results - page 91 / 123
» Classification of Individuals with Complex Structure
Sort
View
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
14 years 11 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens
DSP
2008
14 years 9 months ago
Extension of higher-order HMC modeling with application to image segmentation
In this work, we propose to improve the neighboring relationship ability of the Hidden Markov Chain (HMC) model, by extending the memory lengthes of both the Markov chain process ...
Lamia Benyoussef, Cyril Carincotte, Stéphan...
SIAMAM
2008
94views more  SIAMAM 2008»
14 years 9 months ago
Self-Similar Solutions for the Triple Point Paradox in Gasdynamics
Abstract. We present numerical solutions of a two-dimensional Riemann problem for the compressible Euler equations that describes the Mach reflection of weak shock waves. High reso...
Allen M. Tesdall, Richard Sanders, Barbara L. Keyf...
IJPRAI
2002
93views more  IJPRAI 2002»
14 years 9 months ago
Improving Stability of Decision Trees
Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. B...
Mark Last, Oded Maimon, Einat Minkov
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 6 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...