Catálogo de publicaciones - libros
Discrete Mathematics Using a Computer
John O’Donnell Cordelia Hall Rex Page
2.
Resumen/Descripción – provisto por la editorial
No disponible.
Palabras clave – provistas por la editorial
Discrete Mathematics in Computer Science; Mathematical Logic and Formal Languages; Algorithm Analysis and Problem Complexity
Disponibilidad
| Institución detectada | Año de publicación | Navegá | Descargá | Solicitá |
|---|---|---|---|---|
| No detectada | 2006 | SpringerLink |
Información
Tipo de recurso:
libros
ISBN impreso
978-1-84628-241-6
ISBN electrónico
978-1-84628-598-1
Editor responsable
Springer Nature
País de edición
Reino Unido
Fecha de publicación
2006
Información sobre derechos de publicación
© Springer-Verlag London Limited 2006
Cobertura temática
Tabla de contenidos
Functions
John O’Donnell; Cordelia Hall; Rex Page
This paper presents a Conceptual Graph () framework to the Generation of Referring Expressions (). Employing Conceptual Graphs as the underlying formalism allows a new rigorous, semantically rich, approach to : the intended referent is indentified by a combination of facts that can be deduced in its presence but not if it would be absent. Since s allow a substantial generalisation of the GRE problem, we show how the resulting formalism can be used by a algorithm that uniquely to objects in the scene.
Part III - Set Theory | Pp. 267-309
The AVL Tree Miracle
John O’Donnell; Cordelia Hall; Rex Page
This paper presents a Conceptual Graph () framework to the Generation of Referring Expressions (). Employing Conceptual Graphs as the underlying formalism allows a new rigorous, semantically rich, approach to : the intended referent is indentified by a combination of facts that can be deduced in its presence but not if it would be absent. Since s allow a substantial generalisation of the GRE problem, we show how the resulting formalism can be used by a algorithm that uniquely to objects in the scene.
Part IV - Applications | Pp. 313-353
Discrete Mathematics in Circuit Design
John O’Donnell; Cordelia Hall; Rex Page
This paper presents a Conceptual Graph () framework to the Generation of Referring Expressions (). Employing Conceptual Graphs as the underlying formalism allows a new rigorous, semantically rich, approach to : the intended referent is indentified by a combination of facts that can be deduced in its presence but not if it would be absent. Since s allow a substantial generalisation of the GRE problem, we show how the resulting formalism can be used by a algorithm that uniquely to objects in the scene.
Part IV - Applications | Pp. 355-375