Zobrazeno 1 - 10
of 163 549
pro vyhledávání: '"SINGER, A."'
This report documents the development, test, and application of Large Language Models (LLMs) for automated text analysis, with a specific focus on gambling-like elements in digital games, such as lootboxes. The project aimed not only to analyse user
Externí odkaz:
http://arxiv.org/abs/2412.09345
Autor:
Tsunaki, Lucas, Bauerhenne, Bernd, Xibraku, Malwin, Garcia, Martin E., Singer, Kilian, Naydenov, Boris
Quantum tokens envision to store unclonable authentication keys in quantum states that are issued by a bank for example. In contrast to quantum communication, the information is not transmitted, but rather used for personal authentication in a physic
Externí odkaz:
http://arxiv.org/abs/2412.08530
Autor:
Singer, Neta, Thiery, Theophile
We consider the problem of finding an independent set of maximum weight simultaneously contained in $k$ matroids over a common ground set. This $k$-matroid intersection problem appears naturally in many contexts, for example in generalizing graph and
Externí odkaz:
http://arxiv.org/abs/2411.19366
We explore the use of local algorithms in the design of streaming algorithms for the Maximum Directed Cut problem. Specifically, building on the local algorithm of Buchbinder et al. (FOCS'12) and Censor-Hillel et al. (ALGOSENSORS'17), we develop stre
Externí odkaz:
http://arxiv.org/abs/2411.18829
Multi-source logs provide a comprehensive overview of ongoing system activities, allowing for in-depth analysis to detect potential threats. A practical approach for threat detection involves explicit extraction of entity triples (subject, action, ob
Externí odkaz:
http://arxiv.org/abs/2411.15354
Open-source software serves as a foundation for the internet and the cyber supply chain, but its exploitation is becoming increasingly prevalent. While advances in vulnerability detection for OSS have been significant, prior research has largely focu
Externí odkaz:
http://arxiv.org/abs/2411.14829
In the maximum directed cut problem, the input is a directed graph $G=(V,E)$, and the goal is to pick a partition $V = S \cup (V \setminus S)$ of the vertices such that as many edges as possible go from $S$ to $V\setminus S$. Oblivious algorithms, in
Externí odkaz:
http://arxiv.org/abs/2411.12976
Autor:
Horel, Thibaut, Singer, Yaron
Publikováno v:
Advances in Neural Information Processing Systems 29, NeurIPS 2016, pp. 3045-3053
We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of applications as in many cases errors in evaluation of a submodular function
Externí odkaz:
http://arxiv.org/abs/2411.10949
Human vision is mediated by a complex interconnected network of cortical brain areas jointly representing visual information. While these areas are increasingly understood in isolation, their representational relationships remain elusive. Here we dev
Externí odkaz:
http://arxiv.org/abs/2411.10872
Autor:
O'Donnell, Ryan, Singer, Noah G.
Recent major results in property testing~\cite{BLM24,DDL24} and PCPs~\cite{BMV24} were unlocked by moving to high-dimensional expanders (HDXs) constructed from $\widetilde{C}_d$-type buildings, rather than the long-known $\widetilde{A}_d$-type ones.
Externí odkaz:
http://arxiv.org/abs/2411.05916