Sciweavers

2155 search results - page 388 / 431
» Computational Linguistics
Sort
View
CORR
2007
Springer
105views Education» more  CORR 2007»
14 years 9 months ago
Empirical Evaluation of Four Tensor Decomposition Algorithms
Higher-order tensor decompositions are analogous to the familiar Singular Value Decomposition (SVD), but they transcend the limitations of matrices (second-order tensors). SVD is ...
Peter D. Turney

Book
640views
16 years 8 months ago
Introduction to Pattern Recognition
"Pattern recognition techniques are concerned with the theory and algorithms of putting abstract objects, e.g., measurements made on physical objects, into categories. Typical...
Sargur Srihari
ILP
1998
Springer
15 years 1 months ago
Learning Structurally Indeterminate Clauses
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
Jean-Daniel Zucker, Jean-Gabriel Ganascia
COLING
1990
14 years 11 months ago
Solving Ambiguities In The Semantic Representation Of Texts
One of the issues of Artificial Intelligence is the transfer of the knowledge conveyed by Natural Language into formalisms that a computer can interpret. In the Natural Language P...
Marie-Claude Landau
CI
2004
115views more  CI 2004»
14 years 9 months ago
A Conversational Approach to the Interaction With Web Services
The emerging standards for the specification of Web Services support the publication of the static interfaces of the operations they may execute. However, little attention is paid...
Liliana Ardissono, Giovanna Petrone, Marino Segnan