English
Related papers

Related papers: MazeNet: An Accurate, Fast, and Scalable Deep Lear…

200 papers

Following the great success of Machine Learning (ML), especially Deep Neural Networks (DNNs), in many research domains in 2010s, several ML-based approaches were proposed for detection in large inverse linear problems, e.g., massive MIMO…

Signal Processing · Electrical Eng. & Systems 2021-10-22 Edgar Beck , Carsten Bockelmann , Armin Dekorsy

Symbol detection for Massive Multiple-Input Multiple-Output (MIMO) is a challenging problem for which traditional algorithms are either impractical or suffer from performance limitations. Several recently proposed learning-based approaches…

Signal Processing · Electrical Eng. & Systems 2019-06-12 Mehrdad Khani , Mohammad Alizadeh , Jakob Hoydis , Phil Fleming

In this work we consider the Metric Steiner Forest problem in the sublinear time model. Given a set $V$ of $n$ points in a metric space where distances are provided by means of query access to an $n\times n$ distance matrix, along with a…

Data Structures and Algorithms · Computer Science 2025-10-14 Sepideh Mahabadi , Mohammad Roghani , Jakub Tarnawski , Ali Vakilian

Moir\'e patterns, caused by frequency aliasing between fine repetitive structures and a camera sensor's sampling process, have been a significant obstacle in various real-world applications, such as consumer photography and industrial…

Computer Vision and Pattern Recognition · Computer Science 2025-07-31 Seungryong Lee , Woojeong Baek , Younghyun Kim , Eunwoo Kim , Haru Moon , Donggon Yoo , Eunbyung Park

The Steiner tree problem aims to determine a minimum edge-weighted tree that spans a given set of terminal vertices from a given graph. In the past decade, a considerable number of algorithms have been developed to solve this…

Data Structures and Algorithms · Computer Science 2024-08-23 Ming Sun , Xinyu Wu , Yi Zhou , Jin-Kao Hao , Zhang-Hua Fu

The scalable solution of large sparse linear systems is a bottleneck in scientific computing and graph analysis. While algebraic multigrid (AMG) offers optimal linear scaling, its performance is severely constrained by the trade-off between…

Machine Learning · Computer Science 2026-05-27 Yali Fink , Ido Ben-Yair , Lars Ruthotto , Eran Treister

Neural networks have enabled state-of-the-art approaches to achieve incredible results on computer vision tasks such as object detection. However, such success greatly relies on costly computation resources, which hinders people with cheap…

Computer Vision and Pattern Recognition · Computer Science 2019-11-28 Chien-Yao Wang , Hong-Yuan Mark Liao , I-Hau Yeh , Yueh-Hua Wu , Ping-Yang Chen , Jun-Wei Hsieh

Despite the rapid progress of neuromorphic computing, inadequate capacity and insufficient representation power of spiking neural networks (SNNs) severely restrict their application scope in practice. Residual learning and shortcuts have…

Neural and Evolutionary Computing · Computer Science 2023-03-13 Yifan Hu , Lei Deng , Yujie Wu , Man Yao , Guoqi Li

DeepONet has recently been proposed as a representative framework for learning nonlinear mappings between function spaces. However, when it comes to approximating solution operators of partial differential equations (PDEs) with…

Numerical Analysis · Mathematics 2024-08-09 Yameng Zhu , Jingrun Chen , Weibing Deng

Recently, deep neural networks (DNNs) have been used extensively for automatic modulation classification (AMC), and the results have been quite promising. However, DNNs have high memory and computation requirements making them impractical…

Information Theory · Computer Science 2023-04-19 Deepsayan Sadhukhan , Nitin Priyadarshini Shankar , Nancy Nayak , Thulasi Tholeti , Sheetal Kalyani

The Planar Steiner Tree problem is one of the most fundamental NP-complete problems as it models many network design problems. Recall that an instance of this problem consists of a graph with edge weights, and a subset of vertices (often…

Data Structures and Algorithms · Computer Science 2018-11-19 Sándor Kisfaludi-Bak , Jesper Nederlof , Erik Jan van Leeuwen

A rectilinear Steiner tree for a set $P$ of points in $\mathbb{R}^2$ is a tree that connects the points in $P$ using horizontal and vertical line segments. The goal of Minimal Rectilinear Steiner Tree is to find a rectilinear Steiner tree…

Computational Geometry · Computer Science 2021-03-16 Henk Alkema , Mark de Berg

In this work, we propose a new training method for finding minimum weight norm solutions in over-parameterized neural networks (NNs). This method seeks to improve training speed and generalization performance by framing NN training as a…

Machine Learning · Statistics 2018-06-22 Yamini Bansal , Madhu Advani , David D Cox , Andrew M Saxe

We consider the problem of embedding the Steiner points of a Steiner tree with given topology into the rectilinear plane. Thereby, the length of the path between a distinguished terminal and each other terminal must not exceed given length…

Data Structures and Algorithms · Computer Science 2015-08-19 Jens Maßberg

Retrieving occlusion relation among objects in a single image is challenging due to sparsity of boundaries in image. We observe two key issues in existing works: firstly, lack of an architecture which can exploit the limited amount of…

Computer Vision and Pattern Recognition · Computer Science 2021-08-19 Panhe Feng , Qi She , Lei Zhu , Jiaxin Li , Lin Zhang , Zijian Feng , Changhu Wang , Chunpeng Li , Xuejing Kang , Anlong Ming

The Steiner Tree problem is a classical problem in combinatorial optimization: the goal is to connect a set $T$ of terminals in a graph $G$ by a tree of minimum size. Karpinski and Zelikovsky (1996) studied the $\delta$-dense version of…

Data Structures and Algorithms · Computer Science 2020-04-30 Marek Karpinski , Mateusz Lewandowski , Syed Mohammad Meesum , Matthias Mnich

Crystal-structure phase mapping is a core, long-standing challenge in materials science that requires identifying crystal structures, or mixtures thereof, in synthesized materials. Materials science experts excel at solving simple systems…

Learning meaningful representations using deep neural networks involves designing efficient training schemes and well-structured networks. Currently, the method of stochastic gradient descent that has a momentum with dropout is one of the…

Machine Learning · Computer Science 2016-01-15 Taehoon Lee , Minsuk Choi , Sungroh Yoon

Class imbalance has emerged as one of the major challenges for medical image segmentation. The model cascade (MC) strategy significantly alleviates the class imbalance issue via running a set of individual deep models for coarse-to-fine…

Computer Vision and Pattern Recognition · Computer Science 2020-04-22 Chenhong Zhou , Changxing Ding , Xinchao Wang , Zhentai Lu , Dacheng Tao

Tree-based models are widely recognized for their interpretability and have proven effective in various application domains, particularly in high-stakes domains. However, learning decision trees (DTs) poses a significant challenge due to…

Machine Learning · Computer Science 2026-03-13 Sascha Marton