E-LIB Suche - Ergebnisse für: Abedin, Paniz

1

SenseNow: A Time-Dependent Incentive Approach for Vehicular..:

Jaimes, Luis G. ; Chintakunta, Harish ; Abedin, Paniz
IEEE Open Journal of Intelligent Transportation Systems. 5 (2024) - p. 307-321 , 2024

Link: https://doi.org/10.1109/..

2

Contextual Pattern Matching in Less Space:

, In: 2023 Data Compression Conference (DCC),

Abedin, Paniz ; Chubet, Oliver ; Gibney, Daniel. - p. 160-167 , 2023

Link: https://doi.org/10.1109/..

3

Meta-Analysis of the Machine Learning Operations Open Sourc..:

, In: 2023 International Conference on Machine Learning and Applications (ICMLA),

Zimmerman, Isabel ; Silge, Julia ; Abedin, Paniz. - p. 922-925 , 2023

Link: https://doi.org/10.1109/..

4

Analyzing the Data Completeness of Patients' Records Using ..:

Gurupur, Varadraj P. ; Abedin, Paniz ; Hooshmand, Sahar.
Applied Sciences. 12 (2022) 21 - p. 10746 , 2022

Link: https://doi.org/10.3390/..

5

The Heaviest Induced Ancestors Problem: Better Data Structu..:

Abedin, Paniz ; Hooshmand, Sahar ; Ganguly, Arnab.
Algorithmica. 84 (2022) 7 - p. 2088-2105 , 2022

Link: https://doi.org/10.1007/..

6

I/O-efficient data structures for non-overlapping indexing:

Hooshmand, Sahar ; Abedin, Paniz ; Oğuzhan Külekci, M..
Theoretical Computer Science. 857 (2021) - p. 1-7 , 2021

Link: https://doi.org/10.1016/..

7

A Survey on Shortest Unique Substring Queries:

Abedin, Paniz ; Külekci, M. ; Thankachan, Shama
Algorithms. 13 (2020) 9 - p. 224 , 2020

Link: https://doi.org/10.3390/..

8

A linear-space data structure for range-LCP queries in poly..:

Abedin, Paniz ; Ganguly, Arnab ; Hon, Wing-Kai...
Theoretical Computer Science. 822 (2020) - p. 15-22 , 2020

Link: https://doi.org/10.1016/..

9

Efficient Data Structures for Range Shortest Unique Substri..:

Abedin, Paniz ; Ganguly, Arnab ; Pissis, Solon P..
Algorithms. 13 (2020) 11 - p. 276 , 2020

Link: https://doi.org/10.3390/..

10

Range Shortest Unique Substring Queries:

, In: String Processing and Information Retrieval; Lecture Notes in Computer Science,

Abedin, Paniz ; Ganguly, Arnab ; Pissis, Solon P.. - p. 258-266 , 2019

Link: https://doi.org/10.1007/..

11

Faster Computation of Genome Mappability:

, In: Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics,

Hooshmand, Sahar ; Abedin, Paniz ; Gibney, Daniel.. - p. 537 ff. , 2018

Link: https://dl.acm.org/doi/1..

12

Complexity of the Improper Twin Edge Coloring of Graphs:

Abedin, Paniz ; Akbari, Saieed ; Demange, Marc.
Graphs and Combinatorics. 33 (2017) 4 - p. 595-615 , 2017

Link: https://doi.org/10.1007/..

13

I/O-efficient data structures for non-overlapping indexing:

Hooshmand, Sahar ; Abedin, Paniz ; Kulekci, M. Oguzhan.
https://aperta.ulakbim.gov.tr/record/237248. , 2021

Link: https://aperta.ulakbim.g..

14

Efficient data structures for range shortest unique substri..:

Abedin, Paniz ; Ganguly, Arnab ; Pissis, Solon P.
Abedin , P , Ganguly , A , Pissis , S P & Thankachan , S V 2020 , ' Efficient data structures for range shortest unique substring queries † ' , Algorithms , vol. 13 , no. 11 , 276 , pp. 1-9 . https://doi.org/10.3390/a13110276. , 2020

Link: https://research.vu.nl/e..

15

Non-Overlapping Indexing - Cache Obliviously:

Hooshmand, Sahar ; Abedin, Paniz ; Thankachan, Sharma V
doi:10.4230/LIPIcs.CPM.2018.8. , 2018

Link: https://doi.org/10.4230/..