English
Related papers

Related papers: Horn Binary Serialization Analysis

200 papers

The problem of separating structured information representing phenomena of differing natures is considered. A structure is assumed to be independent of the others if can be represented in a complementary subspace. When the concomitant…

Mathematical Physics · Physics 2015-05-13 Laura Rebollo-Neira , A. PLastino

In this work, we study the arbitrarily varying broadcast channel (AVBC), when state information is available at the transmitter in a causal manner. We establish inner and outer bounds on both the random code capacity region and the…

Information Theory · Computer Science 2017-09-19 Uzi Pereg , Yossef Steinberg

We assume a second-order source separation model where the observed multivariate time series is a linear mixture of latent, temporally uncorrelated time series with some components pure white noise. To avoid the modelling of noise, we…

Methodology · Statistics 2019-05-07 Markus Matilainen , Klaus Nordhausen , Joni Virta

Argumentation frameworks (AFs) provide formal approaches for legal reasoning, but identifying sources of ambiguity and explaining argument acceptance remains challenging for non-experts. We present AF-XRAY, an open-source toolkit for…

Artificial Intelligence · Computer Science 2025-07-16 Yilin Xia , Heng Zheng , Shawn Bowers , Bertram Ludäscher

Verification of temporal logic properties plays a crucial role in proving the desired behaviors of hybrid systems. In this paper, we propose an interval method for verifying the properties described by a bounded linear temporal logic. We…

Logic in Computer Science · Computer Science 2015-07-15 Daisuke Ishii , Naoki Yonezaki , Alexandre Goldsztejn

Determining whether an unordered collection of overlapping substrings (called shingles) can be uniquely decoded into a consistent string is a problem that lies within the foundation of a broad assortment of disciplines ranging from…

Discrete Mathematics · Computer Science 2012-04-17 Aryeh Kontorovich , Ari Trachtenberg

Low-dimensional embeddings are a cornerstone in the modelling and analysis of complex networks. However, most existing approaches for mining network embedding spaces rely on computationally intensive machine learning systems to facilitate…

Social and Information Networks · Computer Science 2024-10-04 Alexandros Xenos , Noel-Malod Dognin , Natasa Przulj

We study the understanding of deep neural networks from the scope in which they are trained on. While the accuracy of these models is usually impressive on the aggregate level, they still make mistakes, sometimes on cases that appear to be…

Machine Learning · Computer Science 2023-12-12 Roozbeh Yousefzadeh

In this work, we study the problem of detecting periodic trends in strings. While detecting exact periodicity has been studied extensively, real-world data is often noisy, where small deviations or mismatches occur between repetitions. This…

Data Structures and Algorithms · Computer Science 2025-09-22 Taha El Ghazi , Tatiana Starikovskaya

Systems for language understanding have become remarkably strong at overcoming linguistic imperfections in tasks involving phrase matching or simple reasoning. Yet, their accuracy drops dramatically as the number of reasoning steps…

Computation and Language · Computer Science 2020-05-04 Daniel Khashabi , Erfan Sadeqi Azer , Tushar Khot , Ashish Sabharwal , Dan Roth

We study the problem of learning a Bayesian network (BN) of a set of variables when structural side information about the system is available. It is well known that learning the structure of a general BN is both computationally and…

Machine Learning · Computer Science 2021-12-22 Ehsan Mokhtarian , Sina Akbari , Fateme Jamshidi , Jalal Etesami , Negar Kiyavash

This paper focuses on the study of recognizing discontiguous entities. Motivated by a previous work, we propose to use a novel hypergraph representation to jointly encode discontiguous entities of unbounded length, which can overlap with…

Computation and Language · Computer Science 2020-05-28 Aldrian Obaja Muis , Wei Lu

Beyond hallucinations, another problem in program synthesis using LLMs is ambiguity in user intent. We illustrate the ambiguity problem in a networking context for LLM-based incremental configuration synthesis of route-maps and ACLs. These…

Networking and Internet Architecture · Computer Science 2025-07-17 Rajdeep Mondal , Nikolaj Bjorner , Todd Millstein , Alan Tang , George Varghese

Limited capacity of fronthaul links in a cell-free massive multiple-input multiple-output (MIMO) system can cause quantization errors at a central processing unit (CPU) during data transmission, complicating the centralized rate…

Signal Processing · Electrical Eng. & Systems 2024-03-29 Minje Kim , In-soo Kim , Junil Choi

Different layouts can characterize different aspects of the same graph. Finding a "good" layout of a graph is thus an important task for graph visualization. In practice, users often visualize a graph in multiple layouts by using different…

Social and Information Networks · Computer Science 2019-10-16 Oh-Hyun Kwon , Kwan-Liu Ma

We say a string has a cadence if a certain character is repeated at regular intervals, possibly with intervening occurrences of that character. We call the cadence anchored if the first interval must be the same length as the others. We…

Data Structures and Algorithms · Computer Science 2016-10-12 Amihood Amir , Alberto Apostolico , Travis Gagie , Gad M. Landau

The paper introduces mixed networks, a new framework for expressing and reasoning with probabilistic and deterministic information. The framework combines belief networks with constraint networks, defining the semantics and graphical…

Artificial Intelligence · Computer Science 2012-07-19 Rina Dechter , Robert Mateescu

Deep learning has boosted the performance of many music information retrieval (MIR) systems in recent years. Yet, the complex hierarchical arrangement of music makes end-to-end learning hard for some MIR tasks - a very deep and flexible…

Sound · Computer Science 2018-12-11 Anders Elowsson

In this paper, we consider the streaming memory-limited matrix completion problem when the observed entries are noisy versions of a small random fraction of the original entries. We are interested in scenarios where the matrix size is very…

Spectral Theory · Mathematics 2015-04-14 Se-Young Yun , Marc Lelarge , Alexandre Proutiere

We present a framework to analyze color documents of complex layout. In addition, no assumption is made on the layout. Our framework combines in a content-driven bottom-up approach two different sources of information: textual and spatial.…

Computation and Language · Computer Science 2007-05-23 Marco Aiello , Christof Monz , Leon Todoran