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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1702.02471 | Adrien Bizeray | Adrien M. Bizeray, Jin-Ho Kim, Stephen R. Duncan and David A. Howey | Identifiability and parameter estimation of the single particle
lithium-ion battery model | 16 pages, 9 figures, pre-print submitted to the IEEE Transactions on
Control Systems Technology | null | 10.1109/TCST.2018.2838097 | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates the identifiability and estimation of the parameters
of the single particle model (SPM) for lithium-ion battery simulation.
Identifiability is addressed both in principle and in practice. The approach
begins by grouping parameters and partially non-dimensionalising the SPM to
determine the max... | [
{
"created": "Wed, 8 Feb 2017 15:28:15 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Jan 2018 17:33:05 GMT",
"version": "v2"
}
] | 2018-10-03 | [
[
"Bizeray",
"Adrien M.",
""
],
[
"Kim",
"Jin-Ho",
""
],
[
"Duncan",
"Stephen R.",
""
],
[
"Howey",
"David A.",
""
]
] | This paper investigates the identifiability and estimation of the parameters of the single particle model (SPM) for lithium-ion battery simulation. Identifiability is addressed both in principle and in practice. The approach begins by grouping parameters and partially non-dimensionalising the SPM to determine the maxim... |
2403.12976 | Vincenzo Barbuto | Vincenzo Barbuto, Claudio Savaglio, Roberto Minerva, Noel Crespi,
Giancarlo Fortino | Towards an Edge Intelligence-Based Traffic Monitoring System | null | null | 10.1109/SMC53992.2023.10393907 | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | Cities have undergone significant changes due to the rapid increase in urban
population, heightened demand for resources, and growing concerns over climate
change. To address these challenges, digital transformation has become a
necessity. Recent advancements in Artificial Intelligence (AI) and sensing
techniques, su... | [
{
"created": "Mon, 5 Feb 2024 17:08:18 GMT",
"version": "v1"
}
] | 2024-03-21 | [
[
"Barbuto",
"Vincenzo",
""
],
[
"Savaglio",
"Claudio",
""
],
[
"Minerva",
"Roberto",
""
],
[
"Crespi",
"Noel",
""
],
[
"Fortino",
"Giancarlo",
""
]
] | Cities have undergone significant changes due to the rapid increase in urban population, heightened demand for resources, and growing concerns over climate change. To address these challenges, digital transformation has become a necessity. Recent advancements in Artificial Intelligence (AI) and sensing techniques, such... |
2404.14248 | Zongwei Wu | Xiaoning Liu, Zongwei Wu, Ao Li, Florin-Alexandru Vasluianu, Yulun
Zhang, Shuhang Gu, Le Zhang, Ce Zhu, Radu Timofte, Zhi Jin, Hongjun Wu,
Chenxi Wang, Haitao Ling, Yuanhao Cai, Hao Bian, Yuxin Zheng, Jing Lin, Alan
Yuille, Ben Shao, Jin Guo, Tianli Liu, Mohao Wu, Yixu Feng, Shuo Hou, Haotian
Lin, Yu Zhu, Peng ... | NTIRE 2024 Challenge on Low Light Image Enhancement: Methods and Results | NTIRE 2024 Challenge Report | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This paper reviews the NTIRE 2024 low light image enhancement challenge,
highlighting the proposed solutions and results. The aim of this challenge is
to discover an effective network design or solution capable of generating
brighter, clearer, and visually appealing results when dealing with a variety
of conditions, ... | [
{
"created": "Mon, 22 Apr 2024 15:01:12 GMT",
"version": "v1"
}
] | 2024-04-23 | [
[
"Liu",
"Xiaoning",
""
],
[
"Wu",
"Zongwei",
""
],
[
"Li",
"Ao",
""
],
[
"Vasluianu",
"Florin-Alexandru",
""
],
[
"Zhang",
"Yulun",
""
],
[
"Gu",
"Shuhang",
""
],
[
"Zhang",
"Le",
""
],
[
"Zhu",
... | This paper reviews the NTIRE 2024 low light image enhancement challenge, highlighting the proposed solutions and results. The aim of this challenge is to discover an effective network design or solution capable of generating brighter, clearer, and visually appealing results when dealing with a variety of conditions, in... |
1702.01394 | Jeffrey Shallit | J\"org Endrullis, Jeffrey Shallit, Tim Smith | Undecidability and Finite Automata | null | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Using a novel rewriting problem, we show that several natural decision
problems about finite automata are undecidable (i.e., recursively unsolvable).
In contrast, we also prove three related problems are decidable. We apply one
result to prove the undecidability of a related problem about k-automatic sets
of rational... | [
{
"created": "Sun, 5 Feb 2017 12:37:36 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Feb 2017 20:47:33 GMT",
"version": "v2"
}
] | 2017-03-01 | [
[
"Endrullis",
"Jörg",
""
],
[
"Shallit",
"Jeffrey",
""
],
[
"Smith",
"Tim",
""
]
] | Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to prove the undecidability of a related problem about k-automatic sets of rational n... |
1009.0072 | Wei Yang | Wei Yang, Lihua Li, Gang Wu, and Haifeng Wang | Joint Relay Selection and Link Adaptation for Distributed Beamforming in
Regenerative Cooperative Networks | Accepted by 2010 International Symposium on Information Theory and
its Applications (ISITA) | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Relay selection enhances the performance of the cooperative networks by
selecting the links with higher capacity. Meanwhile link adaptation improves
the spectral efficiency of wireless data-centric networks through adapting the
modulation and coding schemes (MCS) to the current link condition. In this
paper, relay se... | [
{
"created": "Wed, 1 Sep 2010 02:02:32 GMT",
"version": "v1"
}
] | 2010-09-02 | [
[
"Yang",
"Wei",
""
],
[
"Li",
"Lihua",
""
],
[
"Wu",
"Gang",
""
],
[
"Wang",
"Haifeng",
""
]
] | Relay selection enhances the performance of the cooperative networks by selecting the links with higher capacity. Meanwhile link adaptation improves the spectral efficiency of wireless data-centric networks through adapting the modulation and coding schemes (MCS) to the current link condition. In this paper, relay sele... |
2310.07393 | Matteo El Hariry | Matteo El-Hariry, Antoine Richard, Miguel Olivares-Mendez | RANS: Highly-Parallelised Simulator for Reinforcement Learning based
Autonomous Navigating Spacecrafts | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nowadays, realistic simulation environments are essential to validate and
build reliable robotic solutions. This is particularly true when using
Reinforcement Learning (RL) based control policies. To this end, both robotics
and RL developers need tools and workflows to create physically accurate
simulations and synth... | [
{
"created": "Wed, 11 Oct 2023 11:21:45 GMT",
"version": "v1"
}
] | 2023-10-12 | [
[
"El-Hariry",
"Matteo",
""
],
[
"Richard",
"Antoine",
""
],
[
"Olivares-Mendez",
"Miguel",
""
]
] | Nowadays, realistic simulation environments are essential to validate and build reliable robotic solutions. This is particularly true when using Reinforcement Learning (RL) based control policies. To this end, both robotics and RL developers need tools and workflows to create physically accurate simulations and synthet... |
2303.15012 | Senmao Li | Senmao Li, Joost van de Weijer, Yaxing Wang, Fahad Shahbaz Khan,
Meiqin Liu, Jian Yang | 3D-Aware Multi-Class Image-to-Image Translation with NeRFs | Accepted by CVPR2023 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in 3D-aware generative models (3D-aware GANs) combined with
Neural Radiance Fields (NeRF) have achieved impressive results. However no
prior works investigate 3D-aware GANs for 3D consistent multi-class
image-to-image (3D-aware I2I) translation. Naively using 2D-I2I translation
methods suffers from un... | [
{
"created": "Mon, 27 Mar 2023 08:54:51 GMT",
"version": "v1"
}
] | 2023-03-28 | [
[
"Li",
"Senmao",
""
],
[
"van de Weijer",
"Joost",
""
],
[
"Wang",
"Yaxing",
""
],
[
"Khan",
"Fahad Shahbaz",
""
],
[
"Liu",
"Meiqin",
""
],
[
"Yang",
"Jian",
""
]
] | Recent advances in 3D-aware generative models (3D-aware GANs) combined with Neural Radiance Fields (NeRF) have achieved impressive results. However no prior works investigate 3D-aware GANs for 3D consistent multi-class image-to-image (3D-aware I2I) translation. Naively using 2D-I2I translation methods suffers from unre... |
1102.1265 | Joakim Jalden | Joakim Jalden and Petros Elia | Sphere decoding complexity exponent for decoding full rate codes over
the quasi-static MIMO channel | 19 Pages, 4 figures. Submitted to the IEEE Transactions on
Information Theory | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the setting of quasi-static multiple-input multiple-output (MIMO)
channels, we consider the high signal-to-noise ratio (SNR) asymptotic
complexity required by the sphere decoding (SD) algorithm for decoding a large
class of full rate linear space-time codes. With SD complexity having random
fluctuations induced by... | [
{
"created": "Mon, 7 Feb 2011 10:24:09 GMT",
"version": "v1"
}
] | 2011-02-08 | [
[
"Jalden",
"Joakim",
""
],
[
"Elia",
"Petros",
""
]
] | In the setting of quasi-static multiple-input multiple-output (MIMO) channels, we consider the high signal-to-noise ratio (SNR) asymptotic complexity required by the sphere decoding (SD) algorithm for decoding a large class of full rate linear space-time codes. With SD complexity having random fluctuations induced by t... |
1806.04346 | Ruidan He | Ruidan He and Wee Sun Lee and Hwee Tou Ng and Daniel Dahlmeier | Exploiting Document Knowledge for Aspect-level Sentiment Classification | Accepted to ACL 2018 (short paper) | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Attention-based long short-term memory (LSTM) networks have proven to be
useful in aspect-level sentiment classification. However, due to the
difficulties in annotating aspect-level data, existing public datasets for this
task are all relatively small, which largely limits the effectiveness of those
neural models. In... | [
{
"created": "Tue, 12 Jun 2018 06:04:11 GMT",
"version": "v1"
}
] | 2018-06-13 | [
[
"He",
"Ruidan",
""
],
[
"Lee",
"Wee Sun",
""
],
[
"Ng",
"Hwee Tou",
""
],
[
"Dahlmeier",
"Daniel",
""
]
] | Attention-based long short-term memory (LSTM) networks have proven to be useful in aspect-level sentiment classification. However, due to the difficulties in annotating aspect-level data, existing public datasets for this task are all relatively small, which largely limits the effectiveness of those neural models. In t... |
2006.02163 | Xuan Phi Nguyen | Xuan-Phi Nguyen, Shafiq Joty, Thanh-Tung Nguyen, Wu Kui, Ai Ti Aw | Cross-model Back-translated Distillation for Unsupervised Machine
Translation | Accepted to a conference paper at ICML 2021 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent unsupervised machine translation (UMT) systems usually employ three
main principles: initialization, language modeling and iterative
back-translation, though they may apply them differently. Crucially, iterative
back-translation and denoising auto-encoding for language modeling provide data
diversity to train ... | [
{
"created": "Wed, 3 Jun 2020 10:57:21 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Oct 2020 14:07:14 GMT",
"version": "v2"
},
{
"created": "Sat, 6 Feb 2021 18:02:41 GMT",
"version": "v3"
},
{
"created": "Mon, 24 May 2021 16:07:26 GMT",
"version": "v4"
}
] | 2021-05-25 | [
[
"Nguyen",
"Xuan-Phi",
""
],
[
"Joty",
"Shafiq",
""
],
[
"Nguyen",
"Thanh-Tung",
""
],
[
"Kui",
"Wu",
""
],
[
"Aw",
"Ai Ti",
""
]
] | Recent unsupervised machine translation (UMT) systems usually employ three main principles: initialization, language modeling and iterative back-translation, though they may apply them differently. Crucially, iterative back-translation and denoising auto-encoding for language modeling provide data diversity to train th... |
1912.11194 | Qi Qi | Qi Qi, Yan Yan, Xiaoyu Wang, Tianbao Yang | A Simple and Effective Framework for Pairwise Deep Metric Learning | 16 pages, 5 figures | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep metric learning (DML) has received much attention in deep learning due
to its wide applications in computer vision. Previous studies have focused on
designing complicated losses and hard example mining methods, which are mostly
heuristic and lack of theoretical understanding. In this paper, we cast DML as
a simp... | [
{
"created": "Tue, 24 Dec 2019 03:47:25 GMT",
"version": "v1"
},
{
"created": "Sat, 11 Jan 2020 15:58:11 GMT",
"version": "v2"
},
{
"created": "Thu, 18 Jun 2020 15:44:21 GMT",
"version": "v3"
}
] | 2020-06-19 | [
[
"Qi",
"Qi",
""
],
[
"Yan",
"Yan",
""
],
[
"Wang",
"Xiaoyu",
""
],
[
"Yang",
"Tianbao",
""
]
] | Deep metric learning (DML) has received much attention in deep learning due to its wide applications in computer vision. Previous studies have focused on designing complicated losses and hard example mining methods, which are mostly heuristic and lack of theoretical understanding. In this paper, we cast DML as a simple... |
2003.08951 | Yuya Obinata | Yuya Obinata and Takuma Yamamoto | Temporal Extension Module for Skeleton-Based Action Recognition | Accepted on ICPR2020, 7 pages, 4 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a module that extends the temporal graph of a graph convolutional
network (GCN) for action recognition with a sequence of skeletons. Existing
methods attempt to represent a more appropriate spatial graph on an
intra-frame, but disregard optimization of the temporal graph on the
interframe. Concretely, thes... | [
{
"created": "Thu, 19 Mar 2020 18:00:04 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Oct 2020 02:39:04 GMT",
"version": "v2"
}
] | 2020-10-20 | [
[
"Obinata",
"Yuya",
""
],
[
"Yamamoto",
"Takuma",
""
]
] | We present a module that extends the temporal graph of a graph convolutional network (GCN) for action recognition with a sequence of skeletons. Existing methods attempt to represent a more appropriate spatial graph on an intra-frame, but disregard optimization of the temporal graph on the interframe. Concretely, these ... |
2402.18419 | Shubham Vatsal | Shubham Vatsal, Ayush Singh and Shabnam Tafreshi | Can GPT Improve the State of Prior Authorization via Guideline Based
Automated Question Answering? | null | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Health insurance companies have a defined process called prior authorization
(PA) which is a health plan cost-control process that requires doctors and
other healthcare professionals to get clearance in advance from a health plan
before performing a particular procedure on a patient in order to be eligible
for paymen... | [
{
"created": "Wed, 28 Feb 2024 15:39:53 GMT",
"version": "v1"
}
] | 2024-02-29 | [
[
"Vatsal",
"Shubham",
""
],
[
"Singh",
"Ayush",
""
],
[
"Tafreshi",
"Shabnam",
""
]
] | Health insurance companies have a defined process called prior authorization (PA) which is a health plan cost-control process that requires doctors and other healthcare professionals to get clearance in advance from a health plan before performing a particular procedure on a patient in order to be eligible for payment ... |
1803.02101 | Frank Meyer | Wissam Siblini and Frank Meyer and Pascale Kuntz | VIPE: A new interactive classification framework for large sets of short
texts - application to opinion mining | 8 pages | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a new interactive opinion mining tool that helps users to
classify large sets of short texts originated from Web opinion polls, technical
forums or Twitter. From a manual multi-label pre-classification of a very
limited text subset, a learning algorithm predicts the labels of the remaining
texts o... | [
{
"created": "Tue, 6 Mar 2018 10:45:27 GMT",
"version": "v1"
}
] | 2018-03-07 | [
[
"Siblini",
"Wissam",
""
],
[
"Meyer",
"Frank",
""
],
[
"Kuntz",
"Pascale",
""
]
] | This paper presents a new interactive opinion mining tool that helps users to classify large sets of short texts originated from Web opinion polls, technical forums or Twitter. From a manual multi-label pre-classification of a very limited text subset, a learning algorithm predicts the labels of the remaining texts of ... |
2108.08987 | Cl\'ement Canonne | Cl\'ement L. Canonne and Hongyi Lyu | Uniformity Testing in the Shuffle Model: Simpler, Better, Faster | Accepted to the SIAM Symposium on Simplicity in Algorithms (SOSA
2022). Added some details and discussions | null | null | null | cs.DS cs.CR cs.DM stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Uniformity testing, or testing whether independent observations are uniformly
distributed, is the prototypical question in distribution testing. Over the
past years, a line of work has been focusing on uniformity testing under
privacy constraints on the data, and obtained private and data-efficient
algorithms under v... | [
{
"created": "Fri, 20 Aug 2021 03:43:12 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Oct 2021 08:20:42 GMT",
"version": "v2"
}
] | 2021-10-19 | [
[
"Canonne",
"Clément L.",
""
],
[
"Lyu",
"Hongyi",
""
]
] | Uniformity testing, or testing whether independent observations are uniformly distributed, is the prototypical question in distribution testing. Over the past years, a line of work has been focusing on uniformity testing under privacy constraints on the data, and obtained private and data-efficient algorithms under var... |
2406.05631 | Sana Ayromlou | Sana Ayromlou, Teresa Tsang, Purang Abolmaesumi, Xiaoxiao Li | CCSI: Continual Class-Specific Impression for Data-free Class
Incremental Learning | null | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | In real-world clinical settings, traditional deep learning-based
classification methods struggle with diagnosing newly introduced disease types
because they require samples from all disease classes for offline training.
Class incremental learning offers a promising solution by adapting a deep
network trained on speci... | [
{
"created": "Sun, 9 Jun 2024 03:52:21 GMT",
"version": "v1"
}
] | 2024-06-11 | [
[
"Ayromlou",
"Sana",
""
],
[
"Tsang",
"Teresa",
""
],
[
"Abolmaesumi",
"Purang",
""
],
[
"Li",
"Xiaoxiao",
""
]
] | In real-world clinical settings, traditional deep learning-based classification methods struggle with diagnosing newly introduced disease types because they require samples from all disease classes for offline training. Class incremental learning offers a promising solution by adapting a deep network trained on specifi... |
2012.00267 | Hongyang Du | Hongyang Du, Jiayi Zhang, Ke Guan, Dusit Niyato, Huiying Jiao, Zhiqin
Wang, and Thomas K\"urner | Performance and Optimization of Reconfigurable Intelligent Surface Aided
THz Communications | null | null | null | null | cs.IT eess.SP math.IT | http://creativecommons.org/licenses/by/4.0/ | TeraHertz (THz) communications can satisfy the high data rate demand with
massive bandwidth. However, severe path attenuation and hardware imperfection
greatly alleviate its performance. Therefore, we utilize the reconfigurable
intelligent surface (RIS) technology and investigate the RIS-aided THz
communications. We ... | [
{
"created": "Tue, 1 Dec 2020 05:00:38 GMT",
"version": "v1"
},
{
"created": "Sun, 20 Mar 2022 08:43:14 GMT",
"version": "v2"
}
] | 2022-03-22 | [
[
"Du",
"Hongyang",
""
],
[
"Zhang",
"Jiayi",
""
],
[
"Guan",
"Ke",
""
],
[
"Niyato",
"Dusit",
""
],
[
"Jiao",
"Huiying",
""
],
[
"Wang",
"Zhiqin",
""
],
[
"Kürner",
"Thomas",
""
]
] | TeraHertz (THz) communications can satisfy the high data rate demand with massive bandwidth. However, severe path attenuation and hardware imperfection greatly alleviate its performance. Therefore, we utilize the reconfigurable intelligent surface (RIS) technology and investigate the RIS-aided THz communications. We fi... |
2405.08200 | Rolando Garcia | Rolando Garcia | Interactive Lab Notebooks for Robotics Researchers | null | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Interactive notebooks, such as Jupyter, have revolutionized the field of data
science by providing an integrated environment for data, code, and
documentation. However, their adoption by robotics researchers and model
developers has been limited. This study investigates the logging and
record-keeping practices of rob... | [
{
"created": "Mon, 13 May 2024 21:33:58 GMT",
"version": "v1"
}
] | 2024-05-15 | [
[
"Garcia",
"Rolando",
""
]
] | Interactive notebooks, such as Jupyter, have revolutionized the field of data science by providing an integrated environment for data, code, and documentation. However, their adoption by robotics researchers and model developers has been limited. This study investigates the logging and record-keeping practices of robot... |
2310.18615 | Xiangchen Song | Xiangchen Song, Weiran Yao, Yewen Fan, Xinshuai Dong, Guangyi Chen,
Juan Carlos Niebles, Eric Xing, Kun Zhang | Temporally Disentangled Representation Learning under Unknown
Nonstationarity | NeurIPS 2023. arXiv admin note: text overlap with arXiv:2210.13647 | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | In unsupervised causal representation learning for sequential data with
time-delayed latent causal influences, strong identifiability results for the
disentanglement of causally-related latent variables have been established in
stationary settings by leveraging temporal structure. However, in nonstationary
setting, e... | [
{
"created": "Sat, 28 Oct 2023 06:46:03 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Aug 2024 09:43:57 GMT",
"version": "v2"
}
] | 2024-08-02 | [
[
"Song",
"Xiangchen",
""
],
[
"Yao",
"Weiran",
""
],
[
"Fan",
"Yewen",
""
],
[
"Dong",
"Xinshuai",
""
],
[
"Chen",
"Guangyi",
""
],
[
"Niebles",
"Juan Carlos",
""
],
[
"Xing",
"Eric",
""
],
[
"Zhang"... | In unsupervised causal representation learning for sequential data with time-delayed latent causal influences, strong identifiability results for the disentanglement of causally-related latent variables have been established in stationary settings by leveraging temporal structure. However, in nonstationary setting, exi... |
1312.7793 | Zhao Tan | Zhao Tan, Yonina C. Eldar, Arye Nehorai | Direction of Arrival Estimation Using Co-prime Arrays: A Super
Resolution Viewpoint | Submitted on December 17th, 2013 | null | 10.1109/TSP.2014.2354316 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of direction of arrival (DOA) estimation using a
newly proposed structure of non-uniform linear arrays, referred to as co-prime
arrays, in this paper. By exploiting the second order statistical information
of the received signals, co-prime arrays exhibit O(MN) degrees of freedom with
only M + ... | [
{
"created": "Mon, 30 Dec 2013 17:42:58 GMT",
"version": "v1"
}
] | 2015-06-18 | [
[
"Tan",
"Zhao",
""
],
[
"Eldar",
"Yonina C.",
""
],
[
"Nehorai",
"Arye",
""
]
] | We consider the problem of direction of arrival (DOA) estimation using a newly proposed structure of non-uniform linear arrays, referred to as co-prime arrays, in this paper. By exploiting the second order statistical information of the received signals, co-prime arrays exhibit O(MN) degrees of freedom with only M + N ... |
2305.06732 | Eleonore Bach | Eleonore Bach, Friedrich Eisenbrand, Rom Pinchasi | Integer points in the degree-sequence polytope | 14 pages | null | null | null | cs.DM | http://creativecommons.org/licenses/by-sa/4.0/ | An integer vector $b \in \mathbb{Z}^d$ is a degree sequence if there exists a
hypergraph with vertices $\{1,\dots,d\}$ such that each $b_i$ is the number of
hyperedges containing $i$. The degree-sequence polytope $\mathscr{Z}^d$ is the
convex hull of all degree sequences. We show that all but a $2^{-\Omega(d)}$
fract... | [
{
"created": "Thu, 11 May 2023 11:20:40 GMT",
"version": "v1"
}
] | 2023-05-12 | [
[
"Bach",
"Eleonore",
""
],
[
"Eisenbrand",
"Friedrich",
""
],
[
"Pinchasi",
"Rom",
""
]
] | An integer vector $b \in \mathbb{Z}^d$ is a degree sequence if there exists a hypergraph with vertices $\{1,\dots,d\}$ such that each $b_i$ is the number of hyperedges containing $i$. The degree-sequence polytope $\mathscr{Z}^d$ is the convex hull of all degree sequences. We show that all but a $2^{-\Omega(d)}$ fractio... |
1602.07720 | Renato Paes Leme | Renato Paes Leme, Martin Pal, Sergei Vassilvitskii | A Field Guide to Personalized Reserve Prices | Accepted to WWW'16 | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the question of setting and testing reserve prices in single item
auctions when the bidders are not identical. At a high level, there are two
generalizations of the standard second price auction: in the lazy version we
first determine the winner, and then apply reserve prices; in the eager version
we first d... | [
{
"created": "Wed, 24 Feb 2016 21:39:17 GMT",
"version": "v1"
}
] | 2016-02-26 | [
[
"Leme",
"Renato Paes",
""
],
[
"Pal",
"Martin",
""
],
[
"Vassilvitskii",
"Sergei",
""
]
] | We study the question of setting and testing reserve prices in single item auctions when the bidders are not identical. At a high level, there are two generalizations of the standard second price auction: in the lazy version we first determine the winner, and then apply reserve prices; in the eager version we first dis... |
1906.09029 | Vincenzo Matta | Augusto Santos, Vincenzo Matta, and Ali H. Sayed | Topology Inference over Networks with Nonlinear Coupling | Submitted for publication | null | null | null | cs.MA cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work examines the problem of topology inference over discrete-time
nonlinear stochastic networked dynamical systems. The goal is to recover the
underlying digraph linking the network agents, from observations of their
state-evolution. The dynamical law governing the state-evolution of the
interacting agents migh... | [
{
"created": "Fri, 21 Jun 2019 09:44:29 GMT",
"version": "v1"
}
] | 2019-06-24 | [
[
"Santos",
"Augusto",
""
],
[
"Matta",
"Vincenzo",
""
],
[
"Sayed",
"Ali H.",
""
]
] | This work examines the problem of topology inference over discrete-time nonlinear stochastic networked dynamical systems. The goal is to recover the underlying digraph linking the network agents, from observations of their state-evolution. The dynamical law governing the state-evolution of the interacting agents might ... |
2201.06539 | Keuntaek Lee | Keuntaek Lee, David Isele, Evangelos A. Theodorou, Sangjae Bae | Spatiotemporal Costmap Inference for MPC via Deep Inverse Reinforcement
Learning | IEEE Robotics and Automation Letters (RA-L) | null | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | It can be difficult to autonomously produce driver behavior so that it
appears natural to other traffic participants. Through Inverse Reinforcement
Learning (IRL), we can automate this process by learning the underlying reward
function from human demonstrations. We propose a new IRL algorithm that learns
a goal-condi... | [
{
"created": "Mon, 17 Jan 2022 17:36:29 GMT",
"version": "v1"
}
] | 2022-01-19 | [
[
"Lee",
"Keuntaek",
""
],
[
"Isele",
"David",
""
],
[
"Theodorou",
"Evangelos A.",
""
],
[
"Bae",
"Sangjae",
""
]
] | It can be difficult to autonomously produce driver behavior so that it appears natural to other traffic participants. Through Inverse Reinforcement Learning (IRL), we can automate this process by learning the underlying reward function from human demonstrations. We propose a new IRL algorithm that learns a goal-conditi... |
1903.06473 | Zerong Zheng | Zerong Zheng, Tao Yu, Yixuan Wei, Qionghai Dai, Yebin Liu | DeepHuman: 3D Human Reconstruction from a Single Image | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose DeepHuman, an image-guided volume-to-volume translation CNN for 3D
human reconstruction from a single RGB image. To reduce the ambiguities
associated with the surface geometry reconstruction, even for the
reconstruction of invisible areas, we propose and leverage a dense semantic
representation generated f... | [
{
"created": "Fri, 15 Mar 2019 11:38:15 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Mar 2019 05:44:21 GMT",
"version": "v2"
}
] | 2019-03-29 | [
[
"Zheng",
"Zerong",
""
],
[
"Yu",
"Tao",
""
],
[
"Wei",
"Yixuan",
""
],
[
"Dai",
"Qionghai",
""
],
[
"Liu",
"Yebin",
""
]
] | We propose DeepHuman, an image-guided volume-to-volume translation CNN for 3D human reconstruction from a single RGB image. To reduce the ambiguities associated with the surface geometry reconstruction, even for the reconstruction of invisible areas, we propose and leverage a dense semantic representation generated fro... |
2404.18721 | Shreya Santra | Shreya Santra, Kentaro Uno, Gen Kudo, and Kazuya Yoshida | Risk-Aware Coverage Path Planning for Lunar Micro-Rovers Leveraging
Global and Local Environmental Data | 6 pages, 11 figures. Manuscript accepted at the IEEE International
Conference on Space Robotics 2024 | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This paper presents a novel 3D myopic coverage path planning algorithm for
lunar micro-rovers that can explore unknown environments with limited sensing
and computational capabilities. The algorithm expands upon traditional
non-graph path planning methods to accommodate the complexities of lunar
terrain, utilizing gl... | [
{
"created": "Mon, 29 Apr 2024 14:10:13 GMT",
"version": "v1"
}
] | 2024-04-30 | [
[
"Santra",
"Shreya",
""
],
[
"Uno",
"Kentaro",
""
],
[
"Kudo",
"Gen",
""
],
[
"Yoshida",
"Kazuya",
""
]
] | This paper presents a novel 3D myopic coverage path planning algorithm for lunar micro-rovers that can explore unknown environments with limited sensing and computational capabilities. The algorithm expands upon traditional non-graph path planning methods to accommodate the complexities of lunar terrain, utilizing glob... |
1610.03738 | Daniel Wesierski | Daniel Wesierski | Exploring the Entire Regularization Path for the Asymmetric Cost Linear
Support Vector Machine | 8 pages, 2 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an algorithm for exploring the entire regularization path of
asymmetric-cost linear support vector machines. Empirical evidence suggests the
predictive power of support vector machines depends on the regularization
parameters of the training algorithms. The algorithms exploring the entire
regularization pa... | [
{
"created": "Wed, 12 Oct 2016 14:57:10 GMT",
"version": "v1"
}
] | 2016-10-13 | [
[
"Wesierski",
"Daniel",
""
]
] | We propose an algorithm for exploring the entire regularization path of asymmetric-cost linear support vector machines. Empirical evidence suggests the predictive power of support vector machines depends on the regularization parameters of the training algorithms. The algorithms exploring the entire regularization path... |
1504.05451 | Jing Yang | Qingshan Liu, Jing Yang, Kaihua Zhang, Yi Wu | Adaptive Compressive Tracking via Online Vector Boosting Feature
Selection | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, the compressive tracking (CT) method has attracted much attention
due to its high efficiency, but it cannot well deal with the large scale target
appearance variations due to its data-independent random projection matrix that
results in less discriminative features. To address this issue, in this paper
we p... | [
{
"created": "Tue, 21 Apr 2015 14:55:07 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Apr 2015 01:27:08 GMT",
"version": "v2"
}
] | 2015-04-23 | [
[
"Liu",
"Qingshan",
""
],
[
"Yang",
"Jing",
""
],
[
"Zhang",
"Kaihua",
""
],
[
"Wu",
"Yi",
""
]
] | Recently, the compressive tracking (CT) method has attracted much attention due to its high efficiency, but it cannot well deal with the large scale target appearance variations due to its data-independent random projection matrix that results in less discriminative features. To address this issue, in this paper we pro... |
2111.04310 | Byeongjun Park | Byeongjun Park, Taekyung Kim, Hyojun Go, Changick Kim | Residual-Guided Learning Representation for Self-Supervised Monocular
Depth Estimation | 5 pages, 2 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Photometric consistency loss is one of the representative objective functions
commonly used for self-supervised monocular depth estimation. However, this
loss often causes unstable depth predictions in textureless or occluded regions
due to incorrect guidance. Recent self-supervised learning approaches tackle
this is... | [
{
"created": "Mon, 8 Nov 2021 07:44:31 GMT",
"version": "v1"
}
] | 2021-11-09 | [
[
"Park",
"Byeongjun",
""
],
[
"Kim",
"Taekyung",
""
],
[
"Go",
"Hyojun",
""
],
[
"Kim",
"Changick",
""
]
] | Photometric consistency loss is one of the representative objective functions commonly used for self-supervised monocular depth estimation. However, this loss often causes unstable depth predictions in textureless or occluded regions due to incorrect guidance. Recent self-supervised learning approaches tackle this issu... |
1912.12467 | Alcardo Alex Barakabitze | Alcardo Alex Barakabitze, Nabajeet Barman, Arslan Ahmad, Saman
Zadtootaghaj, Lingfen Sun, Maria G. Martini, Luigi Atzori | QoE Management of Multimedia Streaming Services in Future Networks: A
Tutorial and Survey | 42 pages, 21 figures, 10 tables | null | 10.1109/COMST.2019.2958784 | null | cs.NI cs.MM eess.SP | http://creativecommons.org/licenses/by/4.0/ | We provide in this paper a tutorial and a comprehensive survey of QoE
management solutions in current and future networks. We start with a high level
description of QoE management for multimedia services, which integrates QoE
modelling, monitoring, and optimization. This followed by a discussion of HTTP
Adaptive Stre... | [
{
"created": "Sat, 28 Dec 2019 14:50:48 GMT",
"version": "v1"
}
] | 2020-01-01 | [
[
"Barakabitze",
"Alcardo Alex",
""
],
[
"Barman",
"Nabajeet",
""
],
[
"Ahmad",
"Arslan",
""
],
[
"Zadtootaghaj",
"Saman",
""
],
[
"Sun",
"Lingfen",
""
],
[
"Martini",
"Maria G.",
""
],
[
"Atzori",
"Luigi",
"... | We provide in this paper a tutorial and a comprehensive survey of QoE management solutions in current and future networks. We start with a high level description of QoE management for multimedia services, which integrates QoE modelling, monitoring, and optimization. This followed by a discussion of HTTP Adaptive Stream... |
cs/0702085 | Vincenzo Nicosia | V. Carchiolo, M. Malgeri, G. Mangioni and V. Nicosia | Social Behaviours Applied to P2P Systems: An efficient Algorithm for
Resource Organisation | 5 Pages; 8 Figures; Presented at COPS 2006 -- WETICE -- Manchester
(UK) | 15th IEEE International Workshops on Enabling Technologies:
Infrastructure for Collaborative Enterprises, 2006. WETICE '06. June 2006
Page(s):65 - 72 | null | null | cs.DC cs.IR | null | P2P systems are a great solution to the problem of distributing resources.
The main issue of P2P networks is that searching and retrieving resources
shared by peers is usually expensive and does not take into account
similarities among peers. In this paper we present preliminary simulations of
PROSA, a novel algorith... | [
{
"created": "Wed, 14 Feb 2007 11:53:14 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Carchiolo",
"V.",
""
],
[
"Malgeri",
"M.",
""
],
[
"Mangioni",
"G.",
""
],
[
"Nicosia",
"V.",
""
]
] | P2P systems are a great solution to the problem of distributing resources. The main issue of P2P networks is that searching and retrieving resources shared by peers is usually expensive and does not take into account similarities among peers. In this paper we present preliminary simulations of PROSA, a novel algorithm ... |
0801.0677 | Jad Saklawi | Paul C. Attie | Finite-state concurrent programs can be expressed pairwise | 14 pages | null | null | null | cs.LO | null | We present a \emph{pairwise normal form} for finite-state shared memory
concurrent programs: all variables are shared between exactly two processes,
and the guards on transitions are conjunctions of conditions over this pairwise
shared state. This representation has been used to efficiently (in polynomial
time) synth... | [
{
"created": "Fri, 4 Jan 2008 13:14:31 GMT",
"version": "v1"
}
] | 2008-01-07 | [
[
"Attie",
"Paul C.",
""
]
] | We present a \emph{pairwise normal form} for finite-state shared memory concurrent programs: all variables are shared between exactly two processes, and the guards on transitions are conjunctions of conditions over this pairwise shared state. This representation has been used to efficiently (in polynomial time) synthes... |
2212.04692 | Toshihiro Ota | Toshihiro Ota, Ryo Karakida | Attention in a family of Boltzmann machines emerging from modern
Hopfield networks | 15 pages, 3 figures. v2: added figures and various
corrections/improvements especially in Introduction and Section 3. Published
version | null | null | RIKEN-iTHEMS-Report-22 | cs.LG cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hopfield networks and Boltzmann machines (BMs) are fundamental energy-based
neural network models. Recent studies on modern Hopfield networks have broaden
the class of energy functions and led to a unified perspective on general
Hopfield networks including an attention module. In this letter, we consider
the BM count... | [
{
"created": "Fri, 9 Dec 2022 06:52:36 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Mar 2023 02:36:58 GMT",
"version": "v2"
}
] | 2023-03-30 | [
[
"Ota",
"Toshihiro",
""
],
[
"Karakida",
"Ryo",
""
]
] | Hopfield networks and Boltzmann machines (BMs) are fundamental energy-based neural network models. Recent studies on modern Hopfield networks have broaden the class of energy functions and led to a unified perspective on general Hopfield networks including an attention module. In this letter, we consider the BM counter... |
2404.15886 | Eman Alqahtani | Eman Alqahtani and Mustafa A. Mustafa | Privacy-Preserving Billing for Local Energy Markets (Long Version) | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a privacy-preserving billing protocol for local energy markets
(PBP-LEMs) that takes into account market participants' energy volume
deviations from their bids. PBP-LEMs enables a group of market entities to
jointly compute participants' bills in a decentralized and privacy-preserving
manner without sacrif... | [
{
"created": "Wed, 24 Apr 2024 14:12:56 GMT",
"version": "v1"
}
] | 2024-04-25 | [
[
"Alqahtani",
"Eman",
""
],
[
"Mustafa",
"Mustafa A.",
""
]
] | We propose a privacy-preserving billing protocol for local energy markets (PBP-LEMs) that takes into account market participants' energy volume deviations from their bids. PBP-LEMs enables a group of market entities to jointly compute participants' bills in a decentralized and privacy-preserving manner without sacrific... |
1302.6677 | Ashish Sabharwal | Stefano Ermon, Carla P. Gomes, Ashish Sabharwal, Bart Selman | Taming the Curse of Dimensionality: Discrete Integration by Hashing and
Optimization | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Integration is affected by the curse of dimensionality and quickly becomes
intractable as the dimensionality of the problem grows. We propose a randomized
algorithm that, with high probability, gives a constant-factor approximation of
a general discrete integral defined over an exponentially large set. This
algorithm... | [
{
"created": "Wed, 27 Feb 2013 06:45:28 GMT",
"version": "v1"
}
] | 2013-02-28 | [
[
"Ermon",
"Stefano",
""
],
[
"Gomes",
"Carla P.",
""
],
[
"Sabharwal",
"Ashish",
""
],
[
"Selman",
"Bart",
""
]
] | Integration is affected by the curse of dimensionality and quickly becomes intractable as the dimensionality of the problem grows. We propose a randomized algorithm that, with high probability, gives a constant-factor approximation of a general discrete integral defined over an exponentially large set. This algorithm r... |
2408.06707 | JunYong Choi | JunYong Choi, SeokYeong Lee, Haesol Park, Seung-Won Jung, Ig-Jae Kim,
Junghyun Cho | MAIR++: Improving Multi-view Attention Inverse Rendering with Implicit
Lighting Representation | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In this paper, we propose a scene-level inverse rendering framework that uses
multi-view images to decompose the scene into geometry, SVBRDF, and 3D
spatially-varying lighting. While multi-view images have been widely used for
object-level inverse rendering, scene-level inverse rendering has primarily
been studied us... | [
{
"created": "Tue, 13 Aug 2024 08:04:23 GMT",
"version": "v1"
}
] | 2024-08-14 | [
[
"Choi",
"JunYong",
""
],
[
"Lee",
"SeokYeong",
""
],
[
"Park",
"Haesol",
""
],
[
"Jung",
"Seung-Won",
""
],
[
"Kim",
"Ig-Jae",
""
],
[
"Cho",
"Junghyun",
""
]
] | In this paper, we propose a scene-level inverse rendering framework that uses multi-view images to decompose the scene into geometry, SVBRDF, and 3D spatially-varying lighting. While multi-view images have been widely used for object-level inverse rendering, scene-level inverse rendering has primarily been studied usin... |
1802.01920 | Vincent Neiger | Pascal Giorgi and Vincent Neiger | Certification of minimal approximant bases | ISSAC 2018. 8 pages, 3 algorithms, acmart sigconf style | null | null | null | cs.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For a given computational problem, a certificate is a piece of data that one
(the prover) attaches to the output with the aim of allowing efficient
verification (by the verifier) that this output is correct. Here, we consider
the minimal approximant basis problem, for which the fastest known algorithms
output a polyn... | [
{
"created": "Tue, 6 Feb 2018 12:57:47 GMT",
"version": "v1"
},
{
"created": "Thu, 17 May 2018 20:35:04 GMT",
"version": "v2"
}
] | 2018-05-21 | [
[
"Giorgi",
"Pascal",
""
],
[
"Neiger",
"Vincent",
""
]
] | For a given computational problem, a certificate is a piece of data that one (the prover) attaches to the output with the aim of allowing efficient verification (by the verifier) that this output is correct. Here, we consider the minimal approximant basis problem, for which the fastest known algorithms output a polynom... |
1904.07154 | Jaehun Kim | Jaehun Kim, Juli\'an Urbano, Cynthia C. S. Liem, Alan Hanjalic | Are Nearby Neighbors Relatives?: Testing Deep Music Embeddings | this work was accepted for publication in the "Frontiers in Applied
Mathematics and Statistics (Deep Learning: Status, Applications and
Algorithms)" | null | null | null | cs.LG cs.SD eess.AS stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Deep neural networks have frequently been used to directly learn
representations useful for a given task from raw input data. In terms of
overall performance metrics, machine learning solutions employing deep
representations frequently have been reported to greatly outperform those using
hand-crafted feature represen... | [
{
"created": "Mon, 15 Apr 2019 16:08:41 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Oct 2019 21:42:36 GMT",
"version": "v2"
},
{
"created": "Thu, 17 Oct 2019 23:34:04 GMT",
"version": "v3"
}
] | 2019-10-21 | [
[
"Kim",
"Jaehun",
""
],
[
"Urbano",
"Julián",
""
],
[
"Liem",
"Cynthia C. S.",
""
],
[
"Hanjalic",
"Alan",
""
]
] | Deep neural networks have frequently been used to directly learn representations useful for a given task from raw input data. In terms of overall performance metrics, machine learning solutions employing deep representations frequently have been reported to greatly outperform those using hand-crafted feature representa... |
2106.02809 | Kaihao Zhang | Lirong Zheng, Yanshan Li, Kaihao Zhang, Wenhan Luo | T-Net: Deep Stacked Scale-Iteration Network for Image Dehazing | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hazy images reduce the visibility of the image content, and haze will lead to
failure in handling subsequent computer vision tasks. In this paper, we address
the problem of image dehazing by proposing a dehazing network named T-Net,
which consists of a backbone network based on the U-Net architecture and a dual
atten... | [
{
"created": "Sat, 5 Jun 2021 06:01:05 GMT",
"version": "v1"
}
] | 2021-06-08 | [
[
"Zheng",
"Lirong",
""
],
[
"Li",
"Yanshan",
""
],
[
"Zhang",
"Kaihao",
""
],
[
"Luo",
"Wenhan",
""
]
] | Hazy images reduce the visibility of the image content, and haze will lead to failure in handling subsequent computer vision tasks. In this paper, we address the problem of image dehazing by proposing a dehazing network named T-Net, which consists of a backbone network based on the U-Net architecture and a dual attenti... |
cs/0603067 | Priya Sivakumar | Priya Sivakumar | Implementing the Three-Stage Quantum Cryptography Protocol | 4 pages, 1 figure | null | null | null | cs.CR | null | We present simple implementations of Kak's three-stage quantum cryptography
protocol. The case where the transformation is applied to more than one qubit
at the same time is also considered.
| [
{
"created": "Thu, 16 Mar 2006 22:20:44 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Sivakumar",
"Priya",
""
]
] | We present simple implementations of Kak's three-stage quantum cryptography protocol. The case where the transformation is applied to more than one qubit at the same time is also considered. |
2209.06452 | Luigy Alex Machaca Arcana | Luigy Machaca, F. Oliver Sumari H, Jose Huaman, Esteban Clua, Joris
Guerin | TrADe Re-ID -- Live Person Re-Identification using Tracking and Anomaly
Detection | 6 pages, 4 figures, Accepted on ICMLA 2022 | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Person Re-Identification (Re-ID) aims to search for a person of interest
(query) in a network of cameras. In the classic Re-ID setting the query is
sought in a gallery containing properly cropped images of entire bodies.
Recently, the live Re-ID setting was introduced to represent the practical
application context of... | [
{
"created": "Wed, 14 Sep 2022 07:00:35 GMT",
"version": "v1"
}
] | 2022-09-15 | [
[
"Machaca",
"Luigy",
""
],
[
"H",
"F. Oliver Sumari",
""
],
[
"Huaman",
"Jose",
""
],
[
"Clua",
"Esteban",
""
],
[
"Guerin",
"Joris",
""
]
] | Person Re-Identification (Re-ID) aims to search for a person of interest (query) in a network of cameras. In the classic Re-ID setting the query is sought in a gallery containing properly cropped images of entire bodies. Recently, the live Re-ID setting was introduced to represent the practical application context of R... |
2105.00328 | Marshall Ho | Marshall Ho, Zhipeng Zhou, Judith He | When to Fold'em: How to answer Unanswerable questions | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We present 3 different question-answering models trained on the SQuAD2.0
dataset -- BIDAF, DocumentQA and ALBERT Retro-Reader -- demonstrating the
improvement of language models in the past three years. Through our research in
fine-tuning pre-trained models for question-answering, we developed a novel
approach capabl... | [
{
"created": "Sat, 1 May 2021 19:08:40 GMT",
"version": "v1"
}
] | 2021-05-04 | [
[
"Ho",
"Marshall",
""
],
[
"Zhou",
"Zhipeng",
""
],
[
"He",
"Judith",
""
]
] | We present 3 different question-answering models trained on the SQuAD2.0 dataset -- BIDAF, DocumentQA and ALBERT Retro-Reader -- demonstrating the improvement of language models in the past three years. Through our research in fine-tuning pre-trained models for question-answering, we developed a novel approach capable ... |
2302.07396 | Marcelo Magnasco | Marcelo O. Magnasco | Convolutional unitary or orthogonal recurrent neural networks | null | null | null | null | cs.LG cond-mat.stat-mech cs.AI q-bio.NC | http://creativecommons.org/licenses/by/4.0/ | Recurrent neural networks are extremely powerful yet hard to train. One of
their issues is the vanishing gradient problem, whereby propagation of training
signals may be exponentially attenuated, freezing training. Use of orthogonal
or unitary matrices, whose powers neither explode nor decay, has been proposed
to mit... | [
{
"created": "Tue, 14 Feb 2023 23:36:21 GMT",
"version": "v1"
}
] | 2023-02-16 | [
[
"Magnasco",
"Marcelo O.",
""
]
] | Recurrent neural networks are extremely powerful yet hard to train. One of their issues is the vanishing gradient problem, whereby propagation of training signals may be exponentially attenuated, freezing training. Use of orthogonal or unitary matrices, whose powers neither explode nor decay, has been proposed to mitig... |
2006.05203 | Travis LaCroix | Travis LaCroix and Aydin Mohseni | The Tragedy of the AI Commons | 40 Pages, 5 Figures | null | null | null | cs.CY cs.AI cs.GT cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Policy and guideline proposals for ethical artificial-intelligence research
have proliferated in recent years. These are supposed to guide the
socially-responsible development of AI for the common good. However, there
typically exist incentives for non-cooperation (i.e., non-adherence to such
policies and guidelines)... | [
{
"created": "Tue, 9 Jun 2020 12:01:01 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Jan 2021 19:07:13 GMT",
"version": "v2"
}
] | 2021-01-20 | [
[
"LaCroix",
"Travis",
""
],
[
"Mohseni",
"Aydin",
""
]
] | Policy and guideline proposals for ethical artificial-intelligence research have proliferated in recent years. These are supposed to guide the socially-responsible development of AI for the common good. However, there typically exist incentives for non-cooperation (i.e., non-adherence to such policies and guidelines); ... |
2204.02181 | Hyeonbin Hwang | Hyeonbin Hwang, Soyeon Kim, Wei-Jin Park, Jiho Seo, Kyungtae Ko, Hyeon
Yeo | Vision Transformer Equipped with Neural Resizer on Facial Expression
Recognition Task | Accepted to IEEE ICASSP 2022 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | When it comes to wild conditions, Facial Expression Recognition is often
challenged with low-quality data and imbalanced, ambiguous labels. This field
has much benefited from CNN based approaches; however, CNN models have
structural limitation to see the facial regions in distant. As a remedy,
Transformer has been in... | [
{
"created": "Tue, 5 Apr 2022 13:04:04 GMT",
"version": "v1"
}
] | 2022-04-06 | [
[
"Hwang",
"Hyeonbin",
""
],
[
"Kim",
"Soyeon",
""
],
[
"Park",
"Wei-Jin",
""
],
[
"Seo",
"Jiho",
""
],
[
"Ko",
"Kyungtae",
""
],
[
"Yeo",
"Hyeon",
""
]
] | When it comes to wild conditions, Facial Expression Recognition is often challenged with low-quality data and imbalanced, ambiguous labels. This field has much benefited from CNN based approaches; however, CNN models have structural limitation to see the facial regions in distant. As a remedy, Transformer has been intr... |
1712.01337 | Hsiao-Yu Tung | Hsiao-Yu Fish Tung, Hsiao-Wei Tung, Ersin Yumer, Katerina Fragkiadaki | Self-supervised Learning of Motion Capture | Neural Information Processing Systems (NIPS) 2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current state-of-the-art solutions for motion capture from a single camera
are optimization driven: they optimize the parameters of a 3D human model so
that its re-projection matches measurements in the video (e.g. person
segmentation, optical flow, keypoint detections etc.). Optimization models are
susceptible to lo... | [
{
"created": "Mon, 4 Dec 2017 20:25:47 GMT",
"version": "v1"
}
] | 2017-12-06 | [
[
"Tung",
"Hsiao-Yu Fish",
""
],
[
"Tung",
"Hsiao-Wei",
""
],
[
"Yumer",
"Ersin",
""
],
[
"Fragkiadaki",
"Katerina",
""
]
] | Current state-of-the-art solutions for motion capture from a single camera are optimization driven: they optimize the parameters of a 3D human model so that its re-projection matches measurements in the video (e.g. person segmentation, optical flow, keypoint detections etc.). Optimization models are susceptible to loca... |
2308.09284 | Shaleen Deep | Paraschos Koutris, Shaleen Deep | The Fine-Grained Complexity of CFL Reachability | Appeared in POPL 2023. Please note the erratum on the first page | null | null | null | cs.FL | http://creativecommons.org/licenses/by/4.0/ | Many problems in static program analysis can be modeled as the context-free
language (CFL) reachability problem on directed labeled graphs. The CFL
reachability problem can be generally solved in time $O(n^3)$, where $n$ is the
number of vertices in the graph, with some specific cases that can be solved
faster. In th... | [
{
"created": "Fri, 18 Aug 2023 03:52:27 GMT",
"version": "v1"
}
] | 2023-08-21 | [
[
"Koutris",
"Paraschos",
""
],
[
"Deep",
"Shaleen",
""
]
] | Many problems in static program analysis can be modeled as the context-free language (CFL) reachability problem on directed labeled graphs. The CFL reachability problem can be generally solved in time $O(n^3)$, where $n$ is the number of vertices in the graph, with some specific cases that can be solved faster. In this... |
2312.14280 | Sepideh Koohfar | Sepideh Koohfar and Laura Dietz | Fine-grained Forecasting Models Via Gaussian Process Blurring Effect | 10 pages | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Time series forecasting is a challenging task due to the existence of complex
and dynamic temporal dependencies. This can lead to incorrect predictions by
even the best forecasting models. Using more training data is one way to
improve the accuracy, but this source is often limited. In contrast, we are
building on su... | [
{
"created": "Thu, 21 Dec 2023 20:25:16 GMT",
"version": "v1"
}
] | 2023-12-25 | [
[
"Koohfar",
"Sepideh",
""
],
[
"Dietz",
"Laura",
""
]
] | Time series forecasting is a challenging task due to the existence of complex and dynamic temporal dependencies. This can lead to incorrect predictions by even the best forecasting models. Using more training data is one way to improve the accuracy, but this source is often limited. In contrast, we are building on succ... |
1812.07072 | Nathana\"el Fijalkow | Nathana\"el Fijalkow and Pawe{\l} Gawrychowski and Pierre Ohlmann | The complexity of mean payoff games using universal graphs | null | null | null | null | cs.GT cs.FL cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the computational complexity of solving mean payoff games. This
class of games can be seen as an extension of parity games, and they have
similar complexity status: in both cases solving them is in $\textbf{NP} \cap
\textbf{coNP}$ and not known to be in $\textbf{P}$. In a breakthrough result
Calude, Jain, Kh... | [
{
"created": "Mon, 17 Dec 2018 22:13:33 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Feb 2019 19:04:26 GMT",
"version": "v2"
}
] | 2019-02-06 | [
[
"Fijalkow",
"Nathanaël",
""
],
[
"Gawrychowski",
"Paweł",
""
],
[
"Ohlmann",
"Pierre",
""
]
] | We study the computational complexity of solving mean payoff games. This class of games can be seen as an extension of parity games, and they have similar complexity status: in both cases solving them is in $\textbf{NP} \cap \textbf{coNP}$ and not known to be in $\textbf{P}$. In a breakthrough result Calude, Jain, Khou... |
1908.00381 | Anton Vladzymyrskyy | S.P. Morozov, A.V. Vladzymyrskyy, V.G. Klyashtornyy, A.E.
Andreychenko, N.S. Kulberg, V.A. Gombolevsky, K.A. Sergunova | Clinical acceptance of software based on artificial intelligence
technologies (radiology) | For correspondence: info@npcmr.ru, npcmr@zdrav.mos.ru. 28/1,
Srednyaya Kalitnikovskaya st., Moscow, 109029, Russia +7 (495) 276-04-36 | null | null | Preprint No. CDT-2019-1 | cs.AI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Aim: provide a methodological framework for the process of clinical tests,
clinical acceptance, and scientific assessment of algorithms and software based
on the artificial intelligence (AI) technologies. Clinical tests are considered
as a preparation stage for the software registration as a medical product. The
auth... | [
{
"created": "Thu, 1 Aug 2019 13:24:26 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Feb 2020 14:16:03 GMT",
"version": "v2"
}
] | 2020-02-28 | [
[
"Morozov",
"S. P.",
""
],
[
"Vladzymyrskyy",
"A. V.",
""
],
[
"Klyashtornyy",
"V. G.",
""
],
[
"Andreychenko",
"A. E.",
""
],
[
"Kulberg",
"N. S.",
""
],
[
"Gombolevsky",
"V. A.",
""
],
[
"Sergunova",
"K. A.",
... | Aim: provide a methodological framework for the process of clinical tests, clinical acceptance, and scientific assessment of algorithms and software based on the artificial intelligence (AI) technologies. Clinical tests are considered as a preparation stage for the software registration as a medical product. The author... |
2005.03853 | Rishi Sonthalia | Rishi Sonthalia, Anna C. Gilbert | Project and Forget: Solving Large-Scale Metric Constrained Problems | null | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a set of dissimilarity measurements amongst data points, determining
what metric representation is most "consistent" with the input measurements or
the metric that best captures the relevant geometric features of the data is a
key step in many machine learning algorithms. Existing methods are restricted
to spec... | [
{
"created": "Fri, 8 May 2020 04:50:54 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Sep 2022 21:27:20 GMT",
"version": "v2"
}
] | 2022-09-28 | [
[
"Sonthalia",
"Rishi",
""
],
[
"Gilbert",
"Anna C.",
""
]
] | Given a set of dissimilarity measurements amongst data points, determining what metric representation is most "consistent" with the input measurements or the metric that best captures the relevant geometric features of the data is a key step in many machine learning algorithms. Existing methods are restricted to specif... |
2206.10607 | Jeewon Jeon | Jeewon Jeon, Woojun Kim, Whiyoung Jung, Youngchul Sung | MASER: Multi-Agent Reinforcement Learning with Subgoals Generated from
Experience Replay Buffer | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider cooperative multi-agent reinforcement learning
(MARL) with sparse reward. To tackle this problem, we propose a novel method
named MASER: MARL with subgoals generated from experience replay buffer. Under
the widely-used assumption of centralized training with decentralized execution
and cons... | [
{
"created": "Mon, 20 Jun 2022 08:12:26 GMT",
"version": "v1"
}
] | 2022-06-23 | [
[
"Jeon",
"Jeewon",
""
],
[
"Kim",
"Woojun",
""
],
[
"Jung",
"Whiyoung",
""
],
[
"Sung",
"Youngchul",
""
]
] | In this paper, we consider cooperative multi-agent reinforcement learning (MARL) with sparse reward. To tackle this problem, we propose a novel method named MASER: MARL with subgoals generated from experience replay buffer. Under the widely-used assumption of centralized training with decentralized execution and consis... |
1802.05998 | Tomas Teijeiro | Tom\'as Teijeiro, Constantino A. Garc\'ia, Daniel Castro and Paulo
F\'elix | Abductive reasoning as the basis to reproduce expert criteria in ECG
Atrial Fibrillation identification | 15 pages, 6 figures, 6 tables | Physiological Measurement. 2018 Aug 31;39(8):084006 | 10.1088/1361-6579/aad7e4 | null | cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Objective: This work aims at providing a new method for the automatic
detection of atrial fibrillation, other arrhythmia and noise on short single
lead ECG signals, emphasizing the importance of the interpretability of the
classification results.
Approach: A morphological and rhythm description of the cardiac behav... | [
{
"created": "Fri, 16 Feb 2018 16:06:42 GMT",
"version": "v1"
}
] | 2021-12-09 | [
[
"Teijeiro",
"Tomás",
""
],
[
"García",
"Constantino A.",
""
],
[
"Castro",
"Daniel",
""
],
[
"Félix",
"Paulo",
""
]
] | Objective: This work aims at providing a new method for the automatic detection of atrial fibrillation, other arrhythmia and noise on short single lead ECG signals, emphasizing the importance of the interpretability of the classification results. Approach: A morphological and rhythm description of the cardiac behavior ... |
2012.02024 | Michael Heffels | Michael R. Heffels and Joaquin Vanschoren | Aerial Imagery Pixel-level Segmentation | 30 pages, 15 figures, 4 tables. Code available through GitHub repo at
https://github.com/mrheffels/aerial-imagery-segmentation | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Aerial imagery can be used for important work on a global scale.
Nevertheless, the analysis of this data using neural network architectures lags
behind the current state-of-the-art on popular datasets such as PASCAL VOC,
CityScapes and Camvid. In this paper we bridge the performance-gap between
these popular datasets... | [
{
"created": "Thu, 3 Dec 2020 16:09:09 GMT",
"version": "v1"
}
] | 2020-12-04 | [
[
"Heffels",
"Michael R.",
""
],
[
"Vanschoren",
"Joaquin",
""
]
] | Aerial imagery can be used for important work on a global scale. Nevertheless, the analysis of this data using neural network architectures lags behind the current state-of-the-art on popular datasets such as PASCAL VOC, CityScapes and Camvid. In this paper we bridge the performance-gap between these popular datasets a... |
2104.08404 | Junghoon Kim | Junghoon Kim and Bruno Clerckx | Wireless Information and Power Transfer for IoT: Pulse Position
Modulation, Integrated Receiver, and Experimental Validation | submitted for publication | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Simultaneous wireless information and power transfer (SWIPT) has emerged as a
viable technique to energize and connect low-power autonomous devices and
enable future Internet of Things (IoT). A major challenge of SWIPT is the
energy consumption of the receiver of such low-power devices. An attractive
low-power soluti... | [
{
"created": "Fri, 16 Apr 2021 23:25:51 GMT",
"version": "v1"
}
] | 2021-04-20 | [
[
"Kim",
"Junghoon",
""
],
[
"Clerckx",
"Bruno",
""
]
] | Simultaneous wireless information and power transfer (SWIPT) has emerged as a viable technique to energize and connect low-power autonomous devices and enable future Internet of Things (IoT). A major challenge of SWIPT is the energy consumption of the receiver of such low-power devices. An attractive low-power solution... |
2204.03341 | Tung Kieu | Tung Kieu, Bin Yang, Chenjuan Guo, Christian S. Jensen, Yan Zhao,
Feiteng Huang, Kai Zheng | Robust and Explainable Autoencoders for Unsupervised Time Series Outlier
Detection---Extended Version | This paper has been accepted by IEEE ICDE 2022 | null | null | null | cs.LG cs.DB | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Time series data occurs widely, and outlier detection is a fundamental
problem in data mining, which has numerous applications. Existing
autoencoder-based approaches deliver state-of-the-art performance on
challenging real-world data but are vulnerable to outliers and exhibit low
explainability. To address these two ... | [
{
"created": "Thu, 7 Apr 2022 10:24:12 GMT",
"version": "v1"
}
] | 2022-04-08 | [
[
"Kieu",
"Tung",
""
],
[
"Yang",
"Bin",
""
],
[
"Guo",
"Chenjuan",
""
],
[
"Jensen",
"Christian S.",
""
],
[
"Zhao",
"Yan",
""
],
[
"Huang",
"Feiteng",
""
],
[
"Zheng",
"Kai",
""
]
] | Time series data occurs widely, and outlier detection is a fundamental problem in data mining, which has numerous applications. Existing autoencoder-based approaches deliver state-of-the-art performance on challenging real-world data but are vulnerable to outliers and exhibit low explainability. To address these two li... |
1701.04626 | Simone Bova | Simone Bova and Stefan Szeider | Circuit Treewidth, Sentential Decision, and Query Compilation | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The evaluation of a query over a probabilistic database boils down to
computing the probability of a suitable Boolean function, the lineage of the
query over the database. The method of query compilation approaches the task in
two stages: first, the query lineage is implemented (compiled) in a circuit
form where prob... | [
{
"created": "Tue, 17 Jan 2017 11:34:07 GMT",
"version": "v1"
}
] | 2017-01-18 | [
[
"Bova",
"Simone",
""
],
[
"Szeider",
"Stefan",
""
]
] | The evaluation of a query over a probabilistic database boils down to computing the probability of a suitable Boolean function, the lineage of the query over the database. The method of query compilation approaches the task in two stages: first, the query lineage is implemented (compiled) in a circuit form where probab... |
1611.04144 | Xuanpeng Li | Xuanpeng Li and Rachid Belaroussi | Semi-Dense 3D Semantic Mapping from Monocular SLAM | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The bundle of geometry and appearance in computer vision has proven to be a
promising solution for robots across a wide variety of applications. Stereo
cameras and RGB-D sensors are widely used to realise fast 3D reconstruction and
trajectory tracking in a dense way. However, they lack flexibility of seamless
switch ... | [
{
"created": "Sun, 13 Nov 2016 15:31:31 GMT",
"version": "v1"
}
] | 2016-11-15 | [
[
"Li",
"Xuanpeng",
""
],
[
"Belaroussi",
"Rachid",
""
]
] | The bundle of geometry and appearance in computer vision has proven to be a promising solution for robots across a wide variety of applications. Stereo cameras and RGB-D sensors are widely used to realise fast 3D reconstruction and trajectory tracking in a dense way. However, they lack flexibility of seamless switch be... |
2211.17107 | Ruturaj Ghatage | Sharvi Endait, Ruturaj Ghatage, Prof. DD Kadam | Handling and extracting key entities from customer conversations using
Speech recognition and Named Entity recognition | null | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this modern era of technology with e-commerce developing at a rapid pace,
it is very important to understand customer requirements and details from a
business conversation. It is very crucial for customer retention and
satisfaction. Extracting key insights from these conversations is very
important when it comes t... | [
{
"created": "Mon, 28 Nov 2022 06:41:29 GMT",
"version": "v1"
}
] | 2022-12-01 | [
[
"Endait",
"Sharvi",
""
],
[
"Ghatage",
"Ruturaj",
""
],
[
"Kadam",
"Prof. DD",
""
]
] | In this modern era of technology with e-commerce developing at a rapid pace, it is very important to understand customer requirements and details from a business conversation. It is very crucial for customer retention and satisfaction. Extracting key insights from these conversations is very important when it comes to ... |
2405.02583 | Xiangqi Kong | Xiangqi Kong, Yang Xing, Antonios Tsourdos, Ziyue Wang, Weisi Guo,
Adolfo Perrusquia, Andreas Wikander | Explainable Interface for Human-Autonomy Teaming: A Survey | 45 pages, 9 figures | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Nowadays, large-scale foundation models are being increasingly integrated
into numerous safety-critical applications, including human-autonomy teaming
(HAT) within transportation, medical, and defence domains. Consequently, the
inherent 'black-box' nature of these sophisticated deep neural networks
heightens the sign... | [
{
"created": "Sat, 4 May 2024 06:35:38 GMT",
"version": "v1"
}
] | 2024-05-07 | [
[
"Kong",
"Xiangqi",
""
],
[
"Xing",
"Yang",
""
],
[
"Tsourdos",
"Antonios",
""
],
[
"Wang",
"Ziyue",
""
],
[
"Guo",
"Weisi",
""
],
[
"Perrusquia",
"Adolfo",
""
],
[
"Wikander",
"Andreas",
""
]
] | Nowadays, large-scale foundation models are being increasingly integrated into numerous safety-critical applications, including human-autonomy teaming (HAT) within transportation, medical, and defence domains. Consequently, the inherent 'black-box' nature of these sophisticated deep neural networks heightens the signif... |
1007.0571 | Vikram Krishnamurthy | Vikram Krishnamurthy | Quickest Detection with Social Learning: Interaction of local and global
decision makers | null | null | null | null | cs.GT cs.IT math.IT stat.ME | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider how local and global decision policies interact in stopping time
problems such as quickest time change detection. Individual agents make myopic
local decisions via social learning, that is, each agent records a private
observation of a noisy underlying state process, selfishly optimizes its local
utility ... | [
{
"created": "Sun, 4 Jul 2010 17:06:38 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Aug 2011 09:01:38 GMT",
"version": "v2"
},
{
"created": "Fri, 2 Mar 2012 18:55:34 GMT",
"version": "v3"
}
] | 2012-03-05 | [
[
"Krishnamurthy",
"Vikram",
""
]
] | We consider how local and global decision policies interact in stopping time problems such as quickest time change detection. Individual agents make myopic local decisions via social learning, that is, each agent records a private observation of a noisy underlying state process, selfishly optimizes its local utility an... |
2408.07272 | Junxuan Li | Junxuan Li, Ryan Wickman, Sahil Bhatnagar, Raj Kumar Maity, Arko
Mukherjee | NL2OR: Solve Complex Operations Research Problems Using Natural Language
Inputs | null | null | null | null | cs.AI cs.HC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Operations research (OR) uses mathematical models to enhance decision-making,
but developing these models requires expert knowledge and can be
time-consuming. Automated mathematical programming (AMP) has emerged to
simplify this process, but existing systems have limitations. This paper
introduces a novel methodology... | [
{
"created": "Wed, 14 Aug 2024 03:42:53 GMT",
"version": "v1"
}
] | 2024-08-15 | [
[
"Li",
"Junxuan",
""
],
[
"Wickman",
"Ryan",
""
],
[
"Bhatnagar",
"Sahil",
""
],
[
"Maity",
"Raj Kumar",
""
],
[
"Mukherjee",
"Arko",
""
]
] | Operations research (OR) uses mathematical models to enhance decision-making, but developing these models requires expert knowledge and can be time-consuming. Automated mathematical programming (AMP) has emerged to simplify this process, but existing systems have limitations. This paper introduces a novel methodology t... |
2112.01098 | Surabhi Gupta | Surabhi Gupta, Ashwath Shetty, Avinash Sharma | Attention based Occlusion Removal for Hybrid Telepresence Systems | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Traditionally, video conferencing is a widely adopted solution for
telecommunication, but a lack of immersiveness comes inherently due to the 2D
nature of facial representation. The integration of Virtual Reality (VR) in a
communication/telepresence system through Head Mounted Displays (HMDs) promises
to provide user... | [
{
"created": "Thu, 2 Dec 2021 10:18:22 GMT",
"version": "v1"
}
] | 2021-12-03 | [
[
"Gupta",
"Surabhi",
""
],
[
"Shetty",
"Ashwath",
""
],
[
"Sharma",
"Avinash",
""
]
] | Traditionally, video conferencing is a widely adopted solution for telecommunication, but a lack of immersiveness comes inherently due to the 2D nature of facial representation. The integration of Virtual Reality (VR) in a communication/telepresence system through Head Mounted Displays (HMDs) promises to provide users ... |
2109.00301 | Pedro Henrique Martins | Pedro Henrique Martins and Zita Marinho and Andr\'e F. T. Martins | $\infty$-former: Infinite Memory Transformer | ACL 2022 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transformers are unable to model long-term memories effectively, since the
amount of computation they need to perform grows with the context length. While
variations of efficient transformers have been proposed, they all have a finite
memory capacity and are forced to drop old information. In this paper, we
propose t... | [
{
"created": "Wed, 1 Sep 2021 10:51:58 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Sep 2021 10:12:03 GMT",
"version": "v2"
},
{
"created": "Fri, 25 Mar 2022 10:37:54 GMT",
"version": "v3"
}
] | 2022-03-28 | [
[
"Martins",
"Pedro Henrique",
""
],
[
"Marinho",
"Zita",
""
],
[
"Martins",
"André F. T.",
""
]
] | Transformers are unable to model long-term memories effectively, since the amount of computation they need to perform grows with the context length. While variations of efficient transformers have been proposed, they all have a finite memory capacity and are forced to drop old information. In this paper, we propose the... |
2402.01079 | David OBrien | David OBrien, Robert Dyer, Tien N. Nguyen, Hridesh Rajan | Data-Driven Evidence-Based Syntactic Sugar Design | 12 pages, 12 figures, to be published in ICSE'24 | null | 10.1145/3597503.3639580 | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Programming languages are essential tools for developers, and their evolution
plays a crucial role in supporting the activities of developers. One instance
of programming language evolution is the introduction of syntactic sugars,
which are additional syntax elements that provide alternative, more readable
code const... | [
{
"created": "Fri, 2 Feb 2024 00:35:14 GMT",
"version": "v1"
}
] | 2024-02-05 | [
[
"OBrien",
"David",
""
],
[
"Dyer",
"Robert",
""
],
[
"Nguyen",
"Tien N.",
""
],
[
"Rajan",
"Hridesh",
""
]
] | Programming languages are essential tools for developers, and their evolution plays a crucial role in supporting the activities of developers. One instance of programming language evolution is the introduction of syntactic sugars, which are additional syntax elements that provide alternative, more readable code constru... |
2106.08389 | Anne Collin | Anne Collin, Amitai Y. Bin-Nun, Radboud Duintjer Tebbens | Plane and Sample: Maximizing Information about Autonomous Vehicle
Performance using Submodular Optimization | 8 pages, 8 figures. Accepted for publication at the 2021 IEEE
International Intelligent Transportation Systems Conference (ITSC) | null | null | null | cs.RO cs.SY eess.SY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | As autonomous vehicles (AVs) take on growing Operational Design Domains
(ODDs), they need to go through a systematic, transparent, and scalable
evaluation process to demonstrate their benefits to society. Current scenario
sampling techniques for AV performance evaluation usually focus on a specific
functionality, suc... | [
{
"created": "Tue, 15 Jun 2021 19:35:30 GMT",
"version": "v1"
}
] | 2021-06-17 | [
[
"Collin",
"Anne",
""
],
[
"Bin-Nun",
"Amitai Y.",
""
],
[
"Tebbens",
"Radboud Duintjer",
""
]
] | As autonomous vehicles (AVs) take on growing Operational Design Domains (ODDs), they need to go through a systematic, transparent, and scalable evaluation process to demonstrate their benefits to society. Current scenario sampling techniques for AV performance evaluation usually focus on a specific functionality, such ... |
1812.03556 | Kamran Keykhosravi | Kamran Keykhosravi, Marco Secondini, Giuseppe Durisi and Erik Agrell | How to Increase the Achievable Information Rate by Per-Channel
Dispersion Compensation | null | IEEE/OSA Journal of Lightwave Technology, vol. 37, no. 10, pp.
2443-2451, May 2019 | 10.1109/JLT.2019.2907311 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deploying periodic inline chromatic dispersion compensation enables reducing
the complexity of the digital back propagation (DBP) algorithm. However,
compared with nondispersion-managed (NDM) links, dispersion-managed (DM) ones
suffer a stronger cross-phase modulation (XPM). Utilizing per-channel
dispersion-managed (... | [
{
"created": "Sun, 9 Dec 2018 20:50:52 GMT",
"version": "v1"
}
] | 2024-01-25 | [
[
"Keykhosravi",
"Kamran",
""
],
[
"Secondini",
"Marco",
""
],
[
"Durisi",
"Giuseppe",
""
],
[
"Agrell",
"Erik",
""
]
] | Deploying periodic inline chromatic dispersion compensation enables reducing the complexity of the digital back propagation (DBP) algorithm. However, compared with nondispersion-managed (NDM) links, dispersion-managed (DM) ones suffer a stronger cross-phase modulation (XPM). Utilizing per-channel dispersion-managed (CD... |
1210.6241 | Mael Le Treust | Ma\"el Le Treust, Samson Lasaulce | Transforming Monitoring Structures with Resilient Encoders. Application
to Repeated Games | Springer, Dynamic Games and Applications, 2012 | null | 10.1007/s13235-012-0058-3 | null | cs.IT cs.GT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An important feature of a dynamic game is its monitoring structure namely,
what the players effectively see from the played actions. We consider games
with arbitrary monitoring structures. One of the purposes of this paper is to
know to what extent an encoder, who perfectly observes the played actions and
sends a com... | [
{
"created": "Tue, 23 Oct 2012 14:14:17 GMT",
"version": "v1"
}
] | 2012-10-24 | [
[
"Treust",
"Maël Le",
""
],
[
"Lasaulce",
"Samson",
""
]
] | An important feature of a dynamic game is its monitoring structure namely, what the players effectively see from the played actions. We consider games with arbitrary monitoring structures. One of the purposes of this paper is to know to what extent an encoder, who perfectly observes the played actions and sends a compl... |
1104.3497 | Shih-Chun Lin | Pin-Hsun Lin, Shih-Chun Lin, Hsuan-Jung Su, and Y.-W. Peter Hong | Clean relaying aided cognitive radio under the coexistence constraint | 30 pages | null | 10.1109/TWC.2012.092712.120005 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the interference-mitigation based cognitive radio where the
primary and secondary users can coexist at the same time and frequency bands,
under the constraint that the rate of the primary user (PU) must remain the
same with a single-user decoder. To meet such a coexistence constraint, the
relaying from th... | [
{
"created": "Mon, 18 Apr 2011 14:33:58 GMT",
"version": "v1"
}
] | 2012-12-24 | [
[
"Lin",
"Pin-Hsun",
""
],
[
"Lin",
"Shih-Chun",
""
],
[
"Su",
"Hsuan-Jung",
""
],
[
"Hong",
"Y. -W. Peter",
""
]
] | We consider the interference-mitigation based cognitive radio where the primary and secondary users can coexist at the same time and frequency bands, under the constraint that the rate of the primary user (PU) must remain the same with a single-user decoder. To meet such a coexistence constraint, the relaying from the ... |
2104.11693 | Yiming Zhao | Yiming Zhao, Xinming Huang and Ziming Zhang | Deep Lucas-Kanade Homography for Multimodal Image Alignment | Accepted by CVPR2021, codelink:
https://github.com/placeforyiming/CVPR21-Deep-Lucas-Kanade-Homography | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Estimating homography to align image pairs captured by different sensors or
image pairs with large appearance changes is an important and general challenge
for many computer vision applications. In contrast to others, we propose a
generic solution to pixel-wise align multimodal image pairs by extending the
traditiona... | [
{
"created": "Thu, 22 Apr 2021 04:11:29 GMT",
"version": "v1"
}
] | 2021-04-26 | [
[
"Zhao",
"Yiming",
""
],
[
"Huang",
"Xinming",
""
],
[
"Zhang",
"Ziming",
""
]
] | Estimating homography to align image pairs captured by different sensors or image pairs with large appearance changes is an important and general challenge for many computer vision applications. In contrast to others, we propose a generic solution to pixel-wise align multimodal image pairs by extending the traditional ... |
1907.10709 | Giulio Siracusano Dr. | Giulio Siracusano, Francesca Garesc\`i, Giovanni Finocchio, Riccardo
Tomasello, Francesco Lamonaca, Carmelo Scuro, Mario Carpentieri, Massimo
Chiappini and Aurelio La Corte | Automatic crack classification by exploiting statistical event
descriptors for Deep Learning | 19 pages, 2 tables, 9 figures | null | null | null | cs.LG eess.SP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In modern building infrastructures, the chance to devise adaptive and
unsupervised data-driven health monitoring systems is gaining in popularity due
to the large availability of big data from low-cost sensors with communication
capabilities and advanced modeling tools such as Deep Learning. The main
purpose of this ... | [
{
"created": "Wed, 24 Jul 2019 20:39:49 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Nov 2021 17:01:13 GMT",
"version": "v2"
}
] | 2021-11-29 | [
[
"Siracusano",
"Giulio",
""
],
[
"Garescì",
"Francesca",
""
],
[
"Finocchio",
"Giovanni",
""
],
[
"Tomasello",
"Riccardo",
""
],
[
"Lamonaca",
"Francesco",
""
],
[
"Scuro",
"Carmelo",
""
],
[
"Carpentieri",
"Mar... | In modern building infrastructures, the chance to devise adaptive and unsupervised data-driven health monitoring systems is gaining in popularity due to the large availability of big data from low-cost sensors with communication capabilities and advanced modeling tools such as Deep Learning. The main purpose of this pa... |
2112.14192 | Xudong Li | Xudong Li, Ye Fan, Rugui Yao, Peng Wang, Nan Qi, Xiaoya Zuo | Robust Security Analysis Based on Random Geometry Theory for
Satellite-Terrestrial-Vehicle Network | The theoretical analysis in the original manuscript is insufficient,
and the system model is not convincing. With the consideration of these
flaws, we decide to withdraw our work for further improvement | null | null | null | cs.IT cs.CL math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Driven by B5G and 6G technologies, multi-network fusion is an indispensable
tendency for future communications. In this paper, we focus on and analyze the
\emph{security performance} (SP) of the \emph{satellite-terrestrial downlink
transmission} (STDT). Here, the STDT is composed of a satellite network and a
vehicula... | [
{
"created": "Tue, 28 Dec 2021 15:46:28 GMT",
"version": "v1"
},
{
"created": "Thu, 14 Jul 2022 09:44:03 GMT",
"version": "v2"
}
] | 2022-07-15 | [
[
"Li",
"Xudong",
""
],
[
"Fan",
"Ye",
""
],
[
"Yao",
"Rugui",
""
],
[
"Wang",
"Peng",
""
],
[
"Qi",
"Nan",
""
],
[
"Zuo",
"Xiaoya",
""
]
] | Driven by B5G and 6G technologies, multi-network fusion is an indispensable tendency for future communications. In this paper, we focus on and analyze the \emph{security performance} (SP) of the \emph{satellite-terrestrial downlink transmission} (STDT). Here, the STDT is composed of a satellite network and a vehicular ... |
1810.12272 | Dimitrios Diochnos | Dimitrios I. Diochnos, Saeed Mahloujifar, Mohammad Mahmoody | Adversarial Risk and Robustness: General Definitions and Implications
for the Uniform Distribution | Full version of a work with the same title that will appear in NIPS
2018, 31 pages containing 5 figures, 1 table, 2 algorithms | null | null | null | cs.LG cs.CC cs.CR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study adversarial perturbations when the instances are uniformly
distributed over $\{0,1\}^n$. We study both "inherent" bounds that apply to any
problem and any classifier for such a problem as well as bounds that apply to
specific problems and specific hypothesis classes.
As the current literature contains mult... | [
{
"created": "Mon, 29 Oct 2018 17:41:29 GMT",
"version": "v1"
}
] | 2018-10-30 | [
[
"Diochnos",
"Dimitrios I.",
""
],
[
"Mahloujifar",
"Saeed",
""
],
[
"Mahmoody",
"Mohammad",
""
]
] | We study adversarial perturbations when the instances are uniformly distributed over $\{0,1\}^n$. We study both "inherent" bounds that apply to any problem and any classifier for such a problem as well as bounds that apply to specific problems and specific hypothesis classes. As the current literature contains multiple... |
1906.09934 | Ioannis Chatzigiannakis | Chrysanthi Tziortzioti, Irene Mavrommati, Georgios Mylonas, Andrea
Vitaletti, Ioannis Chatzigiannakis | Scenarios for Educational and Game Activities using Internet of Things
Data | 14 pages, 5 figures. arXiv admin note: text overlap with
arXiv:1805.09561 | null | null | null | cs.HC cs.CY | http://creativecommons.org/licenses/by/4.0/ | Raising awareness among young people and changing their behavior and habits
concerning energy usage and the environment is key to achieving a sustainable
planet. The goal to address the global climate problem requires informing the
population on their roles in mitigation actions and adaptation of sustainable
behavior... | [
{
"created": "Thu, 20 Jun 2019 18:26:12 GMT",
"version": "v1"
}
] | 2019-06-25 | [
[
"Tziortzioti",
"Chrysanthi",
""
],
[
"Mavrommati",
"Irene",
""
],
[
"Mylonas",
"Georgios",
""
],
[
"Vitaletti",
"Andrea",
""
],
[
"Chatzigiannakis",
"Ioannis",
""
]
] | Raising awareness among young people and changing their behavior and habits concerning energy usage and the environment is key to achieving a sustainable planet. The goal to address the global climate problem requires informing the population on their roles in mitigation actions and adaptation of sustainable behaviors.... |
0804.2155 | Joseph Y. Halpern | Joseph Y. Halpern | From Qualitative to Quantitative Proofs of Security Properties Using
First-Order Conditional Logic | null | null | null | null | cs.CR cs.AI cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A first-order conditional logic is considered, with semantics given by a
variant of epsilon-semantics, where p -> q means that Pr(q | p) approaches 1
super-polynomially --faster than any inverse polynomial. This type of
convergence is needed for reasoning about security protocols. A complete
axiomatization is provide... | [
{
"created": "Mon, 14 Apr 2008 12:06:04 GMT",
"version": "v1"
}
] | 2008-12-18 | [
[
"Halpern",
"Joseph Y.",
""
]
] | A first-order conditional logic is considered, with semantics given by a variant of epsilon-semantics, where p -> q means that Pr(q | p) approaches 1 super-polynomially --faster than any inverse polynomial. This type of convergence is needed for reasoning about security protocols. A complete axiomatization is provided ... |
1911.11534 | Siyan Dong | Siyan Dong, Songyin Wu, Yixin Zhuang, Kai Xu, Shanghang Zhang, Baoquan
Chen | Decoupling Features and Coordinates for Few-shot RGB Relocalization | This is a very early initialization of a research project and
contains some out-of-date results and errors. A later version with
significant improvements has been published as a new paper. See
arXiv:2208.06933 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cross-scene model adaption is crucial for camera relocalization in real
scenarios. It is often preferable that a pre-learned model can be fast adapted
to a novel scene with as few training samples as possible. The existing
state-of-the-art approaches, however, can hardly support such few-shot scene
adaption due to th... | [
{
"created": "Tue, 26 Nov 2019 13:57:39 GMT",
"version": "v1"
},
{
"created": "Sat, 1 Aug 2020 17:49:36 GMT",
"version": "v2"
},
{
"created": "Tue, 4 Aug 2020 10:29:36 GMT",
"version": "v3"
},
{
"created": "Tue, 16 Aug 2022 15:40:00 GMT",
"version": "v4"
}
] | 2022-08-17 | [
[
"Dong",
"Siyan",
""
],
[
"Wu",
"Songyin",
""
],
[
"Zhuang",
"Yixin",
""
],
[
"Xu",
"Kai",
""
],
[
"Zhang",
"Shanghang",
""
],
[
"Chen",
"Baoquan",
""
]
] | Cross-scene model adaption is crucial for camera relocalization in real scenarios. It is often preferable that a pre-learned model can be fast adapted to a novel scene with as few training samples as possible. The existing state-of-the-art approaches, however, can hardly support such few-shot scene adaption due to the ... |
2010.13986 | Zhuqi Li | Zhuqi Li, Can Wu, Sigurd Wagner, James C. Sturm, Naveen Verma, Kyle
Jamieson | REITS: Reflective Surface for Intelligent Transportation Systems | null | null | 10.1145/3446382.3448650 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Autonomous vehicles are predicted to dominate the transportation industry in
the foreseeable future. Safety is one of the major challenges to the early
deployment of self-driving systems. To ensure safety, self-driving vehicles
must sense and detect humans, other vehicles, and road infrastructure
accurately, robustly... | [
{
"created": "Tue, 27 Oct 2020 01:45:09 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Nov 2020 15:57:35 GMT",
"version": "v2"
},
{
"created": "Tue, 2 Feb 2021 16:25:12 GMT",
"version": "v3"
}
] | 2021-02-03 | [
[
"Li",
"Zhuqi",
""
],
[
"Wu",
"Can",
""
],
[
"Wagner",
"Sigurd",
""
],
[
"Sturm",
"James C.",
""
],
[
"Verma",
"Naveen",
""
],
[
"Jamieson",
"Kyle",
""
]
] | Autonomous vehicles are predicted to dominate the transportation industry in the foreseeable future. Safety is one of the major challenges to the early deployment of self-driving systems. To ensure safety, self-driving vehicles must sense and detect humans, other vehicles, and road infrastructure accurately, robustly, ... |
1812.02428 | Sai Sri Sathya | Sai Sri Sathya, Praneeth Vepakomma, Ramesh Raskar, Ranjan Ramachandra
and Santanu Bhattacharya | A Review of Homomorphic Encryption Libraries for Secure Computation | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we provide a survey of various libraries for homomorphic
encryption. We describe key features and trade-offs that should be considered
while choosing the right approach for secure computation. We then present a
comparison of six commonly available Homomorphic Encryption libraries - SEAL,
HElib, TFHE, Pa... | [
{
"created": "Thu, 6 Dec 2018 09:55:24 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Dec 2018 06:06:35 GMT",
"version": "v2"
}
] | 2018-12-10 | [
[
"Sathya",
"Sai Sri",
""
],
[
"Vepakomma",
"Praneeth",
""
],
[
"Raskar",
"Ramesh",
""
],
[
"Ramachandra",
"Ranjan",
""
],
[
"Bhattacharya",
"Santanu",
""
]
] | In this paper we provide a survey of various libraries for homomorphic encryption. We describe key features and trade-offs that should be considered while choosing the right approach for secure computation. We then present a comparison of six commonly available Homomorphic Encryption libraries - SEAL, HElib, TFHE, Pail... |
2406.17636 | Alexander Gambashidze | Alexander Gambashidze, Anton Kulikov, Yuriy Sosnin, Ilya Makarov | Aligning Diffusion Models with Noise-Conditioned Perception | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Recent advancements in human preference optimization, initially developed for
Language Models (LMs), have shown promise for text-to-image Diffusion Models,
enhancing prompt alignment, visual appeal, and user preference. Unlike LMs,
Diffusion Models typically optimize in pixel or VAE space, which does not align
well w... | [
{
"created": "Tue, 25 Jun 2024 15:21:50 GMT",
"version": "v1"
}
] | 2024-06-26 | [
[
"Gambashidze",
"Alexander",
""
],
[
"Kulikov",
"Anton",
""
],
[
"Sosnin",
"Yuriy",
""
],
[
"Makarov",
"Ilya",
""
]
] | Recent advancements in human preference optimization, initially developed for Language Models (LMs), have shown promise for text-to-image Diffusion Models, enhancing prompt alignment, visual appeal, and user preference. Unlike LMs, Diffusion Models typically optimize in pixel or VAE space, which does not align well wit... |
2103.11874 | Zemin Sun | Zemin Sun, Yanheng Liu, Jian Wang, Guofa Li, Carie Anil, Keqiang Li,
Xinyu Guo, Geng Sun, Daxin Tian, Dongpu Cao | Applications of Game Theory in Vehicular Networks: A Survey | It has been published on "IEEE communications surveys and tutorials"
(https://ieeexplore.ieee.org/document/9524815) | IEEE Communications Surveys & Tutorials, vol. 23, no. 4, pp.
2660-2710, Fourthquarter 2021 | 10.1109/COMST.2021.3108466 | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the Internet of Things (IoT) era, vehicles and other intelligent
components in an intelligent transportation system (ITS) are connected, forming
Vehicular Networks (VNs) that provide efficient and secure traffic and
ubiquitous access to various applications. However, as the number of nodes in
ITS increases, it is ... | [
{
"created": "Mon, 22 Mar 2021 14:09:33 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Jan 2022 13:22:20 GMT",
"version": "v2"
}
] | 2022-01-06 | [
[
"Sun",
"Zemin",
""
],
[
"Liu",
"Yanheng",
""
],
[
"Wang",
"Jian",
""
],
[
"Li",
"Guofa",
""
],
[
"Anil",
"Carie",
""
],
[
"Li",
"Keqiang",
""
],
[
"Guo",
"Xinyu",
""
],
[
"Sun",
"Geng",
""
... | In the Internet of Things (IoT) era, vehicles and other intelligent components in an intelligent transportation system (ITS) are connected, forming Vehicular Networks (VNs) that provide efficient and secure traffic and ubiquitous access to various applications. However, as the number of nodes in ITS increases, it is ch... |
1701.08547 | Robert Lim | Robert V. Lim, Boyana Norris, Allen D. Malony | Autotuning GPU Kernels via Static and Predictive Analysis | null | null | null | null | cs.DC cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optimizing the performance of GPU kernels is challenging for both human
programmers and code generators. For example, CUDA programmers must set thread
and block parameters for a kernel, but might not have the intuition to make a
good choice. Similarly, compilers can generate working code, but may miss
tuning opportun... | [
{
"created": "Mon, 30 Jan 2017 11:23:42 GMT",
"version": "v1"
},
{
"created": "Thu, 11 May 2017 22:27:32 GMT",
"version": "v2"
},
{
"created": "Thu, 29 Jun 2017 11:25:02 GMT",
"version": "v3"
}
] | 2017-06-30 | [
[
"Lim",
"Robert V.",
""
],
[
"Norris",
"Boyana",
""
],
[
"Malony",
"Allen D.",
""
]
] | Optimizing the performance of GPU kernels is challenging for both human programmers and code generators. For example, CUDA programmers must set thread and block parameters for a kernel, but might not have the intuition to make a good choice. Similarly, compilers can generate working code, but may miss tuning opportunit... |
2010.12176 | Yuxi Li | Yuxi Li, Ning Xu, Jinlong Peng, John See, Weiyao Lin | Delving into the Cyclic Mechanism in Semi-supervised Video Object
Segmentation | 13 pages, 10 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we address several inadequacies of current video object
segmentation pipelines. Firstly, a cyclic mechanism is incorporated to the
standard semi-supervised process to produce more robust representations. By
relying on the accurate reference mask in the starting frame, we show that the
error propagation... | [
{
"created": "Fri, 23 Oct 2020 05:40:53 GMT",
"version": "v1"
}
] | 2020-10-26 | [
[
"Li",
"Yuxi",
""
],
[
"Xu",
"Ning",
""
],
[
"Peng",
"Jinlong",
""
],
[
"See",
"John",
""
],
[
"Lin",
"Weiyao",
""
]
] | In this paper, we address several inadequacies of current video object segmentation pipelines. Firstly, a cyclic mechanism is incorporated to the standard semi-supervised process to produce more robust representations. By relying on the accurate reference mask in the starting frame, we show that the error propagation p... |
1903.07840 | John Skinner | John Skinner, David Hall, Haoyang Zhang, Feras Dayoub, Niko
S\"underhauf | The Probabilistic Object Detection Challenge | 4 pages, workshop paper | null | null | null | cs.RO cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a new challenge for computer and robotic vision, the first ACRV
Robotic Vision Challenge, Probabilistic Object Detection. Probabilistic object
detection is a new variation on traditional object detection tasks, requiring
estimates of spatial and semantic uncertainty. We extend the traditional
bounding bo... | [
{
"created": "Tue, 19 Mar 2019 05:18:52 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Apr 2019 00:58:24 GMT",
"version": "v2"
}
] | 2019-04-09 | [
[
"Skinner",
"John",
""
],
[
"Hall",
"David",
""
],
[
"Zhang",
"Haoyang",
""
],
[
"Dayoub",
"Feras",
""
],
[
"Sünderhauf",
"Niko",
""
]
] | We introduce a new challenge for computer and robotic vision, the first ACRV Robotic Vision Challenge, Probabilistic Object Detection. Probabilistic object detection is a new variation on traditional object detection tasks, requiring estimates of spatial and semantic uncertainty. We extend the traditional bounding box ... |
1808.04510 | Kanstantsin Pashkovich | Robert Chiang and Kanstantsin Pashkovich | On the approximability of the stable matching problem with ties of size
two | Added a detailed comparison with the approaches from the papers "On
the approximability of the stable marriage problem with one-sided ties." by
Bauckholt, Pashkovich, and Sanita and "Improved approximation algorithms for
two variants of the stable marriage problem with ties." by Huang and Kavitha.
(See Appendix... | null | null | null | cs.GT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The stable matching problem is one of the central problems of algorithmic
game theory. If participants are allowed to have ties, the problem of finding a
stable matching of maximum cardinality is an NP-hard problem, even when the
ties are of size two. Moreover, in this setting it is UGC-hard to provide an
approximati... | [
{
"created": "Tue, 14 Aug 2018 02:47:05 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Feb 2019 21:59:31 GMT",
"version": "v2"
}
] | 2019-02-19 | [
[
"Chiang",
"Robert",
""
],
[
"Pashkovich",
"Kanstantsin",
""
]
] | The stable matching problem is one of the central problems of algorithmic game theory. If participants are allowed to have ties, the problem of finding a stable matching of maximum cardinality is an NP-hard problem, even when the ties are of size two. Moreover, in this setting it is UGC-hard to provide an approximation... |
1603.00977 | EPTCS | Mahdi Amani (Universit\`a di Pisa, Pisa, Italy), Abbas Nowzari-Dalini
(UT, Tehran, Iran) | Generation, Ranking and Unranking of Ordered Trees with Degree Bounds | In Proceedings DCM 2015, arXiv:1603.00536 | EPTCS 204, 2016, pp. 31-45 | 10.4204/EPTCS.204.4 | null | cs.CC cs.DM cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of generating, ranking and unranking of unlabeled
ordered trees whose nodes have maximum degree of $\Delta$. This class of trees
represents a generalization of chemical trees. A chemical tree is an unlabeled
tree in which no node has degree greater than 4. By allowing up to $\Delta$
children for ... | [
{
"created": "Thu, 3 Mar 2016 05:33:50 GMT",
"version": "v1"
}
] | 2016-08-22 | [
[
"Amani",
"Mahdi",
"",
"Università di Pisa, Pisa, Italy"
],
[
"Nowzari-Dalini",
"Abbas",
"",
"UT, Tehran, Iran"
]
] | We study the problem of generating, ranking and unranking of unlabeled ordered trees whose nodes have maximum degree of $\Delta$. This class of trees represents a generalization of chemical trees. A chemical tree is an unlabeled tree in which no node has degree greater than 4. By allowing up to $\Delta$ children for ea... |
2005.14253 | Nicholas FitzGerald | Thibault F\'evry, Nicholas FitzGerald, Livio Baldini Soares, Tom
Kwiatkowski | Empirical Evaluation of Pretraining Strategies for Supervised Entity
Linking | 11 pages, 8 figures, appearing at AKBC 2020 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we present an entity linking model which combines a Transformer
architecture with large scale pretraining from Wikipedia links. Our model
achieves the state-of-the-art on two commonly used entity linking datasets:
96.7% on CoNLL and 94.9% on TAC-KBP. We present detailed analyses to understand
what desig... | [
{
"created": "Thu, 28 May 2020 19:32:52 GMT",
"version": "v1"
}
] | 2020-06-01 | [
[
"Févry",
"Thibault",
""
],
[
"FitzGerald",
"Nicholas",
""
],
[
"Soares",
"Livio Baldini",
""
],
[
"Kwiatkowski",
"Tom",
""
]
] | In this work, we present an entity linking model which combines a Transformer architecture with large scale pretraining from Wikipedia links. Our model achieves the state-of-the-art on two commonly used entity linking datasets: 96.7% on CoNLL and 94.9% on TAC-KBP. We present detailed analyses to understand what design ... |
2406.12746 | Miaoyu Li | Miaoyu Li, Haoxin Li, Zilin Du, and Boyang Li | Rationale-based Ensemble of Multiple QA Strategies for Zero-shot
Knowledge-based VQA | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge-based Visual Qustion-answering (K-VQA) necessitates the use of
background knowledge beyond what is depicted in the image. Current zero-shot
K-VQA methods usually translate an image to a single type of textual decision
context and use a text-based model to answer the question based on it, which
conflicts wit... | [
{
"created": "Tue, 18 Jun 2024 16:06:38 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Jun 2024 02:02:13 GMT",
"version": "v2"
},
{
"created": "Sun, 23 Jun 2024 03:06:42 GMT",
"version": "v3"
}
] | 2024-06-25 | [
[
"Li",
"Miaoyu",
""
],
[
"Li",
"Haoxin",
""
],
[
"Du",
"Zilin",
""
],
[
"Li",
"Boyang",
""
]
] | Knowledge-based Visual Qustion-answering (K-VQA) necessitates the use of background knowledge beyond what is depicted in the image. Current zero-shot K-VQA methods usually translate an image to a single type of textual decision context and use a text-based model to answer the question based on it, which conflicts with ... |
1412.8501 | Eli A. Meirom | Eli A. Meirom, Shie Mannor, Ariel Orda | Formation Games of Reliable Networks | null | null | null | null | cs.GT cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We establish a network formation game for the Internet's Autonomous System
(AS) interconnection topology. The game includes different types of players,
accounting for the heterogeneity of ASs in the Internet. We incorporate
reliability considerations in the player's utility function, and analyze static
properties of ... | [
{
"created": "Mon, 29 Dec 2014 22:38:53 GMT",
"version": "v1"
}
] | 2014-12-31 | [
[
"Meirom",
"Eli A.",
""
],
[
"Mannor",
"Shie",
""
],
[
"Orda",
"Ariel",
""
]
] | We establish a network formation game for the Internet's Autonomous System (AS) interconnection topology. The game includes different types of players, accounting for the heterogeneity of ASs in the Internet. We incorporate reliability considerations in the player's utility function, and analyze static properties of th... |
1410.4207 | Claudio Criscione | Enrico Bazzoli, Claudio Criscione, Federico Maggi, Stefano Zanero | XSS Peeker: A Systematic Analysis of Cross-site Scripting Vulnerability
Scanners | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Since the first publication of the "OWASP Top 10" (2004), cross-site
scripting (XSS) vulnerabilities have always been among the top 5 web
application security bugs. Black-box vulnerability scanners are widely used in
the industry to reproduce (XSS) attacks automatically. In spite of the
technical sophistication and a... | [
{
"created": "Wed, 15 Oct 2014 20:03:07 GMT",
"version": "v1"
}
] | 2014-10-17 | [
[
"Bazzoli",
"Enrico",
""
],
[
"Criscione",
"Claudio",
""
],
[
"Maggi",
"Federico",
""
],
[
"Zanero",
"Stefano",
""
]
] | Since the first publication of the "OWASP Top 10" (2004), cross-site scripting (XSS) vulnerabilities have always been among the top 5 web application security bugs. Black-box vulnerability scanners are widely used in the industry to reproduce (XSS) attacks automatically. In spite of the technical sophistication and adv... |
2001.04484 | Luca Papariello | Luca Papariello, Alexandros Bampoulidis, Mihai Lupu | On the Replicability of Combining Word Embeddings and Retrieval Models | null | null | null | null | cs.CL cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We replicate recent experiments attempting to demonstrate an attractive
hypothesis about the use of the Fisher kernel framework and mixture models for
aggregating word embeddings towards document representations and the use of
these representations in document classification, clustering, and retrieval.
Specifically, ... | [
{
"created": "Mon, 13 Jan 2020 19:01:07 GMT",
"version": "v1"
}
] | 2020-01-15 | [
[
"Papariello",
"Luca",
""
],
[
"Bampoulidis",
"Alexandros",
""
],
[
"Lupu",
"Mihai",
""
]
] | We replicate recent experiments attempting to demonstrate an attractive hypothesis about the use of the Fisher kernel framework and mixture models for aggregating word embeddings towards document representations and the use of these representations in document classification, clustering, and retrieval. Specifically, th... |
2403.09547 | Jo\~ao Helis Bernardo | Jo\~ao Helis Bernardo, Daniel Alencar da Costa, S\'ergio Queiroz de
Medeiros, Uir\'a Kulesza | How do Machine Learning Projects use Continuous Integration Practices?
An Empirical Study on GitHub Actions | 10 pages, Mining Software Repositories, MSR 2024 | null | null | null | cs.SE cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Continuous Integration (CI) is a well-established practice in traditional
software development, but its nuances in the domain of Machine Learning (ML)
projects remain relatively unexplored. Given the distinctive nature of ML
development, understanding how CI practices are adopted in this context is
crucial for tailor... | [
{
"created": "Thu, 14 Mar 2024 16:35:39 GMT",
"version": "v1"
}
] | 2024-03-15 | [
[
"Bernardo",
"João Helis",
""
],
[
"da Costa",
"Daniel Alencar",
""
],
[
"de Medeiros",
"Sérgio Queiroz",
""
],
[
"Kulesza",
"Uirá",
""
]
] | Continuous Integration (CI) is a well-established practice in traditional software development, but its nuances in the domain of Machine Learning (ML) projects remain relatively unexplored. Given the distinctive nature of ML development, understanding how CI practices are adopted in this context is crucial for tailorin... |
1902.09103 | Tianwei Shen | Tianwei Shen, Zixin Luo, Lei Zhou, Hanyu Deng, Runze Zhang, Tian Fang,
Long Quan | Beyond Photometric Loss for Self-Supervised Ego-Motion Estimation | Accepted by ICRA 2019 | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accurate relative pose is one of the key components in visual odometry (VO)
and simultaneous localization and mapping (SLAM). Recently, the self-supervised
learning framework that jointly optimizes the relative pose and target image
depth has attracted the attention of the community. Previous works rely on the
photom... | [
{
"created": "Mon, 25 Feb 2019 06:22:52 GMT",
"version": "v1"
}
] | 2019-02-26 | [
[
"Shen",
"Tianwei",
""
],
[
"Luo",
"Zixin",
""
],
[
"Zhou",
"Lei",
""
],
[
"Deng",
"Hanyu",
""
],
[
"Zhang",
"Runze",
""
],
[
"Fang",
"Tian",
""
],
[
"Quan",
"Long",
""
]
] | Accurate relative pose is one of the key components in visual odometry (VO) and simultaneous localization and mapping (SLAM). Recently, the self-supervised learning framework that jointly optimizes the relative pose and target image depth has attracted the attention of the community. Previous works rely on the photomet... |
2305.19157 | Reza Faieghi | S. Mohammadreza Ebrahimi, Farid Norouzi, Hossein Dastres, Reza
Faieghi, Mehdi Naderi, Milad Malekzadeh | Sensor Fault Detection and Compensation with Performance Prescription
for Robotic Manipulators | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper focuses on sensor fault detection and compensation for robotic
manipulators. The proposed method features a new adaptive observer and a new
terminal sliding mode control law established on a second-order integral
sliding surface. The method enables sensor fault detection without the need to
know the bounds... | [
{
"created": "Tue, 30 May 2023 15:58:56 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Mar 2024 01:09:34 GMT",
"version": "v2"
}
] | 2024-03-20 | [
[
"Ebrahimi",
"S. Mohammadreza",
""
],
[
"Norouzi",
"Farid",
""
],
[
"Dastres",
"Hossein",
""
],
[
"Faieghi",
"Reza",
""
],
[
"Naderi",
"Mehdi",
""
],
[
"Malekzadeh",
"Milad",
""
]
] | This paper focuses on sensor fault detection and compensation for robotic manipulators. The proposed method features a new adaptive observer and a new terminal sliding mode control law established on a second-order integral sliding surface. The method enables sensor fault detection without the need to know the bounds o... |
2102.11649 | Rafa\"el Bocquet | Rafa\"el Bocquet and Ambrus Kaposi and Christian Sattler | Relative induction principles for type theories | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present new induction principles for the syntax of dependent type
theories, which we call relative induction principles. The result of the
induction principle relative to a functor F into the syntax is stable over the
codomain of F. We rely on the internal language of presheaf categories. In
order to combine the i... | [
{
"created": "Tue, 23 Feb 2021 12:08:25 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Jul 2021 12:42:20 GMT",
"version": "v2"
}
] | 2021-07-20 | [
[
"Bocquet",
"Rafaël",
""
],
[
"Kaposi",
"Ambrus",
""
],
[
"Sattler",
"Christian",
""
]
] | We present new induction principles for the syntax of dependent type theories, which we call relative induction principles. The result of the induction principle relative to a functor F into the syntax is stable over the codomain of F. We rely on the internal language of presheaf categories. In order to combine the int... |
1811.05233 | Yuichi Kageyama | Hiroaki Mikami, Hisahiro Suganuma, Pongsakorn U-chupala, Yoshiki
Tanaka and Yuichi Kageyama | Massively Distributed SGD: ImageNet/ResNet-50 Training in a Flash | null | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scaling the distributed deep learning to a massive GPU cluster level is
challenging due to the instability of the large mini-batch training and the
overhead of the gradient synchronization. We address the instability of the
large mini-batch training with batch-size control and label smoothing. We
address the overhead... | [
{
"created": "Tue, 13 Nov 2018 11:52:04 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Mar 2019 09:18:09 GMT",
"version": "v2"
}
] | 2019-03-06 | [
[
"Mikami",
"Hiroaki",
""
],
[
"Suganuma",
"Hisahiro",
""
],
[
"U-chupala",
"Pongsakorn",
""
],
[
"Tanaka",
"Yoshiki",
""
],
[
"Kageyama",
"Yuichi",
""
]
] | Scaling the distributed deep learning to a massive GPU cluster level is challenging due to the instability of the large mini-batch training and the overhead of the gradient synchronization. We address the instability of the large mini-batch training with batch-size control and label smoothing. We address the overhead o... |
2401.02636 | Haitao Wang | Haitao Wang | Algorithms for Computing Closest Points for Segments | Accepted to STACS 2024 | null | null | null | cs.CG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a set $P$ of $n$ points and a set $S$ of $n$ segments in the plane, we
consider the problem of computing for each segment of $S$ its closest point in
$P$. The previously best algorithm solves the problem in
$n^{4/3}2^{O(\log^*n)}$ time [Bespamyatnikh, 2003] and a lower bound (under a
somewhat restricted model) ... | [
{
"created": "Fri, 5 Jan 2024 04:56:22 GMT",
"version": "v1"
}
] | 2024-01-08 | [
[
"Wang",
"Haitao",
""
]
] | Given a set $P$ of $n$ points and a set $S$ of $n$ segments in the plane, we consider the problem of computing for each segment of $S$ its closest point in $P$. The previously best algorithm solves the problem in $n^{4/3}2^{O(\log^*n)}$ time [Bespamyatnikh, 2003] and a lower bound (under a somewhat restricted model) $\... |
2303.12594 | Jie Luo | Jie Luo, Carlo Longhi and Agoston E. Eiben | A Comparative Study of Brain Reproduction Methods for Morphologically
Evolving Robots | 8 pages, ALife | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | In the most extensive robot evolution systems, both the bodies and the brains
of the robots undergo evolution and the brains of 'infant' robots are also
optimized by a learning process immediately after 'birth'. This paper is
concerned with the brain evolution mechanism in such a system. In particular,
we compare fou... | [
{
"created": "Wed, 22 Mar 2023 14:31:52 GMT",
"version": "v1"
},
{
"created": "Mon, 29 May 2023 07:23:32 GMT",
"version": "v2"
},
{
"created": "Tue, 30 May 2023 12:01:04 GMT",
"version": "v3"
}
] | 2023-05-31 | [
[
"Luo",
"Jie",
""
],
[
"Longhi",
"Carlo",
""
],
[
"Eiben",
"Agoston E.",
""
]
] | In the most extensive robot evolution systems, both the bodies and the brains of the robots undergo evolution and the brains of 'infant' robots are also optimized by a learning process immediately after 'birth'. This paper is concerned with the brain evolution mechanism in such a system. In particular, we compare four ... |
2401.13656 | Federico Cinus | Ernesto Colacrai, Federico Cinus, Gianmarco De Francisci Morales,
Michele Starnini | Navigating Multidimensional Ideologies with Reddit's Political Compass:
Economic Conflict and Social Affinity | null | null | null | null | cs.SI cs.CY physics.soc-ph stat.AP | http://creativecommons.org/licenses/by/4.0/ | The prevalent perspective in quantitative research on opinion dynamics
flattens the landscape of the online political discourse into a traditional
left--right dichotomy. While this approach helps simplify the analysis and
modeling effort, it also neglects the intrinsic multidimensional richness of
ideologies. In this... | [
{
"created": "Wed, 24 Jan 2024 18:49:19 GMT",
"version": "v1"
}
] | 2024-01-25 | [
[
"Colacrai",
"Ernesto",
""
],
[
"Cinus",
"Federico",
""
],
[
"Morales",
"Gianmarco De Francisci",
""
],
[
"Starnini",
"Michele",
""
]
] | The prevalent perspective in quantitative research on opinion dynamics flattens the landscape of the online political discourse into a traditional left--right dichotomy. While this approach helps simplify the analysis and modeling effort, it also neglects the intrinsic multidimensional richness of ideologies. In this s... |
1807.06958 | Dimitar Nikolov | Dimitar Nikolov and Mounia Lalmas and Alessandro Flammini and Filippo
Menczer | Quantifying Biases in Online Information Exposure | 25 pages, 10 figures, to appear in the Journal of the Association for
Information Science and Technology (JASIST) | JASIST 70 (3): 218-229, 2019 | 10.1002/asi.24121 | null | cs.SI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Our consumption of online information is mediated by filtering, ranking, and
recommendation algorithms that introduce unintentional biases as they attempt
to deliver relevant and engaging content. It has been suggested that our
reliance on online technologies such as search engines and social media may
limit exposure... | [
{
"created": "Wed, 18 Jul 2018 14:19:49 GMT",
"version": "v1"
}
] | 2020-10-07 | [
[
"Nikolov",
"Dimitar",
""
],
[
"Lalmas",
"Mounia",
""
],
[
"Flammini",
"Alessandro",
""
],
[
"Menczer",
"Filippo",
""
]
] | Our consumption of online information is mediated by filtering, ranking, and recommendation algorithms that introduce unintentional biases as they attempt to deliver relevant and engaging content. It has been suggested that our reliance on online technologies such as search engines and social media may limit exposure t... |
2406.02034 | Soha Hussein | Soha Hussein, Stephen McCamant, Mike Whalen | Generator-Based Fuzzers with Type-Based Targeted Mutation | Fixing rendering of figure | null | null | null | cs.SE | http://creativecommons.org/licenses/by-sa/4.0/ | As with any fuzzer, directing Generator-Based Fuzzers (GBF) to reach
particular code targets can increase the fuzzer's effectiveness. In previous
work, coverage-guided fuzzers used a mix of static analysis, taint analysis,
and constraint-solving approaches to address this problem. However, none of
these techniques we... | [
{
"created": "Tue, 4 Jun 2024 07:20:13 GMT",
"version": "v1"
},
{
"created": "Wed, 12 Jun 2024 07:32:41 GMT",
"version": "v2"
}
] | 2024-06-13 | [
[
"Hussein",
"Soha",
""
],
[
"McCamant",
"Stephen",
""
],
[
"Whalen",
"Mike",
""
]
] | As with any fuzzer, directing Generator-Based Fuzzers (GBF) to reach particular code targets can increase the fuzzer's effectiveness. In previous work, coverage-guided fuzzers used a mix of static analysis, taint analysis, and constraint-solving approaches to address this problem. However, none of these techniques were... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.