On the complexity of rate-distortion optimal streaming of packetized media

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:ae2e05614b1c4b3142ba2a5dc11a950d

RÖDER, Martin, Jean CARDINAL, Raouf HAMZAOUI, 2004. On the complexity of rate-distortion optimal streaming of packetized media. Data Compression Conference, 2004. DCC 2004. Snowbird, UT, USA. In: Data Compression Conference, 2004. Proceedings. DCC 2004. Data Compression Conference, 2004. DCC 2004. Snowbird, UT, USA. IEEE, pp. 192-201. ISBN 0-7695-2082-0. Available under: doi: 10.1109/DCC.2004.1281464

@inproceedings{Roder2004compl-23033, title={On the complexity of rate-distortion optimal streaming of packetized media}, year={2004}, doi={10.1109/DCC.2004.1281464}, isbn={0-7695-2082-0}, publisher={IEEE}, booktitle={Data Compression Conference, 2004. Proceedings. DCC 2004}, pages={192--201}, author={Röder, Martin and Cardinal, Jean and Hamzaoui, Raouf} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/23033"> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-05-27T09:03:14Z</dc:date> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dc:creator>Hamzaoui, Raouf</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:rights>deposit-license</dc:rights> <dc:creator>Cardinal, Jean</dc:creator> <dc:language>eng</dc:language> <dcterms:issued>2004</dcterms:issued> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23033/2/roeder_230338.pdf"/> <dcterms:bibliographicCitation>Proceedings - DCC 2004, Data Compression Conference : March 23 - 25, 2004, Snowbird, Utah / ed. by James A. Storer ... - Los Alamitos, Calif. [u.a.] : IEEE Computer Society, 2004. - S. 192-201. - ISBN 0-7695-2082-0</dcterms:bibliographicCitation> <dc:contributor>Cardinal, Jean</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>On the complexity of rate-distortion optimal streaming of packetized media</dcterms:title> <dc:contributor>Röder, Martin</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-05-27T09:03:14Z</dcterms:available> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23033"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23033/2/roeder_230338.pdf"/> <dc:creator>Röder, Martin</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:abstract xml:lang="eng">We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For a single data unit, we prove that the problem is NP-hard and provide efficient branch and bound algorithms that are in practice much faster than the best known solution. For a group of interdependent data units, we show how to compute optimal solutions with branch and bound algorithms. The branch and bound algorithms for a group of data units are slower than the current state of the art, the heuristic sensitivity adaptation algorithm, but provide a significantly better rate-distortion performance in many real-world situations.</dcterms:abstract> <dc:contributor>Hamzaoui, Raouf</dc:contributor> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

roeder_230338.pdf 40

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto