Contacto
Cómo comprar
Entrega
Guía de compras
Using Additional Information in Streaming Algorithms
Inglés
97 b
Política de devolución de 30 días
Clientes que también han comprado
/
Tapa blanda
15.39
€
Streaming problems are algorithmic problems that are mainly characterized by their massive input streams. Because of these data streams, the algorithms for these problems are forced to be space-efficient, as the input stream length generally exceeds the available storage. The goal of this study is to analyze the impact of additional information (more specifically, a hypothesis of the solution) on the algorithmic space complexities of several streaming problems. To this end, different streaming problems are analyzed and compared. The two problems "most frequent item" and "number of distinct items", with many configurations of different result accuracies and probabilities, are deeply studied. Both lower and upper bounds for the space and time complexity for deterministic and probabilistic environments are analyzed with respect to possible improvements due to additional information. The general solution search problem is compared to the decision problem where a solution hypothesis has to be satisfied.
Sobre el libro
Inglés
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa blanda
33.69
€
/
Tapa blanda
12.79
€
/
Tapa blanda
16.39
€
/
Tapa dura
60.39
€
/
Tapa dura
45.59
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?