Zobrazeno 1 - 10
of 2 576
pro vyhledávání: '"Abrahamsen, P."'
We introduce and study a strict monotonicity property of the norm in solid Banach lattices of real functions that prevents such spaces from having the local diameter two property. Then we show that any strictly convex 1-symmetric norm on $\ell_\infty
Externí odkaz:
http://arxiv.org/abs/2410.18473
Autor:
Abrahamsen, Mikkel
We introduce the algorithm ExpoSort, a groundbreaking method that sorts an array of $n$ numbers in a spectacularly inefficient $\Theta(2^n)$ time. ExpoSort proudly claims the title of the first reluctant algorithm to decisively surpass the quasi-poly
Externí odkaz:
http://arxiv.org/abs/2409.00794
Autor:
Abrahamsen, Mikkel, Halperin, Dan
Robots sense, move and act in the physical world. It is therefore natural that algorithmic problems in robotics and automation have a geometric component, often central to the problem. Below we review ten challenging problems at the intersection of r
Externí odkaz:
http://arxiv.org/abs/2408.12657
In the online sorting problem, $n$ items are revealed one by one and have to be placed (immediately and irrevocably) into empty cells of a size-$n$ array. The goal is to minimize the sum of absolute differences between items in consecutive cells. Thi
Externí odkaz:
http://arxiv.org/abs/2406.19257
Autor:
Abrahamsen, Mikkel, Stade, Jack
We show that packing axis-aligned unit squares into a simple polygon $P$ is NP-hard, even when $P$ is an orthogonal and orthogonally convex polygon with half-integer coordinates. It has been known since the early 80s that packing unit squares into a
Externí odkaz:
http://arxiv.org/abs/2404.09835
Publikováno v:
J. Comput. Phys. 516 (2024) 113351
Neural network wavefunctions optimized using the variational Monte Carlo method have been shown to produce highly accurate results for the electronic structure of atoms and small molecules, but the high cost of optimizing such wavefunctions prevents
Externí odkaz:
http://arxiv.org/abs/2401.10190
Given a set of $n$ points in the Euclidean plane, the $k$-MinSumRadius problem asks to cover this point set using $k$ disks with the objective of minimizing the sum of the radii of the disks. After a long line of research on related problems, it was
Externí odkaz:
http://arxiv.org/abs/2312.08803
We devise a polynomial-time algorithm for partitioning a simple polygon $P$ into a minimum number of star-shaped polygons. The question of whether such an algorithm exists has been open for more than four decades [Avis and Toussaint, Pattern Recognit
Externí odkaz:
http://arxiv.org/abs/2311.10631
Autor:
Agnes Lindholm, Marie-Louise Abrahamsen, Kristian Buch-Larsen, Djordje Marina, Michael Andersson, Jørn Wulff Helge, Peter Schwarz, Flemming Dela, Linn Gillberg
Publikováno v:
Breast Cancer Research, Vol 26, Iss 1, Pp 1-11 (2024)
Abstract Background Breast cancer patients have an increased risk of cardiometabolic disease and for many patients, adjuvant therapy causes an altered lipid profile, insulin resistance and inflammation. Previous follow-up studies are inconclusive reg
Externí odkaz:
https://doaj.org/article/49417ec44aee4dfd9742364fa634144d
Publikováno v:
Discover Education, Vol 3, Iss 1, Pp 1-14 (2024)
Abstract In this article, we analyze the relationship between class sizes and examination results in higher education. Data from the University of Stavanger, collected in the Common Student System (FS) in the period from 2011 to 2021, shows that ther
Externí odkaz:
https://doaj.org/article/8339abbfbe9d4a2985f2bdfe5df36195