Výsledky vyhľadávania - "space-efficient algorithms"

Error Correction for Message Streams

Autori: Gupta, Meghal Zhang, Rachel Yun Meghal Gupta and Rachel Yun Zhang

Prispievatelia: Gupta, Meghal Zhang, Rachel Yun Meghal Gupta and Rachel Yun Zhang

Predmety: streaming algorithms, error-correcting codes, ddc:004, space-efficient algorithms

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.59

Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs

Autori: Egidi L. Louza F. A. Manzini G. a ďalší

Prispievatelia: Egidi L. Louza F. A. Manzini G. a ďalší

Zdroj: Algorithmica. 84:639-669

Predmety: FOS: Computer and information sciences, BWT variants, de Bruijn graphs, Space efficient algorithms, Succinct data structures, Wheeler graphs, Computer Science - Data Structures and Algorithms, 0206 medical engineering, Succinct data structures · de Bruijn graphs · Wheeler graphs · BWT variants · Space efficient algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/pdf/2009.03675
http://arxiv.org/abs/2009.03675
https://bv.fapesp.br/pt/publicacao/196024/space-efficient-merging-of-de-bruijn-graphs-and-wheeler-grap/
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-03675
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-03675
https://link.springer.com/article/10.1007/s00453-021-00855-2
https://hdl.handle.net/11568/1105890
https://doi.org/10.1007/s00453-021-00855-2
https://link.springer.com/article/10.1007/s00453-021-00855-2

Space-Efficient Algorithms for Reachability in Directed Geometric Graphs

Autori: Bhore, Sujoy Jain, Rahul Sujoy Bhore and Rahul Jain

Prispievatelia: Bhore, Sujoy Jain, Rahul Sujoy Bhore and Rahul Jain

Predmety: Reachablity, Geometric intersection graphs, Space-efficient algorithms

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.63

Dostupnosť: https://doi.org/10.4230/LIPIcs.ISAAC.2021.63
https://nbn-resolving.org/urn:nbn:de:0030-drops-154961
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.63

Space-Efficient Feature Maps for String Alignment Kernels

Autori: Yasuo Tabei Yoshihiro Yamanishi Rasmus Pagh

Zdroj: Data Science and Engineering, Vol 5, Iss 2, Pp 168-179 (2020)
Tabei, Y, Yamanishi, Y & Pagh, R 2020, 'Space-Efficient Feature Maps for String Alignment Kernels', Data Science and Engineering, vol. 5, pp. 168–179. https://doi.org/10.1007/s41019-020-00120-6

Predmety: FOS: Computer and information sciences, Computer Science - Machine Learning, Edit sensitive parsing (ESP), Kernel approximation, Computer Science - Artificial Intelligence, Edit distance, Large-scale string analysis, Machine Learning (stat.ML), Information technology, QA75.5-76.95, SVM classification, T58.5-58.64, Space-efficient algorithms, Machine Learning (cs.LG), Artificial Intelligence (cs.AI), Alignment kernels, Statistics - Machine Learning, Electronic computers. Computer science, Metric embedding, Random Fourier features (RFFs), String kernels, String alignment kernels, Feature maps

Popis súboru: application/pdf

Prístupová URL adresa: https://link.springer.com/content/pdf/10.1007/s41019-020-00120-6.pdf
http://arxiv.org/pdf/1802.06382
http://arxiv.org/abs/1802.06382
https://doaj.org/article/f5e65c357c814ecfa6d6b5538afb5dae
https://dblp.uni-trier.de/db/journals/dase/dase5.html#TabeiYP20
https://link.springer.com/content/pdf/10.1007/s41019-020-00120-6.pdf
https://link.springer.com/article/10.1007/s41019-020-00120-6
https://dblp.uni-trier.de/db/conf/icdm/icdm2019.html#TabeiYP19
https://pure.itu.dk/ws/files/85658160/art_10.1007_s41019_020_00120_6.pdf

Optimizing Memory-efficient Algorithms for Low-cost and Scalable Network Services

Autori: Wang, Minmei

Predmety: Computer science, Computer engineering, Systems science, IoT security, Network functions, Network services, Space-efficient algorithms

Popis súboru: application/pdf

Prístupová URL adresa: https://escholarship.org/uc/item/7sc2q950
https://escholarship.org/content/qt7sc2q950/qt7sc2q950.pdf

Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems

Autori: Nikhil Bansal Shashwat Garg Jesper Nederlof a ďalší

Prispievatelia: Nikhil Bansal Shashwat Garg Jesper Nederlof a ďalší

Zdroj: SIAM Journal on Computing. 47:1755-1777

Predmety: FOS: Computer and information sciences, Computer Science - Cryptography and Security, cs.CC, Exact exponential time algorithms, Exponential time algorithms, K-sum, Fine-grained complexity, Subset sum, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Space-efficient algorithms, 01 natural sciences, Space-time trade-off, Computer Science - Computational Complexity, cs.DS, cs.CR, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Cryptography and Security (cs.CR)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/pdf/1612.02788
http://arxiv.org/abs/1612.02788
https://research.tue.nl/en/publications/2ba1b4d7-1192-4a44-989f-9db82afacb46
https://doi.org/10.1137/17M1158203
https://research.tue.nl/en/publications/94087494-b38f-4d61-887b-59862f45b385
https://research-portal.uu.nl/en/publications/2281c890-f448-4f4c-b6e2-de153c91eb15
https://doi.org/10.1137/17M1158203
https://pure.tue.nl/ws/files/62892191/1612.02788.pd.pdf
https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A28112
https://dblp.uni-trier.de/db/journals/corr/corr1612.html#BansalGNV16
https://ir.cwi.nl/pub/28112/28112.pdf
https://epubs.siam.org/doi/abs/10.1137/17M1158203
https://ui.adsabs.harvard.edu/abs/2016arXiv161202788B/abstract
https://dspace.library.uu.nl/handle/1874/424016

Space-efficient algorithms for reachability in directed geometric graphs

Autori: Sujoy Bhore Rahul Jain Sujoy Bhore and Rahul Jain

Prispievatelia: Sujoy Bhore Rahul Jain Sujoy Bhore and Rahul Jain

Zdroj: Theoretical Computer Science. 961:113938

Predmety: Geometric intersection graphs, Reachablity, 0102 computer and information sciences, ddc:004, 0101 mathematics, Space-efficient algorithms, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.63

Space-efficient Feature Maps for String Alignment Kernels

Autori: Tabei, Yasuo Yamanishi, Yoshihiro Pagh, Rasmus

Zdroj: Tabei, Y, Yamanishi, Y & Pagh, R 2019, Space-efficient Feature Maps for String Alignment Kernels. in IEEE International Conference on Data Mining (ICDM). IEEE, IEEE International Conference on Data Mining (ICDM). https://doi.org/10.1109/ICDM.2019.00166

Predmety: String kernels, Alignment kernels, SVM classification, Edit distance, Random Fourier features (RFFs), Metric embedding, Edit sensitive parsing (ESP), Large-scale string analysis, Space-efficient algorithms, Feature maps

Popis súboru: application/pdf

Dostupnosť: https://pure.itu.dk/portal/da/publications/1d0841ed-8d36-438c-b5e6-00e69f77e2b7
https://doi.org/10.1109/ICDM.2019.00166
https://pure.itu.dk/ws/files/84805130/1802.06382.pdf
https://arxiv.org/pdf/1802.06382.pdf

Space-efficient parallel algorithms for combinatorial search problems

Autori: PIETRACAPRINA, ANDREA ALBERTO PUCCI, GEPPINO SILVESTRI, FRANCESCO a ďalší

Prispievatelia: PIETRACAPRINA, ANDREA ALBERTO PUCCI, GEPPINO SILVESTRI, FRANCESCO a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783642403125
Pietracaprina, A, Pucci, G, Silvestri, F & Vandin, F 2015, ' Space-efficient parallel algorithms for combinatorial search problems ', Journal of Parallel and Distributed Computing, bind 76, s. 58-65 . https://doi.org/10.1016/j.jpdc.2014.09.007

Predmety: FOS: Computer and information sciences, distributed memory, Branch-and-bound, Communication, parallel algorithms, Combinatorial search problems, Distributed algorithms, Backtrack search, Space-efficient algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, lower bounds, Communication complexity, BSP, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, F.2.2, 0101 mathematics

Popis súboru: application/pdf

Prístupová URL adresa: https://arxiv.org/pdf/1306.2552
http://arxiv.org/abs/1306.2552
http://arxiv.org/abs/1307.1805
https://128.84.21.199/abs/1306.2552
https://arxiv.org/pdf/1306.2552v2
https://www.arxiv.org/abs/1306.2552
https://ui.adsabs.harvard.edu/abs/2013arXiv1306.2552P/abstract
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2013.html#PietracaprinaPSV13
https://core.ac.uk/display/53500743
https://link.springer.com/chapter/10.1007/978-3-642-40313-2_63
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.627
http://www.sciencedirect.com/science/article/pii/S0743731514001701
https://portal.findresearcher.sdu.dk/da/publications/606469f8-3acd-4b78-826d-c2a9fc3a062d
https://doi.org/10.1016/j.jpdc.2014.09.007
http://drops.dagstuhl.de/opus/volltexte/2014/4493/
https://doi.org/10.4230/LIPIcs.STACS.2014.627
https://hdl.handle.net/11577/2836351

Lightweight Data Indexing and Compression in External Memory

Autori: FERRAGINA, PAOLO Travis Gagie Giovanni Manzini a ďalší

Prispievatelia: FERRAGINA, PAOLO Travis Gagie Giovanni Manzini a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783642121999

Predmety: Working space, ta113, FOS: Computer and information sciences, 0206 medical engineering, 0102 computer and information sciences, 02 engineering and technology, Burrows-Wheeler transform, Space-efficient algorithms, 01 natural sciences, Suffix Array, BWT, Compressed indexes, Data compression, ta5141, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ta513, ta512, ta515, Construction, External memory scan-based algorithms

Popis súboru: application/pdf; STAMPA

Prístupová URL adresa: http://arxiv.org/pdf/0909.4341
http://arxiv.org/pdf/0909.4341v1.pdf
http://arxiv.org/abs/0909.4341
http://juuli.fi/Record/0247148512
http://juuli.fi/Record/0352502112
https://doi.org/10.1007/s0045301195350
http://juuli.fi/Record/0352246510
https://doi.org/10.1007/9783642122002_60
https://link.springer.com/chapter/10.1007%2F978-3-642-12200-2_60
https://core.ac.uk/display/22049553
https://link.springer.com/10.1007/978-3-642-12200-2_60
https://arpi.unipi.it/handle/11568/139659
https://dblp.uni-trier.de/db/conf/latin/latin2010.html#FerraginaGM10
https://rd.springer.com/chapter/10.1007/978-3-642-12200-2_60
https://hdl.handle.net/20.500.14243/318199
http://www.scopus.com/record/display.url?eid=2-s2.0-77953507125&origin=inward
https://doi.org/10.1007/978-3-642-12200-2_60
https://hdl.handle.net/11568/139659
http://link.springer.com/chapter/10.1007/978-3-642-12200-2_60
https://doi.org/10.1007/978-3-642-12200-2_60

Space-efficient geometric divide-and-conquer algorithms

Autori: Bose, Prosenjit Maheshwari, Anil Morin, Patrick a ďalší

Zdroj: idUS. Depósito de Investigación de la Universidad de Sevilla
Universidad de Sevilla (US)
instname

