Zobrazeno 1 - 10
of 96
pro vyhledávání: '"Kamer Kaya"'
Autor:
Mirmeysam Rafiei Anamagh, Kaya Gokalp, Taha Atahan Akyıldız, Salih Alan, Kamer Kaya, Bekir Bediz
Publikováno v:
Engineering Analysis with Boundary Elements. 147:181-194
Publikováno v:
Information Sciences. 574:162-175
Synchronizing sequences for large-scale automata have gained popularity recently due to their practical use cases especially to have a faster and better testing process. In many applications, shorter sequences imply less overhead and faster processin
Autor:
Gokhan Gokturk, Kamer Kaya
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 32:1001-1013
Influence maximization (IM) is the problem of finding a seed vertex set which is expected to incur the maximum influence spread on a graph. It has various applications in practice such as devising an effective and efficient approach to disseminate in
Autor:
Kamer Kaya
Publikováno v:
Volume: 27, Issue: 6 4284-4297
Turkish Journal of Electrical Engineering and Computer Science
Turkish Journal of Electrical Engineering and Computer Science
The permanent is an important characteristic of a matrix and it has been used in many applications. Unfortunately, it is a hard to compute and hard to approximate the immanant. For dense/full matrices, the fastest exact algorithm, Ryser, has O($2^{n-
Autor:
Joao Mourinho, Angel Lagares, Aysegul Turupcu, Alda Canito, Kamer Kaya, Huseyin Karabulut, Serkan Tosun, Marta Fernandes, Goreti Marreiros
Publikováno v:
IECON
Predictive maintenance requires the constant monitorization of equipment and the accumulation of data captured from sensors, industrial equipment, and existing management software. This data must be cleaned and processed before being used to train ma
Publikováno v:
Concurrency and Computation: Practice and Experience. 34
Publikováno v:
IEEE BigData
We propose novel and differentially private versions of Count Sketch, particularly suited for dynamic, intermittent queries for observed frequencies of elements in a universal set. Our algorithms are designed for scenarios where the queries are made
Publikováno v:
IEEE BigData
A significant portion of the data today, e.g, social networks, web connections, etc., can be modeled by graphs. A proper analysis of graphs with Machine Learning (ML) algorithms has the potential to yield far-reaching insights into many areas of rese
Publikováno v:
SIU
Graph coloring is a fundamental problem in combinatorics with many applications in practice. In this problem, the vertices in a given graph must be colored by using the least number of colors in such a way that a vertex has a different color than its
Publikováno v:
ICPP
In graph embedding, the connectivity information of a graph is used to represent each vertex as a point in a d-dimensional space. Unlike the original, irregular structural information, such a representation can be used for a multitude of machine lear