Zobrazeno 1 - 10
of 13 229
pro vyhledávání: '"Suciu, A."'
The tensor programming abstraction has become a foundational paradigm for modern computing. This framework allows users to write high performance programs for bulk computation via a high-level imperative interface. Recent work has extended this parad
Externí odkaz:
http://arxiv.org/abs/2408.14706
Autor:
Scheerer, Jan Luca, Lykov, Anton, Kayali, Moe, Fountalis, Ilias, Olteanu, Dan, Vasiloglou, Nikolaos, Suciu, Dan
We demonstrate QirK, a system for answering natural language questions on Knowledge Graphs (KG). QirK can answer structurally complex questions that are still beyond the reach of emerging Large Language Models (LLMs). It does so using a unique combin
Externí odkaz:
http://arxiv.org/abs/2408.07494
Autor:
Gassiat, Paul, Suciu, Florin
We consider the (sub-Riemannian type) control problem of finding a path going from an initial point $x$ to a target point $y$, by only moving in certain admissible directions. We assume that the corresponding vector fields satisfy the bracket-generat
Externí odkaz:
http://arxiv.org/abs/2407.11817
The purpose of the paper is to examine the perceptions of entrepreneurship of graduate students enrolled in a digital-oriented entrepreneurship course, focusing on the challenges and opportunities related to starting a business. In today's digital er
Externí odkaz:
http://arxiv.org/abs/2407.10367
Graph workloads pose a particularly challenging problem for query optimizers. They typically feature large queries made up of entirely many-to-many joins with complex correlations. This puts significant stress on traditional cardinality estimation me
Externí odkaz:
http://arxiv.org/abs/2405.06767
We analyze how well pre-trained large language models (e.g., Llama2, GPT-4, Claude 3, etc) can do linear and non-linear regression when given in-context examples, without any additional training or gradient updates. Our findings reveal that several l
Externí odkaz:
http://arxiv.org/abs/2404.07544
Autor:
Suciu, Alexander I.
A complex hyperplane arrangement $\mathcal{A}$ is said to be decomposable if there are no elements in the degree 3 part of its holonomy Lie algebra besides those coming from the rank 2 flats. When this purely combinatorial condition is satisfied, it
Externí odkaz:
http://arxiv.org/abs/2404.04784
Autor:
Suciu, Alexandru I.
Publikováno v:
Revue Roumaine de Math\'ematiques Pures et Appliqu\'ees 69 (2024), no. 2, 235-293
Each complex hyperplane arrangement gives rise to a Milnor fibration of its complement. Although the Betti numbers of the Milnor fiber $F$ can be expressed in terms of the jump loci for rank 1 local systems on the complement, explicit formulas are st
Externí odkaz:
http://arxiv.org/abs/2402.03619
In recent years, several information-theoretic upper bounds have been introduced on the output size and evaluation cost of database join queries. These bounds vary in their power depending on both the type of statistics on input relations and the que
Externí odkaz:
http://arxiv.org/abs/2402.02001
Numerical solutions for flows in partially saturated porous media pose challenges related to the non-linearity and elliptic-parabolic degeneracy of the governing Richards' equation. Iterative methods are therefore required to manage the complexity of
Externí odkaz:
http://arxiv.org/abs/2402.00194