Predmety: Control and Optimization, All-nearest-neighbors, Orthogonal line segment intersection, 0102 computer and information sciences, 02 engineering and technology, Space-efficient algorithms, 01 natural sciences, Computational geometry, Computer Science Applications, Computational Mathematics, Computational Theory and Mathematics, In-place algorithms, 0202 electrical engineering, electronic engineering, information engineering, In situ algorithms, Geometry and Topology

Popis súboru: application/pdf

Prístupová URL adresa: http://hdl.handle.net/11441/55067
https://idus.us.es/handle/11441/55067
https://www.sciencedirect.com/science/article/abs/pii/S0925772106000794
https://people.scs.carleton.ca/~michiel/space-efficient.pdf
https://core.ac.uk/display/82285559
http://cglab.ca/~morin/publications/insitu/insitu2-submitted.pdf
https://doi.org/10.1016/j.comgeo.2006.03.006
https://idus.us.es/handle/11441/55067

Line-Segment Intersection Made In-Place

Autori: Jan Vahrenhold

Zdroj: Lecture Notes in Computer Science ISBN: 9783540281016

Predmety: Line-segment intersection, Computational Mathematics, Control and Optimization, Computational Theory and Mathematics, In-place algorithms, 0202 electrical engineering, electronic engineering, information engineering, Geometry and Topology, 0102 computer and information sciences, 02 engineering and technology, Space-efficient algorithms, 01 natural sciences, Computer Science Applications

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/comgeo/comgeo38.html#Vahrenhold07
https://core.ac.uk/display/82816646
https://www.sciencedirect.com/science/article/pii/S0925772106000885

Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits

Autori: Chakraborty, Sankardeep Raman, Venkatesh Satti, Srinivasa Rao a ďalší

Prispievatelia: Chakraborty, Sankardeep Raman, Venkatesh Satti, Srinivasa Rao a ďalší

Predmety: biconnectivity, st-number, chain decomposition, tree cover, space efficient algorithms, read-only memory

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.22

Dostupnosť: https://doi.org/10.4230/LIPIcs.ISAAC.2016.22
https://nbn-resolving.org/urn:nbn:de:0030-drops-67927
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.22

Fast BWT in small space by blockwise suffix sorting

Autori: Juha Kärkkäinen

Zdroj: Theoretical Computer Science. 387:249-257

Predmety: 0301 basic medicine, Suffix sorting, 03 medical and health sciences, Suffix array, 0102 computer and information sciences, Burrows–Wheeler transform, Space-efficient algorithms, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Prístupová URL adresa: https://www.cs.helsinki.fi/u/tpkarkka/publications/tcs07-revised.pdf
https://dl.acm.org/doi/10.1016/j.tcs.2007.07.018
https://www.sciencedirect.com/science/article/abs/pii/S0304397507005245
https://dl.acm.org/citation.cfm?id=1314852
http://portal.acm.org/citation.cfm?id=1314852
https://www.sciencedirect.com/science/article/pii/S0304397507005245

TOPOLOGICAL PEELING AND APPLICATIONS: Topological peeling and applications.

Autori: Chen, Danny Luan, Shuang Xu, Jinhui

Zdroj: International Journal of Computational Geometry & Applications. 13:135-172

Predmety: shortest path, space efficient algorithms, 0102 computer and information sciences, 02 engineering and technology, 15. Life on land, Computational aspects related to convexity, 7. Clean energy, 01 natural sciences, 12. Responsible consumption, arrangement, Computer graphics, computational geometry (digital and algorithmic aspects), 8. Economic growth, 11. Sustainability, 0202 electrical engineering, electronic engineering, information engineering, Analysis of algorithms, topological walk

Popis súboru: application/xml

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/ijcga/ijcga13.html#ChenLX03
https://www.worldscientific.com/doi/abs/10.1142/S0218195903001104

New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs

Autori: Chakraborty, Diptarka Pavan, A. Tewari, Raghunath a ďalší

Prispievatelia: Chakraborty, Diptarka Pavan, A. Tewari, Raghunath a ďalší

