{"id":"https://openalex.org/W6888907698","doi":"https://doi.org/10.2312/vissym/vissym03/009-018","title":"Using Graphs for Fast Error Term Approximation of Time-varying Datasets","display_name":"Using Graphs for Fast Error Term Approximation of Time-varying Datasets","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W6888907698","doi":"https://doi.org/10.2312/vissym/vissym03/009-018"},"language":"en","primary_location":{"id":"doi:10.2312/vissym/vissym03/009-018","is_oa":true,"landing_page_url":"https://doi.org/10.2312/vissym/vissym03/009-018","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/vissym/vissym03/009-018","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Nuber, C.","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nuber, C.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"LaMar, E. C.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"LaMar, E. C.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Pascucci, V.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pascucci, V.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Hamann, B.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hamann, B.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Joy, K. I.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joy, K. I.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/round-off-error","display_name":"Round-off error","score":0.6057999730110168},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.5921000242233276},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5884000062942505},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5309000015258789},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5216000080108643},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5163000226020813},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.4546999931335449},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.44760000705718994}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6608999967575073},{"id":"https://openalex.org/C61005703","wikidata":"https://www.wikidata.org/wiki/Q2145211","display_name":"Round-off error","level":2,"score":0.6057999730110168},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.5921000242233276},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5884000062942505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5335000157356262},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5309000015258789},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5216000080108643},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5163000226020813},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.4546999931335449},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.44760000705718994},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.44600000977516174},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4262999892234802},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.42010000348091125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3707999885082245},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3693000078201294},{"id":"https://openalex.org/C123614077","wikidata":"https://www.wikidata.org/wiki/Q1364905","display_name":"Propagation of uncertainty","level":2,"score":0.3691999912261963},{"id":"https://openalex.org/C3018824978","wikidata":"https://www.wikidata.org/wiki/Q2894891","display_name":"Error analysis","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C139945424","wikidata":"https://www.wikidata.org/wiki/Q1940696","display_name":"Mean squared error","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.25690001249313354}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/vissym/vissym03/009-018","is_oa":true,"landing_page_url":"https://doi.org/10.2312/vissym/vissym03/009-018","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.2312/vissym/vissym03/009-018","is_oa":true,"landing_page_url":"https://doi.org/10.2312/vissym/vissym03/009-018","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,20,61,104,107,156,178,200,209,237],"method":[3],"for":[4,16,97,118],"the":[5,38,41,54,74,87,94,130,146,159,162,169,181,187,190,213,216,242],"efficient":[6],"computation":[7,69],"and":[8,110,116,137,185,203],"storage":[9],"of":[10,12,19,43,60,76,100,114,145,155,207],"approximations":[11],"error":[13,17,30,55,68,77,89,95,119,123,150,170,217,232],"tables":[14,48,78],"used":[15,50],"estimation":[18],"region":[21],"between":[22,31,40,56,161,171,180],"different":[23,57,173],"time":[24,33,45,58,67,85,101,112,135,174,195,205],"steps":[25,34,59,102,175],"in":[26,103],"time-varying":[27,62],"datasets.":[28],"The":[29,149],"two":[32,163,172,182],"is":[35,70,220,236],"defined":[36],"as":[37],"distance":[39,160],"data":[42],"these":[44],"steps.":[46],"Error":[47],"are":[49],"to":[51,227,240],"look":[52],"up":[53],"dataset,":[63],"especially":[64],"when":[65],"run":[66],"expensive.":[71,82],"However,":[72],"even":[73],"generation":[75],"itself":[79],"can":[80],"be":[81],"For":[83,193],"n":[84,194],"steps,":[86,136,196],"exact":[88,214],"look-up":[90,124],"table":[91,125],"(which":[92],"stores":[93],"values":[96],"all":[98,229],"pairs":[99],"matrix)":[105],"has":[106,199],"memory":[108,201],"complexity":[109,113,202,206,219],"pre-processing":[111,204],"O(n2),":[115],"O(1)":[117],"retrieval.":[120],"Our":[121],"approximate":[122],"approach":[126,235],"uses":[127],"trees,":[128],"where":[129],"leaf":[131,183],"nodes":[132,139,164],"represent":[133],"original":[134],"interior":[138],"contain":[140],"an":[141,153],"average":[142],"(or":[143],"best-representative)":[144],"children":[147],"nodes.":[148],"computed":[151],"on":[152,165,189],"edge":[154],"tree":[157],"describes":[158],"that":[166],"edge.":[167],"Evaluating":[168],"requires":[176],"traversing":[177],"path":[179],"nodes,":[184],"accumulating":[186],"errors":[188],"traversed":[191],"edges.":[192],"this":[197],"scheme":[198],"O(nlog(n)),":[208],"significant":[210],"improvement":[211],"over":[212],"scheme;":[215],"retrieval":[218],"O(log(n)).":[221],"As":[222],"we":[223],"do":[224],"not":[225],"need":[226],"calculate":[228],"possible":[230],"n2":[231],"terms,":[233],"our":[234],"fast":[238],"way":[239],"generate":[241],"approximation.":[243]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}