Sciweavers

1093 search results - page 126 / 219
» Crossover in Probability Spaces
Sort
View
AI
2006
Springer
14 years 2 months ago
Exploiting Dynamic Independence in a Static Conditioning Graph
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
Kevin Grant, Michael C. Horsch
CIARP
2004
Springer
14 years 2 months ago
New Bounds and Approximations for the Error of Linear Classifiers
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
Luís G. Rueda
CIARP
2006
Springer
14 years 2 months ago
A Theoretical Comparison of Two Linear Dimensionality Reduction Techniques
Abstract. A theoretical analysis for comparing two linear dimensionality reduction (LDR) techniques, namely Fisher's discriminant (FD) and Loog-Duin (LD) dimensionality reduci...
Luis Rueda, Myriam Herrera
DLOG
2008
14 years 22 days ago
Planning of Axiom Absorption
Absorptions are generally employed in Description Logics (DL) reasoners in a uniform way regardless of the structure of an input knowledge base. In this paper we present an approac...
Jiewen Wu, Volker Haarslev
EMNLP
2007
13 years 12 months ago
Online Learning for Deterministic Dependency Parsing
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
Prashanth Mannem