Related papers: Coupling Light with Matter for Identifying Dominan…
Enumerating minimal transversals in a hypergraph is a notoriously hard problem. It can be reduced to enumerating minimal dominating sets in a graph, in fact even to enumerating minimal dominating sets in an incomparability graph. We provide…
This thesis explores experimental and theoretical approaches to dark matter detection, from gas-based detectors to quantum sensors, tackling the challenge of identifying dark matter, which makes up 27% of the Universe's energy. It reviews…
We study the probing prospects of cosmic ray boosted dark matter (DM) in the framework of simplified electron-philic dark photon model. Focusing on the dark matter and dark photon masses around keV $\sim $ MeV scale, we consider the bounds…
In this paper, the uplink adaptation for massive multiple-input-multiple-output (MIMO) networks without the knowledge of user density is considered. Specifically, a novel cooperative uplink transmission and detection scheme is first…
Deep neural networks (DNNs), as the basis of object detection, will play a key role in the development of future autonomous systems with full autonomy. The autonomous systems have special requirements of real-time, energy-efficient…
Co-salient object detection, with the target of detecting co-existed salient objects among a group of images, is gaining popularity. Recent works use the attention mechanism or extra information to aggregate common co-salient features,…
We consider optimal experimental design (OED) problems in selecting the most informative observation sensors to estimate model parameters in a Bayesian framework. Such problems are computationally prohibitive when the…
Automatic Check-Out (ACO) receives increased interests in recent years. An important component of the ACO system is the visual item counting, which recognizes the categories and counts of the items chosen by the customers. However, the…
Optimal symbol detection for multiple-input multiple-output (MIMO) systems is known to be an NP-hard problem. Conventional heuristic algorithms are either too complex to be practical or suffer from poor performance. Recently, several…
A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.…
Gradient networks can be used to model the dominant structure of complex networks. Previous works have focused on random gradient networks. Here we study gradient networks that minimize jamming on substrate networks with scale-free and…
Massive MIMO systems can greatly increase spectral and energy efficiency over traditional MIMO systems by exploiting large antenna arrays. However, increasing the number of antennas at the base station (BS) makes the uplink non-coherent…
We study the geometry of deep (neural) networks (DNs) with piecewise affine and convex nonlinearities. The layers of such DNs have been shown to be {\em max-affine spline operators} (MASOs) that partition their input space and apply a…
We study the parameterized complexity of domination-type problems. (sigma,rho)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G is (sigma,rho)-dominating if for any v in D, |N(v)\cap D| in…
We investigate a WIMP dark matter (DM) candidate in the form of a singlino-dominated lightest supersymmetric particle (LSP) within the $Z_3$-symmetric Next-to-Minimal Supersymmetric Standard Model (NMSSM). This framework gives rise to…
We take a new perspective on the weighted sum-rate maximization in multiple-input multiple-output (MIMO) interference networks, by formulating an equivalent max-min problem. This seemingly trivial reformulation has significant implications:…
To maximize the accuracy of background simulation and event reconstruction, high-energy neutrino telescopes require detailed knowledge of light propagation over a large volume of detection medium. If light scattering and absorption leng ths…
In this paper, we tackle the problem of multi-cell resource scheduling, where the objective is to maximize the weighted sum-rate through inter-cell interference coordination (ICIC). The blanking method is used to mitigate the inter-cell…
Information about quantum phase transitions in conventional condensed matter systems, must be sought by probing the matter system itself. By contrast, we show that mixed matter-light systems offer a distinct advantage in that the photon…
We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) $r$-Domination problem and the (Connected) $p$-Center problem for unweighted and undirected graphs. Given a graph $G$, we show how to…