Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Sinop, Ali"'
Autor:
Karntikoon, Kritkorn, Shen, Yiheng, Gollapudi, Sreenivas, Kollias, Kostas, Schild, Aaron, Sinop, Ali
Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the information required to specify the relevant optimization problem is noisy, unc
Externí odkaz:
http://arxiv.org/abs/2403.10640
Autor:
Shirzad, Hamed, Velingker, Ameya, Venkatachalam, Balaji, Sutherland, Danica J., Sinop, Ali Kemal
Graph transformers have emerged as a promising architecture for a variety of graph learning and representation tasks. Despite their successes, though, it remains challenging to scale graph transformers to large graphs while maintaining accuracy compe
Externí odkaz:
http://arxiv.org/abs/2303.06147
Graph Neural Networks (GNNs) have emerged as a powerful technique for learning on relational data. Owing to the relatively limited number of message passing steps they perform -- and hence a smaller receptive field -- there has been significant inter
Externí odkaz:
http://arxiv.org/abs/2206.11941
We initiate the study of spectral generalizations of the graph isomorphism problem. (a)The Spectral Graph Dominance (SGD) problem: On input of two graphs $G$ and $H$ does there exist a permutation $\pi$ such that $G\preceq \pi(H)$? (b) The Spectrally
Externí odkaz:
http://arxiv.org/abs/1805.00181
Autor:
Sinop, Ali Kemal
A basic problem in spectral clustering is the following. If a solution obtained from the spectral relaxation is close to an integral solution, is it possible to find this integral solution even though they might be in completely different basis? In t
Externí odkaz:
http://arxiv.org/abs/1503.00827
The Euclidean $k$-means problem is a classical problem that has been extensively studied in the theoretical computer science, machine learning and the computational geometry communities. In this problem, we are given a set of $n$ points in Euclidean
Externí odkaz:
http://arxiv.org/abs/1502.03316
We present an approximation scheme for minimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. This framework includes well known graph problems such as Minimum graph bis
Externí odkaz:
http://arxiv.org/abs/1312.3024
We give a new $(1+\epsilon)$-approximation for sparsest cut problem on graphs where small sets expand significantly more than the sparsest cut (sets of size $n/r$ expand by a factor $\sqrt{\log n\log r}$ bigger, for some small $r$; this condition hol
Externí odkaz:
http://arxiv.org/abs/1304.3365
Convex relaxations based on different hierarchies of linear/semi-definite programs have been used recently to devise approximation algorithms for various optimization problems. The approximation guarantee of these algorithms improves with the number
Externí odkaz:
http://arxiv.org/abs/1207.4372
Partitioning the vertices of a graph into two roughly equal parts while minimizing the number of edges crossing the cut is a fundamental problem (called Balanced Separator) that arises in many settings. For this problem, and variants such as the Unif
Externí odkaz:
http://arxiv.org/abs/1202.6071