English
Related papers

Related papers: Mapping Cardinality-based Feature Models to Weight…

200 papers

Declarative modeling uses symbolic expressions to represent models. With such expressions one can formalize high-level mathematical computations on models that would be difficult or impossible to perform directly on a lower-level simulation…

Quantitative Methods · Quantitative Biology 2019-07-02 Eric Mjolsness

Multimodal models have been proven to outperform text-based approaches on learning semantic representations. However, it still remains unclear what properties are encoded in multimodal representations, in what aspects do they outperform the…

Computation and Language · Computer Science 2017-11-23 Shaonan Wang , Jiajun Zhang , Nan Lin , Chengqing Zong

Gene expression datasets are usually of high dimensionality and therefore require efficient and effective methods for identifying the relative importance of their attributes. Due to the huge size of the search space of the possible…

Machine Learning · Computer Science 2022-06-10 Fernando Jiménez , Gracia Sánchez , José Palma , Luis Miralles-Pechuán , Juan Botía

Recently, the philosophy of visual saliency and attention has started to gain popularity in the robotics community. Therefore, this paper aims to mimic this mechanism in SLAM framework by using saliency prediction model. Comparing with…

Robotics · Computer Science 2020-12-23 Ke Wang , Sai Ma , Junlan Chen , Jianbo Lu

Semiring parsing is an elegant framework for describing parsers by using semiring weighted logic programs. In this paper we present a generalization of this concept: latent-variable semiring parsing. With our framework, any semiring…

Computation and Language · Computer Science 2020-06-09 Esma Balkir , Daniel Gildea , Shay Cohen

Enterprise modeling deals with the increasing complexity of processes and systems by operationalizing model content and by linking complementary models and languages, thus amplifying the model-value beyond mere comprehensible pictures. To…

Software Engineering · Computer Science 2022-03-29 Victoria Döller

Aside from regular beamline experiments at light sources, the preparation steps before these experiments are also worth systematic consideration in terms of automation; a representative category in these steps is attitude tuning, which…

Instrumentation and Detectors · Physics 2024-11-06 Peng-Cheng Li , Xiao-Xue Bi , Zhen Zhang , Xiao-Bao Deng , Chun Li , Li-Wen Wang , Gong-Fa Liu , Yi Zhang , Ai-Yu Zhou , Yu Liu

The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on an operation of rescaling is receiving more and more…

Discrete Mathematics · Computer Science 2015-05-18 Laurent Boyer , Guillaume Theyssier

We present the Multi-vAlue Rule Set (MARS) model for interpretable classification with feature efficient presentations. MARS introduces a more generalized form of association rules that allows multiple values in a condition. Rules of this…

Artificial Intelligence · Computer Science 2017-10-17 Tong Wang

Motifs often recur in musical works in altered forms, preserving aspects of their identity while undergoing local variation. This paper investigates how such motivic transformations occur within their musical context in symbolic music. To…

Sound · Computer Science 2026-03-30 Ron Taieb , Yoel Greenberg , Barak Sober

This article presents a new characterization of controllability and regional controllability of Deterministic Cellular Automata (CA for short). It focuses on analyzing these problems within the framework of control theory, which have been…

Dynamical Systems · Mathematics 2025-01-07 Sara Dridi

Automata expressiveness is an essential feature in understanding which of the formalisms available should be chosen for modelling a particular problem. Probabilistic and stochastic automata are suitable for modelling systems exhibiting…

Logic in Computer Science · Computer Science 2019-03-19 Valentin Bura , Tim French , Mark Reynolds

We consider the images of the initial algebra semantics of weighted tree automata over strong bimonoids (hence also over semirings). These images are subsets of the carrier set of the underlying strong bimonoid. We consider locally finite,…

Formal Languages and Automata Theory · Computer Science 2024-06-11 Manfred Droste , Zoltán Fülöp , Andreja Tepavčević , Heiko Vogler

We present novel semiring semantics for abstract reduction systems (ARSs). More precisely, we provide a weighted version of ARSs, where the reduction steps induce weights from a semiring. Inspired by provenance analysis in database theory…

Logic in Computer Science · Computer Science 2025-05-14 Emma Ahrens , Jan-Christoph Kassing , Jürgen Giesl , Joost-Pieter Katoen

Randomly masking and predicting word tokens has been a successful approach in pre-training language models for a variety of downstream tasks. In this work, we observe that the same idea also applies naturally to sequential decision making,…

Designers of autonomous agents, whether in physical or virtual environments, need to express nondeterminisim, failure, and parallelism in behaviors, as well as accounting for synchronous coordination between agents. Behavior Trees are a…

Programming Languages · Computer Science 2018-03-28 Chris Martens , Eric Butler , Joseph C. Osborn

Humans leverage compositionality to efficiently learn new concepts, understanding how familiar parts can combine together to form novel objects. In contrast, popular computer vision models struggle to make the same types of inferences,…

Computer Vision and Pattern Recognition · Computer Science 2023-06-01 Yanli Zhou , Reuben Feinman , Brenden M. Lake

Mechanistic interpretability seeks to localize model behavior to the internal components that causally realize it. Prior work has advanced activation-space localization and causal tracing, but modules that appear important in activation…

Artificial Intelligence · Computer Science 2026-04-16 Chenghao Sun , Chengsheng Zhang , Guanzheng Qin , Rui Dai , Xinmei Tian

Multi-class classification methods based on both labeled and unlabeled functional data sets are discussed. We present a semi-supervised logistic model for classification in the context of functional data analysis. Unknown parameters in our…

Methodology · Statistics 2013-02-15 Shuichi Kawano , Sadanori Konishi

In this paper, we give a Nivat-like characterization for weighted alternating automata over commutative semirings (WAFA). To this purpose we prove that weighted alternating can be characterized as the concatenation of weighted finite tree…

Formal Languages and Automata Theory · Computer Science 2021-09-20 Gustav Grabolle