Related papers: Weighing Obese Timed Languages
We establish statistical properties of random-weighting methods in LASSO regression under different regularization parameters $\lambda_n$ and suitable regularity conditions. The random-weighting methods in view concern repeated optimization…
In spatio-temporal point pattern analysis, one of the main statistical objectives is to estimate the first-order intensity function, i.e., the expected number of points per unit area and unit time. This estimation is usually carried out…
We propose a new notion of variable bandwidth that is based on the spectral subspaces of an elliptic operator $A_pf = - (pf')'$ where $p>0$ is a strictly positive function. Denote by $c_{\Lambda} (A_p)$ the orthogonal projection of $A_p$…
We present time vectors, a simple tool to customize language models to new time periods. Time vectors are created by finetuning a language model on data from a single time (e.g., a year or month), and then subtracting the weights of the…
The common utilization-based definition of available bandwidth and many of the existing tools to estimate it suffer from several important weaknesses: i) most tools report a point estimate of average available bandwidth over a measurement…
Timed pushdown automata are pushdown automata extended with a finite set of real-valued clocks. Additionaly, each symbol in the stack is equipped with a value representing its age. The enabledness of a transition may depend on the values of…
The input to the stochastic orienteering problem consists of a budget $B$ and metric $(V,d)$ where each vertex $v$ has a job with deterministic reward and random processing time (drawn from a known distribution). The processing times are…
In the sciences and engineering, the concept of bandwidth is often subject to interpretation depending upon context and the requirements of a specific community. The focus of this work is to formulate this concept for a general class of…
In coding and information theory, it is desirable to construct maximal codes that can be either variable length codes or error control codes of fixed length. However deciding code maximality boils down to deciding whether a given NFA is…
A classical result (often credited to Y. Medvedev) states that every language recognized by a finite automaton is the homomorphic image of a local language, over a much larger so-called local alphabet, namely the alphabet of the edges of…
A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly. We study the almost-sure model-checking problem for this model, that is, given a…
We present new tight bounds for averaging differential inclusions, which we apply to multi-frequency inclusions consisting of a sum of time periodic set-valued mappings. For this family of inclusions we establish an a tight estimate of…
In this paper, we investigate the synthesis problem of terminating reactive systems from quantitative specifications. Such systems are modeled as finite transducers whose executions are represented as finite words in $(I\times O)^*$, where…
Weighted association rule mining reflects semantic significance of item by considering its weight. Classification constructs the classifier and predicts the new data instance. This paper proposes compact weighted class association rule…
We consider a scenario where a base station (BS) attempts to collect fresh information from power constrained sensors over time-varying band-limited wireless channels. We characterize the data freshness through the recently proposed…
The deterministic membership problem for timed automata asks whether the timed language recognised by a nondeterministic timed automaton can be recognised by a deterministic timed automaton. We show that the problem is decidable when the…
We study the large-volume asymptotics of the sum of power-weighted edge lengths $\sum_{e \in E}|e|^\alpha$ in Poisson-based spatial random networks. In the regime $\alpha > d$, we provide a set of sufficient conditions under which the upper…
In this paper, we discuss the formalized approach for generating and estimating symbols (and alphabets), which can be communicated by the wide range of non-verbal means based on specific user requirements (medium, priorities, type of…
Restless bandit problems are instances of non-stationary multi-armed bandits. These problems have been studied well from the optimization perspective, where the goal is to efficiently find a near-optimal policy when system parameters are…
Neural networks rely on learning synaptic weights. However, this overlooks other neural parameters that can also be learned and may be utilized by the brain. One such parameter is the delay: the brain exhibits complex temporal dynamics with…