Zobrazeno 1 - 10
of 4 770
pro vyhledávání: '"Tunçel A."'
Autor:
Friedman, Ray, Cho, Jaewoo, Brett, Jeanne, Zhan, Xuhui, Han, Ningyu, Kannan, Sriram, Ma, Yingxiang, Spencer-Smith, Jesse, Jäckel, Elisabeth, Zerres, Alfred, Hooper, Madison, Babbit, Katie, Acharya, Manish, Adair, Wendi, Aslani, Soroush, Aykaç, Tayfun, Bauman, Chris, Bennett, Rebecca, Brady, Garrett, Briggs, Peggy, Dowie, Cheryl, Eck, Chase, Geiger, Igmar, Jacob, Frank, Kern, Molly, Lee, Sujin, Liu, Leigh Anne, Liu, Wu, Loewenstein, Jeffrey, Lytle, Anne, Ma, Li, Mann, Michel, Mislin, Alexandra, Mitchell, Tyree, Nagler, Hannah Martensen née, Nandkeolyar, Amit, Olekalns, Mara, Paliakova, Elena, Parlamis, Jennifer, Pierce, Jason, Pierce, Nancy, Pinkley, Robin, Prime, Nathalie, Ramirez-Marin, Jimena, Rockmann, Kevin, Ross, William, Semnani-Azad, Zhaleh, Schroeder, Juliana, Smith, Philip, Stimmer, Elena, Swaab, Roderick, Thompson, Leigh, Tinsley, Cathy, Tuncel, Ece, Weingart, Laurie, Wilken, Robert, Yao, JingJing, Zhang, Zhi-Xue
In recent years, Large Language Models (LLM) have demonstrated impressive capabilities in the field of natural language processing (NLP). This paper explores the application of LLMs in negotiation transcript analysis by the Vanderbilt AI Negotiation
Externí odkaz:
http://arxiv.org/abs/2407.21037
We provide a primal-dual framework for randomized approximation algorithms utilizing semidefinite programming (SDP) relaxations. Our framework pairs a continuum of APX-complete problems including MaxCut, Max2Sat, MaxDicut, and more generally, Max-Boo
Externí odkaz:
http://arxiv.org/abs/2406.18670
Autor:
Au, Yu Hin, Tunçel, Levent
We study the lift-and-project rank of the stable set polytopes of graphs with respect to the Lov\'{a}sz--Schrijver SDP operator $\text{LS}_+$, with a particular focus on finding and characterizing the smallest graphs with a given $\text{LS}_+$-rank (
Externí odkaz:
http://arxiv.org/abs/2401.01476
Autor:
Karimi, Mehdi, Tuncel, Levent
Quantum Relative Entropy (QRE) programming is a recently popular and challenging class of convex optimization problems with significant applications in quantum computing and quantum information theory. We are interested in modern interior point (IP)
Externí odkaz:
http://arxiv.org/abs/2312.07438
Autor:
Roshchina, Vera, Tunçel, Levent
Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In this work, we
Externí odkaz:
http://arxiv.org/abs/2312.04419
A rational number is dyadic if it has a finite binary representation $p/2^k$, where $p$ is an integer and $k$ is a nonnegative integer. Dyadic rationals are important for numerical computations because they have an exact representation in floating-po
Externí odkaz:
http://arxiv.org/abs/2309.04601
Autor:
Golpek, Hande Tuncel, Aytac, Aysun
Publikováno v:
Fundamenta Informaticae, Volume 191, Issue 2 (July 8, 2024) fi:11762
Analysis of a network in terms of vulnerability is one of the most significant problems. Graph theory serves as a valuable tool for solving complex network problems, and there exist numerous graph-theoretic parameters to analyze the system's stabilit
Externí odkaz:
http://arxiv.org/abs/2308.11056
Publikováno v:
Journal of Global Responsibility, 2023, Vol. 15, Issue 3, pp. 305-319.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/JGR-04-2023-0070
Publikováno v:
In Food Chemistry 1 February 2025 464 Part 2
Publikováno v:
In Food Research International January 2025 199