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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2306.06236 | Xiyang Wu | Xiyang Wu, Rohan Chandra, Tianrui Guan, Amrit Singh Bedi, Dinesh
Manocha | iPLAN: Intent-Aware Planning in Heterogeneous Traffic via Distributed
Multi-Agent Reinforcement Learning | null | null | null | null | cs.MA cs.LG cs.RO | http://creativecommons.org/licenses/by/4.0/ | Navigating safely and efficiently in dense and heterogeneous traffic
scenarios is challenging for autonomous vehicles (AVs) due to their inability
to infer the behaviors or intentions of nearby drivers. In this work, we
introduce a distributed multi-agent reinforcement learning (MARL) algorithm
that can predict traje... | [
{
"created": "Fri, 9 Jun 2023 20:12:02 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Aug 2023 03:43:51 GMT",
"version": "v2"
},
{
"created": "Mon, 21 Aug 2023 05:06:36 GMT",
"version": "v3"
}
] | 2023-08-22 | [
[
"Wu",
"Xiyang",
""
],
[
"Chandra",
"Rohan",
""
],
[
"Guan",
"Tianrui",
""
],
[
"Bedi",
"Amrit Singh",
""
],
[
"Manocha",
"Dinesh",
""
]
] | Navigating safely and efficiently in dense and heterogeneous traffic scenarios is challenging for autonomous vehicles (AVs) due to their inability to infer the behaviors or intentions of nearby drivers. In this work, we introduce a distributed multi-agent reinforcement learning (MARL) algorithm that can predict traject... |
2402.17269 | Cam-Van Thi Nguyen | Cam-Van Thi Nguyen, Cao-Bach Nguyen, Quang-Thuy Ha, Duc-Trong Le | Curriculum Learning Meets Directed Acyclic Graph for Multimodal Emotion
Recognition | Accepted by LREC-COLING 2024 | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Emotion recognition in conversation (ERC) is a crucial task in natural
language processing and affective computing. This paper proposes MultiDAG+CL, a
novel approach for Multimodal Emotion Recognition in Conversation (ERC) that
employs Directed Acyclic Graph (DAG) to integrate textual, acoustic, and visual
features w... | [
{
"created": "Tue, 27 Feb 2024 07:28:05 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Mar 2024 06:00:12 GMT",
"version": "v2"
}
] | 2024-03-11 | [
[
"Nguyen",
"Cam-Van Thi",
""
],
[
"Nguyen",
"Cao-Bach",
""
],
[
"Ha",
"Quang-Thuy",
""
],
[
"Le",
"Duc-Trong",
""
]
] | Emotion recognition in conversation (ERC) is a crucial task in natural language processing and affective computing. This paper proposes MultiDAG+CL, a novel approach for Multimodal Emotion Recognition in Conversation (ERC) that employs Directed Acyclic Graph (DAG) to integrate textual, acoustic, and visual features wit... |
2404.13655 | Zehao Dong | Zehao Dong, Muhan Zhang, Yixin Chen | SPGNN: Recognizing Salient Subgraph Patterns via Enhanced Graph
Convolution and Pooling | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph neural networks (GNNs) have revolutionized the field of machine
learning on non-Euclidean data such as graphs and networks. GNNs effectively
implement node representation learning through neighborhood aggregation and
achieve impressive results in many graph-related tasks. However, most
neighborhood aggregation ... | [
{
"created": "Sun, 21 Apr 2024 13:11:59 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Apr 2024 16:21:25 GMT",
"version": "v2"
}
] | 2024-04-30 | [
[
"Dong",
"Zehao",
""
],
[
"Zhang",
"Muhan",
""
],
[
"Chen",
"Yixin",
""
]
] | Graph neural networks (GNNs) have revolutionized the field of machine learning on non-Euclidean data such as graphs and networks. GNNs effectively implement node representation learning through neighborhood aggregation and achieve impressive results in many graph-related tasks. However, most neighborhood aggregation ap... |
1901.07766 | Yu Ji | Yu Ji, Zixin Liu, Xing Hu, Peiqi Wang, Youhui Zhang | Programmable Neural Network Trojan for Pre-Trained Feature Extractor | null | null | null | null | cs.CR cs.CV cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural network (NN) trojaning attack is an emerging and important attack
model that can broadly damage the system deployed with NN models. Existing
studies have explored the outsourced training attack scenario and transfer
learning attack scenario in some small datasets for specific domains, with
limited numbers of f... | [
{
"created": "Wed, 23 Jan 2019 08:18:48 GMT",
"version": "v1"
}
] | 2019-01-24 | [
[
"Ji",
"Yu",
""
],
[
"Liu",
"Zixin",
""
],
[
"Hu",
"Xing",
""
],
[
"Wang",
"Peiqi",
""
],
[
"Zhang",
"Youhui",
""
]
] | Neural network (NN) trojaning attack is an emerging and important attack model that can broadly damage the system deployed with NN models. Existing studies have explored the outsourced training attack scenario and transfer learning attack scenario in some small datasets for specific domains, with limited numbers of fix... |
1902.03549 | Moustapha Diaby | Moustapha Diaby, Mark H. Karwan, and Lei Sun | On modeling hard combinatorial optimization problems as linear programs:
Refutations of the "unconditional impossibility" claims | 17 pages; 3 figures | null | null | null | cs.CC cs.DS math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There has been a series of developments in the recent literature (by
essentially a same "circle" of authors) with the absolute/unconditioned
(implicit or explicit) claim that there exists no abstraction of an NP-Complete
combinatorial optimization problem in which the defining combinatorial
configurations (such as "t... | [
{
"created": "Sun, 10 Feb 2019 07:09:22 GMT",
"version": "v1"
}
] | 2019-02-12 | [
[
"Diaby",
"Moustapha",
""
],
[
"Karwan",
"Mark H.",
""
],
[
"Sun",
"Lei",
""
]
] | There has been a series of developments in the recent literature (by essentially a same "circle" of authors) with the absolute/unconditioned (implicit or explicit) claim that there exists no abstraction of an NP-Complete combinatorial optimization problem in which the defining combinatorial configurations (such as "tou... |
1501.01073 | Samia Allaoua Chelloug | Samia Allaoua Chelloug | Impact of the Temperature and Humidity Variations on Link Quality of
xm1000 Mote Sensors | 9 pages in International Journal of Ad hoc, Sensor & Ubiquitous
Computing (IJASUC) Vol.5, No.6, December 2014 | null | 10.5121/ijasuc.2014.5603 | null | cs.NI | http://creativecommons.org/licenses/by/3.0/ | The core motivations of deploying a sensor network for a specific application
come from the autonomy of sensors, their reduced size, and their capabilities
for computing and communicating in a short range. However, many challenges for
sensor networks still exist: minimizing energy consumption, and ensuring the
perfor... | [
{
"created": "Tue, 6 Jan 2015 04:16:19 GMT",
"version": "v1"
}
] | 2015-01-07 | [
[
"Chelloug",
"Samia Allaoua",
""
]
] | The core motivations of deploying a sensor network for a specific application come from the autonomy of sensors, their reduced size, and their capabilities for computing and communicating in a short range. However, many challenges for sensor networks still exist: minimizing energy consumption, and ensuring the performa... |
2002.09089 | Daniel Brown | Daniel S. Brown, Russell Coleman, Ravi Srinivasan, Scott Niekum | Safe Imitation Learning via Fast Bayesian Reward Inference from
Preferences | In proceedings ICML 2020 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bayesian reward learning from demonstrations enables rigorous safety and
uncertainty analysis when performing imitation learning. However, Bayesian
reward learning methods are typically computationally intractable for complex
control problems. We propose Bayesian Reward Extrapolation (Bayesian REX), a
highly efficien... | [
{
"created": "Fri, 21 Feb 2020 02:04:54 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Jul 2020 04:42:38 GMT",
"version": "v2"
},
{
"created": "Fri, 7 Aug 2020 17:55:39 GMT",
"version": "v3"
},
{
"created": "Thu, 17 Dec 2020 21:48:13 GMT",
"version": "v4"
}
] | 2020-12-21 | [
[
"Brown",
"Daniel S.",
""
],
[
"Coleman",
"Russell",
""
],
[
"Srinivasan",
"Ravi",
""
],
[
"Niekum",
"Scott",
""
]
] | Bayesian reward learning from demonstrations enables rigorous safety and uncertainty analysis when performing imitation learning. However, Bayesian reward learning methods are typically computationally intractable for complex control problems. We propose Bayesian Reward Extrapolation (Bayesian REX), a highly efficient ... |
2204.02139 | Dongkeun Kim | Dongkeun Kim, Jinsung Lee, Minsu Cho, Suha Kwak | Detector-Free Weakly Supervised Group Activity Recognition | Accepted to CVPR 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Group activity recognition is the task of understanding the activity
conducted by a group of people as a whole in a multi-person video. Existing
models for this task are often impractical in that they demand ground-truth
bounding box labels of actors even in testing or rely on off-the-shelf object
detectors. Motivate... | [
{
"created": "Tue, 5 Apr 2022 12:05:04 GMT",
"version": "v1"
}
] | 2022-04-06 | [
[
"Kim",
"Dongkeun",
""
],
[
"Lee",
"Jinsung",
""
],
[
"Cho",
"Minsu",
""
],
[
"Kwak",
"Suha",
""
]
] | Group activity recognition is the task of understanding the activity conducted by a group of people as a whole in a multi-person video. Existing models for this task are often impractical in that they demand ground-truth bounding box labels of actors even in testing or rely on off-the-shelf object detectors. Motivated ... |
1609.04554 | Marco Tiloca | Marco Tiloca, Alexandra Stagkopoulou, Gianluca Dini | Performance and Security Evaluation of SDN Networks in OMNeT++/INET | Published in: A. Foerster, V. Vesely, A. Virdis, M. Kirsche (Eds.),
Proc. of the 3rd OMNeT++ Community Summit, Brno University of Technology -
Czech Republic - September 15-16, 2016 | null | null | OMNET/2016/03 | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Software Defined Networking (SDN) has been recently introduced as a new
communication paradigm in computer networks. By separating the control plane
from the data plane and entrusting packet forwarding to straightforward
switches, SDN makes it possible to deploy and run networks which are more
flexible to manage and ... | [
{
"created": "Thu, 15 Sep 2016 09:46:32 GMT",
"version": "v1"
}
] | 2016-09-16 | [
[
"Tiloca",
"Marco",
""
],
[
"Stagkopoulou",
"Alexandra",
""
],
[
"Dini",
"Gianluca",
""
]
] | Software Defined Networking (SDN) has been recently introduced as a new communication paradigm in computer networks. By separating the control plane from the data plane and entrusting packet forwarding to straightforward switches, SDN makes it possible to deploy and run networks which are more flexible to manage and ea... |
1711.06349 | Joshua Gardner | Josh Gardner, Christopher Brooks | Student Success Prediction in MOOCs | null | null | 10.1007/s11257-018-9203-z | null | cs.CY stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Predictive models of student success in Massive Open Online Courses (MOOCs)
are a critical component of effective content personalization and adaptive
interventions. In this article we review the state of the art in predictive
models of student success in MOOCs and present a categorization of MOOC
research according ... | [
{
"created": "Thu, 16 Nov 2017 23:12:47 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Apr 2018 17:09:39 GMT",
"version": "v2"
},
{
"created": "Wed, 11 Apr 2018 01:00:09 GMT",
"version": "v3"
}
] | 2018-04-23 | [
[
"Gardner",
"Josh",
""
],
[
"Brooks",
"Christopher",
""
]
] | Predictive models of student success in Massive Open Online Courses (MOOCs) are a critical component of effective content personalization and adaptive interventions. In this article we review the state of the art in predictive models of student success in MOOCs and present a categorization of MOOC research according to... |
0904.3316 | Shariq Bashir Mr. | Shariq Bashir, and Abdul Rauf Baig | Ramp: Fast Frequent Itemset Mining with Efficient Bit-Vector Projection
Technique | null | null | null | null | cs.DB cs.AI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mining frequent itemset using bit-vector representation approach is very
efficient for dense type datasets, but highly inefficient for sparse datasets
due to lack of any efficient bit-vector projection technique. In this paper we
present a novel efficient bit-vector projection technique, for sparse and dense
datasets... | [
{
"created": "Tue, 21 Apr 2009 18:49:13 GMT",
"version": "v1"
}
] | 2009-04-22 | [
[
"Bashir",
"Shariq",
""
],
[
"Baig",
"Abdul Rauf",
""
]
] | Mining frequent itemset using bit-vector representation approach is very efficient for dense type datasets, but highly inefficient for sparse datasets due to lack of any efficient bit-vector projection technique. In this paper we present a novel efficient bit-vector projection technique, for sparse and dense datasets. ... |
2310.17729 | Jonayet Miah | Razib Hayat Khan, Jonayet Miah, S M Yasir Arafat, M M Mahbubul Syeed,
Duc M Ca | Improving Traffic Density Forecasting in Intelligent Transportation
Systems Using Gated Graph Neural Networks | null | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This study delves into the application of graph neural networks in the realm
of traffic forecasting, a crucial facet of intelligent transportation systems.
Accurate traffic predictions are vital for functions like trip planning,
traffic control, and vehicle routing in such systems. Three prominent GNN
architectures G... | [
{
"created": "Thu, 26 Oct 2023 18:40:28 GMT",
"version": "v1"
}
] | 2023-10-30 | [
[
"Khan",
"Razib Hayat",
""
],
[
"Miah",
"Jonayet",
""
],
[
"Arafat",
"S M Yasir",
""
],
[
"Syeed",
"M M Mahbubul",
""
],
[
"Ca",
"Duc M",
""
]
] | This study delves into the application of graph neural networks in the realm of traffic forecasting, a crucial facet of intelligent transportation systems. Accurate traffic predictions are vital for functions like trip planning, traffic control, and vehicle routing in such systems. Three prominent GNN architectures Gra... |
1803.07480 | Maximilian Schleich | Mahmoud Abo Khamis and Hung Q. Ngo and XuanLong Nguyen and Dan Olteanu
and Maximilian Schleich | AC/DC: In-Database Learning Thunderstruck | 10 pages, 3 figures | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We report on the design and implementation of the AC/DC gradient descent
solver for a class of optimization problems over normalized databases. AC/DC
decomposes an optimization problem into a set of aggregates over the join of
the database relations. It then uses the answers to these aggregates to
iteratively improve... | [
{
"created": "Tue, 20 Mar 2018 15:17:14 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Jun 2018 04:35:21 GMT",
"version": "v2"
}
] | 2018-06-18 | [
[
"Khamis",
"Mahmoud Abo",
""
],
[
"Ngo",
"Hung Q.",
""
],
[
"Nguyen",
"XuanLong",
""
],
[
"Olteanu",
"Dan",
""
],
[
"Schleich",
"Maximilian",
""
]
] | We report on the design and implementation of the AC/DC gradient descent solver for a class of optimization problems over normalized databases. AC/DC decomposes an optimization problem into a set of aggregates over the join of the database relations. It then uses the answers to these aggregates to iteratively improve t... |
1211.3500 | Guoxu Zhou | Guoxu Zhou, Andrzej Cichocki, and Shengli Xie | Accelerated Canonical Polyadic Decomposition by Using Mode Reduction | 12 pages. Accepted by TNNLS | null | 10.1109/TNNLS.2013.2271507 | null | cs.NA cs.LG math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Canonical Polyadic (or CANDECOMP/PARAFAC, CP) decompositions (CPD) are widely
applied to analyze high order tensors. Existing CPD methods use alternating
least square (ALS) iterations and hence need to unfold tensors to each of the
$N$ modes frequently, which is one major bottleneck of efficiency for
large-scale data... | [
{
"created": "Thu, 15 Nov 2012 05:50:30 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Jun 2013 03:06:52 GMT",
"version": "v2"
}
] | 2013-06-27 | [
[
"Zhou",
"Guoxu",
""
],
[
"Cichocki",
"Andrzej",
""
],
[
"Xie",
"Shengli",
""
]
] | Canonical Polyadic (or CANDECOMP/PARAFAC, CP) decompositions (CPD) are widely applied to analyze high order tensors. Existing CPD methods use alternating least square (ALS) iterations and hence need to unfold tensors to each of the $N$ modes frequently, which is one major bottleneck of efficiency for large-scale data a... |
1402.6281 | Tomasz Brengos | Tomasz Brengos | On coalgebras with internal moves | Article: 23 pages, Appendix: 3 pages | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the first part of the paper we recall the coalgebraic approach to handling
the so-called invisible transitions that appear in different state-based
systems semantics. We claim that these transitions are always part of the unit
of a certain monad. Hence, coalgebras with internal moves are exactly
coalgebras over a ... | [
{
"created": "Tue, 25 Feb 2014 19:12:55 GMT",
"version": "v1"
}
] | 2014-02-26 | [
[
"Brengos",
"Tomasz",
""
]
] | In the first part of the paper we recall the coalgebraic approach to handling the so-called invisible transitions that appear in different state-based systems semantics. We claim that these transitions are always part of the unit of a certain monad. Hence, coalgebras with internal moves are exactly coalgebras over a mo... |
2305.11811 | Yang You | Yang You, Vincent Thomas, Francis Colas, Olivier Buffet | Monte-Carlo Search for an Equilibrium in Dec-POMDPs | Accepted to UAI 2023, preliminary version | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Decentralized partially observable Markov decision processes (Dec-POMDPs)
formalize the problem of designing individual controllers for a group of
collaborative agents under stochastic dynamics and partial observability.
Seeking a global optimum is difficult (NEXP complete), but seeking a Nash
equilibrium -- each age... | [
{
"created": "Fri, 19 May 2023 16:47:46 GMT",
"version": "v1"
}
] | 2023-05-22 | [
[
"You",
"Yang",
""
],
[
"Thomas",
"Vincent",
""
],
[
"Colas",
"Francis",
""
],
[
"Buffet",
"Olivier",
""
]
] | Decentralized partially observable Markov decision processes (Dec-POMDPs) formalize the problem of designing individual controllers for a group of collaborative agents under stochastic dynamics and partial observability. Seeking a global optimum is difficult (NEXP complete), but seeking a Nash equilibrium -- each agent... |
0804.3817 | Jan Arpe | Jan Arpe and Elchanan Mossel | Multiple Random Oracles Are Better Than One | 17 pages | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of learning k-juntas given access to examples drawn from
a number of different product distributions. Thus we wish to learn a function f
: {-1,1}^n -> {-1,1} that depends on k (unknown) coordinates. While the best
known algorithms for the general problem of learning a k-junta require running
time... | [
{
"created": "Wed, 23 Apr 2008 23:18:00 GMT",
"version": "v1"
}
] | 2008-04-25 | [
[
"Arpe",
"Jan",
""
],
[
"Mossel",
"Elchanan",
""
]
] | We study the problem of learning k-juntas given access to examples drawn from a number of different product distributions. Thus we wish to learn a function f : {-1,1}^n -> {-1,1} that depends on k (unknown) coordinates. While the best known algorithms for the general problem of learning a k-junta require running time o... |
2309.11507 | Ludovic Dos Santos | Veronika Shilova, Ludovic Dos Santos, Flavian Vasile, Ga\"etan Racic,
Ugo Tanielian | AdBooster: Personalized Ad Creative Generation using Stable Diffusion
Outpainting | Fifth Workshop on Recommender Systems in Fashion (Fashion x RecSys
2023) | null | null | null | cs.IR cs.LG | http://creativecommons.org/licenses/by/4.0/ | In digital advertising, the selection of the optimal item (recommendation)
and its best creative presentation (creative optimization) have traditionally
been considered separate disciplines. However, both contribute significantly to
user satisfaction, underpinning our assumption that it relies on both an item's
relev... | [
{
"created": "Fri, 8 Sep 2023 12:57:05 GMT",
"version": "v1"
}
] | 2023-09-22 | [
[
"Shilova",
"Veronika",
""
],
[
"Santos",
"Ludovic Dos",
""
],
[
"Vasile",
"Flavian",
""
],
[
"Racic",
"Gaëtan",
""
],
[
"Tanielian",
"Ugo",
""
]
] | In digital advertising, the selection of the optimal item (recommendation) and its best creative presentation (creative optimization) have traditionally been considered separate disciplines. However, both contribute significantly to user satisfaction, underpinning our assumption that it relies on both an item's relevan... |
2406.04306 | Lukas Aichberger | Lukas Aichberger, Kajetan Schweighofer, Mykyta Ielanskyi, Sepp
Hochreiter | Semantically Diverse Language Generation for Uncertainty Estimation in
Language Models | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Large language models (LLMs) can suffer from hallucinations when generating
text. These hallucinations impede various applications in society and industry
by making LLMs untrustworthy. Current LLMs generate text in an autoregressive
fashion by predicting and appending text tokens. When an LLM is uncertain about
the s... | [
{
"created": "Thu, 6 Jun 2024 17:53:34 GMT",
"version": "v1"
}
] | 2024-06-07 | [
[
"Aichberger",
"Lukas",
""
],
[
"Schweighofer",
"Kajetan",
""
],
[
"Ielanskyi",
"Mykyta",
""
],
[
"Hochreiter",
"Sepp",
""
]
] | Large language models (LLMs) can suffer from hallucinations when generating text. These hallucinations impede various applications in society and industry by making LLMs untrustworthy. Current LLMs generate text in an autoregressive fashion by predicting and appending text tokens. When an LLM is uncertain about the sem... |
2102.02723 | Ratish Puduppully | Ratish Puduppully and Mirella Lapata | Data-to-text Generation with Macro Planning | To appear in Transactions of the Association for Computational
Linguistics (TACL); 17 pages | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent approaches to data-to-text generation have adopted the very successful
encoder-decoder architecture or variants thereof. These models generate text
which is fluent (but often imprecise) and perform quite poorly at selecting
appropriate content and ordering it coherently. To overcome some of these
issues, we pr... | [
{
"created": "Thu, 4 Feb 2021 16:32:57 GMT",
"version": "v1"
}
] | 2021-02-05 | [
[
"Puduppully",
"Ratish",
""
],
[
"Lapata",
"Mirella",
""
]
] | Recent approaches to data-to-text generation have adopted the very successful encoder-decoder architecture or variants thereof. These models generate text which is fluent (but often imprecise) and perform quite poorly at selecting appropriate content and ordering it coherently. To overcome some of these issues, we prop... |
2003.13058 | Alireza M. Javid | Alireza M. Javid, Arun Venkitaraman, Mikael Skoglund, and Saikat
Chatterjee | High-dimensional Neural Feature Design for Layer-wise Reduction of
Training Cost | 2020 EURASIP Journal on Advances in Signal Processing | null | 10.1186/s13634-020-00695-2 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We design a ReLU-based multilayer neural network by mapping the feature
vectors to a higher dimensional space in every layer. We design the weight
matrices in every layer to ensure a reduction of the training cost as the
number of layers increases. Linear projection to the target in the higher
dimensional space leads... | [
{
"created": "Sun, 29 Mar 2020 15:57:28 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Aug 2020 21:16:00 GMT",
"version": "v2"
}
] | 2020-10-28 | [
[
"Javid",
"Alireza M.",
""
],
[
"Venkitaraman",
"Arun",
""
],
[
"Skoglund",
"Mikael",
""
],
[
"Chatterjee",
"Saikat",
""
]
] | We design a ReLU-based multilayer neural network by mapping the feature vectors to a higher dimensional space in every layer. We design the weight matrices in every layer to ensure a reduction of the training cost as the number of layers increases. Linear projection to the target in the higher dimensional space leads t... |
2402.07007 | Dominik Klein | Dominik K. Klein and Rogelio Ortigosa and Jes\'us Mart\'inez-Frutos
and Oliver Weeger | Nonlinear electro-elastic finite element analysis with neural network
constitutive models | null | null | null | null | cs.CE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In the present work, the applicability of physics-augmented neural network
(PANN) constitutive models for complex electro-elastic finite element analysis
is demonstrated. For the investigations, PANN models for electro-elastic
material behavior at finite deformations are calibrated to different
synthetically generate... | [
{
"created": "Sat, 10 Feb 2024 18:00:21 GMT",
"version": "v1"
}
] | 2024-02-13 | [
[
"Klein",
"Dominik K.",
""
],
[
"Ortigosa",
"Rogelio",
""
],
[
"Martínez-Frutos",
"Jesús",
""
],
[
"Weeger",
"Oliver",
""
]
] | In the present work, the applicability of physics-augmented neural network (PANN) constitutive models for complex electro-elastic finite element analysis is demonstrated. For the investigations, PANN models for electro-elastic material behavior at finite deformations are calibrated to different synthetically generated ... |
2401.15726 | MinSeok Seo | Young-Jae Park, Minseok Seo, Doyi Kim, Hyeri Kim, Sanghoon Choi,
Beomkyu Choi, Jeongwon Ryu, Sohee Son, Hae-Gon Jeon, Yeji Choi | Long-Term Typhoon Trajectory Prediction: A Physics-Conditioned Approach
Without Reanalysis Data | This paper was accepted for a Spotlight presentation at ICLR 2024 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In the face of escalating climate changes, typhoon intensities and their
ensuing damage have surged. Accurate trajectory prediction is crucial for
effective damage control. Traditional physics-based models, while
comprehensive, are computationally intensive and rely heavily on the expertise
of forecasters. Contempora... | [
{
"created": "Sun, 28 Jan 2024 18:28:33 GMT",
"version": "v1"
}
] | 2024-01-30 | [
[
"Park",
"Young-Jae",
""
],
[
"Seo",
"Minseok",
""
],
[
"Kim",
"Doyi",
""
],
[
"Kim",
"Hyeri",
""
],
[
"Choi",
"Sanghoon",
""
],
[
"Choi",
"Beomkyu",
""
],
[
"Ryu",
"Jeongwon",
""
],
[
"Son",
"So... | In the face of escalating climate changes, typhoon intensities and their ensuing damage have surged. Accurate trajectory prediction is crucial for effective damage control. Traditional physics-based models, while comprehensive, are computationally intensive and rely heavily on the expertise of forecasters. Contemporary... |
1910.09383 | Sarath Shekkizhar | Sarath Shekkizhar and Antonio Ortega | Neighborhood and Graph Constructions using Non-Negative Kernel
Regression | 15 pages | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data-driven neighborhood definitions and graph constructions are often used
in machine learning and signal processing applications. k-nearest
neighbor~(kNN) and $\epsilon$-neighborhood methods are among the most common
methods used for neighborhood selection, due to their computational simplicity.
However, the choice... | [
{
"created": "Mon, 21 Oct 2019 13:58:14 GMT",
"version": "v1"
},
{
"created": "Sat, 31 Dec 2022 16:50:57 GMT",
"version": "v2"
},
{
"created": "Sat, 25 Feb 2023 18:25:36 GMT",
"version": "v3"
},
{
"created": "Sun, 16 Apr 2023 04:57:36 GMT",
"version": "v4"
}
] | 2023-04-18 | [
[
"Shekkizhar",
"Sarath",
""
],
[
"Ortega",
"Antonio",
""
]
] | Data-driven neighborhood definitions and graph constructions are often used in machine learning and signal processing applications. k-nearest neighbor~(kNN) and $\epsilon$-neighborhood methods are among the most common methods used for neighborhood selection, due to their computational simplicity. However, the choice o... |
1412.3670 | Sagar Jha | Devendra Bhave, Sagar Jha, Shankara Narayanan Krishna, Sven Schewe,
Ashutosh Trivedi | Bounded-Rate Multi-Mode Systems Based Motion Planning | 14 pages, 12 figures, HSCC - 2015 | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bounded-rate multi-mode systems are hybrid systems that can switch among a
finite set of modes. Its dynamics is specified by a finite number of
real-valued variables with mode-dependent rates that can vary within given
bounded sets. Given an arbitrary piecewise linear trajectory, we study the
problem of following the... | [
{
"created": "Tue, 9 Dec 2014 19:26:03 GMT",
"version": "v1"
}
] | 2014-12-12 | [
[
"Bhave",
"Devendra",
""
],
[
"Jha",
"Sagar",
""
],
[
"Krishna",
"Shankara Narayanan",
""
],
[
"Schewe",
"Sven",
""
],
[
"Trivedi",
"Ashutosh",
""
]
] | Bounded-rate multi-mode systems are hybrid systems that can switch among a finite set of modes. Its dynamics is specified by a finite number of real-valued variables with mode-dependent rates that can vary within given bounded sets. Given an arbitrary piecewise linear trajectory, we study the problem of following the t... |
2111.02630 | Junyao Kuang | Junyao Kuang, Caterina Scoglio and Kristin Michel | Feature Learning and Network Structure from Noisy Node Activity Data | null | Phys. Rev. E 106, 064301, 2022 | 10.1103/PhysRevE.106.064301 | null | cs.NI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In the studies of network structures, much attention has been devoted to
developing approaches to reconstruct networks and predict missing links when
edge-related information is given. However, such approaches are not applicable
when we are only given noisy node activity data with missing values. This work
presents a... | [
{
"created": "Thu, 4 Nov 2021 05:07:28 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Mar 2022 19:13:16 GMT",
"version": "v2"
},
{
"created": "Sat, 3 Dec 2022 03:33:13 GMT",
"version": "v3"
}
] | 2022-12-09 | [
[
"Kuang",
"Junyao",
""
],
[
"Scoglio",
"Caterina",
""
],
[
"Michel",
"Kristin",
""
]
] | In the studies of network structures, much attention has been devoted to developing approaches to reconstruct networks and predict missing links when edge-related information is given. However, such approaches are not applicable when we are only given noisy node activity data with missing values. This work presents an ... |
2004.00403 | Mark Boss | Mark Boss, Varun Jampani, Kihwan Kim, Hendrik P.A. Lensch, Jan Kautz | Two-shot Spatially-varying BRDF and Shape Estimation | null | null | 10.1109/CVPR42600.2020.00404 | null | cs.CV cs.GR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Capturing the shape and spatially-varying appearance (SVBRDF) of an object
from images is a challenging task that has applications in both computer vision
and graphics. Traditional optimization-based approaches often need a large
number of images taken from multiple views in a controlled environment. Newer
deep learn... | [
{
"created": "Wed, 1 Apr 2020 12:56:13 GMT",
"version": "v1"
}
] | 2021-05-20 | [
[
"Boss",
"Mark",
""
],
[
"Jampani",
"Varun",
""
],
[
"Kim",
"Kihwan",
""
],
[
"Lensch",
"Hendrik P. A.",
""
],
[
"Kautz",
"Jan",
""
]
] | Capturing the shape and spatially-varying appearance (SVBRDF) of an object from images is a challenging task that has applications in both computer vision and graphics. Traditional optimization-based approaches often need a large number of images taken from multiple views in a controlled environment. Newer deep learnin... |
1706.06243 | Luke Miles | Cory Siler, Luke Harold Miles, Judy Goldsmith | The Complexity of Campaigning | Will be presented at the 2017 Algorithmic Decision Theory Conference | null | null | null | cs.AI cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In "The Logic of Campaigning", Dean and Parikh consider a candidate making
campaign statements to appeal to the voters. They model these statements as
Boolean formulas over variables that represent stances on the issues, and study
optimal candidate strategies under three proposed models of voter preferences
based on ... | [
{
"created": "Tue, 20 Jun 2017 02:28:04 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Jul 2017 21:07:09 GMT",
"version": "v2"
}
] | 2017-07-19 | [
[
"Siler",
"Cory",
""
],
[
"Miles",
"Luke Harold",
""
],
[
"Goldsmith",
"Judy",
""
]
] | In "The Logic of Campaigning", Dean and Parikh consider a candidate making campaign statements to appeal to the voters. They model these statements as Boolean formulas over variables that represent stances on the issues, and study optimal candidate strategies under three proposed models of voter preferences based on th... |
2211.15929 | Guanhong Tao | Guanhong Tao, Zhenting Wang, Siyuan Cheng, Shiqing Ma, Shengwei An,
Yingqi Liu, Guangyu Shen, Zhuo Zhang, Yunshu Mao, Xiangyu Zhang | Backdoor Vulnerabilities in Normally Trained Deep Learning Models | null | null | null | null | cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We conduct a systematic study of backdoor vulnerabilities in normally trained
Deep Learning models. They are as dangerous as backdoors injected by data
poisoning because both can be equally exploited. We leverage 20 different types
of injected backdoor attacks in the literature as the guidance and study their
corresp... | [
{
"created": "Tue, 29 Nov 2022 04:55:32 GMT",
"version": "v1"
}
] | 2022-11-30 | [
[
"Tao",
"Guanhong",
""
],
[
"Wang",
"Zhenting",
""
],
[
"Cheng",
"Siyuan",
""
],
[
"Ma",
"Shiqing",
""
],
[
"An",
"Shengwei",
""
],
[
"Liu",
"Yingqi",
""
],
[
"Shen",
"Guangyu",
""
],
[
"Zhang",
... | We conduct a systematic study of backdoor vulnerabilities in normally trained Deep Learning models. They are as dangerous as backdoors injected by data poisoning because both can be equally exploited. We leverage 20 different types of injected backdoor attacks in the literature as the guidance and study their correspon... |
2204.05961 | Anya Belz | Anya Belz, Maja Popovi\'c and Simon Mille | Quantified Reproducibility Assessment of NLP Results | To be published in Proceedings of the 60th Annual Meeting of the
Association for Computational Linguistics (ACL'22) | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This paper describes and tests a method for carrying out quantified
reproducibility assessment (QRA) that is based on concepts and definitions from
metrology. QRA produces a single score estimating the degree of reproducibility
of a given system and evaluation measure, on the basis of the scores from, and
differences... | [
{
"created": "Tue, 12 Apr 2022 17:22:46 GMT",
"version": "v1"
}
] | 2022-04-13 | [
[
"Belz",
"Anya",
""
],
[
"Popović",
"Maja",
""
],
[
"Mille",
"Simon",
""
]
] | This paper describes and tests a method for carrying out quantified reproducibility assessment (QRA) that is based on concepts and definitions from metrology. QRA produces a single score estimating the degree of reproducibility of a given system and evaluation measure, on the basis of the scores from, and differences b... |
2303.07247 | Anmol Goel | Sahil Girhepuje, Anmol Goel, Gokul S Krishnan, Shreya Goyal, Satyendra
Pandey, Ponnurangam Kumaraguru and Balaraman Ravindran | Are Models Trained on Indian Legal Data Fair? | Presented at the Symposium on AI and Law (SAIL) 2023 | null | null | null | cs.CL cs.CY | http://creativecommons.org/licenses/by/4.0/ | Recent advances and applications of language technology and artificial
intelligence have enabled much success across multiple domains like law,
medical and mental health. AI-based Language Models, like Judgement Prediction,
have recently been proposed for the legal sector. However, these models are
strife with encode... | [
{
"created": "Mon, 13 Mar 2023 16:20:33 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Mar 2023 17:40:21 GMT",
"version": "v2"
},
{
"created": "Tue, 14 May 2024 08:44:37 GMT",
"version": "v3"
}
] | 2024-05-15 | [
[
"Girhepuje",
"Sahil",
""
],
[
"Goel",
"Anmol",
""
],
[
"Krishnan",
"Gokul S",
""
],
[
"Goyal",
"Shreya",
""
],
[
"Pandey",
"Satyendra",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
],
[
"Ravindran",
"Balaraman",
... | Recent advances and applications of language technology and artificial intelligence have enabled much success across multiple domains like law, medical and mental health. AI-based Language Models, like Judgement Prediction, have recently been proposed for the legal sector. However, these models are strife with encoded ... |
1909.01627 | Cinzia Di Giusto | Cinzia Di Giusto (C&A), Cinzia Giusto (SARDES), Laetitia Laversa
(C&A), Etienne Lozes | On the k-synchronizability of systems | null | null | null | null | cs.FL cs.CL cs.SC cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we work on the notion of k-synchronizability: a system is
k-synchronizable if any of its executions, up to reordering causally
independent actions, can be divided into a succession of k-bounded interaction
phases. We show two results (both for mailbox and peer-to-peer automata):
first, the reachability... | [
{
"created": "Wed, 4 Sep 2019 08:58:53 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Jan 2020 14:24:45 GMT",
"version": "v2"
}
] | 2020-01-22 | [
[
"Di Giusto",
"Cinzia",
"",
"C&A"
],
[
"Giusto",
"Cinzia",
"",
"SARDES"
],
[
"Laversa",
"Laetitia",
"",
"C&A"
],
[
"Lozes",
"Etienne",
""
]
] | In this paper, we work on the notion of k-synchronizability: a system is k-synchronizable if any of its executions, up to reordering causally independent actions, can be divided into a succession of k-bounded interaction phases. We show two results (both for mailbox and peer-to-peer automata): first, the reachability p... |
2403.17312 | Youpeng Zhao | Youpeng Zhao, Di Wu, Jun Wang | ALISA: Accelerating Large Language Model Inference via Sparsity-Aware KV
Caching | ISCA 2024 | null | null | null | cs.AI cs.LG cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Transformer architecture has significantly advanced natural language
processing (NLP) and has been foundational in developing large language models
(LLMs) such as LLaMA and OPT, which have come to dominate a broad range of NLP
tasks. Despite their superior accuracy, LLMs present unique challenges in
practical inf... | [
{
"created": "Tue, 26 Mar 2024 01:46:34 GMT",
"version": "v1"
}
] | 2024-03-27 | [
[
"Zhao",
"Youpeng",
""
],
[
"Wu",
"Di",
""
],
[
"Wang",
"Jun",
""
]
] | The Transformer architecture has significantly advanced natural language processing (NLP) and has been foundational in developing large language models (LLMs) such as LLaMA and OPT, which have come to dominate a broad range of NLP tasks. Despite their superior accuracy, LLMs present unique challenges in practical infer... |
2109.00165 | Jipeng Qiang | Xinyu Lu and Jipeng Qiang and Yun Li and Yunhao Yuan and Yi Zhu | An Unsupervised Method for Building Sentence Simplification Corpora in
Multiple Languages | null | Findings of the Association for Computational Linguistics: EMNLP
2021 | null | null | cs.CL cs.IR | http://creativecommons.org/licenses/by/4.0/ | The availability of parallel sentence simplification (SS) is scarce for
neural SS modelings. We propose an unsupervised method to build SS corpora from
large-scale bilingual translation corpora, alleviating the need for SS
supervised corpora. Our method is motivated by the following two findings:
neural machine trans... | [
{
"created": "Wed, 1 Sep 2021 03:30:06 GMT",
"version": "v1"
}
] | 2021-09-02 | [
[
"Lu",
"Xinyu",
""
],
[
"Qiang",
"Jipeng",
""
],
[
"Li",
"Yun",
""
],
[
"Yuan",
"Yunhao",
""
],
[
"Zhu",
"Yi",
""
]
] | The availability of parallel sentence simplification (SS) is scarce for neural SS modelings. We propose an unsupervised method to build SS corpora from large-scale bilingual translation corpora, alleviating the need for SS supervised corpora. Our method is motivated by the following two findings: neural machine transla... |
2407.00985 | Takayuki Nishimura | Takayuki Nishimura, Katsuyuki Kuyo, Motonari Kambara and Komei Sugiura | Object Segmentation from Open-Vocabulary Manipulation Instructions Based
on Optimal Transport Polygon Matching with Multimodal Foundation Models | Accepted for presentation at IROS2024 | null | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the task of generating segmentation masks for the target object
from an object manipulation instruction, which allows users to give open
vocabulary instructions to domestic service robots. Conventional segmentation
generation approaches often fail to account for objects outside the camera's
field of view ... | [
{
"created": "Mon, 1 Jul 2024 05:48:48 GMT",
"version": "v1"
}
] | 2024-07-02 | [
[
"Nishimura",
"Takayuki",
""
],
[
"Kuyo",
"Katsuyuki",
""
],
[
"Kambara",
"Motonari",
""
],
[
"Sugiura",
"Komei",
""
]
] | We consider the task of generating segmentation masks for the target object from an object manipulation instruction, which allows users to give open vocabulary instructions to domestic service robots. Conventional segmentation generation approaches often fail to account for objects outside the camera's field of view an... |
1903.03453 | Sulaiman Abo Diab | Sulaiman Y. Abo Diab | Geometry Mapping, Complete Pascal Scheme versus Standard Bilinear
Approach | 23 pages, 9 Figures | null | null | null | cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a complete Pascal interpolation scheme for use in the
plane geometry mapping applied in association with numerical methods. The
geometry of a domain element is approximated by a complete Pascal polynomial.
The interpolation procedure is formulated in a natural coordinate system. It
also presents t... | [
{
"created": "Wed, 6 Mar 2019 20:46:13 GMT",
"version": "v1"
}
] | 2019-03-11 | [
[
"Diab",
"Sulaiman Y. Abo",
""
]
] | This paper presents a complete Pascal interpolation scheme for use in the plane geometry mapping applied in association with numerical methods. The geometry of a domain element is approximated by a complete Pascal polynomial. The interpolation procedure is formulated in a natural coordinate system. It also presents the... |
2204.14116 | Benjamin Provan-Bessell | Benjamin Provan-Bessell, Marco Dalla, Andrea Visentin, Barry
O'Sullivan | SATfeatPy -- A Python-based Feature Extraction System for Satisfiability | 8 pages, 2 figures, code available at
https://github.com/bprovanbessell/SATfeatPy | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Feature extraction is a fundamental task in the application of machine
learning methods to SAT solving. It is used in algorithm selection and
configuration for solver portfolios and satisfiability classification. Many
approaches have been proposed to extract meaningful attributes from CNF
instances. Most of them lack... | [
{
"created": "Fri, 29 Apr 2022 14:10:01 GMT",
"version": "v1"
}
] | 2022-05-02 | [
[
"Provan-Bessell",
"Benjamin",
""
],
[
"Dalla",
"Marco",
""
],
[
"Visentin",
"Andrea",
""
],
[
"O'Sullivan",
"Barry",
""
]
] | Feature extraction is a fundamental task in the application of machine learning methods to SAT solving. It is used in algorithm selection and configuration for solver portfolios and satisfiability classification. Many approaches have been proposed to extract meaningful attributes from CNF instances. Most of them lack a... |
2302.05574 | Junru Lu | Junru Lu, Jiazheng Li, Byron C. Wallace, Yulan He, Gabriele Pergola | NapSS: Paragraph-level Medical Text Simplification via Narrative
Prompting and Sentence-matching Summarization | Findings of EACL 2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accessing medical literature is difficult for laypeople as the content is
written for specialists and contains medical jargon. Automated text
simplification methods offer a potential means to address this issue. In this
work, we propose a summarize-then-simplify two-stage strategy, which we call
NapSS, identifying th... | [
{
"created": "Sat, 11 Feb 2023 02:20:25 GMT",
"version": "v1"
}
] | 2023-02-14 | [
[
"Lu",
"Junru",
""
],
[
"Li",
"Jiazheng",
""
],
[
"Wallace",
"Byron C.",
""
],
[
"He",
"Yulan",
""
],
[
"Pergola",
"Gabriele",
""
]
] | Accessing medical literature is difficult for laypeople as the content is written for specialists and contains medical jargon. Automated text simplification methods offer a potential means to address this issue. In this work, we propose a summarize-then-simplify two-stage strategy, which we call NapSS, identifying the ... |
1803.08298 | Carlos Lopez | Carlos F. Lopez and Cheng-Xiang Wang | A Study of Delay Drifts on Massive MIMO Wideband Channel Models | 7 pages, 5 figures. 22nd International ITG Workshop on Smart Antennas
(WSA 2018) | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study the effects of the variations of the propagation
delay over large-scale antenna-arrays used in massive multiple-input
multiple-output (MIMO) wideband communication systems on the statistical
properties of the channel. Due to its simplicity and popularity, the Elliptical
geometry-based stochast... | [
{
"created": "Thu, 22 Mar 2018 10:23:29 GMT",
"version": "v1"
}
] | 2018-03-23 | [
[
"Lopez",
"Carlos F.",
""
],
[
"Wang",
"Cheng-Xiang",
""
]
] | In this paper, we study the effects of the variations of the propagation delay over large-scale antenna-arrays used in massive multiple-input multiple-output (MIMO) wideband communication systems on the statistical properties of the channel. Due to its simplicity and popularity, the Elliptical geometry-based stochastic... |
1502.01761 | Tom Lee | Tom Lee, Sanja Fidler, Alex Levinshtein, Cristian Sminchisescu, and
Sven Dickinson | A Framework for Symmetric Part Detection in Cluttered Scenes | 10 pages, 8 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The role of symmetry in computer vision has waxed and waned in importance
during the evolution of the field from its earliest days. At first figuring
prominently in support of bottom-up indexing, it fell out of favor as shape
gave way to appearance and recognition gave way to detection. With a strong
prior in the for... | [
{
"created": "Thu, 5 Feb 2015 23:51:16 GMT",
"version": "v1"
}
] | 2015-02-09 | [
[
"Lee",
"Tom",
""
],
[
"Fidler",
"Sanja",
""
],
[
"Levinshtein",
"Alex",
""
],
[
"Sminchisescu",
"Cristian",
""
],
[
"Dickinson",
"Sven",
""
]
] | The role of symmetry in computer vision has waxed and waned in importance during the evolution of the field from its earliest days. At first figuring prominently in support of bottom-up indexing, it fell out of favor as shape gave way to appearance and recognition gave way to detection. With a strong prior in the form ... |
1201.2605 | Zhenwen Dai | Zhenwen Dai and J\"org L\"ucke | Autonomous Cleaning of Corrupted Scanned Documents - A Generative
Modeling Approach | oral presentation and Google Student Travel Award; IEEE conference on
Computer Vision and Pattern Recognition 2012 | null | 10.1109/TPAMI.2014.2313126 | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the task of cleaning scanned text documents that are strongly
corrupted by dirt such as manual line strokes, spilled ink etc. We aim at
autonomously removing dirt from a single letter-size page based only on the
information the page contains. Our approach, therefore, has to learn character
representations wi... | [
{
"created": "Thu, 12 Jan 2012 16:09:10 GMT",
"version": "v1"
},
{
"created": "Mon, 2 Jul 2012 12:42:01 GMT",
"version": "v2"
}
] | 2014-10-21 | [
[
"Dai",
"Zhenwen",
""
],
[
"Lücke",
"Jörg",
""
]
] | We study the task of cleaning scanned text documents that are strongly corrupted by dirt such as manual line strokes, spilled ink etc. We aim at autonomously removing dirt from a single letter-size page based only on the information the page contains. Our approach, therefore, has to learn character representations with... |
2302.05762 | Qiwei Han | Fynn Oldenburg, Qiwei Han, Maximilian Kaiser | Interpretable Deep Learning for Forecasting Online Advertising Costs:
Insights from the Competitive Bidding Landscape | Acceptd at AAAI 2023 Web for Advertising Workshop, 12 pages, 8
figures, 4 tables | null | null | null | cs.LG cs.AI cs.SI | http://creativecommons.org/licenses/by/4.0/ | As advertisers increasingly shift their budgets toward digital advertising,
forecasting advertising costs is essential for making budget plans to optimize
marketing campaign returns. In this paper, we perform a comprehensive study
using a variety of time-series forecasting methods to predict daily average
cost-per-cl... | [
{
"created": "Sat, 11 Feb 2023 19:26:17 GMT",
"version": "v1"
}
] | 2023-02-14 | [
[
"Oldenburg",
"Fynn",
""
],
[
"Han",
"Qiwei",
""
],
[
"Kaiser",
"Maximilian",
""
]
] | As advertisers increasingly shift their budgets toward digital advertising, forecasting advertising costs is essential for making budget plans to optimize marketing campaign returns. In this paper, we perform a comprehensive study using a variety of time-series forecasting methods to predict daily average cost-per-clic... |
1609.05307 | Hung Pham | Hung Pham, Quang-Cuong Pham | On the Structure of the Time-Optimal Path Parameterization Problem with
Third-Order Constraints | 8 pages, 6 figures, ICRA 2017 | null | 10.1109/ICRA.2017.7989084 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Finding the Time-Optimal Parameterization of a Path (TOPP) subject to
second-order constraints (e.g. acceleration, torque, contact stability, etc.)
is an important and well-studied problem in robotics. In comparison, TOPP
subject to third-order constraints (e.g. jerk, torque rate, etc.) has received
far less attentio... | [
{
"created": "Sat, 17 Sep 2016 09:27:46 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Feb 2017 12:11:22 GMT",
"version": "v2"
},
{
"created": "Tue, 19 Sep 2017 12:08:31 GMT",
"version": "v3"
}
] | 2017-09-20 | [
[
"Pham",
"Hung",
""
],
[
"Pham",
"Quang-Cuong",
""
]
] | Finding the Time-Optimal Parameterization of a Path (TOPP) subject to second-order constraints (e.g. acceleration, torque, contact stability, etc.) is an important and well-studied problem in robotics. In comparison, TOPP subject to third-order constraints (e.g. jerk, torque rate, etc.) has received far less attention ... |
2210.05335 | Junjie Wang | Yatai Ji, Junjie Wang, Yuan Gong, Lin Zhang, Yanru Zhu, Hongfa Wang,
Jiaxing Zhang, Tetsuya Sakai, Yujiu Yang | MAP: Multimodal Uncertainty-Aware Vision-Language Pre-training Model | CVPR 2023 Main Track Long Paper | null | null | null | cs.CV cs.CL cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multimodal semantic understanding often has to deal with uncertainty, which
means the obtained messages tend to refer to multiple targets. Such uncertainty
is problematic for our interpretation, including inter- and intra-modal
uncertainty. Little effort has studied the modeling of this uncertainty,
particularly in p... | [
{
"created": "Tue, 11 Oct 2022 10:54:54 GMT",
"version": "v1"
},
{
"created": "Sun, 26 Mar 2023 04:54:25 GMT",
"version": "v2"
},
{
"created": "Thu, 20 Jul 2023 16:24:14 GMT",
"version": "v3"
}
] | 2023-07-21 | [
[
"Ji",
"Yatai",
""
],
[
"Wang",
"Junjie",
""
],
[
"Gong",
"Yuan",
""
],
[
"Zhang",
"Lin",
""
],
[
"Zhu",
"Yanru",
""
],
[
"Wang",
"Hongfa",
""
],
[
"Zhang",
"Jiaxing",
""
],
[
"Sakai",
"Tetsuya",... | Multimodal semantic understanding often has to deal with uncertainty, which means the obtained messages tend to refer to multiple targets. Such uncertainty is problematic for our interpretation, including inter- and intra-modal uncertainty. Little effort has studied the modeling of this uncertainty, particularly in pre... |
2001.04351 | Liang Xu | Liang Xu, Yu tong, Qianqian Dong, Yixuan Liao, Cong Yu, Yin Tian,
Weitang Liu, Lu Li, Caiquan Liu, Xuanwei Zhang | CLUENER2020: Fine-grained Named Entity Recognition Dataset and Benchmark
for Chinese | 6 pages, 5 tables, 1 figure | null | null | null | cs.CL cs.IR cs.LG | http://creativecommons.org/licenses/by/4.0/ | In this paper, we introduce the NER dataset from CLUE organization
(CLUENER2020), a well-defined fine-grained dataset for named entity recognition
in Chinese. CLUENER2020 contains 10 categories. Apart from common labels like
person, organization, and location, it contains more diverse categories. It is
more challengi... | [
{
"created": "Mon, 13 Jan 2020 15:39:56 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Jan 2020 19:06:49 GMT",
"version": "v2"
},
{
"created": "Fri, 17 Jan 2020 16:18:16 GMT",
"version": "v3"
},
{
"created": "Mon, 20 Jan 2020 16:32:50 GMT",
"version": "v4"
}
] | 2020-01-22 | [
[
"Xu",
"Liang",
""
],
[
"tong",
"Yu",
""
],
[
"Dong",
"Qianqian",
""
],
[
"Liao",
"Yixuan",
""
],
[
"Yu",
"Cong",
""
],
[
"Tian",
"Yin",
""
],
[
"Liu",
"Weitang",
""
],
[
"Li",
"Lu",
""
],
... | In this paper, we introduce the NER dataset from CLUE organization (CLUENER2020), a well-defined fine-grained dataset for named entity recognition in Chinese. CLUENER2020 contains 10 categories. Apart from common labels like person, organization, and location, it contains more diverse categories. It is more challenging... |
2103.16489 | Cagatay Basdogan | Idil Ozdamar, M.Reza Alipour, Benoit P. Delhaye, Philippe Lef`evre,
Cagatay Basdogan | Step-Change in Friction under Electrovibration | null | IEEE Transactions on Haptics, 2020, Vol. 13, No. 1, pp. 137-143 | 10.1109/TOH.2020.2966992 | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rendering tactile effects on a touch screen via electrovibration has many
potential applications. However, our knowledge on tactile perception of change
in friction and the underlying contact mechanics are both very limited. In this
study, we investigate the tactile perception and the contact mechanics for a
step cha... | [
{
"created": "Tue, 30 Mar 2021 16:45:27 GMT",
"version": "v1"
}
] | 2021-03-31 | [
[
"Ozdamar",
"Idil",
""
],
[
"Alipour",
"M. Reza",
""
],
[
"Delhaye",
"Benoit P.",
""
],
[
"Lef`evre",
"Philippe",
""
],
[
"Basdogan",
"Cagatay",
""
]
] | Rendering tactile effects on a touch screen via electrovibration has many potential applications. However, our knowledge on tactile perception of change in friction and the underlying contact mechanics are both very limited. In this study, we investigate the tactile perception and the contact mechanics for a step chang... |
1901.05719 | Lingchen Huang | Lingchen Huang, Huazi Zhang, Rong Li, Yiqun Ge, Jun Wang | AI Coding: Learning to Construct Error Correction Codes | 14 pages; 15 figures; Accepted for publication in the IEEE
Transactions on Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we investigate an artificial-intelligence (AI) driven approach
to design error correction codes (ECC). Classic error correction code was
designed upon coding theory that typically defines code properties (e.g.,
hamming distance, subchannel reliability, etc.) to reflect code performance.
Its code design... | [
{
"created": "Thu, 17 Jan 2019 10:24:22 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Oct 2019 02:39:05 GMT",
"version": "v2"
}
] | 2019-10-31 | [
[
"Huang",
"Lingchen",
""
],
[
"Zhang",
"Huazi",
""
],
[
"Li",
"Rong",
""
],
[
"Ge",
"Yiqun",
""
],
[
"Wang",
"Jun",
""
]
] | In this paper, we investigate an artificial-intelligence (AI) driven approach to design error correction codes (ECC). Classic error correction code was designed upon coding theory that typically defines code properties (e.g., hamming distance, subchannel reliability, etc.) to reflect code performance. Its code design i... |
2404.09200 | Pengda Mao | Pengda Mao and Quan Quan | Tube-RRT*: Efficient Homotopic Path Planning for Swarm Robotics
Passing-Through Large-Scale Obstacle Environments | 8 pages, 8 figures, submitted to RA-L | null | null | null | cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, the concept of optimal virtual tube has emerged as a novel solution
to the challenging task of navigating obstacle-dense environments for swarm
robotics, offering a wide ranging of applications. However, it lacks an
efficient homotopic path planning method in obstacle-dense environments. This
paper introduc... | [
{
"created": "Sun, 14 Apr 2024 09:29:37 GMT",
"version": "v1"
}
] | 2024-04-16 | [
[
"Mao",
"Pengda",
""
],
[
"Quan",
"Quan",
""
]
] | Recently, the concept of optimal virtual tube has emerged as a novel solution to the challenging task of navigating obstacle-dense environments for swarm robotics, offering a wide ranging of applications. However, it lacks an efficient homotopic path planning method in obstacle-dense environments. This paper introduces... |
1610.04028 | Arash Andalib | Arash Andalib, Mehdi Zare, Farid Atry | A fuzzy expert system for earthquake prediction, case study: the Zagros
range | 4 pages, 4 figures in proceedings of the third International
Conference on Modeling, Simulation and Applied Optimization, 2009 Corrected
typos, added publication information, Corrected typo, Added publication
information | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A methodology for the development of a fuzzy expert system (FES) with
application to earthquake prediction is presented. The idea is to reproduce the
performance of a human expert in earthquake prediction. To do this, at the
first step, rules provided by the human expert are used to generate a fuzzy
rule base. These ... | [
{
"created": "Thu, 13 Oct 2016 11:18:02 GMT",
"version": "v1"
},
{
"created": "Wed, 17 May 2017 21:23:01 GMT",
"version": "v2"
}
] | 2017-05-19 | [
[
"Andalib",
"Arash",
""
],
[
"Zare",
"Mehdi",
""
],
[
"Atry",
"Farid",
""
]
] | A methodology for the development of a fuzzy expert system (FES) with application to earthquake prediction is presented. The idea is to reproduce the performance of a human expert in earthquake prediction. To do this, at the first step, rules provided by the human expert are used to generate a fuzzy rule base. These ru... |
2010.07347 | Changjiang Cai | Changjiang Cai, Matteo Poggi, Stefano Mattoccia, Philippos Mordohai | Matching-space Stereo Networks for Cross-domain Generalization | 14 pages, 8 figures, International Conference on 3D Vision
(3DV'2020), Github code at https://github.com/ccj5351/MS-Nets | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | End-to-end deep networks represent the state of the art for stereo matching.
While excelling on images framing environments similar to the training set,
major drops in accuracy occur in unseen domains (e.g., when moving from
synthetic to real scenes). In this paper we introduce a novel family of
architectures, namely... | [
{
"created": "Wed, 14 Oct 2020 18:29:20 GMT",
"version": "v1"
}
] | 2020-10-16 | [
[
"Cai",
"Changjiang",
""
],
[
"Poggi",
"Matteo",
""
],
[
"Mattoccia",
"Stefano",
""
],
[
"Mordohai",
"Philippos",
""
]
] | End-to-end deep networks represent the state of the art for stereo matching. While excelling on images framing environments similar to the training set, major drops in accuracy occur in unseen domains (e.g., when moving from synthetic to real scenes). In this paper we introduce a novel family of architectures, namely M... |
1306.4151 | Elchanan Mossel | Elchanan Mossel and Anupam Prakash and Gregory Valiant | Computation in anonymous networks | null | null | null | null | cs.CC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We identify and investigate a computational model arising in molecular
computing, social computing and sensor network. The model is made of of
multiple agents who are computationally limited and posses no global
information. The agents may represent nodes in a social network, sensors, or
molecules in a molecular comp... | [
{
"created": "Tue, 18 Jun 2013 11:37:39 GMT",
"version": "v1"
}
] | 2013-06-19 | [
[
"Mossel",
"Elchanan",
""
],
[
"Prakash",
"Anupam",
""
],
[
"Valiant",
"Gregory",
""
]
] | We identify and investigate a computational model arising in molecular computing, social computing and sensor network. The model is made of of multiple agents who are computationally limited and posses no global information. The agents may represent nodes in a social network, sensors, or molecules in a molecular comput... |
2010.11105 | Jakub Ber\'anek | Stanislav B\"ohm, Jakub Ber\'anek | Runtime vs Scheduler: Analyzing Dask's Overheads | null | null | 10.1109/WORKS51914.2020.00006 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dask is a distributed task framework which is commonly used by data
scientists to parallelize Python code on computing clusters with little
programming effort. It uses a sophisticated work-stealing scheduler which has
been hand-tuned to execute task graphs as efficiently as possible. But is
scheduler optimization a w... | [
{
"created": "Wed, 21 Oct 2020 16:13:37 GMT",
"version": "v1"
}
] | 2021-01-21 | [
[
"Böhm",
"Stanislav",
""
],
[
"Beránek",
"Jakub",
""
]
] | Dask is a distributed task framework which is commonly used by data scientists to parallelize Python code on computing clusters with little programming effort. It uses a sophisticated work-stealing scheduler which has been hand-tuned to execute task graphs as efficiently as possible. But is scheduler optimization a wor... |
2008.09194 | Baiwu Zhang | Baiwu Zhang, Jin Peng Zhou, Ilia Shumailov, Nicolas Papernot | On Attribution of Deepfakes | null | null | null | null | cs.LG cs.CR cs.CV cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Progress in generative modelling, especially generative adversarial networks,
have made it possible to efficiently synthesize and alter media at scale.
Malicious individuals now rely on these machine-generated media, or deepfakes,
to manipulate social discourse. In order to ensure media authenticity, existing
researc... | [
{
"created": "Thu, 20 Aug 2020 20:25:18 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Mar 2021 21:41:33 GMT",
"version": "v2"
}
] | 2021-03-05 | [
[
"Zhang",
"Baiwu",
""
],
[
"Zhou",
"Jin Peng",
""
],
[
"Shumailov",
"Ilia",
""
],
[
"Papernot",
"Nicolas",
""
]
] | Progress in generative modelling, especially generative adversarial networks, have made it possible to efficiently synthesize and alter media at scale. Malicious individuals now rely on these machine-generated media, or deepfakes, to manipulate social discourse. In order to ensure media authenticity, existing research ... |
2203.09308 | Chuxu Zhang | Chuxu Zhang, Kaize Ding, Jundong Li, Xiangliang Zhang, Yanfang Ye,
Nitesh V. Chawla, Huan Liu | Few-Shot Learning on Graphs | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph representation learning has attracted tremendous attention due to its
remarkable performance in many real-world applications. However, prevailing
supervised graph representation learning models for specific tasks often suffer
from label sparsity issue as data labeling is always time and resource
consuming. In l... | [
{
"created": "Thu, 17 Mar 2022 13:21:11 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Jun 2022 13:14:52 GMT",
"version": "v2"
}
] | 2022-06-08 | [
[
"Zhang",
"Chuxu",
""
],
[
"Ding",
"Kaize",
""
],
[
"Li",
"Jundong",
""
],
[
"Zhang",
"Xiangliang",
""
],
[
"Ye",
"Yanfang",
""
],
[
"Chawla",
"Nitesh V.",
""
],
[
"Liu",
"Huan",
""
]
] | Graph representation learning has attracted tremendous attention due to its remarkable performance in many real-world applications. However, prevailing supervised graph representation learning models for specific tasks often suffer from label sparsity issue as data labeling is always time and resource consuming. In lig... |
2010.06401 | Pawan Aurora | Pawan Aurora, Hans Raj Tiwary | On the Complexity of Some Facet-Defining Inequalities of the
QAP-polytope | 20 pages. To be published in COCOA 2020 proceedings | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem that
is equivalent to optimizing a linear objective function over the QAP polytope.
The QAP polytope with parameter $n$ - \qappolytope{n} - is defined as the
convex hull of rank-$1$ matrices $xx^T$ with $x$ as the vectorized $n\times n$
permutatio... | [
{
"created": "Tue, 13 Oct 2020 13:56:24 GMT",
"version": "v1"
}
] | 2020-10-14 | [
[
"Aurora",
"Pawan",
""
],
[
"Tiwary",
"Hans Raj",
""
]
] | The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem that is equivalent to optimizing a linear objective function over the QAP polytope. The QAP polytope with parameter $n$ - \qappolytope{n} - is defined as the convex hull of rank-$1$ matrices $xx^T$ with $x$ as the vectorized $n\times n$ permutation ... |
2105.04021 | Bhaskar Mitra | Nick Craswell, Bhaskar Mitra, Emine Yilmaz, Daniel Campos and Jimmy
Lin | MS MARCO: Benchmarking Ranking Models in the Large-Data Regime | null | null | null | null | cs.IR cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Evaluation efforts such as TREC, CLEF, NTCIR and FIRE, alongside public
leaderboard such as MS MARCO, are intended to encourage research and track our
progress, addressing big questions in our field. However, the goal is not
simply to identify which run is "best", achieving the top score. The goal is to
move the fiel... | [
{
"created": "Sun, 9 May 2021 20:57:36 GMT",
"version": "v1"
}
] | 2021-05-11 | [
[
"Craswell",
"Nick",
""
],
[
"Mitra",
"Bhaskar",
""
],
[
"Yilmaz",
"Emine",
""
],
[
"Campos",
"Daniel",
""
],
[
"Lin",
"Jimmy",
""
]
] | Evaluation efforts such as TREC, CLEF, NTCIR and FIRE, alongside public leaderboard such as MS MARCO, are intended to encourage research and track our progress, addressing big questions in our field. However, the goal is not simply to identify which run is "best", achieving the top score. The goal is to move the field ... |
1203.1095 | Guido Tack | Tom Schrijvers, Guido Tack, Pieter Wuille, Horst Samulowitz, Peter J.
Stuckey | Search Combinators | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The ability to model search in a constraint solver can be an essential asset
for solving combinatorial problems. However, existing infrastructure for
defining search heuristics is often inadequate. Either modeling capabilities
are extremely limited or users are faced with a general-purpose programming
language whose ... | [
{
"created": "Tue, 6 Mar 2012 03:59:34 GMT",
"version": "v1"
}
] | 2012-03-07 | [
[
"Schrijvers",
"Tom",
""
],
[
"Tack",
"Guido",
""
],
[
"Wuille",
"Pieter",
""
],
[
"Samulowitz",
"Horst",
""
],
[
"Stuckey",
"Peter J.",
""
]
] | The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely limited or users are faced with a general-purpose programming language whose fe... |
2403.11529 | Hantao Zhou | Hantao Zhou, Runze Hu, Xiu Li | Video Object Segmentation with Dynamic Query Modulation | Accepted by ICME2024 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Storing intermediate frame segmentations as memory for long-range context
modeling, spatial-temporal memory-based methods have recently showcased
impressive results in semi-supervised video object segmentation (SVOS).
However, these methods face two key limitations: 1) relying on non-local
pixel-level matching to rea... | [
{
"created": "Mon, 18 Mar 2024 07:31:39 GMT",
"version": "v1"
}
] | 2024-03-19 | [
[
"Zhou",
"Hantao",
""
],
[
"Hu",
"Runze",
""
],
[
"Li",
"Xiu",
""
]
] | Storing intermediate frame segmentations as memory for long-range context modeling, spatial-temporal memory-based methods have recently showcased impressive results in semi-supervised video object segmentation (SVOS). However, these methods face two key limitations: 1) relying on non-local pixel-level matching to read ... |
2401.08974 | Lipeng Zhu | Lipeng Zhu, Wenyan Ma, Zhenyu Xiao, and Rui Zhang | Performance Analysis and Optimization for Movable Antenna Aided Wideband
Communications | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Movable antenna (MA) has emerged as a promising technology to enhance
wireless communication performance by enabling the local movement of antennas
at the transmitter (Tx) and/or receiver (Rx) for achieving more favorable
channel conditions. As the existing studies on MA-aided wireless communications
have mainly cons... | [
{
"created": "Wed, 17 Jan 2024 04:54:47 GMT",
"version": "v1"
}
] | 2024-01-18 | [
[
"Zhu",
"Lipeng",
""
],
[
"Ma",
"Wenyan",
""
],
[
"Xiao",
"Zhenyu",
""
],
[
"Zhang",
"Rui",
""
]
] | Movable antenna (MA) has emerged as a promising technology to enhance wireless communication performance by enabling the local movement of antennas at the transmitter (Tx) and/or receiver (Rx) for achieving more favorable channel conditions. As the existing studies on MA-aided wireless communications have mainly consid... |
2104.12674 | Lawrence Paulson | Lawrence C. Paulson | The Relative Consistency of the Axiom of Choice Mechanized Using
Isabelle/ZF | null | LMS Journal of Computation and Mathematics, Volume 6, 2003, pp.
198-248 | 10.1112/S1461157000000449 | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | The proof of the relative consistency of the axiom of choice has been
mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of
the reflection theorem. The heavy reliance on metatheory in the original proof
makes the formalization unusually long, and not entirely satisfactory: two
parts of the p... | [
{
"created": "Mon, 26 Apr 2021 16:00:22 GMT",
"version": "v1"
}
] | 2021-04-27 | [
[
"Paulson",
"Lawrence C.",
""
]
] | The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the formalization unusually long, and not entirely satisfactory: two parts of the pro... |
2001.03665 | Salar Nouri | Ali Parchekani, Salar Nouri, Vahid Shah-Mansouri, and Seyed Pooya
Shariatpanahi | Classification of Traffic Using Neural Networks by Rejecting: a Novel
Approach in Classifying VPN Traffic | null | null | null | null | cs.NI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we introduce a novel end-to-end traffic classification method
to distinguish between traffic classes including VPN traffic in three layers of
the Open Systems Interconnection (OSI) model. Classification of VPN traffic is
not trivial using traditional classification approaches due to its encrypted
natur... | [
{
"created": "Fri, 10 Jan 2020 21:01:22 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Dec 2021 06:00:33 GMT",
"version": "v2"
}
] | 2021-12-13 | [
[
"Parchekani",
"Ali",
""
],
[
"Nouri",
"Salar",
""
],
[
"Shah-Mansouri",
"Vahid",
""
],
[
"Shariatpanahi",
"Seyed Pooya",
""
]
] | In this paper, we introduce a novel end-to-end traffic classification method to distinguish between traffic classes including VPN traffic in three layers of the Open Systems Interconnection (OSI) model. Classification of VPN traffic is not trivial using traditional classification approaches due to its encrypted nature.... |
1710.09713 | Xing Wang | Xing Wang | The relationship between the number of editorial board members and the
scientific output of universities in the chemistry field | This paper is revised and extended based on the paper entitled "Which
Drives Which? The Causal Relationship between the Number of Editorial Board
Members and the Scientific Output of Universities in the Chemistry Field"in
Proceedings of the 16th International Conference of the International Society
for Scientom... | null | null | null | cs.DL stat.OT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Editorial board members, who are considered the gatekeepers of scientific
journals, play an important role in academia, and may directly or indirectly
affect the scientific output of a university. In this article, we used the
quantile regression method among a sample of 1,387 university in chemistry to
characterize t... | [
{
"created": "Wed, 25 Oct 2017 08:53:19 GMT",
"version": "v1"
}
] | 2017-10-27 | [
[
"Wang",
"Xing",
""
]
] | Editorial board members, who are considered the gatekeepers of scientific journals, play an important role in academia, and may directly or indirectly affect the scientific output of a university. In this article, we used the quantile regression method among a sample of 1,387 university in chemistry to characterize the... |
2109.08302 | Xiaoqiang Wang | Jiaojiao Wang, Dabin Zheng, Shenghua Li | Rack-Aware MSR Codes with Multiple Erasure Tolerance | Distributed storage; Multiple erasure tolerance; MSRR codes;
Universally error-resilient repair | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | The minimum storage rack-aware regenerating (MSRR) code is a variation of
regenerating codes that achieves the optimal repair bandwidth for a single node
failure in the rack-aware model. The authors in~\cite{Chen-Barg2019}
and~\cite{Zhou-Zhang2021} provided explicit constructions of MSRR codes for all
parameters to r... | [
{
"created": "Fri, 17 Sep 2021 01:50:25 GMT",
"version": "v1"
}
] | 2021-09-20 | [
[
"Wang",
"Jiaojiao",
""
],
[
"Zheng",
"Dabin",
""
],
[
"Li",
"Shenghua",
""
]
] | The minimum storage rack-aware regenerating (MSRR) code is a variation of regenerating codes that achieves the optimal repair bandwidth for a single node failure in the rack-aware model. The authors in~\cite{Chen-Barg2019} and~\cite{Zhou-Zhang2021} provided explicit constructions of MSRR codes for all parameters to rep... |
2202.10773 | Daniel Franco-Barranco | Daniel Franco-Barranco and Julio Pastor-Tronch and Aitor
Gonzalez-Marfil and Arrate Mu\~noz-Barrutia and Ignacio Arganda-Carreras | Deep learning based domain adaptation for mitochondria segmentation on
EM volumes | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Accurate segmentation of electron microscopy (EM) volumes of the brain is
essential to characterize neuronal structures at a cell or organelle level.
While supervised deep learning methods have led to major breakthroughs in that
direction during the past years, they usually require large amounts of
annotated data to ... | [
{
"created": "Tue, 22 Feb 2022 09:49:25 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Jul 2022 14:43:44 GMT",
"version": "v2"
}
] | 2022-07-06 | [
[
"Franco-Barranco",
"Daniel",
""
],
[
"Pastor-Tronch",
"Julio",
""
],
[
"Gonzalez-Marfil",
"Aitor",
""
],
[
"Muñoz-Barrutia",
"Arrate",
""
],
[
"Arganda-Carreras",
"Ignacio",
""
]
] | Accurate segmentation of electron microscopy (EM) volumes of the brain is essential to characterize neuronal structures at a cell or organelle level. While supervised deep learning methods have led to major breakthroughs in that direction during the past years, they usually require large amounts of annotated data to be... |
2407.17889 | Qing Zhao | Qing Zhao, Chengkui Zhang, Hao Li, Ting Ke | An Error Discovery and Correction for the Family of V-Shaped BPSO
Algorithms | 25 pages, 11 figures | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | BPSO algorithm is a swarm intelligence optimization algorithm, which has the
characteristics of good optimization effect, high efficiency and easy to
implement. In recent years, it has been used to optimize a variety of machine
learning and deep learning models, such as CNN, LSTM, SVM, etc. But it is easy
to fall int... | [
{
"created": "Thu, 25 Jul 2024 09:18:32 GMT",
"version": "v1"
}
] | 2024-07-26 | [
[
"Zhao",
"Qing",
""
],
[
"Zhang",
"Chengkui",
""
],
[
"Li",
"Hao",
""
],
[
"Ke",
"Ting",
""
]
] | BPSO algorithm is a swarm intelligence optimization algorithm, which has the characteristics of good optimization effect, high efficiency and easy to implement. In recent years, it has been used to optimize a variety of machine learning and deep learning models, such as CNN, LSTM, SVM, etc. But it is easy to fall into ... |
1905.09700 | Chen Tessler | Chen Tessler, Tom Zahavy, Deborah Cohen, Daniel J. Mankowitz and Shie
Mannor | Action Assembly: Sparse Imitation Learning for Text Based Games with
Combinatorial Action Spaces | Under review at IJCAI 2020 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a computationally efficient algorithm that combines compressed
sensing with imitation learning to solve text-based games with combinatorial
action spaces. Specifically, we introduce a new compressed sensing algorithm,
named IK-OMP, which can be seen as an extension to the Orthogonal Matching
Pursuit (OMP).... | [
{
"created": "Thu, 23 May 2019 15:06:55 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Dec 2019 09:13:40 GMT",
"version": "v2"
},
{
"created": "Sun, 9 Feb 2020 09:58:08 GMT",
"version": "v3"
}
] | 2020-02-11 | [
[
"Tessler",
"Chen",
""
],
[
"Zahavy",
"Tom",
""
],
[
"Cohen",
"Deborah",
""
],
[
"Mankowitz",
"Daniel J.",
""
],
[
"Mannor",
"Shie",
""
]
] | We propose a computationally efficient algorithm that combines compressed sensing with imitation learning to solve text-based games with combinatorial action spaces. Specifically, we introduce a new compressed sensing algorithm, named IK-OMP, which can be seen as an extension to the Orthogonal Matching Pursuit (OMP). W... |
2009.00513 | Allen Riddell | Allen Riddell and Troy J. Bassett | What Library Digitization Leaves Out: Predicting the Availability of
Digital Surrogates of English Novels | null | portal: Libraries and the Academy, 21(4), 885-900 (2021) | 10.1353/pla.2021.0045 | null | cs.DL | http://creativecommons.org/publicdomain/zero/1.0/ | Library digitization has made more than a hundred thousand 19th-century
English-language books available to the public. Do the books which have been
digitized reflect the population of published books? An affirmative answer
would allow book and literary historians to use holdings of major digital
libraries as proxies... | [
{
"created": "Tue, 1 Sep 2020 15:20:15 GMT",
"version": "v1"
}
] | 2021-11-15 | [
[
"Riddell",
"Allen",
""
],
[
"Bassett",
"Troy J.",
""
]
] | Library digitization has made more than a hundred thousand 19th-century English-language books available to the public. Do the books which have been digitized reflect the population of published books? An affirmative answer would allow book and literary historians to use holdings of major digital libraries as proxies f... |
2309.00236 | Luke Bailey | Luke Bailey, Euan Ong, Stuart Russell, Scott Emmons | Image Hijacks: Adversarial Images can Control Generative Models at
Runtime | Project page at https://image-hijacks.github.io | null | null | null | cs.LG cs.CL cs.CR | http://creativecommons.org/licenses/by/4.0/ | Are foundation models secure against malicious actors? In this work, we focus
on the image input to a vision-language model (VLM). We discover image hijacks,
adversarial images that control the behaviour of VLMs at inference time, and
introduce the general Behaviour Matching algorithm for training image hijacks.
From... | [
{
"created": "Fri, 1 Sep 2023 03:53:40 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Sep 2023 17:59:23 GMT",
"version": "v2"
},
{
"created": "Mon, 22 Apr 2024 20:18:47 GMT",
"version": "v3"
}
] | 2024-04-24 | [
[
"Bailey",
"Luke",
""
],
[
"Ong",
"Euan",
""
],
[
"Russell",
"Stuart",
""
],
[
"Emmons",
"Scott",
""
]
] | Are foundation models secure against malicious actors? In this work, we focus on the image input to a vision-language model (VLM). We discover image hijacks, adversarial images that control the behaviour of VLMs at inference time, and introduce the general Behaviour Matching algorithm for training image hijacks. From t... |
1805.02102 | Maria Luisa Damiani | Maria Luisa Damiani, Fatima Hachem, Issa Hamza, Nathan Ranc, Paul
Moorcroft, Francesca Cagnacci | Cluster-based trajectory segmentation with local noise | 41 pages, Data Mining and Knowledge Discovery (2018) | Data Mining and Knowledge Discovery, 2018, Vol 32, Issue 4,
1017-1055 | 10.1007/s10618-018-0561-2 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a framework for the partitioning of a spatial trajectory in a
sequence of segments based on spatial density and temporal criteria. The result
is a set of temporally separated clusters interleaved by sub-sequences of
unclustered points. A major novelty is the proposal of an outlier or noise
model based on t... | [
{
"created": "Sat, 5 May 2018 18:46:46 GMT",
"version": "v1"
}
] | 2018-06-19 | [
[
"Damiani",
"Maria Luisa",
""
],
[
"Hachem",
"Fatima",
""
],
[
"Hamza",
"Issa",
""
],
[
"Ranc",
"Nathan",
""
],
[
"Moorcroft",
"Paul",
""
],
[
"Cagnacci",
"Francesca",
""
]
] | We present a framework for the partitioning of a spatial trajectory in a sequence of segments based on spatial density and temporal criteria. The result is a set of temporally separated clusters interleaved by sub-sequences of unclustered points. A major novelty is the proposal of an outlier or noise model based on the... |
1903.00029 | Jugal Garg | Jugal Garg and Setareh Taki | An Improved Approximation Algorithm for Maximin Shares | Fixed typos and added more details. A two-page abstract appeared in
ACM EC 2020 | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fair division is a fundamental problem in various multi-agent settings, where
the goal is to divide a set of resources among agents in a fair manner. We
study the case where m indivisible items need to be divided among n agents with
additive valuations using the popular fairness notion of maximin share (MMS).
An MMS ... | [
{
"created": "Thu, 28 Feb 2019 19:08:21 GMT",
"version": "v1"
},
{
"created": "Sat, 15 Feb 2020 17:24:38 GMT",
"version": "v2"
},
{
"created": "Mon, 5 Apr 2021 20:32:03 GMT",
"version": "v3"
}
] | 2021-04-07 | [
[
"Garg",
"Jugal",
""
],
[
"Taki",
"Setareh",
""
]
] | Fair division is a fundamental problem in various multi-agent settings, where the goal is to divide a set of resources among agents in a fair manner. We study the case where m indivisible items need to be divided among n agents with additive valuations using the popular fairness notion of maximin share (MMS). An MMS al... |
2004.09759 | Akhila Sri Manasa Venigalla | Akhila Sri Manasa Venigalla, Dheeraj Vagavolu and Sridhar Chimalakonda | SurviveCovid-19 -- An Educational Game to Facilitate Habituation of
Social Distancing and Other Health Measures for Covid-19 Pandemic | 17 pages, 9 figures and 2 tables | null | null | null | cs.HC cs.CY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Covid-19 has been causing severe loss to the human race. Considering the mode
of spread and severity, it is essential to make it a habit to follow various
safety precautions such as using sanitizers and masks and maintaining social
distancing to prevent the spread of Covid-19. Individuals are widely educated
about th... | [
{
"created": "Tue, 21 Apr 2020 05:24:17 GMT",
"version": "v1"
},
{
"created": "Mon, 3 May 2021 17:47:52 GMT",
"version": "v2"
}
] | 2021-05-04 | [
[
"Venigalla",
"Akhila Sri Manasa",
""
],
[
"Vagavolu",
"Dheeraj",
""
],
[
"Chimalakonda",
"Sridhar",
""
]
] | Covid-19 has been causing severe loss to the human race. Considering the mode of spread and severity, it is essential to make it a habit to follow various safety precautions such as using sanitizers and masks and maintaining social distancing to prevent the spread of Covid-19. Individuals are widely educated about the ... |
2111.14556 | Xuran Pan | Xuran Pan, Chunjiang Ge, Rui Lu, Shiji Song, Guanfu Chen, Zeyi Huang,
Gao Huang | On the Integration of Self-Attention and Convolution | Accepted to CVPR2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolution and self-attention are two powerful techniques for representation
learning, and they are usually considered as two peer approaches that are
distinct from each other. In this paper, we show that there exists a strong
underlying relation between them, in the sense that the bulk of computations of
these two ... | [
{
"created": "Mon, 29 Nov 2021 14:37:05 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Mar 2022 07:01:14 GMT",
"version": "v2"
}
] | 2022-03-15 | [
[
"Pan",
"Xuran",
""
],
[
"Ge",
"Chunjiang",
""
],
[
"Lu",
"Rui",
""
],
[
"Song",
"Shiji",
""
],
[
"Chen",
"Guanfu",
""
],
[
"Huang",
"Zeyi",
""
],
[
"Huang",
"Gao",
""
]
] | Convolution and self-attention are two powerful techniques for representation learning, and they are usually considered as two peer approaches that are distinct from each other. In this paper, we show that there exists a strong underlying relation between them, in the sense that the bulk of computations of these two pa... |
2012.09486 | Kevin Denamganai | Kevin Denamgana\"i and James Alfred Walker | ReferentialGym: A Nomenclature and Framework for Language Emergence &
Grounding in (Visual) Referential Games | Accepted at 4th NeurIPS Workshop on Emergent Communication (EmeCom @
NeurIPS 2020) | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Natural languages are powerful tools wielded by human beings to communicate
information and co-operate towards common goals. Their values lie in some main
properties like compositionality, hierarchy and recurrent syntax, which
computational linguists have been researching the emergence of in artificial
languages indu... | [
{
"created": "Thu, 17 Dec 2020 10:22:15 GMT",
"version": "v1"
}
] | 2020-12-18 | [
[
"Denamganaï",
"Kevin",
""
],
[
"Walker",
"James Alfred",
""
]
] | Natural languages are powerful tools wielded by human beings to communicate information and co-operate towards common goals. Their values lie in some main properties like compositionality, hierarchy and recurrent syntax, which computational linguists have been researching the emergence of in artificial languages induce... |
2108.05145 | Zain Alabedeen Ali | Zain Alabedeen Ali and Konstantin Yakovlev | Prioritized SIPP for Multi-Agent Path Finding With Kinematic Constraints | 13 pages, 3 figures, ICR 2021 | null | null | null | cs.RO cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-Agent Path Finding (MAPF) is a long-standing problem in Robotics and
Artificial Intelligence in which one needs to find a set of collision-free
paths for a group of mobile agents (robots) operating in the shared workspace.
Due to its importance, the problem is well-studied and multiple optimal and
approximate a... | [
{
"created": "Wed, 11 Aug 2021 10:42:11 GMT",
"version": "v1"
}
] | 2021-08-12 | [
[
"Ali",
"Zain Alabedeen",
""
],
[
"Yakovlev",
"Konstantin",
""
]
] | Multi-Agent Path Finding (MAPF) is a long-standing problem in Robotics and Artificial Intelligence in which one needs to find a set of collision-free paths for a group of mobile agents (robots) operating in the shared workspace. Due to its importance, the problem is well-studied and multiple optimal and approximate alg... |
1710.04731 | David Fridovich-Keil | David Fridovich-Keil, Sylvia L. Herbert, Jaime F. Fisac, Sampada
Deglurkar, Claire J. Tomlin | Planning, Fast and Slow: A Framework for Adaptive Real-Time Safe
Trajectory Planning | ICRA, International Conference on Robotics and Automation, ICRA 2018,
8 pages, 9 figures | null | null | null | cs.SY cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motion planning is an extremely well-studied problem in the robotics
community, yet existing work largely falls into one of two categories:
computationally efficient but with few if any safety guarantees, or able to
give stronger guarantees but at high computational cost. This work builds on a
recent development call... | [
{
"created": "Thu, 12 Oct 2017 21:45:24 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Mar 2018 22:05:06 GMT",
"version": "v2"
}
] | 2018-03-08 | [
[
"Fridovich-Keil",
"David",
""
],
[
"Herbert",
"Sylvia L.",
""
],
[
"Fisac",
"Jaime F.",
""
],
[
"Deglurkar",
"Sampada",
""
],
[
"Tomlin",
"Claire J.",
""
]
] | Motion planning is an extremely well-studied problem in the robotics community, yet existing work largely falls into one of two categories: computationally efficient but with few if any safety guarantees, or able to give stronger guarantees but at high computational cost. This work builds on a recent development called... |
2304.05615 | Qiang Liu | Qiang Liu, Zhaocheng Liu, Zhenxi Zhu, Shu Wu, Liang Wang | Deep Stable Multi-Interest Learning for Out-of-distribution Sequential
Recommendation | null | null | null | null | cs.IR cs.AI | http://creativecommons.org/licenses/by/4.0/ | Recently, multi-interest models, which extract interests of a user as
multiple representation vectors, have shown promising performances for
sequential recommendation. However, none of existing multi-interest
recommendation models consider the Out-Of-Distribution (OOD) generalization
problem, in which interest distri... | [
{
"created": "Wed, 12 Apr 2023 05:13:54 GMT",
"version": "v1"
}
] | 2023-04-13 | [
[
"Liu",
"Qiang",
""
],
[
"Liu",
"Zhaocheng",
""
],
[
"Zhu",
"Zhenxi",
""
],
[
"Wu",
"Shu",
""
],
[
"Wang",
"Liang",
""
]
] | Recently, multi-interest models, which extract interests of a user as multiple representation vectors, have shown promising performances for sequential recommendation. However, none of existing multi-interest recommendation models consider the Out-Of-Distribution (OOD) generalization problem, in which interest distribu... |
1909.12992 | Swapnil Mhaske | Swapnil Mhaske, Predrag Spasojevic, Ahsan Aziz | A Blockage Model for the Open Area Mm-wave Device-to-Device Environment | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A significant portion of the 5th generation of wireless networks will operate
in the mm-wave bands. One of the several challenges associated with mm-wave
propagation is to overcome shadowing due to signal blockage caused by
environmental objects. Particularly susceptible are nodes in a device-to-device
network that t... | [
{
"created": "Sat, 28 Sep 2019 00:14:46 GMT",
"version": "v1"
}
] | 2019-10-01 | [
[
"Mhaske",
"Swapnil",
""
],
[
"Spasojevic",
"Predrag",
""
],
[
"Aziz",
"Ahsan",
""
]
] | A significant portion of the 5th generation of wireless networks will operate in the mm-wave bands. One of the several challenges associated with mm-wave propagation is to overcome shadowing due to signal blockage caused by environmental objects. Particularly susceptible are nodes in a device-to-device network that typ... |
2102.03689 | Lei Yan | Lei Yan, Theodoros Stouraitis, and Sethu Vijayakumar | Decentralized Ability-Aware Adaptive Control for Multi-robot
Collaborative Manipulation | The article has been submitted to IEEE Robotics and Automation
Letters (RA-L) with ICRA 2021 conference option; the article has been
accepted for publication in RA-L | null | null | null | cs.RO cs.MA | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Multi-robot teams can achieve more dexterous, complex and heavier payload
tasks than a single robot, yet effective collaboration is required. Multi-robot
collaboration is extremely challenging due to the different kinematic and
dynamics capabilities of the robots, the limited communication between them,
and the uncer... | [
{
"created": "Sun, 7 Feb 2021 00:04:39 GMT",
"version": "v1"
}
] | 2021-02-09 | [
[
"Yan",
"Lei",
""
],
[
"Stouraitis",
"Theodoros",
""
],
[
"Vijayakumar",
"Sethu",
""
]
] | Multi-robot teams can achieve more dexterous, complex and heavier payload tasks than a single robot, yet effective collaboration is required. Multi-robot collaboration is extremely challenging due to the different kinematic and dynamics capabilities of the robots, the limited communication between them, and the uncerta... |
2101.08248 | Sam Wiseman | Sam Wiseman, Arturs Backurs, Karl Stratos | Data-to-text Generation by Splicing Together Nearest Neighbors | EMNLP 2021; figures updated/improved | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose to tackle data-to-text generation tasks by directly splicing
together retrieved segments of text from "neighbor" source-target pairs. Unlike
recent work that conditions on retrieved neighbors but generates text
token-by-token, left-to-right, we learn a policy that directly manipulates
segments of neighbor ... | [
{
"created": "Wed, 20 Jan 2021 18:43:11 GMT",
"version": "v1"
},
{
"created": "Fri, 29 Jan 2021 18:44:33 GMT",
"version": "v2"
},
{
"created": "Wed, 15 Sep 2021 15:46:16 GMT",
"version": "v3"
},
{
"created": "Thu, 28 Oct 2021 20:19:35 GMT",
"version": "v4"
}
] | 2021-11-01 | [
[
"Wiseman",
"Sam",
""
],
[
"Backurs",
"Arturs",
""
],
[
"Stratos",
"Karl",
""
]
] | We propose to tackle data-to-text generation tasks by directly splicing together retrieved segments of text from "neighbor" source-target pairs. Unlike recent work that conditions on retrieved neighbors but generates text token-by-token, left-to-right, we learn a policy that directly manipulates segments of neighbor te... |
2407.16994 | Jake Watts | Jake R. Watts, Joel Sokol | A Voter-Based Stochastic Rejection-Method Framework for Asymptotically
Safe Language Model Outputs | 7 pages, 2 figures | null | null | null | cs.AI cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes a new method for preventing unsafe or otherwise low
quality large language model (LLM) outputs, by leveraging the stochasticity of
LLMs. We propose a system whereby LLM checkers vote on the acceptability of a
generated output, regenerating it if a threshold of disapproval is reached,
until suffici... | [
{
"created": "Wed, 24 Jul 2024 04:27:55 GMT",
"version": "v1"
}
] | 2024-07-25 | [
[
"Watts",
"Jake R.",
""
],
[
"Sokol",
"Joel",
""
]
] | This paper proposes a new method for preventing unsafe or otherwise low quality large language model (LLM) outputs, by leveraging the stochasticity of LLMs. We propose a system whereby LLM checkers vote on the acceptability of a generated output, regenerating it if a threshold of disapproval is reached, until sufficien... |
2311.18525 | Asaf Shabtai | Yizhak Vaisman, Gilad Katz, Yuval Elovici, Asaf Shabtai | Detecting Anomalous Network Communication Patterns Using Graph
Convolutional Networks | null | null | null | null | cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To protect an organizations' endpoints from sophisticated cyberattacks,
advanced detection methods are required. In this research, we present
GCNetOmaly: a graph convolutional network (GCN)-based variational autoencoder
(VAE) anomaly detector trained on data that include connection events among
internal and external ... | [
{
"created": "Thu, 30 Nov 2023 13:03:49 GMT",
"version": "v1"
}
] | 2023-12-01 | [
[
"Vaisman",
"Yizhak",
""
],
[
"Katz",
"Gilad",
""
],
[
"Elovici",
"Yuval",
""
],
[
"Shabtai",
"Asaf",
""
]
] | To protect an organizations' endpoints from sophisticated cyberattacks, advanced detection methods are required. In this research, we present GCNetOmaly: a graph convolutional network (GCN)-based variational autoencoder (VAE) anomaly detector trained on data that include connection events among internal and external ma... |
2111.02881 | Michael Winter | Michael Winter, Heiko Neumann, R\"udiger Pryss, Thomas Probst, and
Manfred Reichert | Defining Gaze Patterns for Process Model Literacy -- Exploring Visual
Routines in Process Models with Diverse Mappings | null | null | null | null | cs.HC cs.CY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Process models depict crucial artifacts for organizations regarding
documentation, communication, and collaboration. The proper comprehension of
such models is essential for an effective application. An important aspect in
process model literacy constitutes the question how the information presented
in process models... | [
{
"created": "Thu, 4 Nov 2021 14:13:48 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Nov 2021 10:58:24 GMT",
"version": "v2"
}
] | 2021-12-01 | [
[
"Winter",
"Michael",
""
],
[
"Neumann",
"Heiko",
""
],
[
"Pryss",
"Rüdiger",
""
],
[
"Probst",
"Thomas",
""
],
[
"Reichert",
"Manfred",
""
]
] | Process models depict crucial artifacts for organizations regarding documentation, communication, and collaboration. The proper comprehension of such models is essential for an effective application. An important aspect in process model literacy constitutes the question how the information presented in process models i... |
1311.4336 | Junming Huang | Junming Huang, Chao Li, Wen-Qiang Wang, Hua-Wei Shen, Guojie Li,
Xue-Qi Cheng | Temporal scaling in information propagation | 13 pages, 2 figures. published on Scientific Reports | Scientific Reports 4, 5334, (2014) | 10.1038/srep05334 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For the study of information propagation, one fundamental problem is
uncovering universal laws governing the dynamics of information propagation.
This problem, from the microscopic perspective, is formulated as estimating the
propagation probability that a piece of information propagates from one
individual to anothe... | [
{
"created": "Mon, 18 Nov 2013 11:15:26 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Nov 2013 02:15:14 GMT",
"version": "v2"
},
{
"created": "Wed, 18 Jun 2014 09:55:29 GMT",
"version": "v3"
}
] | 2014-06-19 | [
[
"Huang",
"Junming",
""
],
[
"Li",
"Chao",
""
],
[
"Wang",
"Wen-Qiang",
""
],
[
"Shen",
"Hua-Wei",
""
],
[
"Li",
"Guojie",
""
],
[
"Cheng",
"Xue-Qi",
""
]
] | For the study of information propagation, one fundamental problem is uncovering universal laws governing the dynamics of information propagation. This problem, from the microscopic perspective, is formulated as estimating the propagation probability that a piece of information propagates from one individual to another.... |
1601.01770 | Albert Haque | Albert Haque | A MapReduce Approach to NoSQL RDF Databases | Undergraduate Honors Thesis, December 2013, The University of Texas
at Austin, Department of Computer Science. Report# HR-13-13 (honors theses) | null | null | HR-13-13 | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, the increased need to house and process large volumes of
data has prompted the need for distributed storage and querying systems. The
growth of machine-readable RDF triples has prompted both industry and academia
to develop new database systems, called NoSQL, with characteristics that differ
from cla... | [
{
"created": "Fri, 8 Jan 2016 05:04:26 GMT",
"version": "v1"
}
] | 2016-01-11 | [
[
"Haque",
"Albert",
""
]
] | In recent years, the increased need to house and process large volumes of data has prompted the need for distributed storage and querying systems. The growth of machine-readable RDF triples has prompted both industry and academia to develop new database systems, called NoSQL, with characteristics that differ from class... |
2109.06601 | Yannic Maus | Keren Censor-Hillel, Yannic Maus, Shahar Romem-Peled, Tigran Tonoyan | Distributed Vertex Cover Reconfiguration | null | null | null | null | cs.DS cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reconfiguration schedules, i.e., sequences that gradually transform one
solution of a problem to another while always maintaining feasibility, have
been extensively studied. Most research has dealt with the decision problem of
whether a reconfiguration schedule exists, and the complexity of finding one. A
prime examp... | [
{
"created": "Tue, 14 Sep 2021 11:45:34 GMT",
"version": "v1"
}
] | 2021-09-15 | [
[
"Censor-Hillel",
"Keren",
""
],
[
"Maus",
"Yannic",
""
],
[
"Romem-Peled",
"Shahar",
""
],
[
"Tonoyan",
"Tigran",
""
]
] | Reconfiguration schedules, i.e., sequences that gradually transform one solution of a problem to another while always maintaining feasibility, have been extensively studied. Most research has dealt with the decision problem of whether a reconfiguration schedule exists, and the complexity of finding one. A prime example... |
1810.00685 | Arnaud Martin | Kuang Zhou (NPU), Arnaud Martin (DRUID), Quan Pan (NPU) | A belief combination rule for a large number of sources | arXiv admin note: substantial text overlap with arXiv:1707.07999 | Journal of Advances in Information Fusion, 2018, 13 (2) | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The theory of belief functions is widely used for data from multiple sources.
Different evidence combination rules have been proposed in this framework
according to the properties of the sources to combine. However, most of these
combination rules are not efficient when there are a large number of sources.
This is du... | [
{
"created": "Fri, 28 Sep 2018 08:24:26 GMT",
"version": "v1"
}
] | 2018-10-02 | [
[
"Zhou",
"Kuang",
"",
"NPU"
],
[
"Martin",
"Arnaud",
"",
"DRUID"
],
[
"Pan",
"Quan",
"",
"NPU"
]
] | The theory of belief functions is widely used for data from multiple sources. Different evidence combination rules have been proposed in this framework according to the properties of the sources to combine. However, most of these combination rules are not efficient when there are a large number of sources. This is due ... |
1902.00219 | Kai Jin | Siu-Wing Cheng, Man-Kwun Chiu, Kai Jin | A note on self-improving sorting with hidden partitions | 4pages | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study self-improving sorting with hidden partitions. Our result is an
optimal algorithm which runs in expected time O(H(\pi(I)) + n), where I is the
given input which contains n elements to be sorted, \pi(I) is the output which
are the ranks of all element in I, and H(\pi(I)) denotes the entropy of the
output.
| [
{
"created": "Fri, 1 Feb 2019 08:26:43 GMT",
"version": "v1"
}
] | 2019-02-04 | [
[
"Cheng",
"Siu-Wing",
""
],
[
"Chiu",
"Man-Kwun",
""
],
[
"Jin",
"Kai",
""
]
] | We study self-improving sorting with hidden partitions. Our result is an optimal algorithm which runs in expected time O(H(\pi(I)) + n), where I is the given input which contains n elements to be sorted, \pi(I) is the output which are the ranks of all element in I, and H(\pi(I)) denotes the entropy of the output. |
2208.04227 | Davide Dalle Pezze | Davide Dalle Pezze, Denis Deronjic, Chiara Masiero, Diego Tosato,
Alessandro Beghi, Gian Antonio Susto | A Multi-label Continual Learning Framework to Scale Deep Learning
Approaches for Packaging Equipment Monitoring | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Continual Learning aims to learn from a stream of tasks, being able to
remember at the same time both new and old tasks. While many approaches were
proposed for single-class classification, multi-label classification in the
continual scenario remains a challenging problem. For the first time, we study
multi-label cla... | [
{
"created": "Mon, 8 Aug 2022 15:58:39 GMT",
"version": "v1"
}
] | 2022-08-09 | [
[
"Pezze",
"Davide Dalle",
""
],
[
"Deronjic",
"Denis",
""
],
[
"Masiero",
"Chiara",
""
],
[
"Tosato",
"Diego",
""
],
[
"Beghi",
"Alessandro",
""
],
[
"Susto",
"Gian Antonio",
""
]
] | Continual Learning aims to learn from a stream of tasks, being able to remember at the same time both new and old tasks. While many approaches were proposed for single-class classification, multi-label classification in the continual scenario remains a challenging problem. For the first time, we study multi-label class... |
2104.09426 | Takaaki Hori | Takaaki Hori, Niko Moritz, Chiori Hori, Jonathan Le Roux | Advanced Long-context End-to-end Speech Recognition Using
Context-expanded Transformers | Submitted to INTERSPEECH 2021 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses end-to-end automatic speech recognition (ASR) for long
audio recordings such as lecture and conversational speeches. Most end-to-end
ASR models are designed to recognize independent utterances, but contextual
information (e.g., speaker or topic) over multiple utterances is known to be
useful for ... | [
{
"created": "Mon, 19 Apr 2021 16:18:00 GMT",
"version": "v1"
}
] | 2021-04-20 | [
[
"Hori",
"Takaaki",
""
],
[
"Moritz",
"Niko",
""
],
[
"Hori",
"Chiori",
""
],
[
"Roux",
"Jonathan Le",
""
]
] | This paper addresses end-to-end automatic speech recognition (ASR) for long audio recordings such as lecture and conversational speeches. Most end-to-end ASR models are designed to recognize independent utterances, but contextual information (e.g., speaker or topic) over multiple utterances is known to be useful for AS... |
2208.00331 | Muhammad Abdullah Hanif | Muhammad Abdullah Hanif, Giuseppe Maria Sarda, Alberto Marchisio,
Guido Masera, Maurizio Martina, Muhammad Shafique | CoNLoCNN: Exploiting Correlation and Non-Uniform Quantization for
Energy-Efficient Low-precision Deep Convolutional Neural Networks | 8 pages, 15 figures, 2 tables | null | null | null | cs.AR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In today's era of smart cyber-physical systems, Deep Neural Networks (DNNs)
have become ubiquitous due to their state-of-the-art performance in complex
real-world applications. The high computational complexity of these networks,
which translates to increased energy consumption, is the foremost obstacle
towards deplo... | [
{
"created": "Sun, 31 Jul 2022 01:34:56 GMT",
"version": "v1"
}
] | 2022-08-02 | [
[
"Hanif",
"Muhammad Abdullah",
""
],
[
"Sarda",
"Giuseppe Maria",
""
],
[
"Marchisio",
"Alberto",
""
],
[
"Masera",
"Guido",
""
],
[
"Martina",
"Maurizio",
""
],
[
"Shafique",
"Muhammad",
""
]
] | In today's era of smart cyber-physical systems, Deep Neural Networks (DNNs) have become ubiquitous due to their state-of-the-art performance in complex real-world applications. The high computational complexity of these networks, which translates to increased energy consumption, is the foremost obstacle towards deployi... |
1210.0408 | Arpit Sharma | Arpit Sharma | A Two Step Perspective for Kripke Structure Reduction | Accepted for Student Research Forum, 39th International Conference on
Current Trends in Theory and Practice of Computer Science (SOFSEM 2013) | null | null | null | cs.FL cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel theoretical framework for the state space
reduction of Kripke structures. We define two equivalence relations, Kripke
minimization equivalence (KME) and weak Kripke minimization equivalence (WKME).
We define the quotient system under these relations and show that these
relations are strict... | [
{
"created": "Mon, 1 Oct 2012 14:06:21 GMT",
"version": "v1"
}
] | 2012-10-02 | [
[
"Sharma",
"Arpit",
""
]
] | This paper presents a novel theoretical framework for the state space reduction of Kripke structures. We define two equivalence relations, Kripke minimization equivalence (KME) and weak Kripke minimization equivalence (WKME). We define the quotient system under these relations and show that these relations are strictly... |
1301.2884 | Anh Cat Le Ngo | Anh Cat Le Ngo, Kenneth Li-Minn Ang, Jasmine Kah-Phooi Seng, Guoping
Qiu | Wavelet-based Scale Saliency | Partly published in ACIIDS 2013 - Kuala Lumpur Malaysia | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Both pixel-based scale saliency (PSS) and basis project methods focus on
multiscale analysis of data content and structure. Their theoretical relations
and practical combination are previously discussed. However, no models have
ever been proposed for calculating scale saliency on basis-projected
descriptors since the... | [
{
"created": "Mon, 14 Jan 2013 08:36:00 GMT",
"version": "v1"
}
] | 2013-01-15 | [
[
"Ngo",
"Anh Cat Le",
""
],
[
"Ang",
"Kenneth Li-Minn",
""
],
[
"Seng",
"Jasmine Kah-Phooi",
""
],
[
"Qiu",
"Guoping",
""
]
] | Both pixel-based scale saliency (PSS) and basis project methods focus on multiscale analysis of data content and structure. Their theoretical relations and practical combination are previously discussed. However, no models have ever been proposed for calculating scale saliency on basis-projected descriptors since then.... |
1201.3011 | Stephen G. Kobourov | Stephen G. Kobourov | Spring Embedders and Force Directed Graph Drawing Algorithms | 23 pages, 8 figures | null | null | null | cs.CG cs.DM cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Force-directed algorithms are among the most flexible methods for calculating
layouts of simple undirected graphs. Also known as spring embedders, such
algorithms calculate the layout of a graph using only information contained
within the structure of the graph itself, rather than relying on
domain-specific knowledge... | [
{
"created": "Sat, 14 Jan 2012 12:49:31 GMT",
"version": "v1"
}
] | 2012-01-17 | [
[
"Kobourov",
"Stephen G.",
""
]
] | Force-directed algorithms are among the most flexible methods for calculating layouts of simple undirected graphs. Also known as spring embedders, such algorithms calculate the layout of a graph using only information contained within the structure of the graph itself, rather than relying on domain-specific knowledge. ... |
2203.04450 | Yifei Ming | Yifei Ming, Yiyou Sun, Ousmane Dia, Yixuan Li | How to Exploit Hyperspherical Embeddings for Out-of-Distribution
Detection? | Published at ICLR 2023 | The Eleventh International Conference on Learning Representations,
2023 | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Out-of-distribution (OOD) detection is a critical task for reliable machine
learning. Recent advances in representation learning give rise to
distance-based OOD detection, where testing samples are detected as OOD if they
are relatively far away from the centroids or prototypes of in-distribution
(ID) classes. Howeve... | [
{
"created": "Tue, 8 Mar 2022 23:44:01 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Feb 2023 20:21:57 GMT",
"version": "v2"
},
{
"created": "Sat, 15 Apr 2023 07:25:57 GMT",
"version": "v3"
}
] | 2023-04-18 | [
[
"Ming",
"Yifei",
""
],
[
"Sun",
"Yiyou",
""
],
[
"Dia",
"Ousmane",
""
],
[
"Li",
"Yixuan",
""
]
] | Out-of-distribution (OOD) detection is a critical task for reliable machine learning. Recent advances in representation learning give rise to distance-based OOD detection, where testing samples are detected as OOD if they are relatively far away from the centroids or prototypes of in-distribution (ID) classes. However,... |
2212.02911 | Mika H\"am\"al\"ainen | Mika H\"am\"al\"ainen, Khalid Alnajjar, Thierry Poibeau | Modern French Poetry Generation with RoBERTa and GPT-2 | ICCC 2022 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We present a novel neural model for modern poetry generation in French. The
model consists of two pretrained neural models that are fine-tuned for the poem
generation task. The encoder of the model is a RoBERTa based one while the
decoder is based on GPT-2. This way the model can benefit from the superior
natural lan... | [
{
"created": "Tue, 6 Dec 2022 12:10:14 GMT",
"version": "v1"
}
] | 2022-12-07 | [
[
"Hämäläinen",
"Mika",
""
],
[
"Alnajjar",
"Khalid",
""
],
[
"Poibeau",
"Thierry",
""
]
] | We present a novel neural model for modern poetry generation in French. The model consists of two pretrained neural models that are fine-tuned for the poem generation task. The encoder of the model is a RoBERTa based one while the decoder is based on GPT-2. This way the model can benefit from the superior natural langu... |
2107.04091 | Grzegorz Dudek | Grzegorz Dudek and Pawe{\l} Pe{\l}ka | Ensembles of Randomized NNs for Pattern-based Time Series Forecasting | arXiv admin note: text overlap with arXiv:2107.01705 | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | In this work, we propose an ensemble forecasting approach based on randomized
neural networks. Improved randomized learning streamlines the fitting abilities
of individual learners by generating network parameters in accordance with the
data and target function features. A pattern-based representation of time
series ... | [
{
"created": "Thu, 8 Jul 2021 20:13:50 GMT",
"version": "v1"
}
] | 2021-07-12 | [
[
"Dudek",
"Grzegorz",
""
],
[
"Pełka",
"Paweł",
""
]
] | In this work, we propose an ensemble forecasting approach based on randomized neural networks. Improved randomized learning streamlines the fitting abilities of individual learners by generating network parameters in accordance with the data and target function features. A pattern-based representation of time series ma... |
2406.01323 | Aurora Zhang | Aurora Zhang, Annette Hosoi | Structural Interventions and the Dynamics of Inequality | null | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Recent conversations in the algorithmic fairness literature have raised
several concerns with standard conceptions of fairness. First, constraining
predictive algorithms to satisfy fairness benchmarks may lead to non-optimal
outcomes for disadvantaged groups. Second, technical interventions are often
ineffective by t... | [
{
"created": "Mon, 3 Jun 2024 13:44:38 GMT",
"version": "v1"
}
] | 2024-06-04 | [
[
"Zhang",
"Aurora",
""
],
[
"Hosoi",
"Annette",
""
]
] | Recent conversations in the algorithmic fairness literature have raised several concerns with standard conceptions of fairness. First, constraining predictive algorithms to satisfy fairness benchmarks may lead to non-optimal outcomes for disadvantaged groups. Second, technical interventions are often ineffective by the... |
1804.06426 | Philipp Mayr | Zeljko Carevic, Sascha Sch\"uller, Philipp Mayr, Norbert Fuhr | Contextualised Browsing in a Digital Library's Living Lab | 10 pages, 2 figures, paper accepted at JCDL 2018 | null | 10.1145/3197026.3197054 | null | cs.IR cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Contextualisation has proven to be effective in tailoring \linebreak search
results towards the users' information need. While this is true for a basic
query search, the usage of contextual session information during exploratory
search especially on the level of browsing has so far been underexposed in
research. In t... | [
{
"created": "Tue, 17 Apr 2018 18:30:29 GMT",
"version": "v1"
}
] | 2018-12-10 | [
[
"Carevic",
"Zeljko",
""
],
[
"Schüller",
"Sascha",
""
],
[
"Mayr",
"Philipp",
""
],
[
"Fuhr",
"Norbert",
""
]
] | Contextualisation has proven to be effective in tailoring \linebreak search results towards the users' information need. While this is true for a basic query search, the usage of contextual session information during exploratory search especially on the level of browsing has so far been underexposed in research. In thi... |
2307.03723 | Alex Milne | Alex Milne, Xianghua Xie | Steel Surface Roughness Parameter Calculations Using Lasers and Machine
Learning Models | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Control of surface texture in strip steel is essential to meet customer
requirements during galvanizing and temper rolling processes. Traditional
methods rely on post-production stylus measurements, while on-line techniques
offer non-contact and real-time measurements of the entire strip. However,
ensuring accurate m... | [
{
"created": "Thu, 6 Jul 2023 16:44:03 GMT",
"version": "v1"
},
{
"created": "Sun, 1 Oct 2023 11:21:37 GMT",
"version": "v2"
}
] | 2023-10-03 | [
[
"Milne",
"Alex",
""
],
[
"Xie",
"Xianghua",
""
]
] | Control of surface texture in strip steel is essential to meet customer requirements during galvanizing and temper rolling processes. Traditional methods rely on post-production stylus measurements, while on-line techniques offer non-contact and real-time measurements of the entire strip. However, ensuring accurate mea... |
0809.3942 | Philippe Hoogvorst | Philippe Hoogvorst, Sylvain Guilley, Sumanta Chaudhuri, Jean-Luc
Danger, Taha Beyrouthy and Laurent Fesquet | A Reconfigurable Programmable Logic Block for a Multi-Style Asynchronous
FPGA resistant to Side-Channel Attacks | 29 pages | null | null | null | cs.CR cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Side-channel attacks are efficient attacks against cryptographic devices.
They use only quantities observable from outside, such as the duration and the
power consumption. Attacks against synchronous devices using electric
observations are facilitated by the fact that all transitions occur
simultaneously with some gl... | [
{
"created": "Tue, 23 Sep 2008 15:27:06 GMT",
"version": "v1"
}
] | 2008-09-24 | [
[
"Hoogvorst",
"Philippe",
""
],
[
"Guilley",
"Sylvain",
""
],
[
"Chaudhuri",
"Sumanta",
""
],
[
"Danger",
"Jean-Luc",
""
],
[
"Beyrouthy",
"Taha",
""
],
[
"Fesquet",
"Laurent",
""
]
] | Side-channel attacks are efficient attacks against cryptographic devices. They use only quantities observable from outside, such as the duration and the power consumption. Attacks against synchronous devices using electric observations are facilitated by the fact that all transitions occur simultaneously with some glob... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.