( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Mobility Data Science (Dagstuhl Seminar 22021).

, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , и . Dagstuhl Reports, 12 (1): 1-34 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Mario A Bassi

Amós Nascimento

Nazem Nascimento

Simone Marion

Ernst Marioth-Wirtz

 

Другие публикации лиц с тем же именем

Aggregate k-nearest neighbors queries in time-dependent road networks., , , и . MobiGIS, стр. 3-12. ACM, (2015)A compact and efficient image retrieval approach based on border/interior pixel classification., , и . CIKM, стр. 102-109. ACM, (2002)Parallel traversal of signature trees for fast CBIR., , и . ACM Multimedia Workshops, стр. 6-9. ACM, (2001)On best drone tour plans for data collection in wireless sensor network., и . SAC, стр. 703-708. ACM, (2016)Evaluation of Access Structures for Discretely Moving Points., , и . Spatio-Temporal Database Management, том 1678 из Lecture Notes in Computer Science, стр. 171-188. Springer, (1999)Indexing Valid Time Databases via B+-Trees., и . IEEE Trans. Knowl. Data Eng., 11 (6): 929-947 (1999)RAID'ing Wireless Sensor Networks - Data Recovery for Node Failures., и . SENSORNETS, стр. 298-308. SciTePress, (2014)Taxonomy-Based Routing Indices for Peer-to-Peer Networks., и . Workshop on Peer-to-Peer Information Retrieval, (2004)Efficient implementation and benchmark of interior point methods for the polynomial L1 fitting problem, , и . Computational Statistics & Data Analysis, 35 (2): 119--135 (28.12.2000)In-Route Task Selection in Spatial Crowdsourcing., и . ACM Trans. Spatial Algorithms Syst., 6 (2): 7:1-7:45 (2020)