Resultados de la búsqueda para ASR- Complete: NP- Completeness, AI- Complete, Computational...
Imagen del vendedor
ASR- Complete
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131347859
ISBN 13: 9786131347856
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -High Quality Content by WIKIPEDIA articles! ASR-complete is, by analogy to NP-completeness in complexity theory, a term to indicate that the difficulty of a computational problem is equivalent to solving the central Automatic Speech Recognition problem, i.e. recognize and understanding spoken language. Note that unlike NP-completeness, this term is typically used more informally.These problems are easy for humans to do (in fact, they are described directly in terms of imitating humans). Some systems can solve very simple restricted versions of these problems, but none can solve them in their full generality. 108 pp. Englisch. Nº de ref. del artículo: 9786131347856
Comprar nuevo
EUR 39,00
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
ASR- Complete : NP- Completeness, AI- Complete, Computational Complexity Theory
Impresión bajo demandaLibrería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! ASR-complete is, by analogy to NP-completeness in complexity theory, a term to indicate that the difficulty of a computational problem is equivalent to solving the central Automatic Speech Recognition problem, i.e. recognize and understanding spoken language. Note that unlike NP-completeness, this term is typically used more informally.These problems are easy for humans to do (in fact, they are described directly in terms of imitating humans). Some systems can solve very simple restricted versions of these problems, but none can solve them in their full generality. Nº de ref. del artículo: 9786131347856
Comprar nuevo
EUR 40,58
Envío por EUR 60,90
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
ASR- Complete | NP- Completeness, AI- Complete, Computational Complexity Theory
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. ASR- Complete | NP- Completeness, AI- Complete, Computational Complexity Theory | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131347856 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 113297004
Comprar nuevo
EUR 125,30
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen del vendedor
ASR- Complete
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131347859
ISBN 13: 9786131347856
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. ASR-complete isby analogy to NP-completeness in complexity theory, a term to indicatethat the difficulty of a computational problem is equivalent to solvingthe central Automatic Speech Recognition problem, i.e. recognize andunderstanding spoken language. Note that unlike NP-completeness, thisterm is typically used more informally.These problems are easy forhumans to do (in fact, they are described directly in terms of imitatinghumans). Some systems can solve very simple restricted versions of theseproblems, but none can solve them in their full generality.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 108 pp. Englisch. Nº de ref. del artículo: 9786131347856
Comprar nuevo
EUR 156,00
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles