Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Paul W. Olsen"'
Publikováno v:
Journal of Logic and Computation. 27:961-983
Publikováno v:
Encyclopedia of Database Systems ISBN: 9781489979933
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0239517f7226f310eed1ae1efbd4904
https://doi.org/10.1007/978-1-4899-7993-3_80703-1
https://doi.org/10.1007/978-1-4899-7993-3_80703-1
Publikováno v:
Encyclopedia of Database Systems ISBN: 9781489979933
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::173ac3e6d5297be0b07472a7198d47e1
https://doi.org/10.1007/978-1-4899-7993-3_80751-1
https://doi.org/10.1007/978-1-4899-7993-3_80751-1
Autor:
Jeremy Birnbaum, Jeong-Hyon Hwang, Sean R. Spillane, Alan G. Labouseur, Jayadevan Vijayan, Wook-Shin Han, Paul W. Olsen
Publikováno v:
Distributed and Parallel Databases. 33:479-514
From sensor networks to transportation infrastructure to social networks, we are awash in data. Many of these real-world networks tend to be large ("big data") and dynamic, evolving over time. Their evolution can be modeled as a series of graphs. Tra
Publikováno v:
GeoInformatica. 18:435-460
GPS-equipped mobile devices such as smart phones and in-car navigation units are collecting enormous amounts of spatial and temporal information that traces a moving object's path. The exponential increase in the amount of such trajectory data has ca
Publikováno v:
WWW (Companion Volume)
Evolving networks can be modeled as series of graphs that represent those networks at different points in time. Our G* system enables efficient storage and querying of these graph snapshots by taking advantage of their commonalities. In extending G*
Publikováno v:
ICDE
Many of today's applications can benefit from the discovery of the most central entities in real-world networks. This paper presents a new technique that efficiently finds the k most central entities in terms of closeness centrality. Instead of compu
Autor:
Yuchao Ma, Paul W. Olsen, S. S. Ravi, Jayadevan Vijayan, Kyuseo Park, Jeremy Birnbaum, Jeong-Hyon Hwang, Jonathan Muckell, Catherine T. Lawson
Publikováno v:
SIGSPATIAL/GIS
Trajectory compression algorithms enable efficient transmission, storage, and processing of trajectory data by eliminating redundant information. While a large number of compression algorithms have been developed, there is no comprehensive and conven
Publikováno v:
COM.Geo
Trajectory compression algorithms eliminate redundant information in the history of a moving object. Such compression enables efficient transmission, storage, and processing of trajectory data. Although a number of compression algorithms have been pr