id stringlengths 9 10 | submitter stringlengths 1 64 ⌀ | authors stringlengths 4 20.7k | title stringlengths 4 246 | comments stringlengths 1 523 ⌀ | journal-ref stringlengths 4 404 ⌀ | doi stringlengths 11 153 ⌀ | report-no stringlengths 2 254 ⌀ | categories stringlengths 5 98 | license stringclasses 9
values | orig_abstract stringlengths 14 3.35k | versions listlengths 1 60 | update_date stringlengths 10 10 | authors_parsed listlengths 1 1.35k | abstract stringlengths 11 3.34k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2401.04682 | Kylliann De Santiago | Kylliann De Santiago, Marie Szafranski, Christophe Ambroise | Mixture of multilayer stochastic block models for multiview clustering | null | null | null | null | cs.LG math.ST stat.ML stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we propose an original method for aggregating multiple
clustering coming from different sources of information. Each partition is
encoded by a co-membership matrix between observations. Our approach uses a
mixture of multilayer Stochastic Block Models (SBM) to group co-membership
matrices with similar i... | [
{
"created": "Tue, 9 Jan 2024 17:15:47 GMT",
"version": "v1"
}
] | 2024-01-10 | [
[
"De Santiago",
"Kylliann",
""
],
[
"Szafranski",
"Marie",
""
],
[
"Ambroise",
"Christophe",
""
]
] | In this work, we propose an original method for aggregating multiple clustering coming from different sources of information. Each partition is encoded by a co-membership matrix between observations. Our approach uses a mixture of multilayer Stochastic Block Models (SBM) to group co-membership matrices with similar inf... |
2008.05102 | Aditya Aniruddha Shrotri | Supratik Chakraborty, Aditya A. Shrotri and Moshe Y. Vardi | On Uniformly Sampling Traces of a Transition System (Extended Version) | Extended version of paper that will appear in proceedings of
International Conference on Computer-Aided Design (ICCAD '20); changed wrong
text color in sec 7; added 'extended version' | null | 10.1145/3400302.3415707 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A key problem in constrained random verification (CRV) concerns generation of
input stimuli that result in good coverage of the system's runs in targeted
corners of its behavior space. Existing CRV solutions however provide no formal
guarantees on the distribution of the system's runs. In this paper, we take a
first ... | [
{
"created": "Wed, 12 Aug 2020 04:28:26 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Aug 2020 00:59:24 GMT",
"version": "v2"
}
] | 2020-08-18 | [
[
"Chakraborty",
"Supratik",
""
],
[
"Shrotri",
"Aditya A.",
""
],
[
"Vardi",
"Moshe Y.",
""
]
] | A key problem in constrained random verification (CRV) concerns generation of input stimuli that result in good coverage of the system's runs in targeted corners of its behavior space. Existing CRV solutions however provide no formal guarantees on the distribution of the system's runs. In this paper, we take a first st... |
1707.06961 | Yuval Pinter | Yuval Pinter, Robert Guthrie, Jacob Eisenstein | Mimicking Word Embeddings using Subword RNNs | EMNLP 2017 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Word embeddings improve generalization over lexical features by placing each
word in a lower-dimensional space, using distributional information obtained
from unlabeled data. However, the effectiveness of word embeddings for
downstream NLP tasks is limited by out-of-vocabulary (OOV) words, for which
embeddings do not... | [
{
"created": "Fri, 21 Jul 2017 16:18:10 GMT",
"version": "v1"
}
] | 2017-07-24 | [
[
"Pinter",
"Yuval",
""
],
[
"Guthrie",
"Robert",
""
],
[
"Eisenstein",
"Jacob",
""
]
] | Word embeddings improve generalization over lexical features by placing each word in a lower-dimensional space, using distributional information obtained from unlabeled data. However, the effectiveness of word embeddings for downstream NLP tasks is limited by out-of-vocabulary (OOV) words, for which embeddings do not e... |
1912.10202 | Songgaojun Deng | Songgaojun Deng, Shusen Wang, Huzefa Rangwala, Lijing Wang, Yue Ning | Graph Message Passing with Cross-location Attentions for Long-term ILI
Prediction | 17 pages, 22 figures, 5 tables | null | null | null | cs.LG cs.SI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Forecasting influenza-like illness (ILI) is of prime importance to
epidemiologists and health-care providers. Early prediction of epidemic
outbreaks plays a pivotal role in disease intervention and control. Most
existing work has either limited long-term prediction performance or lacks a
comprehensive ability to capt... | [
{
"created": "Sat, 21 Dec 2019 05:28:05 GMT",
"version": "v1"
},
{
"created": "Sun, 29 Dec 2019 03:47:33 GMT",
"version": "v2"
}
] | 2020-01-01 | [
[
"Deng",
"Songgaojun",
""
],
[
"Wang",
"Shusen",
""
],
[
"Rangwala",
"Huzefa",
""
],
[
"Wang",
"Lijing",
""
],
[
"Ning",
"Yue",
""
]
] | Forecasting influenza-like illness (ILI) is of prime importance to epidemiologists and health-care providers. Early prediction of epidemic outbreaks plays a pivotal role in disease intervention and control. Most existing work has either limited long-term prediction performance or lacks a comprehensive ability to captur... |
2406.06603 | Chu Li | Chu Li, Pingjia Xiao, Qiping Yuan | FPN-fusion: Enhanced Linear Complexity Time Series Forecasting Model | FPN,time series,fusion. arXiv admin note: text overlap with
arXiv:2401.03001 by other authors | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This study presents a novel time series prediction model, FPN-fusion,
designed with linear computational complexity, demonstrating superior
predictive performance compared to DLiner without increasing parameter count or
computational demands. Our model introduces two key innovations: first, a
Feature Pyramid Network ... | [
{
"created": "Thu, 6 Jun 2024 14:34:26 GMT",
"version": "v1"
}
] | 2024-06-12 | [
[
"Li",
"Chu",
""
],
[
"Xiao",
"Pingjia",
""
],
[
"Yuan",
"Qiping",
""
]
] | This study presents a novel time series prediction model, FPN-fusion, designed with linear computational complexity, demonstrating superior predictive performance compared to DLiner without increasing parameter count or computational demands. Our model introduces two key innovations: first, a Feature Pyramid Network (F... |
1310.4169 | Yuan Gao | Yuan Gao, Guanrong Chen and Rosa H. M. Chan | Naming Game on Networks: Let Everyone be Both Speaker and Hearer | 11 pages, 6 figures | Yuan Gao, Guanrong Chen, and Rosa H. M. Chan. Naming Game on
Networks: Let Everyone be Both Speaker and Hearer. Sci. Rep. 4, 6149, (2014) | 10.1038/srep06149 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To investigate how consensus is reached on a large self-organized
peer-to-peer network, we extended the naming game model commonly used in
language and communication to Naming Game in Groups (NGG). Differing from other
existing naming game models, in NGG, everyone in the population (network) can
be both speaker and h... | [
{
"created": "Sat, 12 Oct 2013 08:30:42 GMT",
"version": "v1"
},
{
"created": "Thu, 31 Oct 2013 13:20:11 GMT",
"version": "v2"
},
{
"created": "Wed, 16 Apr 2014 03:53:18 GMT",
"version": "v3"
},
{
"created": "Wed, 30 Jul 2014 18:10:05 GMT",
"version": "v4"
},
{
"c... | 2014-08-25 | [
[
"Gao",
"Yuan",
""
],
[
"Chen",
"Guanrong",
""
],
[
"Chan",
"Rosa H. M.",
""
]
] | To investigate how consensus is reached on a large self-organized peer-to-peer network, we extended the naming game model commonly used in language and communication to Naming Game in Groups (NGG). Differing from other existing naming game models, in NGG, everyone in the population (network) can be both speaker and hea... |
2312.05925 | Jannik Sheikh | Jannik Sheikh, Andrew Melnik, Gora Chand Nandi, Robert Haschke | Language-Conditioned Semantic Search-Based Policy for Robotic
Manipulation Tasks | null | null | null | null | cs.RO cs.AI cs.CV cs.LG | http://creativecommons.org/publicdomain/zero/1.0/ | Reinforcement learning and Imitation Learning approaches utilize policy
learning strategies that are difficult to generalize well with just a few
examples of a task. In this work, we propose a language-conditioned semantic
search-based method to produce an online search-based policy from the available
demonstration d... | [
{
"created": "Sun, 10 Dec 2023 16:17:00 GMT",
"version": "v1"
}
] | 2023-12-12 | [
[
"Sheikh",
"Jannik",
""
],
[
"Melnik",
"Andrew",
""
],
[
"Nandi",
"Gora Chand",
""
],
[
"Haschke",
"Robert",
""
]
] | Reinforcement learning and Imitation Learning approaches utilize policy learning strategies that are difficult to generalize well with just a few examples of a task. In this work, we propose a language-conditioned semantic search-based method to produce an online search-based policy from the available demonstration dat... |
2405.14758 | Daniel Halpern | Luise Ge, Daniel Halpern, Evi Micha, Ariel D. Procaccia, Itai Shapira,
Yevgeniy Vorobeychik, and Junlin Wu | Axioms for AI Alignment from Human Feedback | null | null | null | null | cs.GT cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the context of reinforcement learning from human feedback (RLHF), the
reward function is generally derived from maximum likelihood estimation of a
random utility model based on pairwise comparisons made by humans. The problem
of learning a reward function is one of preference aggregation that, we argue,
largely fa... | [
{
"created": "Thu, 23 May 2024 16:29:29 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Ge",
"Luise",
""
],
[
"Halpern",
"Daniel",
""
],
[
"Micha",
"Evi",
""
],
[
"Procaccia",
"Ariel D.",
""
],
[
"Shapira",
"Itai",
""
],
[
"Vorobeychik",
"Yevgeniy",
""
],
[
"Wu",
"Junlin",
""
]
] | In the context of reinforcement learning from human feedback (RLHF), the reward function is generally derived from maximum likelihood estimation of a random utility model based on pairwise comparisons made by humans. The problem of learning a reward function is one of preference aggregation that, we argue, largely fall... |
2207.13664 | Sathya Krishnan Suresh | Sathya Krishnan Suresh, Shunmugapriya P | Generic Approach to Visualization of Time Series Data | 5 pages. International Conference on Engineering and Advancement in
Technology-2022 | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Time series is a collection of data instances that are ordered according to a
time stamp. Stock prices, temperature, etc are examples of time series data in
real life. Time series data are used for forecasting sales, predicting trends.
Visualization is the process of visually representing data or the relationship
bet... | [
{
"created": "Mon, 25 Jul 2022 07:08:23 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Apr 2024 05:45:59 GMT",
"version": "v2"
}
] | 2024-04-25 | [
[
"Suresh",
"Sathya Krishnan",
""
],
[
"P",
"Shunmugapriya",
""
]
] | Time series is a collection of data instances that are ordered according to a time stamp. Stock prices, temperature, etc are examples of time series data in real life. Time series data are used for forecasting sales, predicting trends. Visualization is the process of visually representing data or the relationship betwe... |
1310.5815 | Enrique Ordu\~na-Malea | Enrique Orduna-Malea and Jose-Antonio Ontalba-Ruiperez | Selective linking from social platforms to university websites: a case
study of the Spanish academic system | null | Scientometrics Vol. 95, Issue 2, pp. 594-614 (2013) | 10.1007/s11192-012-0851-1 | null | cs.DL cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mention indicators have frequently been used in Webometric studies because
they provide a powerful tool for determining the degree of visibility and
impact of web resources. Among mention indicators, hypertextual links were a
central part of many studies until Yahoo discontinued the linkdomain command in
2011. Select... | [
{
"created": "Tue, 22 Oct 2013 06:58:30 GMT",
"version": "v1"
}
] | 2013-10-23 | [
[
"Orduna-Malea",
"Enrique",
""
],
[
"Ontalba-Ruiperez",
"Jose-Antonio",
""
]
] | Mention indicators have frequently been used in Webometric studies because they provide a powerful tool for determining the degree of visibility and impact of web resources. Among mention indicators, hypertextual links were a central part of many studies until Yahoo discontinued the linkdomain command in 2011. Selectiv... |
cs/0512043 | Dirk Wagner | Dirk Wagner, John Noga | Random Walks with Anti-Correlated Steps | 5 pages, 1 chart, 2 tables | null | null | null | cs.DM cs.PF | null | We conjecture the expected value of random walks with anti-correlated steps
to be exactly 1. We support this conjecture with 2 plausibility arguments and
experimental data. The experimental analysis includes the computation of the
expected values of random walks for steps up to 22. The result shows the
expected value... | [
{
"created": "Sat, 10 Dec 2005 08:04:32 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Wagner",
"Dirk",
""
],
[
"Noga",
"John",
""
]
] | We conjecture the expected value of random walks with anti-correlated steps to be exactly 1. We support this conjecture with 2 plausibility arguments and experimental data. The experimental analysis includes the computation of the expected values of random walks for steps up to 22. The result shows the expected value a... |
1803.09090 | Alexandros-Apostolos Boulogeorgos | Dimitrios S. Karas, Alexandros-Apostolos A. Boulogeorgos, and George
K. Karagiannidis | Physical Layer Security in the Presence of Interference | 4 pages, 5r figures | IEEE Wireless Communications Letters ( Volume: 6, Issue: 6, Dec.
2017 ) | 10.1109/LWC.2017.2743716 | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | We evaluate and quantify the joint effect of fading and multiple interferers
on the physical-layer (PHY) security of a system consisted of a base-station
(BS), a legitimate user, and an eavesdropper. To this end, we present a novel
closed-form expression for the secrecy outage probability, which takes into
account th... | [
{
"created": "Sat, 24 Mar 2018 10:53:55 GMT",
"version": "v1"
}
] | 2018-03-28 | [
[
"Karas",
"Dimitrios S.",
""
],
[
"Boulogeorgos",
"Alexandros-Apostolos A.",
""
],
[
"Karagiannidis",
"George K.",
""
]
] | We evaluate and quantify the joint effect of fading and multiple interferers on the physical-layer (PHY) security of a system consisted of a base-station (BS), a legitimate user, and an eavesdropper. To this end, we present a novel closed-form expression for the secrecy outage probability, which takes into account the ... |
2310.09658 | Tim Schulze | Tim P. Schulze | A Generalized Extensive-Form Fictitious Play Algorithm | null | null | null | null | cs.GT cs.AI | http://creativecommons.org/licenses/by/4.0/ | We introduce a simple extensive-form algorithm for finding equilibria of
two-player, zero-sum games. The algorithm is realization equivalent to a
generalized form of Fictitious Play. We compare its performance to that of a
similar extensive-form fictitious play algorithm and a counter-factual regret
minimization algo... | [
{
"created": "Sat, 14 Oct 2023 20:18:49 GMT",
"version": "v1"
}
] | 2023-10-17 | [
[
"Schulze",
"Tim P.",
""
]
] | We introduce a simple extensive-form algorithm for finding equilibria of two-player, zero-sum games. The algorithm is realization equivalent to a generalized form of Fictitious Play. We compare its performance to that of a similar extensive-form fictitious play algorithm and a counter-factual regret minimization algori... |
1401.0180 | Steve N'Guyen | Steve N'Guyen (ISIR, LPPA), Cl\'ement Moulin-Frier (INRIA Bordeaux -
Sud-Ouest, GIPSA-lab), Jacques Droulez (LPPA) | Decision Making under Uncertainty: A Quasimetric Approach | null | PLoS ONE 8, 12 (2013) e83411 | 10.1371/journal.pone.0083411 | null | cs.AI math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new approach for solving a class of discrete decision making
problems under uncertainty with positive cost. This issue concerns multiple and
diverse fields such as engineering, economics, artificial intelligence,
cognitive science and many others. Basically, an agent has to choose a single
or series of a... | [
{
"created": "Tue, 31 Dec 2013 16:56:04 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"N'Guyen",
"Steve",
"",
"ISIR, LPPA"
],
[
"Moulin-Frier",
"Clément",
"",
"INRIA Bordeaux -\n Sud-Ouest, GIPSA-lab"
],
[
"Droulez",
"Jacques",
"",
"LPPA"
]
] | We propose a new approach for solving a class of discrete decision making problems under uncertainty with positive cost. This issue concerns multiple and diverse fields such as engineering, economics, artificial intelligence, cognitive science and many others. Basically, an agent has to choose a single or series of act... |
2002.09463 | Huanyu Zhang | Huanyu Zhang, Gautam Kamath, Janardhan Kulkarni, Zhiwei Steven Wu | Privately Learning Markov Random Fields | null | null | null | null | cs.DS cs.CR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of learning Markov Random Fields (including the
prototypical example, the Ising model) under the constraint of differential
privacy. Our learning goals include both structure learning, where we try to
estimate the underlying graph structure of the model, as well as the harder
goal of parameter... | [
{
"created": "Fri, 21 Feb 2020 18:30:48 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Aug 2020 14:24:58 GMT",
"version": "v2"
}
] | 2020-08-17 | [
[
"Zhang",
"Huanyu",
""
],
[
"Kamath",
"Gautam",
""
],
[
"Kulkarni",
"Janardhan",
""
],
[
"Wu",
"Zhiwei Steven",
""
]
] | We consider the problem of learning Markov Random Fields (including the prototypical example, the Ising model) under the constraint of differential privacy. Our learning goals include both structure learning, where we try to estimate the underlying graph structure of the model, as well as the harder goal of parameter l... |
2311.02116 | Qingqing Ge | Qingqing Ge, Jianxiang Yu, Zeyuan Zhao and Xiang Li | Resist Label Noise with PGM for Graph Neural Networks | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While robust graph neural networks (GNNs) have been widely studied for graph
perturbation and attack, those for label noise have received significantly less
attention. Most existing methods heavily rely on the label smoothness
assumption to correct noisy labels, which adversely affects their performance
on heterophil... | [
{
"created": "Fri, 3 Nov 2023 02:47:06 GMT",
"version": "v1"
}
] | 2023-11-07 | [
[
"Ge",
"Qingqing",
""
],
[
"Yu",
"Jianxiang",
""
],
[
"Zhao",
"Zeyuan",
""
],
[
"Li",
"Xiang",
""
]
] | While robust graph neural networks (GNNs) have been widely studied for graph perturbation and attack, those for label noise have received significantly less attention. Most existing methods heavily rely on the label smoothness assumption to correct noisy labels, which adversely affects their performance on heterophilou... |
2009.11789 | Paulo S\'ergio Almeida | Paulo S\'ergio Almeida | A Case for Partitioned Bloom Filters | 11 pages; accepted for publication in IEEE Transactions on Computers | null | 10.1109/TC.2022.3218995 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a partitioned Bloom Filter the $m$ bit vector is split into $k$ disjoint
$m/k$ sized parts, one per hash function. Contrary to hardware designs, where
they prevail, software implementations mostly adopt standard Bloom filters,
considering partitioned filters slightly worse, due to the slightly larger
false positiv... | [
{
"created": "Thu, 24 Sep 2020 16:33:22 GMT",
"version": "v1"
},
{
"created": "Wed, 9 Nov 2022 16:27:55 GMT",
"version": "v2"
}
] | 2022-11-10 | [
[
"Almeida",
"Paulo Sérgio",
""
]
] | In a partitioned Bloom Filter the $m$ bit vector is split into $k$ disjoint $m/k$ sized parts, one per hash function. Contrary to hardware designs, where they prevail, software implementations mostly adopt standard Bloom filters, considering partitioned filters slightly worse, due to the slightly larger false positive ... |
2306.08604 | Enyan Dai | Enyan Dai, Limeng Cui, Zhengyang Wang, Xianfeng Tang, Yinghan Wang,
Monica Cheng, Bing Yin, Suhang Wang | A Unified Framework of Graph Information Bottleneck for Robustness and
Membership Privacy | null | null | null | null | cs.LG cs.AI cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph Neural Networks (GNNs) have achieved great success in modeling
graph-structured data. However, recent works show that GNNs are vulnerable to
adversarial attacks which can fool the GNN model to make desired predictions of
the attacker. In addition, training data of GNNs can be leaked under membership
inference a... | [
{
"created": "Wed, 14 Jun 2023 16:11:00 GMT",
"version": "v1"
}
] | 2023-06-16 | [
[
"Dai",
"Enyan",
""
],
[
"Cui",
"Limeng",
""
],
[
"Wang",
"Zhengyang",
""
],
[
"Tang",
"Xianfeng",
""
],
[
"Wang",
"Yinghan",
""
],
[
"Cheng",
"Monica",
""
],
[
"Yin",
"Bing",
""
],
[
"Wang",
"Su... | Graph Neural Networks (GNNs) have achieved great success in modeling graph-structured data. However, recent works show that GNNs are vulnerable to adversarial attacks which can fool the GNN model to make desired predictions of the attacker. In addition, training data of GNNs can be leaked under membership inference att... |
2303.01676 | Hsin Cheng | Hsin Cheng, Zhiwu Zheng, Prakhar Kumar, Wali Afridi, Ben Kim, Sigurd
Wagner, Naveen Verma, James C. Sturm and Minjie Chen | eViper: A Scalable Platform for Untethered Modular Soft Robots | 8 pages, 21 figures, accepted by IROS 2023 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Soft robots present unique capabilities, but have been limited by the lack of
scalable technologies for construction and the complexity of algorithms for
efficient control and motion, which depend on soft-body dynamics,
high-dimensional actuation patterns, and external/on-board forces. This paper
presents scalable me... | [
{
"created": "Fri, 3 Mar 2023 02:31:00 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Nov 2023 23:32:01 GMT",
"version": "v2"
}
] | 2023-11-16 | [
[
"Cheng",
"Hsin",
""
],
[
"Zheng",
"Zhiwu",
""
],
[
"Kumar",
"Prakhar",
""
],
[
"Afridi",
"Wali",
""
],
[
"Kim",
"Ben",
""
],
[
"Wagner",
"Sigurd",
""
],
[
"Verma",
"Naveen",
""
],
[
"Sturm",
"Ja... | Soft robots present unique capabilities, but have been limited by the lack of scalable technologies for construction and the complexity of algorithms for efficient control and motion, which depend on soft-body dynamics, high-dimensional actuation patterns, and external/on-board forces. This paper presents scalable meth... |
2306.02312 | Kacper Sokol | Kacper Sokol and Julia E. Vogt | (Un)reasonable Allure of Ante-hoc Interpretability for High-stakes
Domains: Transparency Is Necessary but Insufficient for Comprehensibility | Workshop on Interpretable ML in Healthcare at 2023 International
Conference on Machine Learning (ICML) | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ante-hoc interpretability has become the holy grail of explainable artificial
intelligence for high-stakes domains such as healthcare; however, this notion
is elusive, lacks a widely-accepted definition and depends on the operational
context. It can refer to predictive models whose structure adheres to
domain-specifi... | [
{
"created": "Sun, 4 Jun 2023 09:34:41 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Jul 2023 13:42:44 GMT",
"version": "v2"
}
] | 2023-07-11 | [
[
"Sokol",
"Kacper",
""
],
[
"Vogt",
"Julia E.",
""
]
] | Ante-hoc interpretability has become the holy grail of explainable artificial intelligence for high-stakes domains such as healthcare; however, this notion is elusive, lacks a widely-accepted definition and depends on the operational context. It can refer to predictive models whose structure adheres to domain-specific ... |
1611.06070 | Alejandro Marzinotto | Alejandro Marzinotto and Johannes A. Stork | Rope through Loop Insertion for Robotic Knotting: A Virtual Magnetic
Field Formulation | 8 pages | null | null | 978-91-7729-218-0 | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Inserting an end of a rope through a loop is a common and important action
that is required for creating most types of knots. To perform this action, we
need to pass the end of the rope through an area that is enclosed by another
segment of rope. As for all knotting actions, the robot must for this exercise
control o... | [
{
"created": "Fri, 18 Nov 2016 13:41:24 GMT",
"version": "v1"
}
] | 2016-11-21 | [
[
"Marzinotto",
"Alejandro",
""
],
[
"Stork",
"Johannes A.",
""
]
] | Inserting an end of a rope through a loop is a common and important action that is required for creating most types of knots. To perform this action, we need to pass the end of the rope through an area that is enclosed by another segment of rope. As for all knotting actions, the robot must for this exercise control ove... |
2407.10477 | Achiya Elyasaf Dr. | Eliad Shem-Tov, Moshe Sipper, Achiya Elyasaf | Deep Learning-Based Operators for Evolutionary Algorithms | 16 pages, 7 figures, 2 tables. Accepted to Genetic Programming Theory
& Practice XXI (GPTP 2024). arXiv admin note: text overlap with
arXiv:2403.11159 | null | null | null | cs.NE cs.LG | http://creativecommons.org/licenses/by/4.0/ | We present two novel domain-independent genetic operators that harness the
capabilities of deep learning: a crossover operator for genetic algorithms and
a mutation operator for genetic programming. Deep Neural Crossover leverages
the capabilities of deep reinforcement learning and an encoder-decoder
architecture to ... | [
{
"created": "Mon, 15 Jul 2024 07:05:34 GMT",
"version": "v1"
}
] | 2024-07-16 | [
[
"Shem-Tov",
"Eliad",
""
],
[
"Sipper",
"Moshe",
""
],
[
"Elyasaf",
"Achiya",
""
]
] | We present two novel domain-independent genetic operators that harness the capabilities of deep learning: a crossover operator for genetic algorithms and a mutation operator for genetic programming. Deep Neural Crossover leverages the capabilities of deep reinforcement learning and an encoder-decoder architecture to se... |
2210.12691 | Stella Civelli | Stella Civelli, Enrico Forestieri, Marco Secondini | Practical Implementation of Sequence Selection for Nonlinear
Probabilistic Shaping | Submitted for presentation to the OFC conference 2023 | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose two novel techniques to implement sequence selection (SS) for
fiber nonlinearity mitigation, demonstrating a nonlinear shaping gain of 0.24
bits/s/Hz, just 0.1 bits/s/Hz below the SS capacity lower bound.
| [
{
"created": "Sun, 23 Oct 2022 10:41:38 GMT",
"version": "v1"
}
] | 2022-10-25 | [
[
"Civelli",
"Stella",
""
],
[
"Forestieri",
"Enrico",
""
],
[
"Secondini",
"Marco",
""
]
] | We propose two novel techniques to implement sequence selection (SS) for fiber nonlinearity mitigation, demonstrating a nonlinear shaping gain of 0.24 bits/s/Hz, just 0.1 bits/s/Hz below the SS capacity lower bound. |
1912.03787 | Austin Dill | Austin Dill, Chun-Liang Li, Songwei Ge, Eunsu Kang | Getting Topology and Point Cloud Generation to Mesh | Sets & Partitions Workshop at NeurIPS 2019 | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | In this work, we explore the idea that effective generative models for point
clouds under the autoencoding framework must acknowledge the relationship
between a continuous surface, a discretized mesh, and a set of points sampled
from the surface. This view motivates a generative model that works by
progressively defo... | [
{
"created": "Sun, 8 Dec 2019 23:36:04 GMT",
"version": "v1"
}
] | 2019-12-10 | [
[
"Dill",
"Austin",
""
],
[
"Li",
"Chun-Liang",
""
],
[
"Ge",
"Songwei",
""
],
[
"Kang",
"Eunsu",
""
]
] | In this work, we explore the idea that effective generative models for point clouds under the autoencoding framework must acknowledge the relationship between a continuous surface, a discretized mesh, and a set of points sampled from the surface. This view motivates a generative model that works by progressively deform... |
2406.01797 | Paolo Cudrano | Paolo Cudrano, Xiaoyu Luo, Matteo Matteucci | The Empirical Impact of Forgetting and Transfer in Continual Visual
Odometry | Accepted to CoLLAs 2024 | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As robotics continues to advance, the need for adaptive and
continuously-learning embodied agents increases, particularly in the realm of
assistance robotics. Quick adaptability and long-term information retention are
essential to operate in dynamic environments typical of humans' everyday lives.
A lifelong learning ... | [
{
"created": "Mon, 3 Jun 2024 21:32:50 GMT",
"version": "v1"
}
] | 2024-06-05 | [
[
"Cudrano",
"Paolo",
""
],
[
"Luo",
"Xiaoyu",
""
],
[
"Matteucci",
"Matteo",
""
]
] | As robotics continues to advance, the need for adaptive and continuously-learning embodied agents increases, particularly in the realm of assistance robotics. Quick adaptability and long-term information retention are essential to operate in dynamic environments typical of humans' everyday lives. A lifelong learning pa... |
2211.12131 | Shengqu Cai | Shengqu Cai, Eric Ryan Chan, Songyou Peng, Mohamad Shahbazi, Anton
Obukhov, Luc Van Gool and Gordon Wetzstein | DiffDreamer: Towards Consistent Unsupervised Single-view Scene
Extrapolation with Conditional Diffusion Models | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-sa/4.0/ | Scene extrapolation -- the idea of generating novel views by flying into a
given image -- is a promising, yet challenging task. For each predicted frame,
a joint inpainting and 3D refinement problem has to be solved, which is ill
posed and includes a high level of ambiguity. Moreover, training data for
long-range sce... | [
{
"created": "Tue, 22 Nov 2022 10:06:29 GMT",
"version": "v1"
},
{
"created": "Sat, 18 Mar 2023 16:07:21 GMT",
"version": "v2"
}
] | 2023-03-21 | [
[
"Cai",
"Shengqu",
""
],
[
"Chan",
"Eric Ryan",
""
],
[
"Peng",
"Songyou",
""
],
[
"Shahbazi",
"Mohamad",
""
],
[
"Obukhov",
"Anton",
""
],
[
"Van Gool",
"Luc",
""
],
[
"Wetzstein",
"Gordon",
""
]
] | Scene extrapolation -- the idea of generating novel views by flying into a given image -- is a promising, yet challenging task. For each predicted frame, a joint inpainting and 3D refinement problem has to be solved, which is ill posed and includes a high level of ambiguity. Moreover, training data for long-range scene... |
0903.1032 | Mohammad Raza | Mohammad Raza and Philippa Gardner | Footprints in Local Reasoning | LMCS 2009 (FOSSACS 2008 special issue) | Logical Methods in Computer Science, Volume 5, Issue 2 (April 24,
2009) lmcs:1118 | 10.2168/LMCS-5(2:4)2009 | null | cs.SE cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Local reasoning about programs exploits the natural local behaviour common in
programs by focussing on the footprint - that part of the resource accessed by
the program. We address the problem of formally characterising and analysing
the footprint notion for abstract local functions introduced by Calcagno, O
Hearn an... | [
{
"created": "Thu, 5 Mar 2009 17:06:05 GMT",
"version": "v1"
},
{
"created": "Fri, 24 Apr 2009 17:59:14 GMT",
"version": "v2"
}
] | 2015-07-01 | [
[
"Raza",
"Mohammad",
""
],
[
"Gardner",
"Philippa",
""
]
] | Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address the problem of formally characterising and analysing the footprint notion for abstract local functions introduced by Calcagno, O Hearn and ... |
1005.3143 | Jezabel Molina-Gil | P. Caballero-Gil, J. Molina-Gil, C. Hern\'andez-Goya and C.
Caballero-Gil | Stimulating Cooperation in Self-Organized Vehicular Networks | null | Proceedings of APCC IEEE Asia Pacific Conference on
Communications. Vol. 82 , (October 2009) pp. 346-349 | 10.1109/APCC.2009.5375621 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A Vehicular Ad-hoc NETwork (VANET) is a special form of Mobile Ad-hoc Network
designed to provide communications among nearby vehicles and between vehicles
and nearby fixed roadside equipment. Its main goal is to improve safety and
comfort for passengers, but it can also be used for commercial applications. In
this l... | [
{
"created": "Tue, 18 May 2010 10:24:16 GMT",
"version": "v1"
}
] | 2016-11-18 | [
[
"Caballero-Gil",
"P.",
""
],
[
"Molina-Gil",
"J.",
""
],
[
"Hernández-Goya",
"C.",
""
],
[
"Caballero-Gil",
"C.",
""
]
] | A Vehicular Ad-hoc NETwork (VANET) is a special form of Mobile Ad-hoc Network designed to provide communications among nearby vehicles and between vehicles and nearby fixed roadside equipment. Its main goal is to improve safety and comfort for passengers, but it can also be used for commercial applications. In this lat... |
1910.12468 | Assia Benbihi | Assia Benbihi, St\'ephanie Aravecchia, Matthieu Geist, and C\'edric
Pradalier | Image-Based Place Recognition on Bucolic Environment Across Seasons From
Semantic Edge Description | null | 2020 IEEE International Conference on Robotics and Automation
(ICRA) | 10.1109/ICRA40945.2020.9197529 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most of the research effort on image-based place recognition is designed for
urban environments. In bucolic environments such as natural scenes with low
texture and little semantic content, the main challenge is to handle the
variations in visual appearance across time such as illumination, weather,
vegetation state ... | [
{
"created": "Mon, 28 Oct 2019 07:06:25 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Jan 2020 05:41:55 GMT",
"version": "v2"
},
{
"created": "Wed, 26 Feb 2020 14:55:38 GMT",
"version": "v3"
},
{
"created": "Fri, 12 Feb 2021 13:42:43 GMT",
"version": "v4"
},
{
"c... | 2021-04-02 | [
[
"Benbihi",
"Assia",
""
],
[
"Aravecchia",
"Stéphanie",
""
],
[
"Geist",
"Matthieu",
""
],
[
"Pradalier",
"Cédric",
""
]
] | Most of the research effort on image-based place recognition is designed for urban environments. In bucolic environments such as natural scenes with low texture and little semantic content, the main challenge is to handle the variations in visual appearance across time such as illumination, weather, vegetation state or... |
2306.06205 | Judit Acs | Judit Acs, Endre Hamerlik, Roy Schwartz, Noah A. Smith, Andras Kornai | Morphosyntactic probing of multilingual BERT models | to appear in the Journal of Natural Language Engineering | null | 10.1017/S1351324923000190 | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We introduce an extensive dataset for multilingual probing of morphological
information in language models (247 tasks across 42 languages from 10
families), each consisting of a sentence with a target word and a morphological
tag as the desired label, derived from the Universal Dependencies treebanks. We
find that pr... | [
{
"created": "Fri, 9 Jun 2023 19:15:20 GMT",
"version": "v1"
}
] | 2023-06-13 | [
[
"Acs",
"Judit",
""
],
[
"Hamerlik",
"Endre",
""
],
[
"Schwartz",
"Roy",
""
],
[
"Smith",
"Noah A.",
""
],
[
"Kornai",
"Andras",
""
]
] | We introduce an extensive dataset for multilingual probing of morphological information in language models (247 tasks across 42 languages from 10 families), each consisting of a sentence with a target word and a morphological tag as the desired label, derived from the Universal Dependencies treebanks. We find that pre-... |
2404.05392 | Artur Xarles | Artur Xarles, Sergio Escalera, Thomas B. Moeslund, Albert Clap\'es | T-DEED: Temporal-Discriminability Enhancer Encoder-Decoder for Precise
Event Spotting in Sports Videos | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In this paper, we introduce T-DEED, a Temporal-Discriminability Enhancer
Encoder-Decoder for Precise Event Spotting in sports videos. T-DEED addresses
multiple challenges in the task, including the need for discriminability among
frame representations, high output temporal resolution to maintain prediction
precision,... | [
{
"created": "Mon, 8 Apr 2024 10:51:29 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Apr 2024 13:36:58 GMT",
"version": "v2"
}
] | 2024-04-12 | [
[
"Xarles",
"Artur",
""
],
[
"Escalera",
"Sergio",
""
],
[
"Moeslund",
"Thomas B.",
""
],
[
"Clapés",
"Albert",
""
]
] | In this paper, we introduce T-DEED, a Temporal-Discriminability Enhancer Encoder-Decoder for Precise Event Spotting in sports videos. T-DEED addresses multiple challenges in the task, including the need for discriminability among frame representations, high output temporal resolution to maintain prediction precision, a... |
2311.10581 | Peyman Dehghanzadeh | Peyman Dehghanzadeh, Baibhab Chatterjee and Swarup Bhunia | LUNA-CIM: Lookup Table based Programmable Neural Processing in Memory | null | null | null | null | cs.AR cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel approach for performing computations using
Look-Up Tables (LUTs) tailored specifically for Compute-in-Memory applications.
The aim is to address the scalability challenges associated with LUT-based
computation by reducing storage requirements and energy consumption while
capitalizing on th... | [
{
"created": "Fri, 17 Nov 2023 15:32:11 GMT",
"version": "v1"
}
] | 2023-11-20 | [
[
"Dehghanzadeh",
"Peyman",
""
],
[
"Chatterjee",
"Baibhab",
""
],
[
"Bhunia",
"Swarup",
""
]
] | This paper presents a novel approach for performing computations using Look-Up Tables (LUTs) tailored specifically for Compute-in-Memory applications. The aim is to address the scalability challenges associated with LUT-based computation by reducing storage requirements and energy consumption while capitalizing on the ... |
1812.10408 | Hugo Chu | Marko Valentin Micic and Hugo Chu | Hyperbolic Deep Learning for Chinese Natural Language Understanding | 11 pages, 1 figure | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently hyperbolic geometry has proven to be effective in building
embeddings that encode hierarchical and entailment information. This makes it
particularly suited to modelling the complex asymmetrical relationships between
Chinese characters and words. In this paper we first train a large scale
hyperboloid skip-gr... | [
{
"created": "Tue, 11 Dec 2018 09:48:17 GMT",
"version": "v1"
}
] | 2018-12-27 | [
[
"Micic",
"Marko Valentin",
""
],
[
"Chu",
"Hugo",
""
]
] | Recently hyperbolic geometry has proven to be effective in building embeddings that encode hierarchical and entailment information. This makes it particularly suited to modelling the complex asymmetrical relationships between Chinese characters and words. In this paper we first train a large scale hyperboloid skip-gram... |
1602.03808 | Kwang In Kim | Kwang In Kim and James Tompkin and Hanspeter Pfister and Christian
Theobalt | Semi-supervised Learning with Explicit Relationship Regularization | Accepted version of paper published at CVPR 2015,
http://dx.doi.org/10.1109/CVPR.2015.7298831 | null | 10.1109/CVPR.2015.7298831 | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In many learning tasks, the structure of the target space of a function holds
rich information about the relationships between evaluations of functions on
different data points. Existing approaches attempt to exploit this relationship
information implicitly by enforcing smoothness on function evaluations only.
Howeve... | [
{
"created": "Thu, 11 Feb 2016 18:08:58 GMT",
"version": "v1"
}
] | 2016-02-12 | [
[
"Kim",
"Kwang In",
""
],
[
"Tompkin",
"James",
""
],
[
"Pfister",
"Hanspeter",
""
],
[
"Theobalt",
"Christian",
""
]
] | In many learning tasks, the structure of the target space of a function holds rich information about the relationships between evaluations of functions on different data points. Existing approaches attempt to exploit this relationship information implicitly by enforcing smoothness on function evaluations only. However,... |
2310.10692 | Laetitia Teodorescu | Julien Pourcel, C\'edric Colas, Gaia Molinaro, Pierre-Yves Oudeyer,
Laetitia Teodorescu | ACES: Generating Diverse Programming Puzzles with with Autotelic
Generative Models | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | The ability to invent novel and interesting problems is a remarkable feature
of human intelligence that drives innovation, art, and science. We propose a
method that aims to automate this process by harnessing the power of
state-of-the-art generative models to produce a diversity of challenging yet
solvable problems,... | [
{
"created": "Sun, 15 Oct 2023 14:57:14 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Oct 2023 22:19:14 GMT",
"version": "v2"
},
{
"created": "Wed, 25 Oct 2023 12:01:38 GMT",
"version": "v3"
},
{
"created": "Wed, 29 May 2024 08:56:23 GMT",
"version": "v4"
}
] | 2024-05-30 | [
[
"Pourcel",
"Julien",
""
],
[
"Colas",
"Cédric",
""
],
[
"Molinaro",
"Gaia",
""
],
[
"Oudeyer",
"Pierre-Yves",
""
],
[
"Teodorescu",
"Laetitia",
""
]
] | The ability to invent novel and interesting problems is a remarkable feature of human intelligence that drives innovation, art, and science. We propose a method that aims to automate this process by harnessing the power of state-of-the-art generative models to produce a diversity of challenging yet solvable problems, h... |
2108.09065 | Fangqi Li | Fang-Qi Li, Shi-Lin Wang, Alan Wee-Chung Liew | Regulating Ownership Verification for Deep Neural Networks: Scenarios,
Protocols, and Prospects | IJCAI 2021 Workshop on Toward IPR on Deep Learning as Services | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | With the broad application of deep neural networks, the necessity of
protecting them as intellectual properties has become evident. Numerous
watermarking schemes have been proposed to identify the owner of a deep neural
network and verify the ownership. However, most of them focused on the
watermark embedding rather ... | [
{
"created": "Fri, 20 Aug 2021 08:47:40 GMT",
"version": "v1"
}
] | 2021-08-23 | [
[
"Li",
"Fang-Qi",
""
],
[
"Wang",
"Shi-Lin",
""
],
[
"Liew",
"Alan Wee-Chung",
""
]
] | With the broad application of deep neural networks, the necessity of protecting them as intellectual properties has become evident. Numerous watermarking schemes have been proposed to identify the owner of a deep neural network and verify the ownership. However, most of them focused on the watermark embedding rather th... |
2005.10083 | Joseph Sweeney | Joseph Sweeney, Samuel Pagliarini, Lawrence Pileggi | Securing Digital Systems via Split-Chip Obfuscation | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Security is an important facet of integrated circuit design for many
applications. IP privacy and Trojan insertion are growing threats as circuit
fabrication in advanced nodes almost inevitably relies on untrusted foundries.
A proposed solution is Split-Chip Obfuscation that uses a combination trusted
and untrusted I... | [
{
"created": "Wed, 20 May 2020 14:43:25 GMT",
"version": "v1"
}
] | 2020-05-21 | [
[
"Sweeney",
"Joseph",
""
],
[
"Pagliarini",
"Samuel",
""
],
[
"Pileggi",
"Lawrence",
""
]
] | Security is an important facet of integrated circuit design for many applications. IP privacy and Trojan insertion are growing threats as circuit fabrication in advanced nodes almost inevitably relies on untrusted foundries. A proposed solution is Split-Chip Obfuscation that uses a combination trusted and untrusted IC ... |
2105.10384 | Leonid Sokolinsky | Leonid B. Sokolinsky and Irina M. Sokolinskaya | FRaGenLP: A Generator of Random Linear Programming Problems for Cluster
Computing Systems | Submitted to "Communications in Computer and Information Science" | Communications in Computer and Information Science. 2021, vol.
1437. 164-177 | 10.1007/978-3-030-81691-9_12 | null | cs.DC cs.MS math.OC | http://creativecommons.org/licenses/by/4.0/ | The article presents and evaluates a scalable FRaGenLP algorithm for
generating random linear programming problems of large dimension $n$ on cluster
computing systems. To ensure the consistency of the problem and the boundedness
of the feasible region, the constraint system includes $2n+1$ standard
inequalities, call... | [
{
"created": "Tue, 18 May 2021 14:55:24 GMT",
"version": "v1"
}
] | 2021-11-29 | [
[
"Sokolinsky",
"Leonid B.",
""
],
[
"Sokolinskaya",
"Irina M.",
""
]
] | The article presents and evaluates a scalable FRaGenLP algorithm for generating random linear programming problems of large dimension $n$ on cluster computing systems. To ensure the consistency of the problem and the boundedness of the feasible region, the constraint system includes $2n+1$ standard inequalities, called... |
1912.01513 | Jan Feyereisl | Marek Rosa and Olga Afanasjeva and Simon Andersson and Joseph Davidson
and Nicholas Guttenberg and Petr Hlubu\v{c}ek and Martin Poliak and Jaroslav
V\'itku and Jan Feyereisl | BADGER: Learning to (Learn [Learning Algorithms] through Multi-Agent
Communication) | null | null | null | null | cs.AI cs.LG cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we propose a novel memory-based multi-agent meta-learning
architecture and learning procedure that allows for learning of a shared
communication policy that enables the emergence of rapid adaptation to new and
unseen environments by learning to learn learning algorithms through
communication. Behavior, ... | [
{
"created": "Tue, 3 Dec 2019 16:36:42 GMT",
"version": "v1"
}
] | 2019-12-04 | [
[
"Rosa",
"Marek",
""
],
[
"Afanasjeva",
"Olga",
""
],
[
"Andersson",
"Simon",
""
],
[
"Davidson",
"Joseph",
""
],
[
"Guttenberg",
"Nicholas",
""
],
[
"Hlubuček",
"Petr",
""
],
[
"Poliak",
"Martin",
""
],
... | In this work, we propose a novel memory-based multi-agent meta-learning architecture and learning procedure that allows for learning of a shared communication policy that enables the emergence of rapid adaptation to new and unseen environments by learning to learn learning algorithms through communication. Behavior, ad... |
2402.03040 | Yiyuan Zhang | Yiyuan Zhang, Yuhao Kang, Zhixin Zhang, Xiaohan Ding, Sanyuan Zhao,
Xiangyu Yue | InteractiveVideo: User-Centric Controllable Video Generation with
Synergistic Multimodal Instructions | Code, models, and demo are available at
https://github.com/invictus717/InteractiveVideo | null | null | null | cs.CV cs.AI cs.LG cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce $\textit{InteractiveVideo}$, a user-centric framework for video
generation. Different from traditional generative approaches that operate based
on user-provided images or text, our framework is designed for dynamic
interaction, allowing users to instruct the generative model through various
intuitive mec... | [
{
"created": "Mon, 5 Feb 2024 14:24:46 GMT",
"version": "v1"
}
] | 2024-02-06 | [
[
"Zhang",
"Yiyuan",
""
],
[
"Kang",
"Yuhao",
""
],
[
"Zhang",
"Zhixin",
""
],
[
"Ding",
"Xiaohan",
""
],
[
"Zhao",
"Sanyuan",
""
],
[
"Yue",
"Xiangyu",
""
]
] | We introduce $\textit{InteractiveVideo}$, a user-centric framework for video generation. Different from traditional generative approaches that operate based on user-provided images or text, our framework is designed for dynamic interaction, allowing users to instruct the generative model through various intuitive mecha... |
cs/0502080 | Youngchul Sung | Youngchul Sung, Lang Tong and H. Vincent Poor | Sensor Configuration and Activation for Field Detection in Large Sensor
Arrays | 7 pages with 11 figures; also to appear in the Fourth International
Conference on Information Processing in Sensor Networks | null | null | null | cs.IT math.IT | null | The problems of sensor configuration and activation for the detection of
correlated random fields using large sensor arrays are considered. Using
results that characterize the large-array performance of sensor networks in
this application, the detection capabilities of different sensor configurations
are analyzed and... | [
{
"created": "Sat, 19 Feb 2005 17:04:59 GMT",
"version": "v1"
}
] | 2007-07-16 | [
[
"Sung",
"Youngchul",
""
],
[
"Tong",
"Lang",
""
],
[
"Poor",
"H. Vincent",
""
]
] | The problems of sensor configuration and activation for the detection of correlated random fields using large sensor arrays are considered. Using results that characterize the large-array performance of sensor networks in this application, the detection capabilities of different sensor configurations are analyzed and c... |
2204.10909 | Ravi Patel | Ravi G. Patel, Indu Manickam, Myoungkyu Lee, Mamikon Gulian | Error-in-variables modelling for operator learning | 23 pages, 10 figures | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Deep operator learning has emerged as a promising tool for reduced-order
modelling and PDE model discovery. Leveraging the expressive power of deep
neural networks, especially in high dimensions, such methods learn the mapping
between functional state variables. While proposed methods have assumed noise
only in the d... | [
{
"created": "Fri, 22 Apr 2022 19:54:34 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Jul 2022 22:02:47 GMT",
"version": "v2"
}
] | 2022-07-21 | [
[
"Patel",
"Ravi G.",
""
],
[
"Manickam",
"Indu",
""
],
[
"Lee",
"Myoungkyu",
""
],
[
"Gulian",
"Mamikon",
""
]
] | Deep operator learning has emerged as a promising tool for reduced-order modelling and PDE model discovery. Leveraging the expressive power of deep neural networks, especially in high dimensions, such methods learn the mapping between functional state variables. While proposed methods have assumed noise only in the dep... |
1911.04209 | Qinbin Li | Qinbin Li, Zhaomin Wu, Zeyi Wen, Bingsheng He | Privacy-Preserving Gradient Boosting Decision Trees | null | null | null | null | cs.LG cs.CR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Gradient Boosting Decision Tree (GBDT) is a popular machine learning
model for various tasks in recent years. In this paper, we study how to improve
model accuracy of GBDT while preserving the strong guarantee of differential
privacy. Sensitivity and privacy budget are two key design aspects for the
effectiveness... | [
{
"created": "Mon, 11 Nov 2019 12:20:24 GMT",
"version": "v1"
},
{
"created": "Wed, 11 Dec 2019 16:24:01 GMT",
"version": "v2"
},
{
"created": "Thu, 29 Oct 2020 02:38:31 GMT",
"version": "v3"
},
{
"created": "Tue, 16 Mar 2021 06:25:41 GMT",
"version": "v4"
},
{
"c... | 2022-10-11 | [
[
"Li",
"Qinbin",
""
],
[
"Wu",
"Zhaomin",
""
],
[
"Wen",
"Zeyi",
""
],
[
"He",
"Bingsheng",
""
]
] | The Gradient Boosting Decision Tree (GBDT) is a popular machine learning model for various tasks in recent years. In this paper, we study how to improve model accuracy of GBDT while preserving the strong guarantee of differential privacy. Sensitivity and privacy budget are two key design aspects for the effectiveness o... |
1401.0282 | Reza Nourjou | Reza Nourjou, Michinori Hatayama, Stephen F. Smith, Atabak Sadeghi and
Pedro Szekely | Design of a GIS-based Assistant Software Agent for the Incident
Commander to Coordinate Emergency Response Operations | 3 pages, 1 figure, In Workshop on Robots and Sensors integration in
future rescue INformation system (ROSIN' 13). In Conjunction of the IEEE/RSJ
International Conference on Intelligent Robots and Systems (IROS' 13), 2013 | null | null | null | cs.MA cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Problem: This paper addresses the design of an intelligent software system
for the IC (incident commander) of a team in order to coordinate actions of
agents (field units or robots) in the domain of emergency/crisis response
operations. Objective: This paper proposes GICoordinator. It is a GIS-based
assistant softwar... | [
{
"created": "Wed, 1 Jan 2014 13:35:06 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Nourjou",
"Reza",
""
],
[
"Hatayama",
"Michinori",
""
],
[
"Smith",
"Stephen F.",
""
],
[
"Sadeghi",
"Atabak",
""
],
[
"Szekely",
"Pedro",
""
]
] | Problem: This paper addresses the design of an intelligent software system for the IC (incident commander) of a team in order to coordinate actions of agents (field units or robots) in the domain of emergency/crisis response operations. Objective: This paper proposes GICoordinator. It is a GIS-based assistant software ... |
1502.04806 | Vinod M. Prabhakaran | Sibi Raj B. Pillai and Vinod M. Prabhakaran | On the Noisy Feedback Capacity of Gaussian Broadcast Channels | 5 pages, 3 figures, to appear in IEEE Information Theory Workshop
2015, Jerusalem | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is well known that, in general, feedback may enlarge the capacity region
of Gaussian broadcast channels. This has been demonstrated even when the
feedback is noisy (or partial-but-perfect) and only from one of the receivers.
The only case known where feedback has been shown not to enlarge the capacity
region is wh... | [
{
"created": "Tue, 17 Feb 2015 06:06:18 GMT",
"version": "v1"
}
] | 2015-02-18 | [
[
"Pillai",
"Sibi Raj B.",
""
],
[
"Prabhakaran",
"Vinod M.",
""
]
] | It is well known that, in general, feedback may enlarge the capacity region of Gaussian broadcast channels. This has been demonstrated even when the feedback is noisy (or partial-but-perfect) and only from one of the receivers. The only case known where feedback has been shown not to enlarge the capacity region is when... |
1801.05164 | Jean Neraud | Jean N\'eraud (LITIS, UNIROUEN), Carla Selmi (LITIS, UNIROUEN) | Embedding a $\theta$-invariant code into a complete one | arXiv admin note: text overlap with arXiv:1705.05564 | Theoretical Computer Science, Elsevier | 10.1016/j.tcs.2018.08.022 | null | cs.DM cs.CL math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let A be a finite or countable alphabet and let $\theta$ be a literal
(anti-)automorphism onto A * (by definition, such a correspondence is
determinated by a permutation of the alphabet). This paper deals with sets
which are invariant under $\theta$ ($\theta$-invariant for short) that is,
languages L such that $\thet... | [
{
"created": "Tue, 16 Jan 2018 09:09:58 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Aug 2018 16:59:05 GMT",
"version": "v2"
},
{
"created": "Mon, 3 Sep 2018 09:10:32 GMT",
"version": "v3"
}
] | 2018-09-06 | [
[
"Néraud",
"Jean",
"",
"LITIS, UNIROUEN"
],
[
"Selmi",
"Carla",
"",
"LITIS, UNIROUEN"
]
] | Let A be a finite or countable alphabet and let $\theta$ be a literal (anti-)automorphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under $\theta$ ($\theta$-invariant for short) that is, languages L such that $\theta$... |
2301.12204 | Ferdinando Fioretto | Keyu Zhu, Ferdinando Fioretto, Pascal Van Hentenryck, Saswat Das,
Christine Task | Privacy and Bias Analysis of Disclosure Avoidance Systems | null | null | null | null | cs.CR cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Disclosure avoidance (DA) systems are used to safeguard the confidentiality
of data while allowing it to be analyzed and disseminated for analytic
purposes. These methods, e.g., cell suppression, swapping, and k-anonymity, are
commonly applied and may have significant societal and economic implications.
However, a fo... | [
{
"created": "Sat, 28 Jan 2023 13:58:25 GMT",
"version": "v1"
}
] | 2023-01-31 | [
[
"Zhu",
"Keyu",
""
],
[
"Fioretto",
"Ferdinando",
""
],
[
"Van Hentenryck",
"Pascal",
""
],
[
"Das",
"Saswat",
""
],
[
"Task",
"Christine",
""
]
] | Disclosure avoidance (DA) systems are used to safeguard the confidentiality of data while allowing it to be analyzed and disseminated for analytic purposes. These methods, e.g., cell suppression, swapping, and k-anonymity, are commonly applied and may have significant societal and economic implications. However, a form... |
2407.20203 | Yuhong Cao | Yixiao Ma, Jingsong Liang, Yuhong Cao, Derek Ming Siang Tan, Guillaume
Sartoretti | Privileged Reinforcement and Communication Learning for Distributed,
Bandwidth-limited Multi-robot Exploration | Accepted by DARS2024 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Communication bandwidth is an important consideration in multi-robot
exploration, where information exchange among robots is critical. While
existing methods typically aim to reduce communication throughput, they either
require significant computation or significantly compromise exploration
efficiency. In this work, ... | [
{
"created": "Mon, 29 Jul 2024 17:34:55 GMT",
"version": "v1"
}
] | 2024-07-30 | [
[
"Ma",
"Yixiao",
""
],
[
"Liang",
"Jingsong",
""
],
[
"Cao",
"Yuhong",
""
],
[
"Tan",
"Derek Ming Siang",
""
],
[
"Sartoretti",
"Guillaume",
""
]
] | Communication bandwidth is an important consideration in multi-robot exploration, where information exchange among robots is critical. While existing methods typically aim to reduce communication throughput, they either require significant computation or significantly compromise exploration efficiency. In this work, we... |
2212.11151 | Yutaka Nagashima | Yutaka Nagashima, Zijin Xu, Ningli Wang, Daniel Sebastian Goc, and
James Bang | Template-Based Conjecturing for Automated Induction in Isabelle/HOL | To appear at Fundamentals of Software engineering 2023
(http://fsen.ir/2023/) | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Proof by induction plays a central role in formal verification. However, its
automation remains as a formidable challenge in Computer Science. To solve
inductive problems, human engineers often have to provide auxiliary lemmas
manually. We automate this laborious process with template-based conjecturing,
a novel appr... | [
{
"created": "Sun, 20 Nov 2022 22:39:47 GMT",
"version": "v1"
},
{
"created": "Thu, 19 Jan 2023 23:12:41 GMT",
"version": "v2"
}
] | 2023-01-23 | [
[
"Nagashima",
"Yutaka",
""
],
[
"Xu",
"Zijin",
""
],
[
"Wang",
"Ningli",
""
],
[
"Goc",
"Daniel Sebastian",
""
],
[
"Bang",
"James",
""
]
] | Proof by induction plays a central role in formal verification. However, its automation remains as a formidable challenge in Computer Science. To solve inductive problems, human engineers often have to provide auxiliary lemmas manually. We automate this laborious process with template-based conjecturing, a novel approa... |
2309.09782 | Xhani Marvin Sa{\ss} | Xhani Marvin Sa{\ss}, Thilo Krachenfels, Frederik Dermot Pustelnik,
Jean-Pierre Seifert, Christian Gro{\ss}e, Frank Altmann | Modulation to the Rescue: Identifying Sub-Circuitry in the Transistor
Morass for Targeted Analysis | 6 pages, short paper at ASHES2023 | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Physical attacks form one of the most severe threats against secure computing
platforms. Their criticality arises from their corresponding threat model: By,
e.g., passively measuring an integrated circuit's (IC's) environment during a
security-related operation, internal secrets may be disclosed. Furthermore, by
acti... | [
{
"created": "Mon, 18 Sep 2023 13:59:57 GMT",
"version": "v1"
}
] | 2023-09-19 | [
[
"Saß",
"Xhani Marvin",
""
],
[
"Krachenfels",
"Thilo",
""
],
[
"Pustelnik",
"Frederik Dermot",
""
],
[
"Seifert",
"Jean-Pierre",
""
],
[
"Große",
"Christian",
""
],
[
"Altmann",
"Frank",
""
]
] | Physical attacks form one of the most severe threats against secure computing platforms. Their criticality arises from their corresponding threat model: By, e.g., passively measuring an integrated circuit's (IC's) environment during a security-related operation, internal secrets may be disclosed. Furthermore, by active... |
2402.07420 | Hideaki Takahashi | Hideaki Takahashi and Alex Fukunaga | On the Transit Obfuscation Problem | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Concealing an intermediate point on a route or visible from a route is an
important goal in some transportation and surveillance scenarios. This paper
studies the Transit Obfuscation Problem, the problem of traveling from some
start location to an end location while "covering" a specific transit point
that needs to b... | [
{
"created": "Mon, 12 Feb 2024 05:48:52 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Feb 2024 07:02:05 GMT",
"version": "v2"
}
] | 2024-02-14 | [
[
"Takahashi",
"Hideaki",
""
],
[
"Fukunaga",
"Alex",
""
]
] | Concealing an intermediate point on a route or visible from a route is an important goal in some transportation and surveillance scenarios. This paper studies the Transit Obfuscation Problem, the problem of traveling from some start location to an end location while "covering" a specific transit point that needs to be ... |
2011.09517 | Tanveer Syeda-Mahmood | Tanveer Syeda-Mahmood, Ph.D, K.C.L Wong, Ph.D, Joy T. Wu, M.D., M.P.H,
Ashutosh Jadhav, Ph.D, Orest Boyko, M.D. Ph.D | Extracting and Learning Fine-Grained Labels from Chest Radiographs | This paper won the Homer R. Warner Award at AMIA 2020 awarded to a
paper that best describes approaches to improving computerized information
acquisition, knowledge data acquisition and management, and experimental
results documenting the value of these approaches. The paper shows a
combination of textual and v... | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Chest radiographs are the most common diagnostic exam in emergency rooms and
intensive care units today. Recently, a number of researchers have begun
working on large chest X-ray datasets to develop deep learning models for
recognition of a handful of coarse finding classes such as opacities, masses
and nodules. In t... | [
{
"created": "Wed, 18 Nov 2020 19:56:08 GMT",
"version": "v1"
}
] | 2020-11-20 | [
[
"Syeda-Mahmood",
"Tanveer",
""
],
[
"D",
"Ph.",
""
],
[
"Wong",
"K. C. L",
""
],
[
"D",
"Ph.",
""
],
[
"Wu",
"Joy T.",
""
],
[
"D.",
"M.",
""
],
[
"H",
"M. P.",
""
],
[
"Jadhav",
"Ashutosh",
... | Chest radiographs are the most common diagnostic exam in emergency rooms and intensive care units today. Recently, a number of researchers have begun working on large chest X-ray datasets to develop deep learning models for recognition of a handful of coarse finding classes such as opacities, masses and nodules. In thi... |
1911.07399 | Xijie Huang | Xijie Huang, Moustafa Alzantot, Mani Srivastava | NeuronInspect: Detecting Backdoors in Neural Networks via Output
Explanations | 8 pages, 13 figures | null | null | null | cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks have achieved state-of-the-art performance on various
tasks. However, lack of interpretability and transparency makes it easier for
malicious attackers to inject trojan backdoor into the neural networks, which
will make the model behave abnormally when a backdoor sample with a specific
trigger is... | [
{
"created": "Mon, 18 Nov 2019 02:27:10 GMT",
"version": "v1"
}
] | 2019-11-19 | [
[
"Huang",
"Xijie",
""
],
[
"Alzantot",
"Moustafa",
""
],
[
"Srivastava",
"Mani",
""
]
] | Deep neural networks have achieved state-of-the-art performance on various tasks. However, lack of interpretability and transparency makes it easier for malicious attackers to inject trojan backdoor into the neural networks, which will make the model behave abnormally when a backdoor sample with a specific trigger is i... |
cs/0110065 | Kay-Uwe Kasemir | K.U. Kasemir, L.R. Dalesio | Interfacing the ControlLogix PLC over Ethernet/IP | 3 pages, 1 figure, 8th International Conference on Accelerator and
Large Experimental Physics Control Systems (PSN THAP020), San Jose, CA, USA,
November 27-30 | eConf C011127:THDT002,2001 | null | LA-UR -01-5891 | cs.NI cs.AR | null | The Allen-Bradley ControlLogix line of pro-grammable logic controllers (PLCs)
offers several in-terfaces: Ethernet, ControlNet, DeviceNet, RS-232 and others.
The ControlLogix Ethernet interface module 1756-ENET uses EtherNet/IP, the
ControlNet protocol, encapsulated in Ethernet packages, with specific service
codes. ... | [
{
"created": "Wed, 31 Oct 2001 18:07:17 GMT",
"version": "v1"
}
] | 2010-05-27 | [
[
"Kasemir",
"K. U.",
""
],
[
"Dalesio",
"L. R.",
""
]
] | The Allen-Bradley ControlLogix line of pro-grammable logic controllers (PLCs) offers several in-terfaces: Ethernet, ControlNet, DeviceNet, RS-232 and others. The ControlLogix Ethernet interface module 1756-ENET uses EtherNet/IP, the ControlNet protocol, encapsulated in Ethernet packages, with specific service codes. A ... |
2309.04084 | Xiangyu Chen | Xiangyu Chen, Zheyuan Li, Zhengwen Zhang, Jimmy S. Ren, Yihao Liu,
Jingwen He, Yu Qiao, Jiantao Zhou, Chao Dong | Towards Efficient SDRTV-to-HDRTV by Learning from Image Formation | Extended version of HDRTVNet | null | null | null | cs.CV cs.MM eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern displays are capable of rendering video content with high dynamic
range (HDR) and wide color gamut (WCG). However, the majority of available
resources are still in standard dynamic range (SDR). As a result, there is
significant value in transforming existing SDR content into the HDRTV standard.
In this paper, ... | [
{
"created": "Fri, 8 Sep 2023 02:50:54 GMT",
"version": "v1"
}
] | 2023-09-11 | [
[
"Chen",
"Xiangyu",
""
],
[
"Li",
"Zheyuan",
""
],
[
"Zhang",
"Zhengwen",
""
],
[
"Ren",
"Jimmy S.",
""
],
[
"Liu",
"Yihao",
""
],
[
"He",
"Jingwen",
""
],
[
"Qiao",
"Yu",
""
],
[
"Zhou",
"Jianta... | Modern displays are capable of rendering video content with high dynamic range (HDR) and wide color gamut (WCG). However, the majority of available resources are still in standard dynamic range (SDR). As a result, there is significant value in transforming existing SDR content into the HDRTV standard. In this paper, we... |
2303.04579 | Andr\'e Artelt | Andr\'e Artelt, Andreas Gregoriades | "How to make them stay?" -- Diverse Counterfactual Explanations of
Employee Attrition | Accepted as a short paper at ICEIS 2023 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Employee attrition is an important and complex problem that can directly
affect an organisation's competitiveness and performance. Explaining the
reasons why employees leave an organisation is a key human resource management
challenge due to the high costs and time required to attract and keep talented
employees. Bus... | [
{
"created": "Wed, 8 Mar 2023 13:54:57 GMT",
"version": "v1"
}
] | 2023-03-09 | [
[
"Artelt",
"André",
""
],
[
"Gregoriades",
"Andreas",
""
]
] | Employee attrition is an important and complex problem that can directly affect an organisation's competitiveness and performance. Explaining the reasons why employees leave an organisation is a key human resource management challenge due to the high costs and time required to attract and keep talented employees. Busin... |
2303.10346 | Boyan Wan | Boyan Wan, Yifei Shi, Kai Xu | SOCS: Semantically-aware Object Coordinate Space for Category-Level 6D
Object Pose Estimation under Large Shape Variations | 10 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most learning-based approaches to category-level 6D pose estimation are
design around normalized object coordinate space (NOCS). While being
successful, NOCS-based methods become inaccurate and less robust when handling
objects of a category containing significant intra-category shape variations.
This is because the ... | [
{
"created": "Sat, 18 Mar 2023 06:34:16 GMT",
"version": "v1"
}
] | 2023-03-21 | [
[
"Wan",
"Boyan",
""
],
[
"Shi",
"Yifei",
""
],
[
"Xu",
"Kai",
""
]
] | Most learning-based approaches to category-level 6D pose estimation are design around normalized object coordinate space (NOCS). While being successful, NOCS-based methods become inaccurate and less robust when handling objects of a category containing significant intra-category shape variations. This is because the ob... |
1509.02437 | Rishabh Soni | Rishabh Soni, K. James Mathai | Improved Twitter Sentiment Prediction through Cluster-then-Predict Model | 5 pages | null | null | null | cs.IR cs.CL cs.LG cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Over the past decade humans have experienced exponential growth in the use of
online resources, in particular social media and microblogging websites such as
Facebook, Twitter, YouTube and also mobile applications such as WhatsApp, Line,
etc. Many companies have identified these resources as a rich mine of marketing
... | [
{
"created": "Tue, 8 Sep 2015 16:36:04 GMT",
"version": "v1"
}
] | 2015-09-09 | [
[
"Soni",
"Rishabh",
""
],
[
"Mathai",
"K. James",
""
]
] | Over the past decade humans have experienced exponential growth in the use of online resources, in particular social media and microblogging websites such as Facebook, Twitter, YouTube and also mobile applications such as WhatsApp, Line, etc. Many companies have identified these resources as a rich mine of marketing kn... |
1912.02098 | Siddarth Srinivasan | Sandesh Adhikary, Siddarth Srinivasan, Geoff Gordon, Byron Boots | Expressiveness and Learning of Hidden Quantum Markov Models | arXiv admin note: text overlap with arXiv:1903.03730 | null | null | null | cs.LG quant-ph stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Extending classical probabilistic reasoning using the quantum mechanical view
of probability has been of recent interest, particularly in the development of
hidden quantum Markov models (HQMMs) to model stochastic processes. However,
there has been little progress in characterizing the expressiveness of such
models a... | [
{
"created": "Mon, 2 Dec 2019 21:51:19 GMT",
"version": "v1"
}
] | 2019-12-05 | [
[
"Adhikary",
"Sandesh",
""
],
[
"Srinivasan",
"Siddarth",
""
],
[
"Gordon",
"Geoff",
""
],
[
"Boots",
"Byron",
""
]
] | Extending classical probabilistic reasoning using the quantum mechanical view of probability has been of recent interest, particularly in the development of hidden quantum Markov models (HQMMs) to model stochastic processes. However, there has been little progress in characterizing the expressiveness of such models and... |
2305.02997 | Colin White | Duncan McElfresh, Sujay Khandagale, Jonathan Valverde, Vishak Prasad
C, Benjamin Feuer, Chinmay Hegde, Ganesh Ramakrishnan, Micah Goldblum, Colin
White | When Do Neural Nets Outperform Boosted Trees on Tabular Data? | NeurIPS Datasets and Benchmarks Track 2023 | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Tabular data is one of the most commonly used types of data in machine
learning. Despite recent advances in neural nets (NNs) for tabular data, there
is still an active discussion on whether or not NNs generally outperform
gradient-boosted decision trees (GBDTs) on tabular data, with several recent
works arguing eith... | [
{
"created": "Thu, 4 May 2023 17:04:41 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Oct 2023 21:51:42 GMT",
"version": "v2"
},
{
"created": "Mon, 30 Oct 2023 21:24:22 GMT",
"version": "v3"
},
{
"created": "Mon, 15 Jul 2024 19:00:47 GMT",
"version": "v4"
}
] | 2024-07-17 | [
[
"McElfresh",
"Duncan",
""
],
[
"Khandagale",
"Sujay",
""
],
[
"Valverde",
"Jonathan",
""
],
[
"C",
"Vishak Prasad",
""
],
[
"Feuer",
"Benjamin",
""
],
[
"Hegde",
"Chinmay",
""
],
[
"Ramakrishnan",
"Ganesh",
... | Tabular data is one of the most commonly used types of data in machine learning. Despite recent advances in neural nets (NNs) for tabular data, there is still an active discussion on whether or not NNs generally outperform gradient-boosted decision trees (GBDTs) on tabular data, with several recent works arguing either... |
2309.07181 | Fraser Mince | Fraser Mince, Dzung Dinh, Jonas Kgomo, Neil Thompson, Sara Hooker | The Grand Illusion: The Myth of Software Portability and Implications
for ML Progress | 28 pages, 13 figures, repo can be found at associated
https://github.com/for-ai/portability | null | null | null | cs.SE cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Pushing the boundaries of machine learning often requires exploring different
hardware and software combinations. However, the freedom to experiment across
different tooling stacks can be at odds with the drive for efficiency, which
has produced increasingly specialized AI hardware and incentivized
consolidation arou... | [
{
"created": "Tue, 12 Sep 2023 22:11:55 GMT",
"version": "v1"
}
] | 2023-09-15 | [
[
"Mince",
"Fraser",
""
],
[
"Dinh",
"Dzung",
""
],
[
"Kgomo",
"Jonas",
""
],
[
"Thompson",
"Neil",
""
],
[
"Hooker",
"Sara",
""
]
] | Pushing the boundaries of machine learning often requires exploring different hardware and software combinations. However, the freedom to experiment across different tooling stacks can be at odds with the drive for efficiency, which has produced increasingly specialized AI hardware and incentivized consolidation around... |
2010.07708 | Antonis Sidiropoulos | Antonis Sidiropoulos and Zoe Doulgeri | A Reversible Dynamic Movement Primitive formulation | null | 2021 IEEE International Conference on Robotics and Automation
(ICRA), 2021, pp. 3147-3153 | 10.1109/ICRA48506.2021.9562059 | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | In this work, a novel Dynamic Movement Primitive (DMP) formulation is
proposed which supports reversibility, i.e. backwards reproduction of a learned
trajectory. Apart from sharing all favourable properties of the original DMP,
decoupling the teaching of position and velocity profiles and bidirectional
drivability al... | [
{
"created": "Thu, 15 Oct 2020 12:38:31 GMT",
"version": "v1"
},
{
"created": "Wed, 27 Oct 2021 13:47:51 GMT",
"version": "v2"
}
] | 2021-10-28 | [
[
"Sidiropoulos",
"Antonis",
""
],
[
"Doulgeri",
"Zoe",
""
]
] | In this work, a novel Dynamic Movement Primitive (DMP) formulation is proposed which supports reversibility, i.e. backwards reproduction of a learned trajectory. Apart from sharing all favourable properties of the original DMP, decoupling the teaching of position and velocity profiles and bidirectional drivability alon... |
1602.03110 | Akhil Arora | Sainyam Galhotra, Akhil Arora, Shourya Roy | Holistic Influence Maximization: Combining Scalability and Efficiency
with Opinion-Aware Models | ACM SIGMOD Conference 2016, 18 pages, 29 figures | null | 10.1145/2882903.2882929 | null | cs.SI cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The steady growth of graph data from social networks has resulted in
wide-spread research in finding solutions to the influence maximization
problem. In this paper, we propose a holistic solution to the influence
maximization (IM) problem. (1) We introduce an opinion-cum-interaction (OI)
model that closely mirrors th... | [
{
"created": "Tue, 9 Feb 2016 18:21:41 GMT",
"version": "v1"
}
] | 2016-02-10 | [
[
"Galhotra",
"Sainyam",
""
],
[
"Arora",
"Akhil",
""
],
[
"Roy",
"Shourya",
""
]
] | The steady growth of graph data from social networks has resulted in wide-spread research in finding solutions to the influence maximization problem. In this paper, we propose a holistic solution to the influence maximization (IM) problem. (1) We introduce an opinion-cum-interaction (OI) model that closely mirrors the ... |
2311.18809 | Evin P{\i}nar \"Ornek | Evin P{\i}nar \"Ornek and Yann Labb\'e and Bugra Tekin and Lingni Ma
and Cem Keskin and Christian Forster and Tomas Hodan | FoundPose: Unseen Object Pose Estimation with Foundation Features | null | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose FoundPose, a model-based method for 6D pose estimation of unseen
objects from a single RGB image. The method can quickly onboard new objects
using their 3D models without requiring any object- or task-specific training.
In contrast, existing methods typically pre-train on large-scale, task-specific
dataset... | [
{
"created": "Thu, 30 Nov 2023 18:52:29 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Jul 2024 09:33:12 GMT",
"version": "v2"
}
] | 2024-07-22 | [
[
"Örnek",
"Evin Pınar",
""
],
[
"Labbé",
"Yann",
""
],
[
"Tekin",
"Bugra",
""
],
[
"Ma",
"Lingni",
""
],
[
"Keskin",
"Cem",
""
],
[
"Forster",
"Christian",
""
],
[
"Hodan",
"Tomas",
""
]
] | We propose FoundPose, a model-based method for 6D pose estimation of unseen objects from a single RGB image. The method can quickly onboard new objects using their 3D models without requiring any object- or task-specific training. In contrast, existing methods typically pre-train on large-scale, task-specific datasets ... |
2107.14013 | Jonathan Roberts PhD | Jonathan C. Roberts, Peter Butcher, Ann Sherlock and Sarah Nason | Explanatory Journeys: Visualising to Understand and Explain
Administrative Justice Paths of Redress | 11 pages with 10 figures, accepted for publication in IEEE
Transactions on Visualization and Computer Graphics | null | null | null | cs.HC cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Administrative justice concerns the relationships between individuals and the
state. It includes redress and complaints on decisions of a child's education,
social care, licensing, planning, environment, housing and homelessness.
However, if someone has a complaint or an issue, it is challenging for people
to underst... | [
{
"created": "Thu, 29 Jul 2021 14:25:58 GMT",
"version": "v1"
}
] | 2021-07-30 | [
[
"Roberts",
"Jonathan C.",
""
],
[
"Butcher",
"Peter",
""
],
[
"Sherlock",
"Ann",
""
],
[
"Nason",
"Sarah",
""
]
] | Administrative justice concerns the relationships between individuals and the state. It includes redress and complaints on decisions of a child's education, social care, licensing, planning, environment, housing and homelessness. However, if someone has a complaint or an issue, it is challenging for people to understan... |
1806.05121 | Chun Lam Chan | Jean Barbier, Chun Lam Chan and Nicolas Macris | Adaptive Path Interpolation for Sparse Systems: Application to a Simple
Censored Block Model | null | null | null | null | cs.IT cond-mat.dis-nn math-ph math.IT math.MP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently a new adaptive path interpolation method has been developed as a
simple and versatile scheme to calculate exactly the asymptotic mutual
information of Bayesian inference problems defined on dense factor graphs.
These include random linear and generalized estimation, sparse superposition
codes, or low-rank ma... | [
{
"created": "Wed, 13 Jun 2018 15:54:36 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Jul 2019 12:26:40 GMT",
"version": "v2"
}
] | 2019-07-19 | [
[
"Barbier",
"Jean",
""
],
[
"Chan",
"Chun Lam",
""
],
[
"Macris",
"Nicolas",
""
]
] | Recently a new adaptive path interpolation method has been developed as a simple and versatile scheme to calculate exactly the asymptotic mutual information of Bayesian inference problems defined on dense factor graphs. These include random linear and generalized estimation, sparse superposition codes, or low-rank matr... |
1806.01571 | Pengpeng Yang | Pengpeng Yang, Rongrong Ni, and Yao Zhao | Double JPEG Compression Detection by Exploring the Correlations in DCT
Domain | 5 pages, submitted to APSIPA ASC 2018 | null | null | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the field of digital image processing, JPEG image compression technique
has been widely applied. And numerous image processing software suppose this.
It is likely for the images undergoing double JPEG compression to be tampered.
Therefore, double JPEG compression detection schemes can provide an important
clue for... | [
{
"created": "Tue, 5 Jun 2018 09:20:40 GMT",
"version": "v1"
}
] | 2018-06-06 | [
[
"Yang",
"Pengpeng",
""
],
[
"Ni",
"Rongrong",
""
],
[
"Zhao",
"Yao",
""
]
] | In the field of digital image processing, JPEG image compression technique has been widely applied. And numerous image processing software suppose this. It is likely for the images undergoing double JPEG compression to be tampered. Therefore, double JPEG compression detection schemes can provide an important clue for i... |
1203.2299 | Maxim Makatchev | Maxim Makatchev, Reid Simmons, Majd Sakr | A Cross-cultural Corpus of Annotated Verbal and Nonverbal Behaviors in
Receptionist Encounters | 7 pages, 3 figures, presented at the Workshop on Gaze in HRI: From
Modeling to Communication (a Workshop of International Conference on
Human-Robot Interaction), March 5, 2012 | null | null | null | cs.CL cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the first annotated corpus of nonverbal behaviors in receptionist
interactions, and the first nonverbal corpus (excluding the original video and
audio data) of service encounters freely available online. Native speakers of
American English and Arabic participated in a naturalistic role play at
reception de... | [
{
"created": "Sun, 11 Mar 2012 00:45:01 GMT",
"version": "v1"
}
] | 2012-03-13 | [
[
"Makatchev",
"Maxim",
""
],
[
"Simmons",
"Reid",
""
],
[
"Sakr",
"Majd",
""
]
] | We present the first annotated corpus of nonverbal behaviors in receptionist interactions, and the first nonverbal corpus (excluding the original video and audio data) of service encounters freely available online. Native speakers of American English and Arabic participated in a naturalistic role play at reception desk... |
1702.04584 | Lina Antonietta Coppola | Lina Antonietta Coppola | Developing an ontology for the access to the contents of an archival
fonds: the case of the Catasto Gregoriano | in Italian | null | null | null | cs.AI cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The research was proposed to exploit and extend the relational and contextual
nature of the information assets of the Catasto Gregoriano, kept at the
Archivio di Stato in Rome. Developed within the MODEUS project (Making Open
Data Effectively Usable), this study originates from the following key ideas of
MODEUS: to r... | [
{
"created": "Wed, 15 Feb 2017 12:58:39 GMT",
"version": "v1"
}
] | 2017-02-16 | [
[
"Coppola",
"Lina Antonietta",
""
]
] | The research was proposed to exploit and extend the relational and contextual nature of the information assets of the Catasto Gregoriano, kept at the Archivio di Stato in Rome. Developed within the MODEUS project (Making Open Data Effectively Usable), this study originates from the following key ideas of MODEUS: to req... |
2310.02470 | Muhammed Fatih Bal{\i}n | Muhammed Fatih Balin, Xiaojing An, Abdurrahman Ya\c{s}ar, \"Umit V.
\c{C}ataly\"urek | SGORP: A Subgradient-based Method for d-Dimensional Rectilinear
Partitioning | null | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | Partitioning for load balancing is a crucial first step to parallelize any
type of computation. In this work, we propose SGORP, a new spatial partitioning
method based on Subgradient Optimization, to solve the $d$-dimensional
Rectilinear Partitioning Problem (RPP). Our proposed method allows the use of
customizable o... | [
{
"created": "Tue, 3 Oct 2023 22:37:27 GMT",
"version": "v1"
}
] | 2023-10-05 | [
[
"Balin",
"Muhammed Fatih",
""
],
[
"An",
"Xiaojing",
""
],
[
"Yaşar",
"Abdurrahman",
""
],
[
"Çatalyürek",
"Ümit V.",
""
]
] | Partitioning for load balancing is a crucial first step to parallelize any type of computation. In this work, we propose SGORP, a new spatial partitioning method based on Subgradient Optimization, to solve the $d$-dimensional Rectilinear Partitioning Problem (RPP). Our proposed method allows the use of customizable obj... |
2402.03772 | Zeyan Zhuang | Zeyan Zhuang, Xin Zhang, Dongfang Xu, and Shenghui Song | Fundamental Limits of Two-Hop MIMO Channels: An Asymptotic Approach | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-antenna relays and intelligent reflecting surfaces (IRSs) have been
utilized to construct favorable channels to improve the performance of wireless
systems. A common feature between relay systems and IRS-aided systems is the
two-hop multiple-input multiple-output (MIMO) channel. As a result, the mutual
informat... | [
{
"created": "Tue, 6 Feb 2024 07:32:02 GMT",
"version": "v1"
}
] | 2024-02-07 | [
[
"Zhuang",
"Zeyan",
""
],
[
"Zhang",
"Xin",
""
],
[
"Xu",
"Dongfang",
""
],
[
"Song",
"Shenghui",
""
]
] | Multi-antenna relays and intelligent reflecting surfaces (IRSs) have been utilized to construct favorable channels to improve the performance of wireless systems. A common feature between relay systems and IRS-aided systems is the two-hop multiple-input multiple-output (MIMO) channel. As a result, the mutual informatio... |
2203.16463 | Georg Pichler | Georg Pichler and Marco Romanelli and Leonardo Rey Vega and Pablo
Piantanida | Perfectly Accurate Membership Inference by a Dishonest Central Server in
Federated Learning | accepted for publication in IEEE Transactions on Dependable and
Secure Computing | null | 10.1109/TDSC.2023.3326230 | null | cs.LG cs.AI cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated Learning is expected to provide strong privacy guarantees, as only
gradients or model parameters but no plain text training data is ever exchanged
either between the clients or between the clients and the central server. In
this paper, we challenge this claim by introducing a simple but still very
effective... | [
{
"created": "Wed, 30 Mar 2022 17:01:19 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Nov 2023 08:44:44 GMT",
"version": "v2"
}
] | 2023-11-10 | [
[
"Pichler",
"Georg",
""
],
[
"Romanelli",
"Marco",
""
],
[
"Vega",
"Leonardo Rey",
""
],
[
"Piantanida",
"Pablo",
""
]
] | Federated Learning is expected to provide strong privacy guarantees, as only gradients or model parameters but no plain text training data is ever exchanged either between the clients or between the clients and the central server. In this paper, we challenge this claim by introducing a simple but still very effective m... |
2002.05607 | Zheng Chen | Zheng Chen, Xing Fan, Yuan Ling, Lambert Mathias, Chenlei Guo | Pre-Training for Query Rewriting in A Spoken Language Understanding
System | null | null | null | null | cs.CL cs.IR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Query rewriting (QR) is an increasingly important technique to reduce
customer friction caused by errors in a spoken language understanding pipeline,
where the errors originate from various sources such as speech recognition
errors, language understanding errors or entity resolution errors. In this
work, we first pro... | [
{
"created": "Thu, 13 Feb 2020 16:31:50 GMT",
"version": "v1"
}
] | 2020-02-14 | [
[
"Chen",
"Zheng",
""
],
[
"Fan",
"Xing",
""
],
[
"Ling",
"Yuan",
""
],
[
"Mathias",
"Lambert",
""
],
[
"Guo",
"Chenlei",
""
]
] | Query rewriting (QR) is an increasingly important technique to reduce customer friction caused by errors in a spoken language understanding pipeline, where the errors originate from various sources such as speech recognition errors, language understanding errors or entity resolution errors. In this work, we first propo... |
1909.07587 | Sayan Putatunda PhD | Sayan Putatunda | A Hybrid Deep Learning Approach for Diagnosis of the Erythemato-Squamous
Disease | Pre-review version of the paper accepted at the 2020 IEEE
International Conference on Electronics, Computing and Communication
Technologies (CONECCT) | 2020 IEEE International Conference on Electronics, Computing and
Communication Technologies (CONECCT) | 10.1109/CONECCT50063.2020.9198447 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The diagnosis of the Erythemato-squamous disease (ESD) is accepted as a
difficult problem in dermatology. ESD is a form of skin disease. It generally
causes redness of the skin and also may cause loss of skin. They are generally
due to genetic or environmental factors. ESD comprises six classes of skin
conditions nam... | [
{
"created": "Tue, 17 Sep 2019 04:50:28 GMT",
"version": "v1"
},
{
"created": "Sun, 24 May 2020 04:52:54 GMT",
"version": "v2"
}
] | 2020-09-18 | [
[
"Putatunda",
"Sayan",
""
]
] | The diagnosis of the Erythemato-squamous disease (ESD) is accepted as a difficult problem in dermatology. ESD is a form of skin disease. It generally causes redness of the skin and also may cause loss of skin. They are generally due to genetic or environmental factors. ESD comprises six classes of skin conditions namel... |
2108.07709 | Anshul Kumar | Anshul Kumar, Taylor DiJohnson, Roger Edwards, Lisa Walker | The application of adaptive minimum match k-nearest neighbors to
identify at-risk students in health professions education | null | JPAE 34(3):p 171-177, September 2023 | 10.1097/JPA.0000000000000513 | null | cs.CY cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Purpose: When a learner fails to reach a milestone, educators often wonder if
there had been any warning signs that could have allowed them to intervene
sooner. Machine learning can predict which students are at risk of failing a
high-stakes certification exam. If predictions can be made well in advance of
the exam, ... | [
{
"created": "Thu, 5 Aug 2021 03:55:53 GMT",
"version": "v1"
},
{
"created": "Sat, 5 Mar 2022 07:10:45 GMT",
"version": "v2"
},
{
"created": "Tue, 9 Aug 2022 16:08:42 GMT",
"version": "v3"
}
] | 2023-09-01 | [
[
"Kumar",
"Anshul",
""
],
[
"DiJohnson",
"Taylor",
""
],
[
"Edwards",
"Roger",
""
],
[
"Walker",
"Lisa",
""
]
] | Purpose: When a learner fails to reach a milestone, educators often wonder if there had been any warning signs that could have allowed them to intervene sooner. Machine learning can predict which students are at risk of failing a high-stakes certification exam. If predictions can be made well in advance of the exam, th... |
2401.10744 | Ziqiang Yuan Mr. | Ziqiang Yuan, Kaiyuan Wang, Shoutai Zhu, Ye Yuan, Jingya Zhou, Yanlin
Zhu, Wenqi Wei | FinLLMs: A Framework for Financial Reasoning Dataset Generation with
Large Language Models | Under submission of IEEE Transactions | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large Language models (LLMs) usually rely on extensive training datasets. In
the financial domain, creating numerical reasoning datasets that include a mix
of tables and long text often involves substantial manual annotation expenses.
To address the limited data resources and reduce the annotation cost, we
introduce ... | [
{
"created": "Fri, 19 Jan 2024 15:09:39 GMT",
"version": "v1"
}
] | 2024-01-22 | [
[
"Yuan",
"Ziqiang",
""
],
[
"Wang",
"Kaiyuan",
""
],
[
"Zhu",
"Shoutai",
""
],
[
"Yuan",
"Ye",
""
],
[
"Zhou",
"Jingya",
""
],
[
"Zhu",
"Yanlin",
""
],
[
"Wei",
"Wenqi",
""
]
] | Large Language models (LLMs) usually rely on extensive training datasets. In the financial domain, creating numerical reasoning datasets that include a mix of tables and long text often involves substantial manual annotation expenses. To address the limited data resources and reduce the annotation cost, we introduce Fi... |
2008.08286 | Jihoon Cha | Jihoon Cha, Junil Choi, and David J. Love | Noncoherent OOK Symbol Detection with Supervised-Learning Approach for
BCC | This paper has been accepted from the IEEE International Symposium on
Personal, Indoor and Mobile Radio Communications (PIMRC) | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There has been a continuing demand for improving the accuracy and ease of use
of medical devices used on or around the human body. Communication is critical
to medical applications, and wireless body area networks (WBANs) have the
potential to revolutionize diagnosis. Despite its importance, WBAN technology
is still ... | [
{
"created": "Wed, 19 Aug 2020 06:36:01 GMT",
"version": "v1"
}
] | 2020-08-20 | [
[
"Cha",
"Jihoon",
""
],
[
"Choi",
"Junil",
""
],
[
"Love",
"David J.",
""
]
] | There has been a continuing demand for improving the accuracy and ease of use of medical devices used on or around the human body. Communication is critical to medical applications, and wireless body area networks (WBANs) have the potential to revolutionize diagnosis. Despite its importance, WBAN technology is still in... |
1904.10786 | Ond\v{r}ej Leng\'al | Milan \v{C}e\v{s}ka, Vojt\v{e}ch Havlena, Luk\'a\v{s} Hol\'ik, Jan
Ko\v{r}enek, Ond\v{r}ej Leng\'al, Denis Matou\v{s}ek, Ji\v{r}\'i
Matou\v{s}ek, Jakub Semri\v{c}, Tom\'a\v{s} Vojnar | Deep Packet Inspection in FPGAs via Approximate Nondeterministic
Automata | In Proceedings of FCCM'19 | null | null | null | cs.FL cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep packet inspection via regular expression (RE) matching is a crucial task
of network intrusion detection systems (IDSes), which secure Internet
connection against attacks and suspicious network traffic. Monitoring
high-speed computer networks (100 Gbps and faster) in a single-box solution
demands that the RE matc... | [
{
"created": "Wed, 24 Apr 2019 13:13:07 GMT",
"version": "v1"
}
] | 2019-04-25 | [
[
"Češka",
"Milan",
""
],
[
"Havlena",
"Vojtěch",
""
],
[
"Holík",
"Lukáš",
""
],
[
"Kořenek",
"Jan",
""
],
[
"Lengál",
"Ondřej",
""
],
[
"Matoušek",
"Denis",
""
],
[
"Matoušek",
"Jiří",
""
],
[
"Semr... | Deep packet inspection via regular expression (RE) matching is a crucial task of network intrusion detection systems (IDSes), which secure Internet connection against attacks and suspicious network traffic. Monitoring high-speed computer networks (100 Gbps and faster) in a single-box solution demands that the RE matchi... |
2011.00775 | Ruo Ando | Ruo Ando, Yoshiyasu Takefuji | A Curious New Result of Resolution Strategies in Negation-Limited
Inverters Problem | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generally, negation-limited inverters problem is known as a puzzle of
constructing an inverter with AND gates and OR gates and a few inverters. In
this paper, we introduce a curious new result about the effectiveness of two
powerful ATP (Automated Theorem Proving) strategies on tackling negation
limited inverter prob... | [
{
"created": "Mon, 2 Nov 2020 06:52:35 GMT",
"version": "v1"
}
] | 2020-11-03 | [
[
"Ando",
"Ruo",
""
],
[
"Takefuji",
"Yoshiyasu",
""
]
] | Generally, negation-limited inverters problem is known as a puzzle of constructing an inverter with AND gates and OR gates and a few inverters. In this paper, we introduce a curious new result about the effectiveness of two powerful ATP (Automated Theorem Proving) strategies on tackling negation limited inverter proble... |
1706.07598 | Antonio Jose Jimeno Yepes | Quan Tran, Andrew MacKinlay and Antonio Jimeno Yepes | Named Entity Recognition with stack residual LSTM and trainable bias
decoding | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recurrent Neural Network models are the state-of-the-art for Named Entity
Recognition (NER). We present two innovations to improve the performance of
these models. The first innovation is the introduction of residual connections
between the Stacked Recurrent Neural Network model to address the degradation
problem of ... | [
{
"created": "Fri, 23 Jun 2017 08:33:38 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Jul 2017 11:57:13 GMT",
"version": "v2"
}
] | 2017-07-12 | [
[
"Tran",
"Quan",
""
],
[
"MacKinlay",
"Andrew",
""
],
[
"Yepes",
"Antonio Jimeno",
""
]
] | Recurrent Neural Network models are the state-of-the-art for Named Entity Recognition (NER). We present two innovations to improve the performance of these models. The first innovation is the introduction of residual connections between the Stacked Recurrent Neural Network model to address the degradation problem of de... |
1303.1026 | Simon Blackburn | Simon R. Blackburn | Non-overlapping codes | 14 pages. Extra explanations added at some points, and an extra
citation. To appear in IEEE Trans Information Theory | null | 10.1109/TIT.2015.2456634 | null | cs.DM cs.IT math.CO math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We say that a $q$-ary length $n$ code is \emph{non-overlapping} if the set of
non-trivial prefixes of codewords and the set of non-trivial suffices of
codewords are disjoint. These codes were first studied by Levenshtein in 1964,
motivated by applications in synchronisation. More recently these codes were
independent... | [
{
"created": "Tue, 5 Mar 2013 13:26:11 GMT",
"version": "v1"
},
{
"created": "Mon, 31 Mar 2014 15:34:50 GMT",
"version": "v2"
},
{
"created": "Wed, 8 Jul 2015 12:53:39 GMT",
"version": "v3"
}
] | 2016-11-15 | [
[
"Blackburn",
"Simon R.",
""
]
] | We say that a $q$-ary length $n$ code is \emph{non-overlapping} if the set of non-trivial prefixes of codewords and the set of non-trivial suffices of codewords are disjoint. These codes were first studied by Levenshtein in 1964, motivated by applications in synchronisation. More recently these codes were independently... |
1702.07474 | Fei Han | Fei Han, Xue Yang, Christopher Reardon, Yu Zhang, Hao Zhang | Simultaneous Feature and Body-Part Learning for Real-Time Robot
Awareness of Human Behaviors | 8 pages, 6 figures, accepted by ICRA'17 | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robot awareness of human actions is an essential research problem in robotics
with many important real-world applications, including human-robot
collaboration and teaming. Over the past few years, depth sensors have become a
standard device widely used by intelligent robots for 3D perception, which can
also offer hum... | [
{
"created": "Fri, 24 Feb 2017 06:35:10 GMT",
"version": "v1"
}
] | 2017-02-27 | [
[
"Han",
"Fei",
""
],
[
"Yang",
"Xue",
""
],
[
"Reardon",
"Christopher",
""
],
[
"Zhang",
"Yu",
""
],
[
"Zhang",
"Hao",
""
]
] | Robot awareness of human actions is an essential research problem in robotics with many important real-world applications, including human-robot collaboration and teaming. Over the past few years, depth sensors have become a standard device widely used by intelligent robots for 3D perception, which can also offer human... |
2306.12331 | Aniket Sharma | Aniket Sharma and Nandan K Sinha | Decentralized Aerial Transportation and Manipulation of a Cable-Slung
Payload With Swarm of Agents | null | null | null | null | cs.MA cs.RO | http://creativecommons.org/licenses/by/4.0/ | With the advent of Unmanned Aerial Vehicles (UAV) and Micro Aerial Vehicles
(MAV) in commercial sectors, their application for transporting and
manipulating payloads has attracted many research work. A swarm of agents,
cooperatively working to transport and manipulate a payload can overcome the
physical limitations o... | [
{
"created": "Wed, 21 Jun 2023 15:20:53 GMT",
"version": "v1"
}
] | 2023-06-22 | [
[
"Sharma",
"Aniket",
""
],
[
"Sinha",
"Nandan K",
""
]
] | With the advent of Unmanned Aerial Vehicles (UAV) and Micro Aerial Vehicles (MAV) in commercial sectors, their application for transporting and manipulating payloads has attracted many research work. A swarm of agents, cooperatively working to transport and manipulate a payload can overcome the physical limitations of ... |
2407.19894 | Ivan Kruzhilov | Alexander Ponomarchuk, Ivan Kruzhilov, Galina Zubkova, Artem Shadrin,
Ruslan Utegenov, Ivan Bessonov, Pavel Blinov | End-to-end SYNTAX score prediction: benchmark and methods | null | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | The SYNTAX score has become a widely used measure of coronary disease
severity , crucial in selecting the optimal mode of revascularization. This
paper introduces a new medical regression and classification problem -
automatically estimating SYNTAX score from coronary angiography. Our study
presents a comprehensive d... | [
{
"created": "Mon, 29 Jul 2024 11:16:59 GMT",
"version": "v1"
}
] | 2024-07-30 | [
[
"Ponomarchuk",
"Alexander",
""
],
[
"Kruzhilov",
"Ivan",
""
],
[
"Zubkova",
"Galina",
""
],
[
"Shadrin",
"Artem",
""
],
[
"Utegenov",
"Ruslan",
""
],
[
"Bessonov",
"Ivan",
""
],
[
"Blinov",
"Pavel",
""
]
... | The SYNTAX score has become a widely used measure of coronary disease severity , crucial in selecting the optimal mode of revascularization. This paper introduces a new medical regression and classification problem - automatically estimating SYNTAX score from coronary angiography. Our study presents a comprehensive dat... |
2309.09134 | Dimitrios Myrisiotis | Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios
Myrisiotis, A. Pavan, N. V. Vinodchandran | Total Variation Distance Meets Probabilistic Inference | 25 pages. This work has been accepted for presentation at the
International Conference on Machine Learning (ICML) 2024 | null | null | null | cs.DS cs.CC cs.DM cs.LG | http://creativecommons.org/licenses/by/4.0/ | In this paper, we establish a novel connection between total variation (TV)
distance estimation and probabilistic inference. In particular, we present an
efficient, structure-preserving reduction from relative approximation of TV
distance to probabilistic inference over directed graphical models. This
reduction leads... | [
{
"created": "Sun, 17 Sep 2023 02:12:36 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Jul 2024 08:24:41 GMT",
"version": "v2"
}
] | 2024-07-02 | [
[
"Bhattacharyya",
"Arnab",
""
],
[
"Gayen",
"Sutanu",
""
],
[
"Meel",
"Kuldeep S.",
""
],
[
"Myrisiotis",
"Dimitrios",
""
],
[
"Pavan",
"A.",
""
],
[
"Vinodchandran",
"N. V.",
""
]
] | In this paper, we establish a novel connection between total variation (TV) distance estimation and probabilistic inference. In particular, we present an efficient, structure-preserving reduction from relative approximation of TV distance to probabilistic inference over directed graphical models. This reduction leads t... |
0905.3359 | Geoff Hollinger | Ath. Kehagias, G. Hollinger and A. Gelastopoulos | Searching the Nodes of a Graph: Theory and Algorithms | null | null | null | null | cs.DM cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One or more searchers must capture an invisible evader hiding in the nodes of
a graph. We study this graph search problem; we emphasize that we study the
capture of a node-located evader, which has received less attention than edge
search. We show that in general graphs the problem of node search is easier
than that ... | [
{
"created": "Wed, 20 May 2009 17:15:54 GMT",
"version": "v1"
}
] | 2009-05-21 | [
[
"Kehagias",
"Ath.",
""
],
[
"Hollinger",
"G.",
""
],
[
"Gelastopoulos",
"A.",
""
]
] | One or more searchers must capture an invisible evader hiding in the nodes of a graph. We study this graph search problem; we emphasize that we study the capture of a node-located evader, which has received less attention than edge search. We show that in general graphs the problem of node search is easier than that of... |
2405.20713 | Erik Pohle | Erik Pohle, Aysajan Abidin, Bart Preneel | Fast Evaluation of S-boxes with Garbled Circuits | 15 pages, published in IEEE Transactions on Information Forensics and
Security vol. 19 | IEEE Transactions on Information Forensics and Security, vol. 19,
pp. 5530-5544, 2024. | 10.1109/TIFS.2024.3402145 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Garbling schemes are vital primitives for privacy-preserving protocols and
secure two-party computation. This paper presents a projective garbling scheme
that assigns $2^n$ values to wires in a circuit comprising XOR and unary
projection gates. A generalization of FreeXOR allows the XOR of wires with
$2^n$ values to ... | [
{
"created": "Fri, 31 May 2024 09:07:44 GMT",
"version": "v1"
}
] | 2024-06-03 | [
[
"Pohle",
"Erik",
""
],
[
"Abidin",
"Aysajan",
""
],
[
"Preneel",
"Bart",
""
]
] | Garbling schemes are vital primitives for privacy-preserving protocols and secure two-party computation. This paper presents a projective garbling scheme that assigns $2^n$ values to wires in a circuit comprising XOR and unary projection gates. A generalization of FreeXOR allows the XOR of wires with $2^n$ values to be... |
2201.12352 | Swapnil Bhosale | Swapnil Bhosale, Rupayan Chakraborty, Sunil Kumar Kopparapu | Automatic Audio Captioning using Attention weighted Event based
Embeddings | null | null | null | null | cs.SD cs.LG eess.AS | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Automatic Audio Captioning (AAC) refers to the task of translating audio into
a natural language that describes the audio events, source of the events and
their relationships. The limited samples in AAC datasets at present, has set up
a trend to incorporate transfer learning with Audio Event Detection (AED) as a
pare... | [
{
"created": "Fri, 28 Jan 2022 05:54:19 GMT",
"version": "v1"
}
] | 2022-02-01 | [
[
"Bhosale",
"Swapnil",
""
],
[
"Chakraborty",
"Rupayan",
""
],
[
"Kopparapu",
"Sunil Kumar",
""
]
] | Automatic Audio Captioning (AAC) refers to the task of translating audio into a natural language that describes the audio events, source of the events and their relationships. The limited samples in AAC datasets at present, has set up a trend to incorporate transfer learning with Audio Event Detection (AED) as a parent... |
2006.13329 | Alisa Liu | Alexander Fang, Alisa Liu, Prem Seetharaman, Bryan Pardo | Bach or Mock? A Grading Function for Chorales in the Style of J.S. Bach | 2 pages, 3 figures, Machine Learning for Media Discovery (ML4MD)
Workshop at ICML 2020 | null | null | null | cs.SD cs.LG eess.AS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep generative systems that learn probabilistic models from a corpus of
existing music do not explicitly encode knowledge of a musical style, compared
to traditional rule-based systems. Thus, it can be difficult to determine
whether deep models generate stylistically correct output without expert
evaluation, but thi... | [
{
"created": "Tue, 23 Jun 2020 21:02:55 GMT",
"version": "v1"
},
{
"created": "Thu, 25 Jun 2020 18:56:12 GMT",
"version": "v2"
},
{
"created": "Fri, 17 Jul 2020 16:25:28 GMT",
"version": "v3"
}
] | 2020-07-20 | [
[
"Fang",
"Alexander",
""
],
[
"Liu",
"Alisa",
""
],
[
"Seetharaman",
"Prem",
""
],
[
"Pardo",
"Bryan",
""
]
] | Deep generative systems that learn probabilistic models from a corpus of existing music do not explicitly encode knowledge of a musical style, compared to traditional rule-based systems. Thus, it can be difficult to determine whether deep models generate stylistically correct output without expert evaluation, but this ... |
2308.00295 | Shamanthak Hegde | Shamanthak Hegde, Soumya Jahagirdar and Shankar Gangisetty | Making the V in Text-VQA Matter | Accepted for the CVPR 2023 Workshop on Open-Domain Reasoning Under
Multi-Modal Settings | null | null | null | cs.CV cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | Text-based VQA aims at answering questions by reading the text present in the
images. It requires a large amount of scene-text relationship understanding
compared to the VQA task. Recent studies have shown that the question-answer
pairs in the dataset are more focused on the text present in the image but less
importa... | [
{
"created": "Tue, 1 Aug 2023 05:28:13 GMT",
"version": "v1"
}
] | 2023-08-02 | [
[
"Hegde",
"Shamanthak",
""
],
[
"Jahagirdar",
"Soumya",
""
],
[
"Gangisetty",
"Shankar",
""
]
] | Text-based VQA aims at answering questions by reading the text present in the images. It requires a large amount of scene-text relationship understanding compared to the VQA task. Recent studies have shown that the question-answer pairs in the dataset are more focused on the text present in the image but less importanc... |
1603.06798 | Fran\c{c}ois Simon | Francois Simon | On The Capacity Of Noisy Computations | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an analysis of the concept of capacity for noisy com-
putations, i.e. functions implemented by unreliable or random devices. An
information theoretic model of noisy computation of a perfect function f
(measurable function between sequence spaces) thanks to an unreliable device
(random channel) F i... | [
{
"created": "Tue, 22 Mar 2016 14:08:40 GMT",
"version": "v1"
}
] | 2016-03-23 | [
[
"Simon",
"Francois",
""
]
] | This paper presents an analysis of the concept of capacity for noisy com- putations, i.e. functions implemented by unreliable or random devices. An information theoretic model of noisy computation of a perfect function f (measurable function between sequence spaces) thanks to an unreliable device (random channel) F is ... |
2003.09516 | Karen Bodie | Karen Bodie, Maximilian Brunner, Michael Pantic, Stefan Walser,
Patrick Pf\"andler, Ueli Angst, Roland Siegwart, and Juan Nieto | Active Interaction Force Control for Contact-Based Inspection with a
Fully Actuated Aerial Vehicle | 14 pages, 17 figures | null | 10.1109/TRO.2020.3036623 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents and validates active interaction force control and
planning for fully actuated and omnidirectional aerial manipulation platforms,
with the goal of aerial contact inspection in unstructured environments. We
present a variable axis-selective impedance control which integrates direct
force control fo... | [
{
"created": "Fri, 20 Mar 2020 22:15:50 GMT",
"version": "v1"
},
{
"created": "Wed, 1 Apr 2020 09:06:22 GMT",
"version": "v2"
},
{
"created": "Tue, 5 Jan 2021 10:00:19 GMT",
"version": "v3"
}
] | 2021-01-06 | [
[
"Bodie",
"Karen",
""
],
[
"Brunner",
"Maximilian",
""
],
[
"Pantic",
"Michael",
""
],
[
"Walser",
"Stefan",
""
],
[
"Pfändler",
"Patrick",
""
],
[
"Angst",
"Ueli",
""
],
[
"Siegwart",
"Roland",
""
],
[
... | This paper presents and validates active interaction force control and planning for fully actuated and omnidirectional aerial manipulation platforms, with the goal of aerial contact inspection in unstructured environments. We present a variable axis-selective impedance control which integrates direct force control for ... |
2305.11615 | Jingcai Guo | Yingchun Wang, Jingcai Guo, Yi Liu, Song Guo, Weizhan Zhang, Xiangyong
Cao, Qinghua Zheng | SFP: Spurious Feature-targeted Pruning for Out-of-Distribution
Generalization | 14 pages, 4 figures. arXiv admin note: substantial text overlap with
arXiv:2212.09458 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Model substructure learning aims to find an invariant network substructure
that can have better out-of-distribution (OOD) generalization than the original
full structure. Existing works usually search the invariant substructure using
modular risk minimization (MRM) with fully exposed out-domain data, which may
bring ... | [
{
"created": "Fri, 19 May 2023 11:46:36 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Jun 2023 04:29:43 GMT",
"version": "v2"
}
] | 2023-06-05 | [
[
"Wang",
"Yingchun",
""
],
[
"Guo",
"Jingcai",
""
],
[
"Liu",
"Yi",
""
],
[
"Guo",
"Song",
""
],
[
"Zhang",
"Weizhan",
""
],
[
"Cao",
"Xiangyong",
""
],
[
"Zheng",
"Qinghua",
""
]
] | Model substructure learning aims to find an invariant network substructure that can have better out-of-distribution (OOD) generalization than the original full structure. Existing works usually search the invariant substructure using modular risk minimization (MRM) with fully exposed out-domain data, which may bring ab... |
1407.2758 | Yunquan Dong | Yunquan Dong, Zhi Chen, Pingyi Fan, Khaled Ben Letaief | Mobility-Aware Uplink Interference Model for 5G Heterogeneous Networks | 14 pages,12 figures | null | 10.1109/TWC.2015.2500566 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To meet the surging demand for throughput, 5G cellular networks need to be
more heterogeneous and much denser, by deploying more and more small cells. In
particular, the number of users in each small cell can change dramatically due
to users' mobility, resulting in random and time varying uplink interference.
This pa... | [
{
"created": "Thu, 10 Jul 2014 11:26:59 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Jul 2014 01:13:56 GMT",
"version": "v2"
},
{
"created": "Fri, 13 Nov 2015 09:21:34 GMT",
"version": "v3"
}
] | 2015-11-16 | [
[
"Dong",
"Yunquan",
""
],
[
"Chen",
"Zhi",
""
],
[
"Fan",
"Pingyi",
""
],
[
"Letaief",
"Khaled Ben",
""
]
] | To meet the surging demand for throughput, 5G cellular networks need to be more heterogeneous and much denser, by deploying more and more small cells. In particular, the number of users in each small cell can change dramatically due to users' mobility, resulting in random and time varying uplink interference. This pape... |
2302.10632 | Wei Wei | Wei Wei and Chao Huang and Lianghao Xia and Chuxu Zhang | Multi-Modal Self-Supervised Learning for Recommendation | This paper has been published as a full paper at WWW 2023 | null | 10.1145/3543507.3583206 | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The online emergence of multi-modal sharing platforms (eg, TikTok, Youtube)
is powering personalized recommender systems to incorporate various modalities
(eg, visual, textual and acoustic) into the latent user representations. While
existing works on multi-modal recommendation exploit multimedia content
features in ... | [
{
"created": "Tue, 21 Feb 2023 12:44:17 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Feb 2023 11:48:45 GMT",
"version": "v2"
},
{
"created": "Tue, 28 Feb 2023 12:13:25 GMT",
"version": "v3"
},
{
"created": "Fri, 7 Apr 2023 13:41:20 GMT",
"version": "v4"
},
{
"cr... | 2023-07-19 | [
[
"Wei",
"Wei",
""
],
[
"Huang",
"Chao",
""
],
[
"Xia",
"Lianghao",
""
],
[
"Zhang",
"Chuxu",
""
]
] | The online emergence of multi-modal sharing platforms (eg, TikTok, Youtube) is powering personalized recommender systems to incorporate various modalities (eg, visual, textual and acoustic) into the latent user representations. While existing works on multi-modal recommendation exploit multimedia content features in en... |
1509.05454 | Jo\~ao Strapasson E. | Jo\~ao E. Strapasson and Cristiano Torezzan | A heuristic approach for designing cyclic group codes | 16 pages, 4 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we propose a heuristic technique for distributing points on the
surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a
finite cyclic subgroup of orthogonal matrices, the so called cyclic group
codes. Massive numerical experiments were done and many new cyclic group codes
have been... | [
{
"created": "Thu, 17 Sep 2015 21:54:26 GMT",
"version": "v1"
}
] | 2015-09-21 | [
[
"Strapasson",
"João E.",
""
],
[
"Torezzan",
"Cristiano",
""
]
] | In this paper we propose a heuristic technique for distributing points on the surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so called cyclic group codes. Massive numerical experiments were done and many new cyclic group codes have been o... |
2407.16295 | Chunjiang Che | Chunjiang Che, Songze Li, Xuechao Wang | Manifoldchain: Maximizing Blockchain Throughput via Bandwidth-Clustered
Sharding | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bandwidth limitation is the major bottleneck that hinders scaling throughput
of proof-of-work blockchains. To guarantee security, the mining rate of the
blockchain is determined by the miners with the lowest bandwidth, resulting in
an inefficient bandwidth utilization among fast miners. We propose
Manifoldchain, an i... | [
{
"created": "Tue, 23 Jul 2024 08:52:51 GMT",
"version": "v1"
}
] | 2024-07-24 | [
[
"Che",
"Chunjiang",
""
],
[
"Li",
"Songze",
""
],
[
"Wang",
"Xuechao",
""
]
] | Bandwidth limitation is the major bottleneck that hinders scaling throughput of proof-of-work blockchains. To guarantee security, the mining rate of the blockchain is determined by the miners with the lowest bandwidth, resulting in an inefficient bandwidth utilization among fast miners. We propose Manifoldchain, an inn... |
1703.05881 | Pavol Hell | Tomas Feder and Pavol Hell | Complexity of Correspondence Homomorphisms | 12 pages, 5 figures | null | null | null | cs.DM cs.CC math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Correspondence homomorphisms are both a generalization of standard
homomorphisms and a generalization of correspondence colourings. For a fixed
target graph $H$, the problem is to decide whether an input graph $G$, with
each edge labeled by a pair of permutations of $V(H)$, admits a homomorphism to
$H$ `corresponding... | [
{
"created": "Fri, 17 Mar 2017 03:58:22 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Mar 2018 23:15:08 GMT",
"version": "v2"
}
] | 2018-03-30 | [
[
"Feder",
"Tomas",
""
],
[
"Hell",
"Pavol",
""
]
] | Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph $H$, the problem is to decide whether an input graph $G$, with each edge labeled by a pair of permutations of $V(H)$, admits a homomorphism to $H$ `corresponding' ... |
2305.03982 | Yu Cheng Hung | Yu Cheng Hung and Ping Hung Chen and Jian Jiun Ding | Pitch Estimation by Denoising Preprocessor and Hybrid Estimation Model | From ICCE-Taiwan | null | null | null | cs.SD cs.MM eess.AS | http://creativecommons.org/licenses/by/4.0/ | Pitch estimation is to estimate the fundamental frequency and the midi number
and plays a critical role in music signal analysis and vocal signal processing.
In this work, we proposed a new architecture based on a learning-based
enhancement preprocessor and a combination of several traditional and deep
learning pitch... | [
{
"created": "Sat, 6 May 2023 09:05:11 GMT",
"version": "v1"
}
] | 2023-05-09 | [
[
"Hung",
"Yu Cheng",
""
],
[
"Chen",
"Ping Hung",
""
],
[
"Ding",
"Jian Jiun",
""
]
] | Pitch estimation is to estimate the fundamental frequency and the midi number and plays a critical role in music signal analysis and vocal signal processing. In this work, we proposed a new architecture based on a learning-based enhancement preprocessor and a combination of several traditional and deep learning pitch e... |
1509.00442 | Darren Strash | Irina Kostitsyna, Martin N\"ollenburg, Valentin Polishchuk, Andr\'e
Schulz, and Darren Strash | On Minimizing Crossings in Storyline Visualizations | 6 pages, 4 figures. To appear at the 23rd International Symposium on
Graph Drawing and Network Visualization (GD 2015) | null | 10.1007/978-3-319-27261-0_16 | null | cs.DS cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a storyline visualization, we visualize a collection of interacting
characters (e.g., in a movie, play, etc.) by $x$-monotone curves that converge
for each interaction, and diverge otherwise. Given a storyline with $n$
characters, we show tight lower and upper bounds on the number of crossings
required in any stor... | [
{
"created": "Tue, 1 Sep 2015 19:03:34 GMT",
"version": "v1"
}
] | 2016-08-03 | [
[
"Kostitsyna",
"Irina",
""
],
[
"Nöllenburg",
"Martin",
""
],
[
"Polishchuk",
"Valentin",
""
],
[
"Schulz",
"André",
""
],
[
"Strash",
"Darren",
""
]
] | In a storyline visualization, we visualize a collection of interacting characters (e.g., in a movie, play, etc.) by $x$-monotone curves that converge for each interaction, and diverge otherwise. Given a storyline with $n$ characters, we show tight lower and upper bounds on the number of crossings required in any storyl... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.