Suchergebnisse - "I/O-efficient algorithms"
-
1
Autoren: et al.
Quelle: Sølvsten, S, van de Pol, J, Jakobsen, A B & Thomasen, M W B 2021 'Efficient Binary Decision Diagram Manipulation in External Memory' ArXiv. https://doi.org/10.48550/arXiv.2104.12101
Schlagwörter: FOS: Computer and information sciences, I/O-efficient algorithms, Time-forward Processing, E.1, F.2.2, F.2.1, I.1.2, 02 engineering and technology, Binary Decision Diagram, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 68W30 (primary) 68R05, 68Q60, 68R07 (secondary)
Zugangs-URL: http://arxiv.org/abs/2104.12101
-
2
Autoren: et al.
Quelle: Lecture Notes in Computer Science ISBN: 9783662483497
Pagh, R, Pham, N D, Silvestri, F & Stöckel, M 2015, I/O-Efficient Similarity Join. in Algorithms-ESA 2015 : 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Springer, Lecture Notes in Computer Science, vol. 9294, pp. 941-952. https://doi.org/10.1007/978-3-662-48350-3_78
Algorithmica
Proceedings of ESA 2015Schlagwörter: Locality-sensitive hashing, FOS: Computer and information sciences, I/O-efficient algorithms, Similarity join, Cache-oblivious computing, Theoretical Computer Science, Computer Science (all), 02 engineering and technology, 16. Peace & justice, External memory algorithms, Cache aware, Cache oblivious, Locality sensitive hashing, Applied Mathematics, cache oblivious, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), cache aware, locality sensitive hashing, Similarity joins
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/pdf/1507.00552
http://arxiv.org/abs/1507.00552
http://www.itu.dk/people/ndap/SimJoin.pdf
http://ui.adsabs.harvard.edu/abs/2015arXiv150700552P/abstract
https://core.ac.uk/display/84920785
https://dblp.uni-trier.de/db/journals/corr/corr1507.html#PaghPSS15
https://link.springer.com/article/10.1007/s00453-017-0285-5
https://rd.springer.com/chapter/10.1007/978-3-662-48350-3_78
https://www.research.unipd.it/handle/11577/3228997
https://dblp.uni-trier.de/db/conf/esa/esa2015.html#PaghPSS15
https://pure.itu.dk/portal/da/publications/522297be-bcf4-4c73-b2d3-aca1df7ca739 -
3
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Arge, L, Haverkort, H & Tsirogiannis, C 2012, Fast generation of multiple resolution instances of raster data sets. in I Cruz & C Knoblock (eds), Proceedings of the 20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems : ACM SIGSPATIAL GIS 2012. Association for Computing Machinery, pp. 52-60, ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Redondo Beach, United States, 06/11/2012. https://doi.org/10.1145/2424321.2424329
Schlagwörter: 03 medical and health sciences, 0302 clinical medicine, I/O-efficient algorithms, Raster processing, Multiscalar analysis, 0211 other engineering and technologies, 02 engineering and technology
Zugangs-URL: https://dl.acm.org/doi/10.1145/2424321.2424329
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F575a7422-828b-4c18-94cd-aa0377b7d9d1
https://dl.acm.org/citation.cfm?doid=2424321.2424329
https://doi.org/10.1145/2424321.2424329
https://dblp.uni-trier.de/db/conf/gis/gis2012.html#ArgeHT12
https://core.ac.uk/display/158716293
https://pure.au.dk/portal/en/publications/33b3e660-9e89-4d9b-a9d8-eefacc26c54d
https://doi.org/10.1145/2424321.2424329 -
4
Autoren: et al.
Quelle: Arge, L, Rav, M, Svendsen, S C & Truelsen, J 2017, External Memory Pipelining Made Easy With TPIE. in Proceedings - 2017 IEEE International Conference on Big Data, Big Data 2017. IEEE, Boston, MA, USA , pp. 319-324, 2017 IEEE International Conference on Big Data, Boston, Massachusetts, United States, 11/12/2017. https://doi.org/10.1109/BigData.2017.8257940
Schlagwörter: C++, I/O-efficient algorithms, software framework
Dateibeschreibung: application/pdf
-
5
Autoren:
Quelle: Agarwal, P K, Arge, L A & Yi, K 2010, 'I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis', A C M Transactions on Algorithms, vol. 7, no. 1, pp. Article 11. https://doi.org/10.1145/1868237.1868249
Schlagwörter: I/O-efficient algorithms, Union-find
Zugangs-URL: https://dblp.uni-trier.de/db/journals/talg/talg7.html#AgarwalAY10
https://core.ac.uk/display/34027913
https://doi.org/10.1145/1868237.1868249
https://dl.acm.org/doi/10.1145/1868237.1868249
https://repository.ust.hk/ir/Record/1783.1-33009
https://www.cse.ust.hk/~yike/union-find/paper.pdf
https://dblp.uni-trier.de/db/conf/compgeom/compgeom2006.html#AgarwalAY06
https://repository.ust.hk/ir/Record/1783.1-41833
https://core.ac.uk/display/20891846
https://pure.au.dk/portal/en/publications/1b425550-e5a9-11df-a891-000ea68e967b
https://doi.org/10.1145/1868237.1868249 -
6
Autoren: Arge, Lars Allan
Quelle: Arge, L A 2003, 'The Buffer Tree: A Technique for Designing Batched External Data Structures', Algorithmica, vol. 37, Issue 1, pp. 1-24. https://doi.org/10.1007/s00453-003-1021-x
Schlagwörter: I/O-efficient algorithms, Data structures, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Dateibeschreibung: application/xml
-
7
Autoren: Thonangi, Risi
Thesis Advisors: Yang, Jun
Schlagwörter: Computer science, data management on new hardware, I/O efficient algorithms, random-access block devices, solid-state drives
Verfügbarkeit: http://hdl.handle.net/10161/10521
-
8
Autoren: et al.
Quelle: Pagh, R, Pham, N D, Silvestri, F & Stöckel, M 2015, I/O-Efficient Similarity Join. in Algorithms - ESA 2015 : 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Springer, Lecture Notes in Computer Science, vol. 9294, pp. 941-952. https://doi.org/10.1007/978-3-662-48350-3_78
Schlagwörter: I/O-efficient algorithms, Locality-sensitive hashing, Similarity joins, Cache-oblivious computing, External memory algorithms
Dateibeschreibung: application/pdf
-
9
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Cache oblivious, cache aware, external memory, I/O-efficient algorithms, data structures
Dateibeschreibung: application/pdf
Relation: Is Part Of Dagstuhl Seminar Proceedings, Volume 4301, Cache-Oblivious and Cache-Aware Algorithms (2005); https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04301.1
-
10
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Nonnumerical Algorithms and Problems—Geometrical problems and computations General Terms Algorithms, Theory Keywords Terrains, geographical information systems, I/O-efficient algorithms
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.1278; http://users.cs.dal.ca/%7Enzeh/Publications/terrain_socg2010.pdf
-
11
Autoren:
Weitere Verfasser:
Schlagwörter: and problems—Geometrical problems and computations General Terms, Algorithms, Experimentation, Theory Keywords, MBES, noise removal, I/O-efficient algorithms, connected components ∗ Supported by MADALGO — Center for Massive Data Algorithmics
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.584; http://www.daimi.au.dk/~larsen/papers/cleaning_sonar.pdf
-
12
Autoren:
Schlagwörter: Adiar, Binary Decision Diagrams, I/O-efficient Algorithms
Relation: arXiv:2104.12101; https://zenodo.org/records/5638551; oai:zenodo.org:5638551; https://doi.org/10.5281/zenodo.5638551
-
13
Autoren: et al.
Quelle: Sølvsten, S, van de Pol, J, Jakobsen, A B, Rysgaard, C M, Carstensen, E F & Thomasen, M W B, Adiar : An I/O-efficient implementation of Decision Diagrams, 2021, Software, GitHub. https://doi.org/10.5281/zenodo.4718218
Schlagwörter: Binary Decision Diagrams, I/O-Efficient Algorithms, Time-forward Processing, External Memory Algorithms, Model Checking
-
14
Autoren:
Weitere Verfasser:
Schlagwörter: I/O-efficient algorithms, planar directed graphs, topological sorting, ear decomposition
Dateibeschreibung: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.7362; http://www.daimi.au.dk/~large/Papers/topsortspaa03.ps
-
15
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: General Terms, I/O-efficient Algorithms, Geographic Information Systems, Terrain Additional Key Words and Phrases, I/O-model, flow, shortest paths, connected components
Dateibeschreibung: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.7692; http://www.cs.duke.edu/~laura/papers/alenex00_drainage.ps.gz
-
16
Autoren:
Schlagwörter: Acyclic joins, I/O-efficient algorithms, Worst-case optimal
Relation: https://doi.org/10.1145/2902251.2902292; http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000455700700011
Verfügbarkeit: http://repository.hkust.edu.hk/ir/Record/1783.1-77634
https://doi.org/10.1145/2902251.2902292
http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=978-1-4503-4191-2/16/06&rft.volume=&rft.issue=&rft.date=2016&rft.spage=00&rft.aulast=Hu&rft.aufirst=Xiao%7C015769&rft.atitle=Towards+a+Worst-case+I%2FO-optimal+Algorithm+for+Acyclic+Joins&rft.title=The+2016+ACM+SIGMOD%2FPODS+Conference,+San+Francisco,+USA
http://www.scopus.com/record/display.url?eid=2-s2.0-84978474623&origin=inward
http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000455700700011 -
17
Autoren:
Schlagwörter: I/O-Efficient Algorithms, Lower Bound, Sampling, Stream, 1708 Hardware and Architecture, 1710 Information Systems, 1712 Software
Relation: orcid:0000-0003-3883-5452; GRF 142072/14, GRF 4168/13
Verfügbarkeit: https://espace.library.uq.edu.au/view/UQ:607333
-
18
Autoren:
Schlagwörter: I/O-efficient algorithms, Union-find
Relation: ACM Transactions on Algorithms, v. 7, (1), 2010; https://doi.org/10.1145/1868237.1868249; http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000288825000011
Verfügbarkeit: http://repository.hkust.edu.hk/ir/Record/1783.1-33009
https://doi.org/10.1145/1868237.1868249
http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=1549-6325&rft.volume=7&rft.issue=1&rft.date=2010&rft.spage=&rft.epage=&rft.aulast=Agarwal&rft.aufirst=P.K.&rft.atitle=I%2FO-efficient+batched+union-find+and+its+applications+to+terrain+analysis&rft.title=ACM+Transactions+on+Algorithms
http://www.scopus.com/record/display.url?eid=2-s2.0-78650633271&origin=inward
http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000288825000011 -
19
Autoren: et al.
Quelle: Arge, L A, Larsen, K G, Mølhave, T & Walderveen, F V 2010, Cleaning Massive Sonar Point Clouds. in Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems. GIS '10. Association for Computing Machinery, pp. 152-161, 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2010), San Jose, California, United States, 03/11/2010. https://doi.org/10.1145/1869790.1869815
Schlagwörter: MBES, noise removal, I/O-efficient algorithms, connected components
-
20
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Agarwal, P K, Arge, L, Sadri, B & Mølhave, T 2008, I/O-Efficient Algorithms for Computing Contour Lines on a Terrain. in M Teilaud (ed.), Proceedings of the twenty-fourth annual symposium on Computational geometry. Association for Computing Machinery, pp. 129-138, ACM Symposium on Computational Geometry, University of Maryland, United States, 09/06/2008. https://doi.org/10.1145/1377676.1377698
Schlagwörter: contours, geographical information systems, i/o-efficient algorithms, terrains
Nájsť tento článok vo Web of Science 
Full Text Finder