1999 search results - page 140 / 400 » Finding Reductions Automatically |
NAACL
2004
14 years 11 months ago
2004
We examine the utility of multiple types of turn-level and contextual linguistic features for automatically predicting student emotions in human-human spoken tutoring dialogues. W...
CCS
2008
ACM
15 years 2 days ago
2008
ACM
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
159
click to vote
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
The Non-negative Matrix Factorization technique (NMF) has been recently proposed for dimensionality reduction. NMF is capable to produce a region- or partbased representation of o...
ICML
2006
IEEE
15 years 11 months ago
2006
IEEE
We derive a robust Euclidean embedding procedure based on semidefinite programming that may be used in place of the popular classical multidimensional scaling (cMDS) algorithm. We...