Zobrazeno 1 - 10
of 349 975
pro vyhledávání: '"Csp '
Autor:
Chou, Chi-Ning1 chiningchou@g.harvard.edu, Golovnev, Alexander2 alexgolovnev@gmail.com, Sudan, Madhu1 madhu@cs.harvard.edu, Velusamy, Santhoshini3 santhoshini@ttic.edu
Publikováno v:
Journal of the ACM. Apr2024, Vol. 71 Issue 2, p1-74. 74p.
CSP-Net: Common Spatial Pattern Empowered Neural Networks for EEG-Based Motor Imagery Classification
Publikováno v:
Knowledge Based Systems, 305:112668, 2024
Electroencephalogram-based motor imagery (MI) classification is an important paradigm of non-invasive brain-computer interfaces. Common spatial pattern (CSP), which exploits different energy distributions on the scalp while performing different MI ta
Externí odkaz:
http://arxiv.org/abs/2411.11879
Given a fixed arity $k \geq 2$, Min-$k$-CSP on complete instances involves a set of $n$ variables $V$ and one nontrivial constraint for every $k$-subset of variables (so there are $\binom{n}{k}$ constraints). The goal is to find an assignment that mi
Externí odkaz:
http://arxiv.org/abs/2410.19066
Autor:
ROMERO, MIGUEL1 mgromero@uc.cl, WROCHNA, MARCIN2 m.wrochna@mimuw.edu.pl, ŽIVNÝ, STANISLAV3 standa.zivny@cs.ox.ac.uk
Publikováno v:
Journal of the ACM. Dec2023, Vol. 70 Issue 6, p1-43. 43p.
Autor:
Wang, Yichen, Yu, Chengcheng
Accurate origin-destination (OD) passenger flow prediction is crucial for enhancing metro system efficiency, optimizing scheduling, and improving passenger experiences. However, current models often fail to effectively capture the asynchronous depart
Externí odkaz:
http://arxiv.org/abs/2412.01419
We prove local and global inverse theorems for general $3$-wise correlations over pairwise-connected distributions. Let $\mu$ be a distribution over $\Sigma \times \Gamma \times \Phi$ such that the supports of $\mu_{xy}$, $\mu_{xz}$, and $\mu_{yz}$ a
Externí odkaz:
http://arxiv.org/abs/2411.15133
Autor:
Culus, Jean-François, Toulouse, Sophie
Traditionally, inapproximability results for $\mathsf{Max\,k\,CSP\!-\!q}$ have been established using balanced $t$-wise independent distributions, which are related to orthogonal arrays of strength $t$. We contribute to the field by exploring such co
Externí odkaz:
http://arxiv.org/abs/2409.03903
We propose a framework of algorithm vs. hardness for all Max-CSPs and demonstrate it for a large class of predicates. This framework extends the work of Raghavendra [STOC, 2008], who showed a similar result for almost satisfiable Max-CSPs. Our framew
Externí odkaz:
http://arxiv.org/abs/2408.15377
The constraint satisfaction problem asks to decide if a set of constraints over a relational structure $\mathcal{A}$ is satisfiable (CSP$(\mathcal{A})$). We consider CSP$(\mathcal{A} \cup \mathcal{B})$ where $\mathcal{A}$ is a structure and $\mathcal
Externí odkaz:
http://arxiv.org/abs/2408.12909
Publikováno v:
Professional Safety. Oct2024, Vol. 69 Issue 10, p14-14. 1p.