{"id":"https://openalex.org/W2099340762","doi":"https://doi.org/10.1109/time.2004.1314426","title":"Max-count aggregation estimation for moving points","display_name":"Max-count aggregation estimation for moving points","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2099340762","doi":"https://doi.org/10.1109/time.2004.1314426","mag":"2099340762"},"language":"en","primary_location":{"id":"doi:10.1109/time.2004.1314426","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2004.1314426","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100419295","display_name":"Yi Chen","orcid":"https://orcid.org/0000-0003-4099-2684"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yi Chen","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082669031","display_name":"P\u00e9ter R\u00e9v\u00e9sz","orcid":"https://orcid.org/0000-0002-1145-1283"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Revesz","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100419295"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":1.4021,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.81727969,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"103","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7418351173400879},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6630014777183533},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.6124049425125122},{"id":"https://openalex.org/keywords/real-line","display_name":"Real line","score":0.5676264762878418},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5577403903007507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4970147907733917},{"id":"https://openalex.org/keywords/estimation","display_name":"Estimation","score":0.4880472421646118},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4520546793937683},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4223478138446808},{"id":"https://openalex.org/keywords/data-point","display_name":"Data point","score":0.41844695806503296},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.32162728905677795},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2760045528411865},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12623462080955505}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7418351173400879},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6630014777183533},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.6124049425125122},{"id":"https://openalex.org/C75432250","wikidata":"https://www.wikidata.org/wiki/Q29654355","display_name":"Real line","level":2,"score":0.5676264762878418},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5577403903007507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4970147907733917},{"id":"https://openalex.org/C96250715","wikidata":"https://www.wikidata.org/wiki/Q965330","display_name":"Estimation","level":2,"score":0.4880472421646118},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4520546793937683},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4223478138446808},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.41844695806503296},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.32162728905677795},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2760045528411865},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12623462080955505},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/time.2004.1314426","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2004.1314426","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2091638028","https://openalex.org/W2101694635","https://openalex.org/W2123575007","https://openalex.org/W2131634374"],"related_works":["https://openalex.org/W4255213289","https://openalex.org/W163007141","https://openalex.org/W4291756354","https://openalex.org/W2963780169","https://openalex.org/W2301982874","https://openalex.org/W3105522989","https://openalex.org/W4320086039","https://openalex.org/W3107028987","https://openalex.org/W2969322178","https://openalex.org/W2099340762"],"abstract_inverted_index":{"Many":[0],"interesting":[1],"problems":[2],"regarding":[3],"moving":[4,18],"objects":[5],"can":[6,65,114],"be":[7,46,115],"reduced":[8],"to":[9,94,133],"the":[10,32,37,67,86,90,103],"following":[11],"question:":[12],"Given":[13],"a":[14,21,53,79,120],"set":[15],"S":[16,43,77,118],"of":[17,40,89,102,123],"points":[19,27,41,124],"on":[20,31],"line":[22],"and":[23,29,50,72,74,98,125,127],"two":[24],"other":[25,100],"movings":[26],"A":[28,49,71,126],"B":[30,51,73,128],"same":[33],"line,":[34],"what":[35],"is":[36,92],"maximum":[38],"number":[39,122],"in":[42,78],"that":[44,64,85,110],"will":[45],"simultaneously":[47],"between":[48],"within":[52],"time":[54],"interval":[55],"(t/sub":[56],"1/,":[57],"t/sub":[58],"2/)?":[59],"We":[60,83],"propose":[61],"an":[62],"algorithm":[63],"estimate":[66],"answer":[68],"for":[69],"arbitrary":[70],"any":[75],"fixed":[76],"chosen":[80,96],"constant":[81,97],"time.":[82],"show":[84,109],"error":[87],"rate":[88],"estimation":[91,113],"related":[93],"this":[95],"some":[99],"parameters":[101],"input":[104],"data.":[105],"Our":[106],"experimental":[107],"results":[108],"high":[111],"accuracy":[112],"achieved":[116],"when":[117],"has":[119],"large":[121],"are":[129],"not":[130],"too":[131],"close":[132],"each":[134],"other.":[135]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}