Author image not provided
 Kamer Kaya

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article4.12
Citation Count177
Publication count43
Publication years2006-2018
Available for download14
Average downloads per article214.93
Downloads (cumulative)3,009
Downloads (12 Months)421
Downloads (6 Weeks)51
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


43 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 43
Result page: 1 2 3

Sort by:

1
March 2018 Expert Systems with Applications: An International Journal: Volume 94 Issue C, March 2018
Publisher: Pergamon Press, Inc.
Bibliometrics:
Citation Count: 0

New heuristics to generate synchronizing words have been proposed in the literature.Greedy and Cycle synchronizing heuristics have been frequently used as a benchmark.We make these heuristics order(s) of magnitude faster.The proposed techniques will yield better performance evaluations for future studies. Testing is the most expensive and time consuming phase in ...
Keywords: Finite state automata, Synchronizing heuristics, Synchronizing words

2
May 2017 CCGrid '17: Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing
Publisher: IEEE Press
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 7,   Downloads (12 Months): 53,   Downloads (Overall): 103

Full text available: PDFPDF
Finding a good partition of a computational directed acyclic graph associated with an algorithm can help find an execution pattern improving data locality, conduct an analysis of data movement, and expose parallel steps. The partition is required to be acyclic, i.e., the inter-part edges between the vertices from different parts ...
Keywords: multilevel partitioning, acyclic partitioning, directed graph

3 published by ACM
March 2017 ACM Transactions on Knowledge Discovery from Data (TKDD): Volume 11 Issue 3, April 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 10,   Downloads (12 Months): 127,   Downloads (Overall): 340

Full text available: PDFPDF
The betweenness and closeness metrics are widely used metrics in many network analysis applications. Yet, they are expensive to compute. For that reason, making the betweenness and closeness centrality computations faster is an important and well-studied problem. In this work, we propose the framework BADIOS that manipulates the graph by ...
Keywords: Betweenness centrality, closeness centrality, shortest path

4
November 2016 Security and Communication Networks: Volume 9 Issue 17, November 2016
Publisher: John Wiley & Sons, Inc.
Bibliometrics:
Citation Count: 0

For commitments on secrets, statistical hiding is a must when we are dealing with a long-term secret or when the secret domain is small enough for a brute-force attack by a powerful adversary. Unfortunately, all the Chinese Remainder Theorem-based verifiable secret sharing schemes in the literature are either insecure or ...
Keywords: Chinese Remainder Theorem, joint random secret sharing, verifiable secret sharing, statistically hiding commitments, Asmuth-Bloom

5
November 2015 Journal of Parallel and Distributed Computing: Volume 85 Issue C, November 2015
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

We propose two heuristics for the bipartite matching problem that are amenable to shared-memory parallelization. The first heuristic is very intriguing from a parallelization perspective. It has no significant algorithmic synchronization overhead and no conflict resolution is needed across threads. We show that this heuristic has an approximation ratio of ...
Keywords: Approximation algorithm, Shared memory parallelism, Matching, Bipartite graphs

6 published by ACM
September 2015 BCB '15: Proceedings of the 6th ACM Conference on Bioinformatics, Computational Biology and Health Informatics
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 12,   Downloads (Overall): 51

Full text available: PDFPDF
A successful method to address disease-specific module discovery is the integration of the gene expression data with the protein-protein interaction (PPI) network. Although many algorithms have been developed for this purpose, they focus only on the network genes (mostly on the well-connected ones); totally neglecting the genes whose interactions are ...
Keywords: microRNA, PPI network, active modules

7
August 2015 Parallel Computing: Volume 47 Issue C, August 2015
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

We propose a distributed memory framework for incremental closeness centrality computation.We parallelize different components of the framework for faster solution.Vectorization is applied to make the computation faster.All the algorithms and techniques are experimentally validated.Our framework proves to be practical for real time scenarios. Networks are commonly used to model traffic ...
Keywords: Cluster computing, Parallel programming, Incremental centrality, BFS, Closeness centrality

8
May 2015 IPDPS '15: Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

Considering the large number of processors and the size of the interconnection networks on exactable-capable supercomputers, mapping concurrently executable and communicating tasks of an application is complex problem that needs to be dealt with care. For parallel applications, the communication overhead can be a significant bottleneck on scalability. Topology-aware task-mapping ...
Keywords: Task mapping, communication graph, partitioning

9
March 2015 Journal of Parallel and Distributed Computing: Volume 77 Issue C, March 2015
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 7

We investigate hypergraph partitioning-based methods for efficient parallelization of communicating tasks. A good partitioning method should divide the load among the processors as evenly as possible and minimize the inter-processor communication overhead. The total communication volume is the most popular communication overhead metric which is reduced by the existing state-of-the-art ...
Keywords: Partitioning, Graph, Hypergraph, Load balancing

10
February 2015 Journal of Parallel and Distributed Computing: Volume 76 Issue C, February 2015
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 4

Centrality metrics such as betweenness and closeness have been used to identify important nodes in a network. However, it takes days to months on a high-end workstation to compute the centrality of today's networks. The main reasons are the size and the irregular structure of these networks. While today's computing ...
Keywords: Intel Xeon Phi, BFS, Betweenness centrality, Closeness centrality, Vectorization, CPU, GPU

11 published by ACM
December 2014 ACM Transactions on Intelligent Systems and Technology (TIST) - Special Sections on Diversity and Discovery in Recommender Systems, Online Advertising and Regular Papers: Volume 5 Issue 4, January 2015
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 8,   Downloads (12 Months): 39,   Downloads (Overall): 291

Full text available: PDFPDF
Literature search is one of the most important steps of academic research. With more than 100,000 papers published each year just in computer science, performing a complete literature search becomes a Herculean task. Some of the existing approaches and tools for literature search cannot compete with the characteristics of today’s ...
Keywords: Bibliographic search, direction awareness, diversity

12
May 2014 IPDPS '14: Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

We propose two heuristics for the bipartite matching problem that are amenable to shared-memory parallelization. The first heuristic is very intriguing from parallelization perspective. It has no significant algorithmic synchronization overhead and no conflict resolution is needed across threads. We show that this heuristic has an approximation ratio of around ...
Keywords: bipartite matching, approximation algorithms, parallel algorithms

13
May 2014 IPDPSW '14: Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

The revolution in high-throughput sequencing technologies accelerated the discovery and extraction of various genomic sequences. However, the massive size of the generated datasets raise several computational problems. For example, aligning the sequences or finding the similar regions in them, which is one of the crucial steps in many bioinformatics pipelines, ...
Keywords: maximal exact matches, GPUs, parallel programming, indexing

14
May 2014 IPDPSW '14: Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 3

Centrality metrics have shown to be highly correlated with the importance and loads of the nodes in a network. Given the scale of today's social networks, it is essential to use efficient algorithms and high performance computing techniques for their fast computation. In this work, we exploit hardware and software ...
Keywords: Centrality, closeness centrality, vectorization, breadth-first search, Intel Xeon Phi

15
March 2014 Journal of Computational and Applied Mathematics: Volume 259, March, 2014
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

In this paper, we propose a new threshold scheme for the Digital Signature Standard (DSS) using Asmuth-Bloom secret sharing based on the Chinese Remainder Theorem (CRT). To achieve the desired result, we first show how to realize certain other threshold primitives using Asmuth-Bloom secret sharing, such as joint random secret ...
Keywords: Threshold cryptography, DSS, Function sharing, Asmuth-Bloom secret sharing

16
October 2013 ICPP '13: Proceedings of the 2013 42nd International Conference on Parallel Processing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

We design, develop, and evaluate an atomic- and lock-free GPU implementation of the push-relabel algorithm in the context of finding maximum cardinality matchings in bipartite graphs. The problem has applications on computer science, scientific computing, bioinformatics, and other areas. Although the GPU parallelization of the push-relabel technique has been investigated ...
Keywords: Push-relabel, GPU, maximum cardinality matchings, bipartite graphs

17
October 2013 ICPP '13: Proceedings of the 2013 42nd International Conference on Parallel Processing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

The data one needs to cope to solve today's problems is large scale, so are the graphs and hyper graphs used to model it. Today, we have Big Data, big graphs, big matrices, and in the future, they are expected to be bigger and more complex. Many of today's algorithms ...
Keywords: Hypergraph sparsification, hypergraph partitioning, multi-level approach, identical nets, identical vertices, Jaccard similarity

18 published by ACM
September 2013 BCB'13: Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 28,   Downloads (Overall): 186

Full text available: PDFPDF
Fast and robust algorithms and aligners have been developed to help the researchers in the analysis of genomic data whose size has been dramatically increased in the last decade due to the technological advancements in DNA sequencing. It was not only the size, but the characteristics of the data have ...
Keywords: GPUs, Sequence alignment, parallel programming, indexing

19 published by ACM
September 2013 BCB'13: Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 11,   Downloads (Overall): 137

Full text available: PDFPDF
Integrating protein-protein interaction networks with gene expression data to extract active subnetworks is shown to be promising in detecting meaningful biomarkers for cancer and other diseases. Lately, the RNA-Seq technology became the new standard for gene expression. Existing algorithms either cannot handle the RNA-Seq data or return large subnetworks which ...
Keywords: Active subnetworks, p-value, RNA-Seq, PageRank

20
August 2013 Euro-Par'13: Proceedings of the 19th international conference on Parallel Processing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer science, scientific computing, bioinformatics, and other areas. To the best of our knowledge, ours is the first study which focuses on the GPU implementation of ...
Keywords: bipartite graphs, maximum cardinality matchings, GPU, breadth-first search



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us