207
Voted
CSL
15 years 7 months ago
2006 Springer 
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
229
click to vote
CSL
15 years 7 months ago
2006 Springer 
Support vector machines (SVMs) have proven to be a powerful technique for pattern classification. SVMs map inputs into a high dimensional space and then separate classes with a hy...
195
Voted
CSL
15 years 11 months ago
2006 Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
182
click to vote
CSL
15 years 7 months ago
2006 Springer
In this contribution, the Bayesian framework for interpretation of evidence when applied to forensic speaker recognition is introduced. Different aspects of the use of voice as ev...
|
Automated Reasoning