English
Related papers

Related papers: On d-ary tree algorithms with successive interfere…

200 papers

To analyze complex and heterogeneous real-time embedded systems, recent works have proposed interface techniques between real-time calculus (RTC) and timed automata (TA), in order to take advantage of the strengths of each technique for…

Performance · Computer Science 2010-06-29 Karine Altisen , Yanhong Liu , Matthieu Moy

To analyze complex and heterogeneous real-time embedded systems, recent works have proposed interface techniques between real-time calculus (RTC) and timed automata (TA), in order to take advantage of the strengths of each technique for…

Performance · Computer Science 2010-04-16 Karine Altisen , Yanhong Liu , Matthieu Moy

We investigate fully asynchronous unsourced random access (URA), and propose a high-performing scheme that employs on-off division multiple access (ODMA). In this scheme, active users distribute their data over the transmit block based on a…

Signal Processing · Electrical Eng. & Systems 2025-04-16 Mert Ozates , Mohammad Kazemi , Gianluigi Liva , Deniz Gündüz

In this paper, the problem of using uncoordinated multiple access (UMA) to serve a massive amount of heterogeneous users is investigated. Leveraging the heterogeneity, we propose a novel UMA protocol, called iterative collision resolution…

Information Theory · Computer Science 2020-12-25 Yu-Chih Huang , Shin-Lin Shieh , Yu-Pin Hsu , Hao-Ping Cheng

Reliable communication over bandlimited and non-linear channels usually requires equalization to simplify receiver processing. Equalizers that perform joint detection and decoding (JDD) achieve the highest information rates but are often…

Information Theory · Computer Science 2024-08-28 Daniel Plabst , Tobias Prinz , Francesca Diedolo , Thomas Wiegart , Georg Böcherer , Norbert Hanik , Gerhard Kramer

We consider the reachability problem for timed automata. A standard solution to this problem involves computing a search tree whose nodes are abstractions of zones. For efficiency reasons, they are parametrized by the maximal lower and…

Logic in Computer Science · Computer Science 2013-01-21 Frédéric Herbreteau , B. Srivathsan , Igor Walukiewicz

In their seminal paper [Sleator and Tarjan, J.ACM, 1985], the authors conjectured that the splay tree is dynamically optimal binary search tree (BST). In spite of decades of intensive research, the problem remains open. Perhaps a more basic…

Data Structures and Algorithms · Computer Science 2016-04-26 Navin Goyal , Manoj Gupta

We introduce a large-scale benchmark for broad- and narrow-phase continuous collision detection (CCD) over linearized trajectories with exact time of impacts and use it to evaluate the accuracy, correctness, and efficiency of 13…

Graphics · Computer Science 2025-06-10 David Belgrod , Bolun Wang , Zachary Ferguson , Xin Zhao , Marco Attene , Daniele Panozzo , Teseo Schneider

Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in various other algorithms, such as the bi-connectivity and the…

Data Structures and Algorithms · Computer Science 2021-05-19 Alexander Fedorov , Nikita Koval , Dan Alistarh

A fundamental aspect in performance engineering of wireless networks is optimizing the set of links that can be concurrently activated to meet given signal-to-interference-and-noise ratio (SINR) thresholds. The solution of this…

Information Theory · Computer Science 2015-03-19 Di Yuan , Vangelis Angelakis , Lei Chen , Eleftherios Karipidis , Erik G. Larsson

Time-to-collision (TTC) is a widely used measure for predicting rear-end collisions, assuming constant speed and heading for both vehicles in the prediction horizon. However, this conventional formulation cannot detect sideswipe collisions.…

Robotics · Computer Science 2025-08-11 Abhijeet Behera , Sogol Kharrazi , Erik Frisk , Maytheewat Aramrattana

Slotted Aloha-based Random Access (RA) techniques have recently regained attention in light of the use of Interference Cancellation (IC) as a mean to exploit diversity created through the transmission of multiple burst copies per packet…

Information Theory · Computer Science 2015-01-29 Alessio Meloni , Maurizio Murroni

The random access scheme is a fundamental scenario in which users transmit through a shared channel and cannot coordinate each other. In recent years, successive interference cancellation (SIC) was introduced into the random access scheme.…

Information Theory · Computer Science 2018-04-16 Tomokazu Emoto , Takayuki Nozaki

This paper analyses the performance of reconfigurable intelligent surface (RIS)-assisted device-to-device (D2D) communication systems, focusing on addressing co-channel interference, a prevalent issue due to the frequency reuse of sidelink…

Signal Processing · Electrical Eng. & Systems 2024-11-15 Hamid Amiriara , Farid Ashtiani , Mahtab Mirmohseni , Masoumeh Nasiri-Kenari , Behrouz Maham

Analog self-interference cancellation (A-SIC) plays a crucial role in the implementation of in-band full-duplex (IBFD) radios, due to the fact that the inherent transmit (Tx) noise can only be addressed in the analog domain. It is thus…

Signal Processing · Electrical Eng. & Systems 2025-05-19 Limin Liao , Jun Sun , Junzhi Wang , Yingzhuang Liu

The fifth generation (5G) wireless system has a platform-driven approach, aiming to support heterogeneous connections with very diverse requirements. The shared wireless resources should be sliced in a way that each user perceives that its…

Information Theory · Computer Science 2020-10-30 Israel Leyva-Mayorga , Federico Chiariotti , Čedomir Stefanović , Anders E. Kalør , Petar Popovski

We introduce a simple yet powerful and versatile analytical framework to approximate the SIR distribution in the downlink of cellular systems. It is based on the mean interference-to-signal ratio and yields the horizontal gap (SIR gain)…

Information Theory · Computer Science 2014-06-12 Martin Haenggi

We study downlink delay minimization within the context of cellular user association policies that map mobile users to base stations. We note the delay minimum user association problem fits within a broader class of network utility…

Information Theory · Computer Science 2015-10-08 Jeffrey Wildman , Yusuf Osmanlioglu , Steven Weber , Ali Shokoufandeh

Interference mitigation techniques are essential for improving the performance of interference limited wireless networks. In this paper, we introduce novel interference mitigation schemes for wireless cellular networks with space division…

Information Theory · Computer Science 2014-08-18 Martin Kasparick , Gerhard Wunder

Frequent temporal patterns discovered in time-interval-based multivariate data, although syntactically correct, might be non-transparent: For some pattern instances, there might exist intervals for the same entity that contradict the…

Machine Learning · Computer Science 2021-01-12 Alexander Shknevsky , Yuval Shahar , Robert Moskovitch
‹ Prev 1 4 5 6 7 8 10 Next ›