1k citations
- Sungkyunkwan UniversityKR27 papers
- Ruhr University BochumDE26 papers
- Centre National de la Recherche ScientifiqueFR14 papers
- KTH Royal Institute of TechnologySE12 papers
- Stockholm UniversitySE12 papers
- Novo Nordisk (Denmark)DK10 papers
- Rutherford Appleton LaboratoryGB9 papers
- Chalmers University of TechnologySE6 papers
- AlbaNovaSE5 papers
- Instituto Superior TécnicoPT5 papers
- University of RochesterUS5 papers
- Uppsala UniversitySE5 papers
18 papers · 1 filter
Linnea: Automatic Generation of Efficient Linear Algebra Programs
Henrik Barthels, Christos Psarras, Paolo Bientinesi
The translation of linear algebra computations into efficient sequences of library calls is a non-trivial task that requires expertise in both linear algebra and high-performance c…
Functional marked point processes -- A natural structure to unify spatio-temporal frameworks and to analyse dependent functional data
Ottmar Cronie, Mohammad Ghorbani, Jorge Mateu +1
This paper treats functional marked point processes (FMPPs), which are defined as marked point processes where the marks are random elements in some (Polish) function space. Such m…
End-to-End Cascaded U-Nets with a Localization Network for Kidney Tumor Segmentation
Minh H. Vu, Guus Grimbergen, Attila Simkó +2
Kidney tumor segmentation emerges as a new frontier of computer vision in medical imaging. This is partly due to its challenging manual annotation and great medical impact. Within…
General Perfect Fluid Perturbations of Homogeneous and Orthogonal Locally Rotationally Symmetric Class II Cosmologies
Robin Törnkvist, Michael Bradley
First order perturbations of homogeneous and hypersurface orthogonal LRS (Locally Rotationally Symmetric) class II cosmologies with a cosmological constant are considered in the fr…
Biased random k-SAT
Joel Larsson, Klas Markström
The basic random -SAT problem is: Given a set of Boolean variables, and clauses of size picked uniformly at random from the set of all such clauses on our variables,…
On restricted colorings of -edge colorable graphs
Lan Anh Pham
A cycle is -colored if its edges are properly colored by two distinct colors. A -edge colorable graph is a -regular graph that admits a proper -edge coloring in…