About: Multi-resolution Next Location Prediction for Distributed Virtual Environments

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Multi-resolution Next Location Prediction for Distributed Virtual Environments Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Computing performance of today's graphics hardware grows fast as well as amount of rendered data. Modern graphics engines enable a possibility to use an arbitrary number of textures with arbitrary resolutions. On the other hand, high quality distributed 3D virtual environments can't exploit the computation power due to the limited network bandwidth. The problem mainly appears just in case the designers of such environments use high resolution textures. To overcome this streaming bottleneck an ef&#64257;cient prefetching scheme should be proposed. Instead of blind greedy scheduling policy we propose a scheme which exploits movement history of users to realize a look-ahead policy which enables the clients to retrieve potentially rendered data in advance. The prediction itself is established by Markov chains due to their ability to fast learning in conjunction with 2-state predictor which increases ability of the scheduling system to adapt to new habits of particular users.<br> Computing performance of today's graphics hardware grows fast as well as amount of rendered data. Modern graphics engines enable a possibility to use an arbitrary number of textures with arbitrary resolutions. On the other hand, high quality distributed 3D virtual environments can't exploit the computation power due to the limited network bandwidth. The problem mainly appears just in case the designers of such environments use high resolution textures. To overcome this streaming bottleneck an ef&#64257;cient prefetching scheme should be proposed. Instead of blind greedy scheduling policy we propose a scheme which exploits movement history of users to realize a look-ahead policy which enables the clients to retrieve potentially rendered data in advance. The prediction itself is established by Markov chains due to their ability to fast learning in conjunction with 2-state predictor which increases ability of the scheduling system to adapt to new habits of particular users.<br> (en)
Title	Multi-resolution Next Location Prediction for Distributed Virtual Environments Multi-resolution Next Location Prediction for Distributed Virtual Environments (en)
skos:prefLabel	Multi-resolution Next Location Prediction for Distributed Virtual Environments Multi-resolution Next Location Prediction for Distributed Virtual Environments (en)
skos:notation	RIV/00216305:26230/10:PU90542!RIV11-MSM-26230___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(LC06008), S, Z(MSM0021630528)
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Zemčík, Pavel Přibyl, Jaroslav
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	273192
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/10:PU90542
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	distributed virtual environment, chain code, k-state predictor, Markov chain, next location prediction,scheduling, streaming,<br> (en)
http://linked.open.../riv/klicoveSlovo	<br> chain code distributed virtual environment k-state predictor next location prediction scheduling streaming Markov chain
http://linked.open...ontrolniKodProRIV	[FDCC760093D2]
http://linked.open...v/mistoKonaniAkce	HongKong
http://linked.open...i/riv/mistoVydani	Hong Kong
http://linked.open...i/riv/nazevZdroje	Proceedings IEEE/IFIP International Conference on Embedded and Ubiquitous Computing
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Center of Computer Graphics
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Přibyl, Jaroslav Zemčík, Pavel
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2010-12-11 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Výzkum informačních technologií z hlediska bezpečnosti
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE Computer Society
https://schema.org/isbn	978-0-7695-4322-2
http://localhost/t...ganizacniJednotka	26230
is http://linked.open...avai/riv/vysledek of	Multi-resolution Next Location Prediction for Distributed Virtual Environments Multi-resolution Next Location Prediction for Distributed Virtual Environments Multi-resolution Next Location Prediction for Distributed Virtual Environments

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software