Treffer: On-line stream merging, max span, and min coverage
Title:
On-line stream merging, max span, and min coverage
Authors:
Source:
Algorithms and complexity (Rome, 28-30 May 2003)Lecture notes in computer science. :70-82
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 16 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Généralités, General, Intelligence artificielle, Artificial intelligence, Reconnaissance des formes. Traitement numérique des images. Géométrie algorithmique, Pattern recognition. Digital image processing. Computational geometry, Reconnaissance et synthèse de la parole et du son. Linguistique, Speech and sound recognition and synthesis. Linguistics, Algorithme compétitif, Competitive algorithms, Algorithme glouton, Greedy algorithm, Algoritmo glotón, Analyse algorithme, Algorithm analysis, Análisis algoritmo, Couverture, Coverage, Cobertura, Idéal, Ideal, Largeur bande, Bandwidth, Anchura banda, Ligne courant, Stream line, Línea corriente, Méthode minimax, Minimax method, Método minimax, Performance algorithme, Algorithm performance, Resultado algoritmo, Reconnaissance forme, Pattern recognition, Reconocimiento patrón, Traitement image, Image processing, Procesamiento imagen, Traitement parole, Speech processing, Tratamiento palabra
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computing, Hong Kong Polytechnic University, Hong-Kong
Department of Computer Science, University of Hong Kong, Hong-Kong
Department of Computer Science, University of Hong Kong, Hong-Kong
ISSN:
0302-9743
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15692252
Database:
PASCAL Archive
Weitere Informationen
This paper introduces the notions of span and coverage for analyzing the performance of on-line algorithms for stream merging. We show that these two notions can solely determine the competitive ratio of any such algorithm. Furthermore, we devise a simple greedy algorithm that can attain the ideal span and coverage, thus giving a better performance guarantee than existing algorithms with respect to either the maximum bandwidth or the total bandwidth. The new notions also allow us to obtain a tighter analysis of existing algorithms.