About: On Root Classification in Kinetic Data Structures     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)

AttributesValues
rdf:type
Description
  • In this paper we discuss the mathematical properties of kinetic events computation for kinetic data structures with polynomial-type certi?cate functions. We show that it is neither theoretically possible nor numerically safe to ignore the multiplicities of roots of these equations. The multiplicities of the roots are sometimes ignored in order to speed up the process of estimating their location, however, they must be taken into account during the management of the kinetic data structures. Some of the roots obtained by the computations of these equations do not necessarily carry the expected information (i.e., the times of future kinetic events) and they may be therefore avoided entirely during the computation. This text shows how to distinguish these roots before their exact location is computed and thus to avoid their computation.
  • In this paper we discuss the mathematical properties of kinetic events computation for kinetic data structures with polynomial-type certi?cate functions. We show that it is neither theoretically possible nor numerically safe to ignore the multiplicities of roots of these equations. The multiplicities of the roots are sometimes ignored in order to speed up the process of estimating their location, however, they must be taken into account during the management of the kinetic data structures. Some of the roots obtained by the computations of these equations do not necessarily carry the expected information (i.e., the times of future kinetic events) and they may be therefore avoided entirely during the computation. This text shows how to distinguish these roots before their exact location is computed and thus to avoid their computation. (en)
Title
  • On Root Classification in Kinetic Data Structures
  • On Root Classification in Kinetic Data Structures (en)
skos:prefLabel
  • On Root Classification in Kinetic Data Structures
  • On Root Classification in Kinetic Data Structures (en)
skos:notation
  • RIV/49777513:23520/11:43897723!RIV12-MSM-23520___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 218122
http://linked.open...ai/riv/idVysledku
  • RIV/49777513:23520/11:43897723
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • computational geometry, polynomials, data structures (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [07489DFB61BC]
http://linked.open...v/mistoKonaniAkce
  • Lisbon, Portugal
http://linked.open...i/riv/mistoVydani
  • Lisabon
http://linked.open...i/riv/nazevZdroje
  • ADVCOMP 2011
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Kolingerová, Ivana
  • Vomáčka, Tomáš
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • IARIA
https://schema.org/isbn
  • 978-1-61208-172-4
http://localhost/t...ganizacniJednotka
  • 23520
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software