 | 2009 |
|---|
| 71 |       | Changqing Chen,
Sakti Pramanik,
Qiang Zhu,
Watve Alok,
Gang Qian:
The C-ND tree: a multidimensional index for hybrid continuous and non-ordered discrete data spaces.
EDBT 2009: 462-471 |
| 70 | | Changqing Chen,
Sakti Pramanik,
Qiang Zhu,
Gang Qian:
A Study of Indexing Strategies for Hybrid Data Spaces.
ICEIS 2009: 149-159 |
| 69 |  | Hyun-Jeong Seok,
Qiang Zhu,
Gang Qian,
Sakti Pramanik,
Wen-Chi Hou:
Deletion Techniques for the ND-tree in Non-ordered Discrete Data Spaces.
SEDE 2009: 1-6 |
| 2008 |
|---|
| 68 | | Hyun-Jeong Seok,
Gang Qian,
Qiang Zhu,
Alexander R. Oswald,
Sakti Pramanik:
Bulk-Loading the ND-Tree in Non-ordered Discrete Data Spaces.
DASFAA 2008: 156-171 |
| 67 | | Gang Qian,
Hyun-Jeong Seok,
Qiang Zhu,
Sakti Pramanik:
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces.
DEXA 2008: 404-418 |
| 2007 |
|---|
| 66 | | Dashiell Kolbe,
Qiang Zhu,
Sakti Pramanik:
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces.
ICDE 2007: 426-435 |
| 2006 |
|---|
| 65 | | Qiang Xue,
James R. Cole,
Sakti Pramanik:
Sequence Homology Search Based on Database Indexing Using the Profile Hidden Markov Model.
BIBE 2006: 135-140 |
| 64 | | Gang Qian,
Qiang Zhu,
Qiang Xue,
Sakti Pramanik:
Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach.
ACM Trans. Database Syst. 31(2): 439-484 (2006) |
| 63 | | Gang Qian,
Qiang Zhu,
Qiang Xue,
Sakti Pramanik:
A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces.
ACM Trans. Inf. Syst. 24(1): 79-110 (2006) |
| 2005 |
|---|
| 62 | | Qiang Xue,
Sakti Pramanik,
Gang Qian,
Qiang Zhu:
The Hybrid Digital Tree: A New Indexing Technique for Large String Databases.
ICEIS (1) 2005: 115-121 |
| 61 | | Sungwon Jung,
Byungkyu Lee,
Sakti Pramanik:
A Tree-Structured Index Allocation Method with Replication over Multiple Broadcast Channels in Wireless Environments.
IEEE Trans. Knowl. Data Eng. 17(3): 311-325 (2005) |
| 60 | | Qiang Xue,
Sakti Pramanik,
Gang Qian,
Qiang Zhu:
A hybrid index structure for querying large string databases.
IJEB 3(3/4): 243-254 (2005) |
| 2004 |
|---|
| 59 | | Gang Qian,
Shamik Sural,
Yuelong Gu,
Sakti Pramanik:
Similarity between Euclidean and cosine angle distance for nearest neighbor queries.
SAC 2004: 1232-1237 |
| 2003 |
|---|
| 58 | | Gang Qian,
Qiang Zhu,
Qiang Xue,
Sakti Pramanik:
The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces.
VLDB 2003: 620-631 |
| 2002 |
|---|
| 57 | | Shamik Sural,
Gang Qian,
Sakti Pramanik:
A comparative analysis of two distance measures in color image databases.
ICIP (1) 2002: 401-404 |
| 56 | | Shamik Sural,
Gang Qian,
Sakti Pramanik:
Segmentation and histogram generation using the HSV color space for image retrieval.
ICIP (2) 2002: 589-592 |
| 55 | | Shamik Sural,
Gang Qian,
Sakti Pramanik:
A Histogramm with Perceptually Smooth Color Transition for Image Retrieval.
JCIS 2002: 664-667 |
| 54 | | Sungwon Jung,
Sakti Pramanik:
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps.
IEEE Trans. Knowl. Data Eng. 14(5): 1029-1046 (2002) |
| 2001 |
|---|
| 53 | | Sakti Pramanik,
Jinhua Li:
Clustered SS-Tree.
ICME 2001 |
| 2000 |
|---|
| 52 | | Sakti Pramanik,
Jinhua Li,
Jiandong Ruan:
Performance Analysis of AB-Tree.
IEEE International Conference on Multimedia and Expo (III) 2000: 1701-1704 |
| 51 | | Sankhayan Choudhury,
Nabendu Chaki,
Sakti Pramanik,
Swapan Bhattacharya:
Conceptual Level Graph Theoretic Design and Development of Complex Information System.
ITCC 2000: 449-454 |
| 50 | | Bonnie L. Maidak,
James R. Cole,
Timothy G. Lilburn,
Charles T. Parker Jr.,
Paul Saxman,
Jason M. Stredwick,
George M. Garrity,
Bing Li,
Gary J. Olsen,
Sakti Pramanik,
Thomas M. Schmidt,
James M. Tiedje:
The RDP (Ribosomal Database Project) continues.
Nucleic Acids Research 28(1): 173-174 (2000) |
| 1999 |
|---|
| 49 | | Sakti Pramanik,
Jinhua Li:
Fast Approximate Search Algorithm for Nearest Neighbor Queries in High Dimensions.
ICDE 1999: 251 |
| 48 | | Sakti Pramanik,
Scott Alexander,
Jinhua Li:
An Efficient Searching Algorithm for Approximate Nearest Neighbor Queries in High Dimensions.
ICMCS, Vol. 1 1999: 865-869 |
| 47 | | Yang Zhong,
Y. Luo,
Sakti Pramanik,
John H. Beaman:
HICLAS: a taxonomic database system for displaying and comparing biological classification and phylogenetic trees.
Bioinformatics 15(2): 149-156 (1999) |
| 46 | | Bonnie L. Maidak,
James R. Cole,
Charles T. Parker Jr.,
George M. Garrity,
Niels Larsen,
Bing Li,
Timothy G. Lilburn,
Michael J. McCaughey,
Gary J. Olsen,
Ross A. Overbeek,
Sakti Pramanik,
Thomas M. Schmidt,
James M. Tiedje,
Carl R. Woese:
A new version of the RDP (Ribosomal Database Project).
Nucleic Acids Research 27(1): 171-173 (1999) |
| 1998 |
|---|
| 45 | | Jaruloj Eamsiri Chongstitvatana,
Sakti Pramanik:
Extending Relational Algebra to Incorporate Characteristics of Temporal Data.
IADT 1998: 328-335 |
| 1997 |
|---|
| 44 | | Sakti Pramanik,
Walid R. Tout:
The NUMA with Clusters of Processors for Parallel Join.
IEEE Trans. Knowl. Data Eng. 9(4): 653-660 (1997) |
| 1996 |
|---|
| 43 | | Sungwon Jung,
Sakti Pramanik:
HiTi Graph Model of Topographical Roadmaps in Navigation Systems.
ICDE 1996: 76-84 |
| 42 | | Jin Kim,
James R. Cole,
Eric Torng,
Sakti Pramanik:
Inferring Relatedness of a Macromolecule to a Sequence Database Without Sequencing.
ISMB 1996: 125-133 |
| 41 | | Jin Kim,
James R. Cole,
Sakti Pramanik:
Alignment of possible secondary structures in multiple RNA sequences using simulated annealing.
Computer Applications in the Biosciences 12(4): 259-267 (1996) |
| 40 | | Sakti Pramanik,
Sungwon Jung:
Description and Identification of Distributed Fragments of Recursive Relations.
IEEE Trans. Knowl. Data Eng. 8(6): 1002-1016 (1996) |
| 1995 |
|---|
| 39 | | Sungwon Jung,
Sakti Pramanik:
An Efficient Representation of Distributed Fragments of Recursive Relations.
DASFAA 1995: 397-404 |
| 38 | | Sungwon Jung,
Steve Perkins,
Yang Zhong,
Sakti Pramanik,
John H. Beaman:
A new data model for biological classification.
Computer Applications in the Biosciences 11(3): 237-246 (1995) |
| 37 | | Walid R. Tout,
Sakti Pramanik:
Distributed Load Balancing for Parallel Main Memory Hash Join.
IEEE Trans. Parallel Distrib. Syst. 6(8): 841-849 (1995) |
| 36 | | Anastasia Analyti,
Sakti Pramanik:
Reliable Semantics for Extended Logic Programs with Rule Prioritization.
J. Log. Comput. 5(3): 303-324 (1995) |
| 1994 |
|---|
| 35 | | Anastasia Analyti,
Sakti Pramanik:
Semantics for Reasoning with Contradictory Extended Logic Programs.
GULP-PRODE (1) 1994: 434-448 |
| 34 | | Jin Kim,
Sakti Pramanik:
An Efficient Method for Multiple Sequence Alignment.
ISMB 1994: 212-218 |
| 33 | | Anastasia Analyti,
Sakti Pramanik:
Declarative Semantics for Contradictory Modular Logic Programs.
ISMIS 1994: 245-254 |
| 32 | | Jin Kim,
Sakti Pramanik,
M. J. Chung:
Multiple sequence alignment using simulated annealing.
Computer Applications in the Biosciences 10(4): 419-426 (1994) |
| 1993 |
|---|
| 31 | | Robert L. Grossman,
Yannis E. Ioannidis,
Edward N. May,
Sakti Pramanik,
Ruth Pordes:
Panel: Scientific Databases.
FODO 1993: 361 |
| 30 | | Walid R. Tout,
Sakti Pramanik:
A Distributed Load Balancing Scheme for Data Parallel Applications.
ICPP 1993: 213-216 |
| 29 | | Anastasia Analyti,
Sakti Pramanik:
Performance Analysis of a Main Memory Multi-Directory Hashing Technique.
Inf. Process. Lett. 45(4): 191-197 (1993) |
| 28 | | Sakti Pramanik,
Anastasia Analyti,
Henry Davies,
Hsiao-Yu Chou:
Multi-Directory Hashing.
Inf. Syst. 18(1): 63-74 (1993) |
| 1992 |
|---|
| 27 | | Sakti Pramanik,
David T. Kao,
David Vineyard:
Fragmentation of Recursive Relations in Distributed Datbases.
EDBT 1992: 389-404 |
| 26 | | Anastasia Analyti,
Sakti Pramanik:
Fast Search in Main Memory Databases.
SIGMOD Conference 1992: 215-224 |
| 25 | | Myoung-Ho Kim,
Sakti Pramanik:
Optimizing Database Accesses for Parallel Processing of Multikey Range Searches.
Comput. J. 35(1): 45-51 (1992) |
| 1991 |
|---|
| 24 | | Myoung-Ho Kim,
Sakti Pramanik:
The FX Distribution Method for Parallel Processing of Partial Match Queries.
Inf. Process. Lett. 38(5): 243-252 (1991) |
| 23 | | Farshad Fotouhi,
Sakti Pramanik:
Problem of Optimizing the Number of Block Accesses in Performing Relational Join is NP-Hard.
Inf. Process. Lett. 38(5): 271-275 (1991) |
| 1990 |
|---|
| 22 | | Charles Severance,
Sakti Pramanik:
Distributed Linear Hashing for Main Memory Databases.
ICPP (1) 1990: 92-95 |
| 21 | | Sakti Pramanik,
Charles Severance,
Todd Rosenau:
A High Speed Main Memory File System for Shared Memory Multi-Processor Systems.
PARBASE / Databases 1990: 187-203 |
| 20 | | Charles Severance,
Sakti Pramanik,
P. Wolberg:
Distributed Linear Hashing and Parallel Projection in Main Memory Databases.
VLDB 1990: 674-682 |
| 19 | | Sakti Pramanik,
Myoung-Ho Kim:
Parallel Processing of Large Node B-Trees.
IEEE Trans. Computers 39(9): 1208-1212 (1990) |
| 1989 |
|---|
| 18 | | Myoung-Ho Kim,
Sakti Pramanik:
On the Data Distribution Problems for Range Queries.
ICPP (1) 1989: 91-94 |
| 17 | | Sakti Pramanik,
Myoung-Ho Kim:
Database Processing Models in Parallel Processing Systems.
IWDM 1989: 112-126 |
| 16 | | Farshad Fotouhi,
Sakti Pramanik:
Optimal Secondary Storage Access Sequence for Performing Relational Join.
IEEE Trans. Knowl. Data Eng. 1(3): 318-328 (1989) |
| 1988 |
|---|
| 15 | | Myoung-Ho Kim,
Sakti Pramanik:
Optimal File Distribution For Partial Match Retrieval.
SIGMOD Conference 1988: 173-182 |
| 14 | | Sakti Pramanik,
David Vineyard:
Optimizing Join Queries in Distributed Databases.
IEEE Trans. Software Eng. 14(9): 1319-1326 (1988) |
| 13 | | Sakti Pramanik,
Myoung-Ho Kim:
HCB-Tree: A Height Compressed B-Tree for Parallel Processing.
Inf. Process. Lett. 29(4): 213-220 (1988) |
| 12 | | Sakti Pramanik,
Farshad Fotouhi:
Optimizing the cost of relational queries using Partial-Relation schemes.
Inf. Syst. 13(1): 71-79 (1988) |
| 1987 |
|---|
| 11 | | Sakti Pramanik,
David Vineyard:
Optimizing Join Queries in Distributed Database.
FSTTCS 1987: 282-304 |
| 10 | | Sakti Pramanik,
Myoung-Ho Kim:
HCB-Tree: A B-Tree Structure for Parallel Processing.
ICPP 1987: 140-146 |
| 1986 |
|---|
| 9 | | Sakti Pramanik,
Farshad Fotouhi:
Index Database Machine.
Comput. J. 29(5): 451-457 (1986) |
| 8 | | Sakti Pramanik:
Performance Analysis of a Database Filter Search Hardware.
IEEE Trans. Computers 35(12): 1077-1082 (1986) |
| 1985 |
|---|
| 7 | | Sakti Pramanik,
David Ittner:
Use of Graph-Theoretic Models for Optimal Relational Database Accesses to Perform Join.
ACM Trans. Database Syst. 10(1): 57-74 (1985) |
| 6 | | Sakti Pramanik,
Chung-Ta King:
A Hardware Pattern Matching Algorithm on a Dataflow.
Comput. J. 28(3): 264-269 (1985) |
| 1983 |
|---|
| 5 | | Sakti Pramanik:
Implementing set-theoretic relational-query functions using highly parallel index-processing hardware.
AFIPS National Computer Conference 1983: 283-291 |
| 1982 |
|---|
| 4 | | Sakti Pramanik:
Database filters.
ISCA 1982: 201-210 |
| 1981 |
|---|
| 3 | | Sakti Pramanik:
Highly parallel associative search and its application to cellular database machine design.
AFIPS National Computer Conference 1981: 521-528 |
| 2 | | Sakti Pramanik:
Hardware Organization for Nonnumeric Processing
VLDB 1981: 66-75 |
| 1980 |
|---|
| 1 | | Sakti Pramanik:
A mathematical model of character string manipulation.
AFIPS National Computer Conference 1980: 837-839 |