Predmety: Reachability, Space complexity, Time-Space Efficient Algorithms, Graphs on Surfaces, Minor Free Graphs, Savitch's Algorithm, BBRS Bound

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 29, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.585

Dostupnosť: https://doi.org/10.4230/LIPIcs.FSTTCS.2014.585
https://nbn-resolving.org/urn:nbn:de:0030-drops-48730
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.585

Small Work Space Algorithms for Some Basic Problems on Binary Images

Autori: Asano, Tetsuo Bereg, Sergey Buzer, Lilian a ďalší

Prispievatelia: Asano, Tetsuo Bereg, Sergey Buzer, Lilian a ďalší

Zdroj: Combinatorial Image Analysis ; 15th International Workshop Combinatorial Image Analysis, IWCIA 2012 ; https://hal.science/hal-00827181 ; 15th International Workshop Combinatorial Image Analysis, IWCIA 2012, Nov 2012, Austin, United States. pp.103-114, ⟨10.1007/978-3-642-34732-0_8⟩

Predmety: Connected component, Minimum enclosing rectangle, Largest connected component, Space-efficient algorithms, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]

Geografické téma: Austin, United States

Dostupnosť: https://hal.science/hal-00827181
https://hal.science/hal-00827181v1/document
https://hal.science/hal-00827181v1/file/IWCIA_2012.pdf
https://doi.org/10.1007/978-3-642-34732-0_8

Space-efficient recognition of sparse self-reducible languages

Autori: Seinosuke Toda Mitsunori Ogihara Lane A. Hemaspaandra

Zdroj: Computational Complexity. 4:262-296

Predmety: Complexity of computation (including implicit computational complexity), time-space-efficient algorithms, 4. Education, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://urresearch.rochester.edu/fileDownloadForInstitutionalItem.action?itemId=4732&itemFileId=7171
https://link.springer.com/article/10.1007%2FBF01206639
https://miami.pure.elsevier.com/en/publications/space-efficient-recognition-of-sparse-self-reducible-languages
https://dblp.uni-trier.de/db/journals/cc/cc4.html#HemaspaandraOT94
https://link.springer.com/content/pdf/10.1007/BF01206639.pdf
https://urresearch.rochester.edu/institutionalPublicationPublicView.action?institutionalItemId=4732

Space-efficient Representation of Semi-structured Document Formats Utilizing Succinct Data Structures ; 간결한 자료구조를 활용한 반구조화된 문서 형식들의 공간 효율적 표현법

Autori: 이준희 Srinivasa Rao Satti Junhee Lee a ďalší

Prispievatelia: 이준희 Srinivasa Rao Satti Junhee Lee a ďalší

Predmety: Semi-structured Document Formats, Succinct Data Structures, Compression Algorithms, Space-efficient Algorithms, Integer Arrays, Bitmap Indexes, Big Data Processing, 반구조화된 문서 형식, 간결한 자료구조, 압축 알고리즘, 공간 효율적 알고리즘, 정수 배열, 비트맵 인덱스, 빅 데이터 처리, 621.3

Popis súboru: xi, 125

Relation: 000000163616; https://hdl.handle.net/10371/175354; https://dcollection.snu.ac.kr/common/orgView/000000163616; 000000000044▲000000000050▲000000163616▲

Dostupnosť: https://hdl.handle.net/10371/175354
https://dcollection.snu.ac.kr/common/orgView/000000163616

Line-segment intersection made in-place

Autori: Jan Vahrenhold The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Jan Vahrenhold The Pennsylvania State University CiteSeerX Archives

Zdroj: http://dominik.eigendynamik.ch/ethz/focus_ti/cgsem/03 Line-segment intersection made in-place.pdf.

Predmety: Space-efficient algorithms, In-place algorithms, Line-segment intersection

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.5684

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.5684
http://dominik.eigendynamik.ch/ethz/focus_ti/cgsem/03 Line-segment intersection made in-place.pdf