Zobrazeno 1 - 10
of 8 261
pro vyhledávání: '"A, Király"'
Autor:
Kiraly, Atilla P., Baur, Sebastien, Philbrick, Kenneth, Mahvar, Fereshteh, Yatziv, Liron, Chen, Tiffany, Sterling, Bram, George, Nick, Jamil, Fayaz, Tang, Jing, Bailey, Kai, Ahmed, Faruk, Goel, Akshay, Ward, Abbi, Yang, Lin, Sellergren, Andrew, Matias, Yossi, Hassidim, Avinatan, Shetty, Shravya, Golden, Daniel, Azizi, Shekoofeh, Steiner, David F., Liu, Yun, Thelin, Tim, Pilgrim, Rory, Kirmizibayrak, Can
Robust medical Machine Learning (ML) models have the potential to revolutionize healthcare by accelerating clinical research, improving workflows and outcomes, and producing novel insights or capabilities. Developing such ML models from scratch is co
Externí odkaz:
http://arxiv.org/abs/2411.15128
Autor:
Hausen, Jürgen, Király, Katharina
We give an explicit description of all quasismooth, rational, projective surfaces of Picard number one that admit a non-trivial torus action and have an integral canonical self intersection number.
Comment: 38 pages
Comment: 38 pages
Externí odkaz:
http://arxiv.org/abs/2411.15079
Autor:
Tschand, Arya, Rajan, Arun Tejusve Raghunath, Idgunji, Sachin, Ghosh, Anirban, Holleman, Jeremy, Kiraly, Csaba, Ambalkar, Pawan, Borkar, Ritika, Chukka, Ramesh, Cockrell, Trevor, Curtis, Oliver, Fursin, Grigori, Hodak, Miro, Kassa, Hiwot, Lokhmotov, Anton, Miskovic, Dejan, Pan, Yuechao, Manmathan, Manu Prasad, Raymond, Liz, John, Tom St., Suresh, Arjun, Taubitz, Rowan, Zhan, Sean, Wasson, Scott, Kanter, David, Reddi, Vijay Janapa
Rapid adoption of machine learning (ML) technologies has led to a surge in power consumption across diverse systems, from tiny IoT devices to massive datacenter clusters. Benchmarking the energy efficiency of these systems is crucial for optimization
Externí odkaz:
http://arxiv.org/abs/2410.12032
As a common generalization of previously solved optimization problems concerning bipartite stable matchings, we describe a strongly polynomial network flow based algorithm for computing $\ell$ disjoint stable matchings with minimum total cost. The ma
Externí odkaz:
http://arxiv.org/abs/2409.04885
Motivated by the real-world problem of international kidney exchange (IKEP), [Bir\'o et al., Generalized Matching Games for International Kidney Exchange, 2019] introduced a generalized transferable utility matching game featuring a partition of the
Externí odkaz:
http://arxiv.org/abs/2409.01452
This paper presents an in-depth exploration of Data Availability Sampling (DAS) and sharding mechanisms within decentralized systems through simulation-based analysis. DAS, a pivotal concept in blockchain technology and decentralized networks, is tho
Externí odkaz:
http://arxiv.org/abs/2407.18085
We investigate weighted settings of popular matching problems with matroid constraints. The concept of popularity was originally defined for matchings in bipartite graphs, where vertices have preferences over the incident edges. There are two standar
Externí odkaz:
http://arxiv.org/abs/2407.09798
In this paper, we study several generalizations of multiway cut where the terminals can be chosen as \emph{representatives} from sets of \emph{candidates} $T_1,\ldots,T_q$. In this setting, one is allowed to choose these representatives so that the m
Externí odkaz:
http://arxiv.org/abs/2407.03877
In this paper, we consider the tractability of the matroid intersection problem under the minimum rank oracle. In this model, we are given an oracle that takes as its input a set of elements, and returns as its output the minimum of the ranks of the
Externí odkaz:
http://arxiv.org/abs/2407.03229
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight spanning tree amo
Externí odkaz:
http://arxiv.org/abs/2407.02958