E-LIB Suche - Ergebnisse für: Pramanik, Sakti

1

Fast Edit Distance Prediction for All Pairs of Sequences in..:

, In: Advances in Knowledge Discovery and Data Mining; Lecture Notes in Computer Science,

Islam, A. K. M. Tauhidul ; Pramanik, Sakti - p. 72-91 , 2024

2

VA-Store: A Virtual Approximate Store Approach to Supportin..:

Liu, Xianying ; Zhu, Qiang ; Pramanik, Sakti..
IEEE Transactions on Knowledge and Data Engineering. 32 (2020) 3 - p. 602-616 , 2020

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

3

An Effective Clustering Method over CF+ Tree Using Multiple..:

Ryu, Hyeong-cheol ; Jung, Sungwon ; Pramanik, Sakti
IEEE Transactions on Knowledge and Data Engineering. , 2020

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

4

The BINDS-Tree: A Space-Partitioning Based Indexing Scheme ..:

ISLAM, A. K. M. Tauhidul ; PRAMANIK, Sakti ; ZHU, Qiang
IEICE Transactions on Information and Systems. E102.D (2019) 4 - p. 745-758 , 2019

Link: https://doi.org/10.1587/..

5

Data-independent vantage point selection for range queries:

Watve, Alok ; Pramanik, Sakti ; Jung, Sungwon.
The Journal of Supercomputing. 75 (2018) 12 - p. 7952-7978 , 2018

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

6

Exploring Deletion Strategies for the BoND-Tree in Multidim..:

, In: Proceedings of the 21st International Database Engineering & Applications Symposium,

Cherniak, Ramblin ; Zhu, Qiang ; Gu, Yarong. - p. 153-160 , 2017

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

7

Topological Transformation Approaches to Database Query Pro..:

Watve, Alok ; Pramanik, Sakti ; Shahid, Salman..
IEEE Transactions on Knowledge and Data Engineering. 27 (2015) 5 - p. 1438-1451 , 2015

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

8

A new method for DNA sequencing error verification and corr..:

, In: Proceedings of the 6th ACM Conference on Bioinformatics, Computational Biology and Health Informatics,

Gu, Yarong ; Liu, Xianying ; Zhu, Qiang... - p. 503-504 , 2015

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

9

k-Nearest neighbor searching in hybrid spaces:

Kolbe, Dashiell ; Zhu, Qiang ; Pramanik, Sakti
Information Systems. 43 (2014) - p. 55-64 , 2014

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

10

The BoND-Tree: An Efficient Indexing Method for Box Queries..:

Chen, Changqing ; Watve, Alok ; Pramanik, Sakti.
IEEE Transactions on Knowledge and Data Engineering. 25 (2013) 11 - p. 2629-2643 , 2013

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

11

Minimum bounding boxes for regular cross-polytopes:

, In: Proceedings of the 27th Annual ACM Symposium on Applied Computing,

Shahid, Salman ; Pramanik, Sakti ; Owen, Charles B. - p. 879-884 , 2012

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

12

Efficient k-nearest neighbor searching in nonordered discre..:

Kolbe, Dashiell ; Zhu, Qiang ; Pramanik, Sakti
ACM Transactions on Information Systems. 28 (2010) 2 - p. 1-33 , 2010

Link: https://doi.org/10.1145/..

13

Transforming range queries to equivalent box queries to opt..:

Pramanik, Sakti ; Watve, Alok ; Meiners, Chad R..
Proceedings of the VLDB Endowment. 3 (2010) 1-2 - p. 409-416 , 2010

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

14

Reducing non-determinism of k-NN searching in non-ordered d..:

Kolbe, Dashiell ; Zhu, Qiang ; Pramanik, Sakti
Information Processing Letters. 110 (2010) 10 - p. 420-423 , 2010

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

15

Efficient k-nearest neighbor searching in nonordered discre..:

Kolbe, Dashiell ; Zhu, Qiang ; Pramanik, Sakti
ACM Transactions on Information Systems (TOIS). 28 (2010) 2 - p. 1-33 , 2010

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