Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

Hash tables are one of the oldest and simplest data structures for storing elements and supporting deletions and queries. Invented in 1953, they underly most computational systems. Yet despite their ...

ABSTRACT: A new nano-based architectural design of multiple-stream convolutional homeomorphic error-control coding will be conducted, and a corresponding hierarchical implementation of important class ...

When you log onto LinkedIn, you're normally presented with suggestions to connect with people you know, either because you went to the same university as them, or worked in the same company or ...

ABSTRACT: The excessive computational burden encountered in power market analysis has necessitated the need for obtaining reduced equivalent networks that preserve flows along certain selected lines ...

We study the greedy (exploitation-only) algorithm in bandit problems with a known reward structure. We allow arbitrary finite reward structures, while prior work focused on a few specific ones. We ...

Complicated robotic system solving a dual-arm manipulation task. In the first row, the robot approaches the table with its mobile base to then perform a touch-based alignment. In the second row, the ...

Graph theory is an integral component of algorithm design that underlies sparse matrices, relational databases, and networks. Improving the performance of graph algorithms has direct implications to ...

Abstract: The time and wavelength division multiplexing passive optical network (TWDM-PON) allows numerous users to share a single optical fiber and wavelength. In TWDM-PON, the optical network unit ...