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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1107.0088 | Marcel de Carli Silva | Marcel K. de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato | Sparse Sums of Positive Semidefinite Matrices | null | null | 10.1145/2746241 | null | cs.DM cs.DS cs.NA math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently there has been much interest in "sparsifying" sums of rank one
matrices: modifying the coefficients such that only a few are nonzero, while
approximately preserving the matrix that results from the sum. Results of this
sort have found applications in many different areas, including sparsifying
graphs. In thi... | [
{
"created": "Fri, 1 Jul 2011 00:36:03 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Oct 2011 03:50:03 GMT",
"version": "v2"
}
] | 2018-01-30 | [
[
"Silva",
"Marcel K. de Carli",
""
],
[
"Harvey",
"Nicholas J. A.",
""
],
[
"Sato",
"Cristiane M.",
""
]
] | Recently there has been much interest in "sparsifying" sums of rank one matrices: modifying the coefficients such that only a few are nonzero, while approximately preserving the matrix that results from the sum. Results of this sort have found applications in many different areas, including sparsifying graphs. In this ... |
2401.10228 | Xiangtai Li Dr | Shilin Xu, Haobo Yuan, Qingyu Shi, Lu Qi, Jingbo Wang, Yibo Yang,
Yining Li, Kai Chen, Yunhai Tong, Bernard Ghanem, Xiangtai Li, Ming-Hsuan
Yang | RAP-SAM: Towards Real-Time All-Purpose Segment Anything | Project Page: https://xushilin1.github.io/rap_sam/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Advanced by transformer architecture, vision foundation models (VFMs) achieve
remarkable progress in performance and generalization ability. Segment Anything
Model (SAM) is one remarkable model that can achieve generalized segmentation.
However, most VFMs cannot run in realtime, which makes it difficult to transfer
t... | [
{
"created": "Thu, 18 Jan 2024 18:59:30 GMT",
"version": "v1"
}
] | 2024-01-19 | [
[
"Xu",
"Shilin",
""
],
[
"Yuan",
"Haobo",
""
],
[
"Shi",
"Qingyu",
""
],
[
"Qi",
"Lu",
""
],
[
"Wang",
"Jingbo",
""
],
[
"Yang",
"Yibo",
""
],
[
"Li",
"Yining",
""
],
[
"Chen",
"Kai",
""
],... | Advanced by transformer architecture, vision foundation models (VFMs) achieve remarkable progress in performance and generalization ability. Segment Anything Model (SAM) is one remarkable model that can achieve generalized segmentation. However, most VFMs cannot run in realtime, which makes it difficult to transfer the... |
2212.08290 | Ambrish Rawat | Ambrish Rawat, Giulio Zizzo, Swanand Kadhe, Jonathan P. Epperlein,
Stefano Braghin | Robust Learning Protocol for Federated Tumor Segmentation Challenge | 14 pages, 2 figures, 3 tables | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | In this work, we devise robust and efficient learning protocols for
orchestrating a Federated Learning (FL) process for the Federated Tumor
Segmentation Challenge (FeTS 2022). Enabling FL for FeTS setup is challenging
mainly due to data heterogeneity among collaborators and communication cost of
training. To tackle t... | [
{
"created": "Fri, 16 Dec 2022 05:51:52 GMT",
"version": "v1"
}
] | 2022-12-19 | [
[
"Rawat",
"Ambrish",
""
],
[
"Zizzo",
"Giulio",
""
],
[
"Kadhe",
"Swanand",
""
],
[
"Epperlein",
"Jonathan P.",
""
],
[
"Braghin",
"Stefano",
""
]
] | In this work, we devise robust and efficient learning protocols for orchestrating a Federated Learning (FL) process for the Federated Tumor Segmentation Challenge (FeTS 2022). Enabling FL for FeTS setup is challenging mainly due to data heterogeneity among collaborators and communication cost of training. To tackle the... |
1507.05463 | Robert Ganian | Eduard Eiben and Robert Ganian and Stefan Szeider | Solving Problems on Graphs of High Rank-Width | Accepted at WADS 2015 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A modulator of a graph G to a specified graph class H is a set of vertices
whose deletion puts G into H. The cardinality of a modulator to various
tractable graph classes has long been used as a structural parameter which can
be exploited to obtain FPT algorithms for a range of hard problems. Here we
investigate what... | [
{
"created": "Mon, 20 Jul 2015 12:17:26 GMT",
"version": "v1"
}
] | 2015-07-21 | [
[
"Eiben",
"Eduard",
""
],
[
"Ganian",
"Robert",
""
],
[
"Szeider",
"Stefan",
""
]
] | A modulator of a graph G to a specified graph class H is a set of vertices whose deletion puts G into H. The cardinality of a modulator to various tractable graph classes has long been used as a structural parameter which can be exploited to obtain FPT algorithms for a range of hard problems. Here we investigate what h... |
1608.06469 | Jerome Darmont | Ayb\"uk\"e Ozt\"urk (ERIC,ARAR), Louis Eyango (ARAR), Sylvie Yona
Waksman (ARAR), St\'ephane Lallich (ERIC), J\'er\^ome Darmont (ERIC) | Warehousing Complex Archaeological Objects | 9th International and Interdisciplinary Conference on Modeling and
Using Context (CONTEXT 2015), Nov 2015, Larnaca, Cyprus. Springer,
Proceedings of the 9th International and Interdisciplinary Conference on
Modeling and Using Context (CONTEXT 2015), 9405, pp.226-239, 2015, Lecture
Notes in Artificial Intelligen... | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data organization is a difficult and essential component in cultural heritage
applications. Over the years, a great amount of archaeological ceramic data
have been created and processed by various methods and devices. Such ceramic
data are stored in databases that concur to increase the amount of available
informatio... | [
{
"created": "Tue, 23 Aug 2016 11:30:48 GMT",
"version": "v1"
}
] | 2016-08-24 | [
[
"Oztürk",
"Aybükë",
"",
"ERIC,ARAR"
],
[
"Eyango",
"Louis",
"",
"ARAR"
],
[
"Waksman",
"Sylvie Yona",
"",
"ARAR"
],
[
"Lallich",
"Stéphane",
"",
"ERIC"
],
[
"Darmont",
"Jérôme",
"",
"ERIC"
]
] | Data organization is a difficult and essential component in cultural heritage applications. Over the years, a great amount of archaeological ceramic data have been created and processed by various methods and devices. Such ceramic data are stored in databases that concur to increase the amount of available information ... |
1701.07274 | Yuxi Li | Yuxi Li | Deep Reinforcement Learning: An Overview | Please see Deep Reinforcement Learning, arXiv:1810.06339, for a
significant update | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give an overview of recent exciting achievements of deep reinforcement
learning (RL). We discuss six core elements, six important mechanisms, and
twelve applications. We start with background of machine learning, deep
learning and reinforcement learning. Next we discuss core RL elements,
including value function, ... | [
{
"created": "Wed, 25 Jan 2017 11:52:11 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Jan 2017 16:38:08 GMT",
"version": "v2"
},
{
"created": "Sat, 15 Jul 2017 01:49:43 GMT",
"version": "v3"
},
{
"created": "Sun, 3 Sep 2017 12:39:11 GMT",
"version": "v4"
},
{
"cr... | 2018-11-27 | [
[
"Li",
"Yuxi",
""
]
] | We give an overview of recent exciting achievements of deep reinforcement learning (RL). We discuss six core elements, six important mechanisms, and twelve applications. We start with background of machine learning, deep learning and reinforcement learning. Next we discuss core RL elements, including value function, in... |
2211.06163 | Longbin Yan | Longbin Yan, Yunxiao Qin, Shumin Liu, Jie Chen | Dual Complementary Dynamic Convolution for Image Recognition | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As a powerful engine, vanilla convolution has promoted huge breakthroughs in
various computer tasks. However, it often suffers from sample and content
agnostic problems, which limits the representation capacities of the
convolutional neural networks (CNNs). In this paper, we for the first time
model the scene feature... | [
{
"created": "Fri, 11 Nov 2022 12:32:12 GMT",
"version": "v1"
}
] | 2022-11-14 | [
[
"Yan",
"Longbin",
""
],
[
"Qin",
"Yunxiao",
""
],
[
"Liu",
"Shumin",
""
],
[
"Chen",
"Jie",
""
]
] | As a powerful engine, vanilla convolution has promoted huge breakthroughs in various computer tasks. However, it often suffers from sample and content agnostic problems, which limits the representation capacities of the convolutional neural networks (CNNs). In this paper, we for the first time model the scene features ... |
1611.07119 | Chongxuan Li | Chongxuan Li and Jun Zhu and Bo Zhang | Max-Margin Deep Generative Models for (Semi-)Supervised Learning | arXiv admin note: substantial text overlap with arXiv:1504.06787 | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep generative models (DGMs) are effective on learning multilayered
representations of complex data and performing inference of input data by
exploring the generative ability. However, it is relatively insufficient to
empower the discriminative ability of DGMs on making accurate predictions. This
paper presents max-... | [
{
"created": "Tue, 22 Nov 2016 01:36:29 GMT",
"version": "v1"
}
] | 2016-11-23 | [
[
"Li",
"Chongxuan",
""
],
[
"Zhu",
"Jun",
""
],
[
"Zhang",
"Bo",
""
]
] | Deep generative models (DGMs) are effective on learning multilayered representations of complex data and performing inference of input data by exploring the generative ability. However, it is relatively insufficient to empower the discriminative ability of DGMs on making accurate predictions. This paper presents max-ma... |
2310.18979 | Henrik Leopold | Jan Mendling, Henrik Leopold, Henning Meyerhenke, Beno\^it Depaire | Methodology of Algorithm Engineering | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Research on algorithms has drastically increased in recent years. Various
sub-disciplines of computer science investigate algorithms according to
different objectives and standards. This plurality of the field has led to
various methodological advances that have not yet been transferred to
neighboring sub-disciplines... | [
{
"created": "Sun, 29 Oct 2023 11:14:02 GMT",
"version": "v1"
}
] | 2023-10-31 | [
[
"Mendling",
"Jan",
""
],
[
"Leopold",
"Henrik",
""
],
[
"Meyerhenke",
"Henning",
""
],
[
"Depaire",
"Benoît",
""
]
] | Research on algorithms has drastically increased in recent years. Various sub-disciplines of computer science investigate algorithms according to different objectives and standards. This plurality of the field has led to various methodological advances that have not yet been transferred to neighboring sub-disciplines. ... |
0804.1083 | Ambedkar Dukkipati | Ambedkar Dukkipati | Towards algebraic methods for maximum entropy estimation | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that various formulations (e.g., dual and Kullback-Csiszar
iterations) of estimation of maximum entropy (ME) models can be transformed to
solving systems of polynomial equations in several variables for which one can
use celebrated Grobner bases methods. Posing of ME estimation as solving
polynomial equations... | [
{
"created": "Mon, 7 Apr 2008 17:09:00 GMT",
"version": "v1"
}
] | 2008-04-08 | [
[
"Dukkipati",
"Ambedkar",
""
]
] | We show that various formulations (e.g., dual and Kullback-Csiszar iterations) of estimation of maximum entropy (ME) models can be transformed to solving systems of polynomial equations in several variables for which one can use celebrated Grobner bases methods. Posing of ME estimation as solving polynomial equations i... |
2102.04448 | Valentin Khrulkov | Valentin Khrulkov, Artem Babenko, Ivan Oseledets | Functional Space Analysis of Local GAN Convergence | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work demonstrated the benefits of studying continuous-time dynamics
governing the GAN training. However, this dynamics is analyzed in the model
parameter space, which results in finite-dimensional dynamical systems. We
propose a novel perspective where we study the local dynamics of adversarial
training in the... | [
{
"created": "Mon, 8 Feb 2021 18:59:46 GMT",
"version": "v1"
}
] | 2021-02-09 | [
[
"Khrulkov",
"Valentin",
""
],
[
"Babenko",
"Artem",
""
],
[
"Oseledets",
"Ivan",
""
]
] | Recent work demonstrated the benefits of studying continuous-time dynamics governing the GAN training. However, this dynamics is analyzed in the model parameter space, which results in finite-dimensional dynamical systems. We propose a novel perspective where we study the local dynamics of adversarial training in the g... |
2402.10211 | Raunaq Mahesh Bhirangi | Raunaq Bhirangi, Chenyu Wang, Venkatesh Pattabiraman, Carmel Majidi,
Abhinav Gupta, Tess Hellebrekers, Lerrel Pinto | Hierarchical State Space Models for Continuous Sequence-to-Sequence
Modeling | null | null | null | null | cs.LG cs.RO eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reasoning from sequences of raw sensory data is a ubiquitous problem across
fields ranging from medical devices to robotics. These problems often involve
using long sequences of raw sensor data (e.g. magnetometers, piezoresistors) to
predict sequences of desirable physical quantities (e.g. force, inertial
measurement... | [
{
"created": "Thu, 15 Feb 2024 18:59:43 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Jul 2024 08:38:41 GMT",
"version": "v2"
},
{
"created": "Wed, 31 Jul 2024 21:17:43 GMT",
"version": "v3"
}
] | 2024-08-02 | [
[
"Bhirangi",
"Raunaq",
""
],
[
"Wang",
"Chenyu",
""
],
[
"Pattabiraman",
"Venkatesh",
""
],
[
"Majidi",
"Carmel",
""
],
[
"Gupta",
"Abhinav",
""
],
[
"Hellebrekers",
"Tess",
""
],
[
"Pinto",
"Lerrel",
""
]... | Reasoning from sequences of raw sensory data is a ubiquitous problem across fields ranging from medical devices to robotics. These problems often involve using long sequences of raw sensor data (e.g. magnetometers, piezoresistors) to predict sequences of desirable physical quantities (e.g. force, inertial measurements)... |
2302.12148 | Yunyu Huang | Yunyu Huang, Yani Feng, Qifeng Liao | Streaming data recovery via Bayesian tensor train decomposition | null | null | null | null | cs.LG math.ST stat.ML stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study a Bayesian tensor train (TT) decomposition method to
recover streaming data by approximating the latent structure in high-order
streaming data. Drawing on the streaming variational Bayes method, we introduce
the TT format into Bayesian tensor decomposition methods for streaming data,
and formu... | [
{
"created": "Thu, 23 Feb 2023 16:32:31 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Feb 2024 09:32:02 GMT",
"version": "v2"
}
] | 2024-02-29 | [
[
"Huang",
"Yunyu",
""
],
[
"Feng",
"Yani",
""
],
[
"Liao",
"Qifeng",
""
]
] | In this paper, we study a Bayesian tensor train (TT) decomposition method to recover streaming data by approximating the latent structure in high-order streaming data. Drawing on the streaming variational Bayes method, we introduce the TT format into Bayesian tensor decomposition methods for streaming data, and formula... |
1912.02628 | Song Fang | Song Fang, Quanyan Zhu | Fundamental Limitations in Sequential Prediction and Recursive
Algorithms: $\mathcal{L}_{p}$ Bounds via an Entropic Analysis | arXiv admin note: substantial text overlap with arXiv:1910.06742.
text overlap with arXiv:1912.05541 | null | null | null | cs.LG cs.IT eess.SP math.IT math.ST stat.ML stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we obtain fundamental $\mathcal{L}_{p}$ bounds in sequential
prediction and recursive algorithms via an entropic analysis. Both classes of
problems are examined by investigating the underlying entropic relationships of
the data and/or noises involved, and the derived lower bounds may all be
quantified ... | [
{
"created": "Tue, 3 Dec 2019 16:52:15 GMT",
"version": "v1"
},
{
"created": "Tue, 11 May 2021 15:56:59 GMT",
"version": "v2"
}
] | 2021-05-12 | [
[
"Fang",
"Song",
""
],
[
"Zhu",
"Quanyan",
""
]
] | In this paper, we obtain fundamental $\mathcal{L}_{p}$ bounds in sequential prediction and recursive algorithms via an entropic analysis. Both classes of problems are examined by investigating the underlying entropic relationships of the data and/or noises involved, and the derived lower bounds may all be quantified in... |
2303.05429 | Isadora Cardoso-Pereira | Isadora Cardoso-Pereira, Geraldo Gomes, Danilo Monteiro Ribeiro,
Alberto de Souza, Danilo Lucena, Gustavo Pinto | Supporting the Careers of Developers with Disabilities: Lessons from Zup
Innovation | 5 pages (two columns), 1 figures | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | People with still face discrimination, which creates significant obstacles to
accessing higher education, ultimately hindering their access to high-skilled
occupations. In this study we present Catalisa, an eight-month training camp
(developed by Zup Innovation) that hires and trains people with disabilities as
softw... | [
{
"created": "Thu, 9 Mar 2023 17:21:27 GMT",
"version": "v1"
},
{
"created": "Fri, 26 May 2023 20:36:56 GMT",
"version": "v2"
}
] | 2023-05-30 | [
[
"Cardoso-Pereira",
"Isadora",
""
],
[
"Gomes",
"Geraldo",
""
],
[
"Ribeiro",
"Danilo Monteiro",
""
],
[
"de Souza",
"Alberto",
""
],
[
"Lucena",
"Danilo",
""
],
[
"Pinto",
"Gustavo",
""
]
] | People with still face discrimination, which creates significant obstacles to accessing higher education, ultimately hindering their access to high-skilled occupations. In this study we present Catalisa, an eight-month training camp (developed by Zup Innovation) that hires and trains people with disabilities as softwar... |
1609.01461 | Battista Biggio | Battista Biggio and Giorgio Fumera and Gian Luca Marcialis and Fabio
Roli | Statistical Meta-Analysis of Presentation Attacks for Secure
Multibiometric Systems | Published in: IEEE Transactions on Pattern Analysis and Machine
Intelligence, 2016 | IEEE Transactions on Pattern Analysis and Machine Intelligence,
2016 | 10.1109/TPAMI.2016.2558154 | null | cs.CV cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Prior work has shown that multibiometric systems are vulnerable to
presentation attacks, assuming that their matching score distribution is
identical to that of genuine users, without fabricating any fake trait. We have
recently shown that this assumption is not representative of current
fingerprint and face presenta... | [
{
"created": "Tue, 6 Sep 2016 09:44:47 GMT",
"version": "v1"
}
] | 2016-09-07 | [
[
"Biggio",
"Battista",
""
],
[
"Fumera",
"Giorgio",
""
],
[
"Marcialis",
"Gian Luca",
""
],
[
"Roli",
"Fabio",
""
]
] | Prior work has shown that multibiometric systems are vulnerable to presentation attacks, assuming that their matching score distribution is identical to that of genuine users, without fabricating any fake trait. We have recently shown that this assumption is not representative of current fingerprint and face presentati... |
2207.02025 | Ashish Tiwari | Ashish Tiwari and Shanmuganathan Raman | DeepPS2: Revisiting Photometric Stereo Using Two Differently Illuminated
Images | Accepted in ECCV 2022 Project Page:
https://sites.google.com/iitgn.ac.in/deepps2/home | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Photometric stereo, a problem of recovering 3D surface normals using images
of an object captured under different lightings, has been of great interest and
importance in computer vision research. Despite the success of existing
traditional and deep learning-based methods, it is still challenging due to:
(i) the requi... | [
{
"created": "Tue, 5 Jul 2022 13:14:10 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Aug 2022 08:56:21 GMT",
"version": "v2"
}
] | 2022-08-31 | [
[
"Tiwari",
"Ashish",
""
],
[
"Raman",
"Shanmuganathan",
""
]
] | Photometric stereo, a problem of recovering 3D surface normals using images of an object captured under different lightings, has been of great interest and importance in computer vision research. Despite the success of existing traditional and deep learning-based methods, it is still challenging due to: (i) the require... |
1812.01410 | Vincent Schellekens | Vincent Schellekens and Laurent Jacques | Compressive Classification (Machine Learning without learning) | in Proceedings of iTWIST'18, Paper-ID: 8, Marseille, France,
November, 21-23, 2018 | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compressive learning is a framework where (so far unsupervised) learning
tasks use not the entire dataset but a compressed summary (sketch) of it. We
propose a compressive learning classification method, and a novel sketch
function for images.
| [
{
"created": "Tue, 4 Dec 2018 13:50:11 GMT",
"version": "v1"
}
] | 2018-12-05 | [
[
"Schellekens",
"Vincent",
""
],
[
"Jacques",
"Laurent",
""
]
] | Compressive learning is a framework where (so far unsupervised) learning tasks use not the entire dataset but a compressed summary (sketch) of it. We propose a compressive learning classification method, and a novel sketch function for images. |
1702.01823 | Mostafa Dehghan | Mostafa Dehghan, Weibo Chu, Philippe Nain, Don Towsley | Sharing LRU Cache Resources among Content Providers: A Utility-Based
Approach | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider the problem of allocating cache resources among
multiple content providers. The cache can be partitioned into slices and each
partition can be dedicated to a particular content provider, or shared among a
number of them. It is assumed that each partition employs the LRU policy for
managing ... | [
{
"created": "Mon, 6 Feb 2017 23:42:59 GMT",
"version": "v1"
}
] | 2017-02-08 | [
[
"Dehghan",
"Mostafa",
""
],
[
"Chu",
"Weibo",
""
],
[
"Nain",
"Philippe",
""
],
[
"Towsley",
"Don",
""
]
] | In this paper, we consider the problem of allocating cache resources among multiple content providers. The cache can be partitioned into slices and each partition can be dedicated to a particular content provider, or shared among a number of them. It is assumed that each partition employs the LRU policy for managing co... |
2008.08903 | Nan Gao | Nan Gao, Hao Xue, Wei Shao, Sichen Zhao, Kyle Kai Qin, Arian Prabowo,
Mohammad Saiedur Rahaman, Flora D. Salim | Generative Adversarial Networks for Spatio-temporal Data: A Survey | This paper has been accepted by ACM Transactions on Intelligent
Systems and Technology (TIST) | null | 10.1145/3474838 | null | cs.LG cs.IR eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative Adversarial Networks (GANs) have shown remarkable success in
producing realistic-looking images in the computer vision area. Recently,
GAN-based techniques are shown to be promising for spatio-temporal-based
applications such as trajectory prediction, events generation and time-series
data imputation. Whil... | [
{
"created": "Tue, 18 Aug 2020 11:05:40 GMT",
"version": "v1"
},
{
"created": "Tue, 1 Dec 2020 01:30:20 GMT",
"version": "v2"
},
{
"created": "Wed, 30 Jun 2021 06:01:17 GMT",
"version": "v3"
},
{
"created": "Fri, 30 Jul 2021 02:36:45 GMT",
"version": "v4"
}
] | 2021-08-02 | [
[
"Gao",
"Nan",
""
],
[
"Xue",
"Hao",
""
],
[
"Shao",
"Wei",
""
],
[
"Zhao",
"Sichen",
""
],
[
"Qin",
"Kyle Kai",
""
],
[
"Prabowo",
"Arian",
""
],
[
"Rahaman",
"Mohammad Saiedur",
""
],
[
"Salim",
... | Generative Adversarial Networks (GANs) have shown remarkable success in producing realistic-looking images in the computer vision area. Recently, GAN-based techniques are shown to be promising for spatio-temporal-based applications such as trajectory prediction, events generation and time-series data imputation. While ... |
1101.4435 | Ali Fakoorian | S. Ali. A. Fakoorian and A. Lee Swindlehurst | Solutions for the MIMO Gaussian Wiretap Channel with a Cooperative
Jammer | null | null | 10.1109/TSP.2011.2161298 | null | cs.IT math.IT | http://creativecommons.org/licenses/by/3.0/ | We study the Gaussian MIMO wiretap channel with a transmitter, a legitimate
receiver, an eavesdropper and an external helper, each equipped with multiple
antennas. The transmitter sends confidential messages to its intended receiver,
while the helper transmits jamming signals independent of the source message to
conf... | [
{
"created": "Mon, 24 Jan 2011 03:09:16 GMT",
"version": "v1"
}
] | 2015-05-27 | [
[
"Fakoorian",
"S. Ali. A.",
""
],
[
"Swindlehurst",
"A. Lee",
""
]
] | We study the Gaussian MIMO wiretap channel with a transmitter, a legitimate receiver, an eavesdropper and an external helper, each equipped with multiple antennas. The transmitter sends confidential messages to its intended receiver, while the helper transmits jamming signals independent of the source message to confus... |
2003.04094 | Jacek Dabrowski | Mikolaj Wieczorek (1), Andrzej Michalowski (1), Anna Wroblewska (1 and
2), Jacek Dabrowski (1) ((1) Synerise, (2) Warsaw University of Technology) | A Strong Baseline for Fashion Retrieval with Person Re-Identification
Models | 33 pages, 14 figures | short paper in Neural Information Processing, Communications in
Computer and Information Science, 2020 | 10.1007/978-3-030-63820-7_33 | null | cs.CV cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fashion retrieval is the challenging task of finding an exact match for
fashion items contained within an image. Difficulties arise from the
fine-grained nature of clothing items, very large intra-class and inter-class
variance. Additionally, query and source images for the task usually come from
different domains - ... | [
{
"created": "Mon, 9 Mar 2020 12:50:15 GMT",
"version": "v1"
}
] | 2022-11-24 | [
[
"Wieczorek",
"Mikolaj",
"",
"Synerise"
],
[
"Michalowski",
"Andrzej",
"",
"Synerise"
],
[
"Wroblewska",
"Anna",
"",
"1 and\n 2"
],
[
"Dabrowski",
"Jacek",
"",
"Synerise"
]
] | Fashion retrieval is the challenging task of finding an exact match for fashion items contained within an image. Difficulties arise from the fine-grained nature of clothing items, very large intra-class and inter-class variance. Additionally, query and source images for the task usually come from different domains - st... |
1711.06333 | Jason Phipps Morgan | J. M. Taram\'on, J. P. Morgan, C. Shi, and J. Hasenclever | Generation of unstructured meshes in 2-D, 3-D, and spherical geometries
with embedded high resolution sub-regions | 20 pages + supplement, submitted to SIAM J. Sci. Comp | null | null | null | cs.CG cs.CE math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present 2-D, 3-D, and spherical mesh generators for the Finite Element
Method (FEM) using triangular and tetrahedral elements. The mesh nodes are
treated as if they were linked by virtual springs that obey Hooke's law. Given
the desired length for the springs, the FEM is used to solve for the optimal
nodal positio... | [
{
"created": "Tue, 14 Nov 2017 20:01:38 GMT",
"version": "v1"
}
] | 2017-11-20 | [
[
"Taramón",
"J. M.",
""
],
[
"Morgan",
"J. P.",
""
],
[
"Shi",
"C.",
""
],
[
"Hasenclever",
"J.",
""
]
] | We present 2-D, 3-D, and spherical mesh generators for the Finite Element Method (FEM) using triangular and tetrahedral elements. The mesh nodes are treated as if they were linked by virtual springs that obey Hooke's law. Given the desired length for the springs, the FEM is used to solve for the optimal nodal positions... |
1805.06334 | Lukas Liebel | Lukas Liebel and Marco K\"orner | Auxiliary Tasks in Multi-task Learning | fixed minor typesetting issue | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-task convolutional neural networks (CNNs) have shown impressive results
for certain combinations of tasks, such as single-image depth estimation (SIDE)
and semantic segmentation. This is achieved by pushing the network towards
learning a robust representation that generalizes well to different atomic
tasks. We ... | [
{
"created": "Wed, 16 May 2018 13:59:20 GMT",
"version": "v1"
},
{
"created": "Thu, 17 May 2018 16:12:16 GMT",
"version": "v2"
}
] | 2018-11-05 | [
[
"Liebel",
"Lukas",
""
],
[
"Körner",
"Marco",
""
]
] | Multi-task convolutional neural networks (CNNs) have shown impressive results for certain combinations of tasks, such as single-image depth estimation (SIDE) and semantic segmentation. This is achieved by pushing the network towards learning a robust representation that generalizes well to different atomic tasks. We ex... |
2306.03197 | Martin Schr\"oder | Martin Schroder | AutoScrum: Automating Project Planning Using Large Language Models | 25 pages, 3 figures, demo: https://github.com/autoscrum/autoscrum | null | null | null | cs.AI cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | Recent advancements in the field of large language models have made it
possible to use language models for advanced reasoning. In this paper we
leverage this ability for designing complex project plans based only on knowing
the current state and the desired state. Two approaches are demonstrated - a
scrum based appro... | [
{
"created": "Mon, 5 Jun 2023 19:16:37 GMT",
"version": "v1"
}
] | 2023-06-07 | [
[
"Schroder",
"Martin",
""
]
] | Recent advancements in the field of large language models have made it possible to use language models for advanced reasoning. In this paper we leverage this ability for designing complex project plans based only on knowing the current state and the desired state. Two approaches are demonstrated - a scrum based approac... |
1802.05004 | Khoa Nguyen | Khoa Nguyen and Benjamin Hong Meng Tan and Huaxiong Wang | Zero-Knowledge Password Policy Check from Lattices | null | ISC 2017 | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Passwords are ubiquitous and most commonly used to authenticate users when
logging into online services. Using high entropy passwords is critical to
prevent unauthorized access and password policies emerged to enforce this
requirement on passwords. However, with current methods of password storage,
poor practices and... | [
{
"created": "Wed, 14 Feb 2018 09:39:10 GMT",
"version": "v1"
}
] | 2018-02-15 | [
[
"Nguyen",
"Khoa",
""
],
[
"Tan",
"Benjamin Hong Meng",
""
],
[
"Wang",
"Huaxiong",
""
]
] | Passwords are ubiquitous and most commonly used to authenticate users when logging into online services. Using high entropy passwords is critical to prevent unauthorized access and password policies emerged to enforce this requirement on passwords. However, with current methods of password storage, poor practices and s... |
1808.09170 | Math\'e Zeegers | Math\'e Zeegers, Felix Lucka and Kees Joost Batenburg | A Multi-channel DART Algorithm | 16 pages. 17 figures. Paper for IWCIA 2018 conference | null | 10.1007/978-3-030-05288-1_13 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Tomography deals with the reconstruction of objects from their projections,
acquired along a range of angles. Discrete tomography is concerned with objects
that consist of a small number of materials, which makes it possible to compute
accurate reconstructions from highly limited projection data. For cases where
the ... | [
{
"created": "Tue, 28 Aug 2018 08:41:55 GMT",
"version": "v1"
}
] | 2020-09-07 | [
[
"Zeegers",
"Mathé",
""
],
[
"Lucka",
"Felix",
""
],
[
"Batenburg",
"Kees Joost",
""
]
] | Tomography deals with the reconstruction of objects from their projections, acquired along a range of angles. Discrete tomography is concerned with objects that consist of a small number of materials, which makes it possible to compute accurate reconstructions from highly limited projection data. For cases where the al... |
1809.02681 | Zhedong Zheng | Zhedong Zheng, Liang Zheng, Yi Yang, Fei Wu | Query Attack via Opposite-Direction Feature:Towards Robust Image
Retrieval | 12 pages, 9 figures, 3 tables | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most existing works of adversarial samples focus on attacking image
recognition models, while little attention is paid to the image retrieval task.
In this paper, we identify two inherent challenges in applying prevailing image
recognition attack methods to image retrieval. First, image retrieval demands
discriminati... | [
{
"created": "Fri, 7 Sep 2018 21:29:32 GMT",
"version": "v1"
},
{
"created": "Tue, 20 Oct 2020 04:04:01 GMT",
"version": "v2"
}
] | 2020-10-21 | [
[
"Zheng",
"Zhedong",
""
],
[
"Zheng",
"Liang",
""
],
[
"Yang",
"Yi",
""
],
[
"Wu",
"Fei",
""
]
] | Most existing works of adversarial samples focus on attacking image recognition models, while little attention is paid to the image retrieval task. In this paper, we identify two inherent challenges in applying prevailing image recognition attack methods to image retrieval. First, image retrieval demands discriminative... |
2009.00296 | Alessandro Betti | Alessandro Betti, Marco Gori, Simone Marullo, Stefano Melacci | Developing Constrained Neural Units Over Time | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present a foundational study on a constrained method that
defines learning problems with Neural Networks in the context of the principle
of least cognitive action, which very much resembles the principle of least
action in mechanics. Starting from a general approach to enforce constraints
into the dy... | [
{
"created": "Tue, 1 Sep 2020 09:07:25 GMT",
"version": "v1"
}
] | 2020-09-02 | [
[
"Betti",
"Alessandro",
""
],
[
"Gori",
"Marco",
""
],
[
"Marullo",
"Simone",
""
],
[
"Melacci",
"Stefano",
""
]
] | In this paper we present a foundational study on a constrained method that defines learning problems with Neural Networks in the context of the principle of least cognitive action, which very much resembles the principle of least action in mechanics. Starting from a general approach to enforce constraints into the dyna... |
2102.01397 | Simon Scherrer | Simon Scherrer, Che-Yu Wu, Yu-Hsi Chiang, Benjamin Rothenberger,
Daniele E. Asoni, Arish Sateesan, Jo Vliegen, Nele Mentens, Hsu-Chun Hsiao,
Adrian Perrig | Low-Rate Overuse Flow Tracer (LOFT): An Efficient and Scalable Algorithm
for Detecting Overuse Flows | null | null | null | null | cs.NI cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current probabilistic flow-size monitoring can only detect heavy hitters
(e.g., flows utilizing 10 times their permitted bandwidth), but cannot detect
smaller overuse (e.g., flows utilizing 50-100% more than their permitted
bandwidth). Thus, these systems lack accuracy in the challenging environment of
high-throughpu... | [
{
"created": "Tue, 2 Feb 2021 09:33:14 GMT",
"version": "v1"
}
] | 2021-02-03 | [
[
"Scherrer",
"Simon",
""
],
[
"Wu",
"Che-Yu",
""
],
[
"Chiang",
"Yu-Hsi",
""
],
[
"Rothenberger",
"Benjamin",
""
],
[
"Asoni",
"Daniele E.",
""
],
[
"Sateesan",
"Arish",
""
],
[
"Vliegen",
"Jo",
""
],
[
... | Current probabilistic flow-size monitoring can only detect heavy hitters (e.g., flows utilizing 10 times their permitted bandwidth), but cannot detect smaller overuse (e.g., flows utilizing 50-100% more than their permitted bandwidth). Thus, these systems lack accuracy in the challenging environment of high-throughput ... |
2305.10444 | Wadii Boulila Prof. | Mahdi Jemmali, Loai Kayed B.Melhim, Wadii Boulila, Hajer Amdouni,
Mafawez T. Alharbi | Optimizing Forest Fire Prevention: Intelligent Scheduling Algorithms for
Drone-Based Surveillance System | null | null | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by/4.0/ | Given the importance of forests and their role in maintaining the ecological
balance, which directly affects the planet, the climate, and the life on this
planet, this research presents the problem of forest fire monitoring using
drones. The forest monitoring process is performed continuously to track any
changes in ... | [
{
"created": "Sun, 14 May 2023 13:52:43 GMT",
"version": "v1"
}
] | 2023-05-19 | [
[
"Jemmali",
"Mahdi",
""
],
[
"Melhim",
"Loai Kayed B.",
""
],
[
"Boulila",
"Wadii",
""
],
[
"Amdouni",
"Hajer",
""
],
[
"Alharbi",
"Mafawez T.",
""
]
] | Given the importance of forests and their role in maintaining the ecological balance, which directly affects the planet, the climate, and the life on this planet, this research presents the problem of forest fire monitoring using drones. The forest monitoring process is performed continuously to track any changes in th... |
1603.02604 | Ralf Steinberger | Ralf Steinberger, Aldo Podavini, Alexandra Balahur, Guillaume Jacquet,
Hristo Tanev, Jens Linge, Martin Atkinson, Michele Chinosi, Vanni Zavarella,
Yaniv Steiner, Erik van der Goot | Observing Trends in Automated Multilingual Media Analysis | Proceedings of the Symposium on New Frontiers of Automated Content
Analysis in the Social Sciences (ACA'2015), Z\"urich, Switzerland, 1-3 July
2015 (20 pages) | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Any large organisation, be it public or private, monitors the media for
information to keep abreast of developments in their field of interest, and
usually also to become aware of positive or negative opinions expressed towards
them. At least for the written media, computer programs have become very
efficient at help... | [
{
"created": "Tue, 8 Mar 2016 17:43:48 GMT",
"version": "v1"
}
] | 2016-03-09 | [
[
"Steinberger",
"Ralf",
""
],
[
"Podavini",
"Aldo",
""
],
[
"Balahur",
"Alexandra",
""
],
[
"Jacquet",
"Guillaume",
""
],
[
"Tanev",
"Hristo",
""
],
[
"Linge",
"Jens",
""
],
[
"Atkinson",
"Martin",
""
],
... | Any large organisation, be it public or private, monitors the media for information to keep abreast of developments in their field of interest, and usually also to become aware of positive or negative opinions expressed towards them. At least for the written media, computer programs have become very efficient at helpin... |
2211.04545 | Karl-Dieter Crisman | Karl-Dieter Crisman, Abraham Holleran, Micah Martin, and Josephine
Noonan | Voting on Cyclic Orders, Group Theory, and Ballots | 29 pages, to be published in conference proceedings from AMS Special
Session on The Mathematics of Decisions, Elections and Games, 2022 | null | 10.1090/conm/795/15967 | null | cs.GT math.RT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A cyclic order may be thought of informally as a way to seat people around a
table, perhaps for a game of chance or for dinner. Given a set of agents such
as $\{A,B,C\}$, we can formalize this by defining a cyclic order as a
permutation or linear order on this finite set, under the equivalence relation
where $A\succ ... | [
{
"created": "Tue, 8 Nov 2022 20:32:14 GMT",
"version": "v1"
}
] | 2024-07-23 | [
[
"Crisman",
"Karl-Dieter",
""
],
[
"Holleran",
"Abraham",
""
],
[
"Martin",
"Micah",
""
],
[
"Noonan",
"Josephine",
""
]
] | A cyclic order may be thought of informally as a way to seat people around a table, perhaps for a game of chance or for dinner. Given a set of agents such as $\{A,B,C\}$, we can formalize this by defining a cyclic order as a permutation or linear order on this finite set, under the equivalence relation where $A\succ B\... |
2003.02609 | Mirco Theile | Mirco Theile, Harald Bayerlein, Richard Nai, David Gesbert and Marco
Caccamo | UAV Coverage Path Planning under Varying Power Constraints using Deep
Reinforcement Learning | 2020 IEEE/RSJ International Conference on Intelligent Robots and
Systems (IROS) | null | 10.1109/IROS45743.2020.9340934 | null | cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Coverage path planning (CPP) is the task of designing a trajectory that
enables a mobile agent to travel over every point of an area of interest. We
propose a new method to control an unmanned aerial vehicle (UAV) carrying a
camera on a CPP mission with random start positions and multiple options for
landing position... | [
{
"created": "Thu, 5 Mar 2020 13:43:47 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Feb 2021 13:22:45 GMT",
"version": "v2"
}
] | 2021-02-15 | [
[
"Theile",
"Mirco",
""
],
[
"Bayerlein",
"Harald",
""
],
[
"Nai",
"Richard",
""
],
[
"Gesbert",
"David",
""
],
[
"Caccamo",
"Marco",
""
]
] | Coverage path planning (CPP) is the task of designing a trajectory that enables a mobile agent to travel over every point of an area of interest. We propose a new method to control an unmanned aerial vehicle (UAV) carrying a camera on a CPP mission with random start positions and multiple options for landing positions ... |
1202.3898 | Peter Bro Miltersen | Kristoffer Arnsfelt Hansen, Michal Koucky, Niels Lauritzen, Peter Bro
Miltersen, Elias Tsigaridas | Exact Algorithms for Solving Stochastic Games | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Shapley's discounted stochastic games, Everett's recursive games and
Gillette's undiscounted stochastic games are classical models of game theory
describing two-player zero-sum games of potentially infinite duration. We
describe algorithms for exactly solving these games.
| [
{
"created": "Fri, 17 Feb 2012 12:37:42 GMT",
"version": "v1"
}
] | 2012-02-20 | [
[
"Hansen",
"Kristoffer Arnsfelt",
""
],
[
"Koucky",
"Michal",
""
],
[
"Lauritzen",
"Niels",
""
],
[
"Miltersen",
"Peter Bro",
""
],
[
"Tsigaridas",
"Elias",
""
]
] | Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games. |
2012.13744 | Ryoichi Takase | Ryoichi Takase, Nobuyuki Yoshikawa, Toshisada Mariyama, and Takeshi
Tsuchiya | Stability-Certified Reinforcement Learning via Spectral Normalization | null | null | null | null | cs.AI cs.LG cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this article, two types of methods from different perspectives based on
spectral normalization are described for ensuring the stability of the system
controlled by a neural network. The first one is that the L2 gain of the
feedback system is bounded less than 1 to satisfy the stability condition
derived from the s... | [
{
"created": "Sat, 26 Dec 2020 14:26:24 GMT",
"version": "v1"
}
] | 2020-12-29 | [
[
"Takase",
"Ryoichi",
""
],
[
"Yoshikawa",
"Nobuyuki",
""
],
[
"Mariyama",
"Toshisada",
""
],
[
"Tsuchiya",
"Takeshi",
""
]
] | In this article, two types of methods from different perspectives based on spectral normalization are described for ensuring the stability of the system controlled by a neural network. The first one is that the L2 gain of the feedback system is bounded less than 1 to satisfy the stability condition derived from the sma... |
cs/0504036 | Richard Belew | Richard K. Belew | Scientific impact quantity and quality: Analysis of two sources of
bibliographic data | 12 pages, 1 table, 6 figures | null | null | null | cs.IR cs.DL | null | Attempts to understand the consequence of any individual scientist's activity
within the long-term trajectory of science is one of the most difficult
questions within the philosophy of science. Because scientific publications
play such as central role in the modern enterprise of science, bibliometric
techniques which... | [
{
"created": "Mon, 11 Apr 2005 13:52:55 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Belew",
"Richard K.",
""
]
] | Attempts to understand the consequence of any individual scientist's activity within the long-term trajectory of science is one of the most difficult questions within the philosophy of science. Because scientific publications play such as central role in the modern enterprise of science, bibliometric techniques which m... |
2004.12213 | Wenying Ji | Yitong Li, Wenying Ji, Simaan M. AbouRizk | Automated Abstraction of Operation Processes from Unstructured Text for
Simulation Modeling | null | null | null | null | cs.IR cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Abstraction of operation processes is a fundamental step for simulation
modeling. To reliably abstract an operation process, modelers rely on text
information to study and understand details of operations. Aiming at reducing
modelers' interpretation load and ensuring the reliability of the abstracted
information, thi... | [
{
"created": "Sat, 25 Apr 2020 19:18:23 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Jun 2020 22:47:02 GMT",
"version": "v2"
},
{
"created": "Sat, 4 Jul 2020 14:34:44 GMT",
"version": "v3"
}
] | 2020-07-07 | [
[
"Li",
"Yitong",
""
],
[
"Ji",
"Wenying",
""
],
[
"AbouRizk",
"Simaan M.",
""
]
] | Abstraction of operation processes is a fundamental step for simulation modeling. To reliably abstract an operation process, modelers rely on text information to study and understand details of operations. Aiming at reducing modelers' interpretation load and ensuring the reliability of the abstracted information, this ... |
2305.14327 | Da Yin | Da Yin, Xiao Liu, Fan Yin, Ming Zhong, Hritik Bansal, Jiawei Han,
Kai-Wei Chang | Dynosaur: A Dynamic Growth Paradigm for Instruction-Tuning Data Curation | EMNLP 2023. Code and data are available at
https://github.com/WadeYin9712/Dynosaur | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Instruction tuning has emerged to enhance the capabilities of large language
models (LLMs) to comprehend instructions and generate appropriate responses.
Existing methods either manually annotate or employ LLM (e.g., GPT-series) to
generate data for instruction tuning. However, they often overlook associating
instruc... | [
{
"created": "Tue, 23 May 2023 17:56:26 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Oct 2023 05:10:18 GMT",
"version": "v2"
}
] | 2023-10-27 | [
[
"Yin",
"Da",
""
],
[
"Liu",
"Xiao",
""
],
[
"Yin",
"Fan",
""
],
[
"Zhong",
"Ming",
""
],
[
"Bansal",
"Hritik",
""
],
[
"Han",
"Jiawei",
""
],
[
"Chang",
"Kai-Wei",
""
]
] | Instruction tuning has emerged to enhance the capabilities of large language models (LLMs) to comprehend instructions and generate appropriate responses. Existing methods either manually annotate or employ LLM (e.g., GPT-series) to generate data for instruction tuning. However, they often overlook associating instructi... |
2310.08967 | Maxime Bouthors | Maxime Bouthors, Josep Crego and Fran\c{c}ois Yvon | Towards Example-Based NMT with Multi-Levenshtein Transformers | 17 pages, EMNLP 2023 submission | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Retrieval-Augmented Machine Translation (RAMT) is attracting growing
attention. This is because RAMT not only improves translation metrics, but is
also assumed to implement some form of domain adaptation. In this contribution,
we study another salient trait of RAMT, its ability to make translation
decisions more tran... | [
{
"created": "Fri, 13 Oct 2023 09:18:57 GMT",
"version": "v1"
}
] | 2023-10-16 | [
[
"Bouthors",
"Maxime",
""
],
[
"Crego",
"Josep",
""
],
[
"Yvon",
"François",
""
]
] | Retrieval-Augmented Machine Translation (RAMT) is attracting growing attention. This is because RAMT not only improves translation metrics, but is also assumed to implement some form of domain adaptation. In this contribution, we study another salient trait of RAMT, its ability to make translation decisions more transp... |
2403.17831 | Thomas Wolgast | Thomas Wolgast and Astrid Nie{\ss}e | Learning the Optimal Power Flow: Environment Design Matters | null | null | null | null | cs.LG cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | To solve the optimal power flow (OPF) problem, reinforcement learning (RL)
emerges as a promising new approach. However, the RL-OPF literature is strongly
divided regarding the exact formulation of the OPF problem as an RL
environment. In this work, we collect and implement diverse environment design
decisions from t... | [
{
"created": "Tue, 26 Mar 2024 16:13:55 GMT",
"version": "v1"
}
] | 2024-03-27 | [
[
"Wolgast",
"Thomas",
""
],
[
"Nieße",
"Astrid",
""
]
] | To solve the optimal power flow (OPF) problem, reinforcement learning (RL) emerges as a promising new approach. However, the RL-OPF literature is strongly divided regarding the exact formulation of the OPF problem as an RL environment. In this work, we collect and implement diverse environment design decisions from the... |
1504.05727 | Xiaofu Wu Dr | Xiaofu Wu and ZhenYang | Coding vs. Spreading for Narrow-Band Interference Suppression | 13 pages, 9 figures, accepted for publication in IEEE Trans. Vech.
Tech | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The use of active narrow-band interference (NBI) suppression in
direct-sequence spread-spectrum (DS-SS) communications has been extensively
studied. In this paper, we address the problem of optimum coding-spreading
tradeoff for NBI suppression. With maximum likelihood decoding, we first derive
upper bounds on the err... | [
{
"created": "Wed, 22 Apr 2015 10:54:06 GMT",
"version": "v1"
}
] | 2015-04-23 | [
[
"Wu",
"Xiaofu",
""
],
[
"ZhenYang",
"",
""
]
] | The use of active narrow-band interference (NBI) suppression in direct-sequence spread-spectrum (DS-SS) communications has been extensively studied. In this paper, we address the problem of optimum coding-spreading tradeoff for NBI suppression. With maximum likelihood decoding, we first derive upper bounds on the error... |
2109.10582 | Tamara Mueller | Tamara T. Mueller, Alexander Ziller, Dmitrii Usynin, Moritz Knolle,
Friederike Jungmann, Daniel Rueckert, Georgios Kaissis | Partial sensitivity analysis in differential privacy | null | null | null | null | cs.CR cs.AI | http://creativecommons.org/licenses/by/4.0/ | Differential privacy (DP) allows the quantification of privacy loss when the
data of individuals is subjected to algorithmic processing such as machine
learning, as well as the provision of objective privacy guarantees. However,
while techniques such as individual R\'enyi DP (RDP) allow for granular,
per-person priva... | [
{
"created": "Wed, 22 Sep 2021 08:29:16 GMT",
"version": "v1"
},
{
"created": "Sun, 28 Nov 2021 08:29:30 GMT",
"version": "v2"
}
] | 2021-11-30 | [
[
"Mueller",
"Tamara T.",
""
],
[
"Ziller",
"Alexander",
""
],
[
"Usynin",
"Dmitrii",
""
],
[
"Knolle",
"Moritz",
""
],
[
"Jungmann",
"Friederike",
""
],
[
"Rueckert",
"Daniel",
""
],
[
"Kaissis",
"Georgios",
... | Differential privacy (DP) allows the quantification of privacy loss when the data of individuals is subjected to algorithmic processing such as machine learning, as well as the provision of objective privacy guarantees. However, while techniques such as individual R\'enyi DP (RDP) allow for granular, per-person privacy... |
1904.05717 | Tyler Smith PhD | Tyler M. Smith and Robert A. van de Geijn | The MOMMS Family of Matrix Multiplication Algorithms | null | null | null | null | cs.MS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the ratio between the rate of computation and rate with which data can be
retrieved from various layers of memory continues to deteriorate, a question
arises: Will the current best algorithms for computing matrix-matrix
multiplication on future CPUs continue to be (near) optimal? This paper
provides compelling ana... | [
{
"created": "Thu, 11 Apr 2019 14:25:27 GMT",
"version": "v1"
}
] | 2019-04-12 | [
[
"Smith",
"Tyler M.",
""
],
[
"van de Geijn",
"Robert A.",
""
]
] | As the ratio between the rate of computation and rate with which data can be retrieved from various layers of memory continues to deteriorate, a question arises: Will the current best algorithms for computing matrix-matrix multiplication on future CPUs continue to be (near) optimal? This paper provides compelling analy... |
2102.01771 | Praneeth Kumar Vippathalla | Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap and Qiaoqiao
Zhou | Secret Key Agreement and Secure Omniscience of Tree-PIN Source with
Linear Wiretapper | 13 pages, 2 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While the wiretap secret key capacity remains unknown for general source
models even in the two-user case, we obtained a single-letter characterization
for a large class of multi-user source models with a linear wiretapper who can
observe any linear combinations of the source. We introduced the idea of
irreducible so... | [
{
"created": "Tue, 2 Feb 2021 21:46:39 GMT",
"version": "v1"
}
] | 2021-02-04 | [
[
"Vippathalla",
"Praneeth Kumar",
""
],
[
"Chan",
"Chung",
""
],
[
"Kashyap",
"Navin",
""
],
[
"Zhou",
"Qiaoqiao",
""
]
] | While the wiretap secret key capacity remains unknown for general source models even in the two-user case, we obtained a single-letter characterization for a large class of multi-user source models with a linear wiretapper who can observe any linear combinations of the source. We introduced the idea of irreducible sour... |
1812.09887 | Stefan Schmid | Harald R\"acke and Stefan Schmid | Compact Oblivious Routing | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Oblivious routing is an attractive paradigm for large distributed systems in
which centralized control and frequent reconfigurations are infeasible or
undesired (e.g., costly). Over the last almost 20 years, much progress has been
made in devising oblivious routing schemes that guarantee close to optimal load
and als... | [
{
"created": "Mon, 24 Dec 2018 10:48:44 GMT",
"version": "v1"
}
] | 2018-12-27 | [
[
"Räcke",
"Harald",
""
],
[
"Schmid",
"Stefan",
""
]
] | Oblivious routing is an attractive paradigm for large distributed systems in which centralized control and frequent reconfigurations are infeasible or undesired (e.g., costly). Over the last almost 20 years, much progress has been made in devising oblivious routing schemes that guarantee close to optimal load and also ... |
1704.01045 | Christoph Martin | Christoph Martin and Peter Niemeyer | Estimating the sensitivity of centrality measures w.r.t. measurement
errors | null | Network Science. 2019;7(2):180-195 | 10.1017/nws.2019.12 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most network studies rely on an observed network that differs from the
underlying network which is obfuscated by measurement errors. It is well known
that such errors can have a severe impact on the reliability of network
metrics, especially on centrality measures: a more central node in the observed
network might be... | [
{
"created": "Tue, 4 Apr 2017 15:00:10 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Sep 2017 13:20:26 GMT",
"version": "v2"
}
] | 2020-01-09 | [
[
"Martin",
"Christoph",
""
],
[
"Niemeyer",
"Peter",
""
]
] | Most network studies rely on an observed network that differs from the underlying network which is obfuscated by measurement errors. It is well known that such errors can have a severe impact on the reliability of network metrics, especially on centrality measures: a more central node in the observed network might be l... |
1904.02767 | Reno Kriz | Reno Kriz, Jo\~ao Sedoc, Marianna Apidianaki, Carolina Zheng, Gaurav
Kumar, Eleni Miltsakaki and Chris Callison-Burch | Complexity-Weighted Loss and Diverse Reranking for Sentence
Simplification | 11 pages, North American Association of Computational Linguistics
(NAACL 2019) | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sentence simplification is the task of rewriting texts so they are easier to
understand. Recent research has applied sequence-to-sequence (Seq2Seq) models
to this task, focusing largely on training-time improvements via reinforcement
learning and memory augmentation. One of the main problems with applying
generic Seq... | [
{
"created": "Thu, 4 Apr 2019 19:47:17 GMT",
"version": "v1"
}
] | 2019-04-08 | [
[
"Kriz",
"Reno",
""
],
[
"Sedoc",
"João",
""
],
[
"Apidianaki",
"Marianna",
""
],
[
"Zheng",
"Carolina",
""
],
[
"Kumar",
"Gaurav",
""
],
[
"Miltsakaki",
"Eleni",
""
],
[
"Callison-Burch",
"Chris",
""
]
] | Sentence simplification is the task of rewriting texts so they are easier to understand. Recent research has applied sequence-to-sequence (Seq2Seq) models to this task, focusing largely on training-time improvements via reinforcement learning and memory augmentation. One of the main problems with applying generic Seq2S... |
1702.08199 | Shenghui Wang | Rob Koopman, Shenghui Wang | Mutual Information based labelling and comparing clusters | Special Issue of Scientometrics: Same data - different results?
Towards a comparative approach to the identification of thematic structures
in science | null | 10.1007/s11192-017-2305-2 | null | cs.IR cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | After a clustering solution is generated automatically, labelling these
clusters becomes important to help understanding the results. In this paper, we
propose to use a Mutual Information based method to label clusters of journal
articles. Topical terms which have the highest Normalised Mutual Information
(NMI) with ... | [
{
"created": "Mon, 27 Feb 2017 09:23:46 GMT",
"version": "v1"
}
] | 2017-02-28 | [
[
"Koopman",
"Rob",
""
],
[
"Wang",
"Shenghui",
""
]
] | After a clustering solution is generated automatically, labelling these clusters becomes important to help understanding the results. In this paper, we propose to use a Mutual Information based method to label clusters of journal articles. Topical terms which have the highest Normalised Mutual Information (NMI) with a ... |
1903.07788 | Jianxin Wu | Kun Yi and Jianxin Wu | Probabilistic End-to-end Noise Correction for Learning with Noisy Labels | CVPR 2019 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning has achieved excellent performance in various computer vision
tasks, but requires a lot of training examples with clean labels. It is easy to
collect a dataset with noisy labels, but such noise makes networks overfit
seriously and accuracies drop dramatically. To address this problem, we propose
an end-... | [
{
"created": "Tue, 19 Mar 2019 01:38:08 GMT",
"version": "v1"
}
] | 2019-03-20 | [
[
"Yi",
"Kun",
""
],
[
"Wu",
"Jianxin",
""
]
] | Deep learning has achieved excellent performance in various computer vision tasks, but requires a lot of training examples with clean labels. It is easy to collect a dataset with noisy labels, but such noise makes networks overfit seriously and accuracies drop dramatically. To address this problem, we propose an end-to... |
2212.00616 | Tao Ge | Tao Ge, Jing Hu, Li Dong, Shaoguang Mao, Yan Xia, Xun Wang, Si-Qing
Chen, Furu Wei | Extensible Prompts for Language Models on Zero-shot Language Style
Customization | Accepted by NeurIPS 2023 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We propose eXtensible Prompt (X-Prompt) for prompting a large language model
(LLM) beyond natural language (NL). X-Prompt instructs an LLM with not only NL
but also an extensible vocabulary of imaginary words. Registering new imaginary
words allows us to instruct the LLM to comprehend concepts that are difficult
to d... | [
{
"created": "Thu, 1 Dec 2022 16:11:56 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Nov 2023 20:11:14 GMT",
"version": "v2"
}
] | 2023-12-04 | [
[
"Ge",
"Tao",
""
],
[
"Hu",
"Jing",
""
],
[
"Dong",
"Li",
""
],
[
"Mao",
"Shaoguang",
""
],
[
"Xia",
"Yan",
""
],
[
"Wang",
"Xun",
""
],
[
"Chen",
"Si-Qing",
""
],
[
"Wei",
"Furu",
""
]
] | We propose eXtensible Prompt (X-Prompt) for prompting a large language model (LLM) beyond natural language (NL). X-Prompt instructs an LLM with not only NL but also an extensible vocabulary of imaginary words. Registering new imaginary words allows us to instruct the LLM to comprehend concepts that are difficult to des... |
2005.03566 | Bo Zhang | Xiangxiang Chu and Bo Zhang | Noisy Differentiable Architecture Search | BMVC 2021 | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Simplicity is the ultimate sophistication. Differentiable Architecture Search
(DARTS) has now become one of the mainstream paradigms of neural architecture
search. However, it largely suffers from the well-known performance collapse
issue due to the aggregation of skip connections. It is thought to have overly
benefi... | [
{
"created": "Thu, 7 May 2020 15:53:52 GMT",
"version": "v1"
},
{
"created": "Tue, 19 May 2020 14:42:33 GMT",
"version": "v2"
},
{
"created": "Sun, 17 Oct 2021 14:57:46 GMT",
"version": "v3"
}
] | 2021-10-19 | [
[
"Chu",
"Xiangxiang",
""
],
[
"Zhang",
"Bo",
""
]
] | Simplicity is the ultimate sophistication. Differentiable Architecture Search (DARTS) has now become one of the mainstream paradigms of neural architecture search. However, it largely suffers from the well-known performance collapse issue due to the aggregation of skip connections. It is thought to have overly benefite... |
1611.03899 | Richard Mann | Richard P. Mann and Dirk Helbing | Optimal incentives for collective intelligence | null | PNAS 2017 114 (20) 5077-5082 | 10.1073/pnas.1618722114 | null | cs.GT math.DS stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Collective intelligence is the ability of a group to perform more effectively
than any individual alone. Diversity among group members is a key condition for
the emergence of collective intelligence, but maintaining diversity is
challenging in the face of social pressure to imitate one's peers. We
investigate the rol... | [
{
"created": "Fri, 11 Nov 2016 22:21:24 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Oct 2017 12:18:41 GMT",
"version": "v2"
}
] | 2017-10-18 | [
[
"Mann",
"Richard P.",
""
],
[
"Helbing",
"Dirk",
""
]
] | Collective intelligence is the ability of a group to perform more effectively than any individual alone. Diversity among group members is a key condition for the emergence of collective intelligence, but maintaining diversity is challenging in the face of social pressure to imitate one's peers. We investigate the role ... |
1910.11547 | Yiheng Liu | Yiheng Liu, Wengang Zhou, Jianzhuang Liu, Guojun Qi, Qi Tian, Houqiang
Li | An End-to-End Foreground-Aware Network for Person Re-Identification | Accepted to IEEE Transactions on Image Processing (TIP), 2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Person re-identification is a crucial task of identifying pedestrians of
interest across multiple surveillance camera views. In person
re-identification, a pedestrian is usually represented with features extracted
from a rectangular image region that inevitably contains the scene background,
which incurs ambiguity to... | [
{
"created": "Fri, 25 Oct 2019 06:43:19 GMT",
"version": "v1"
},
{
"created": "Sat, 6 Mar 2021 09:42:43 GMT",
"version": "v2"
}
] | 2021-03-09 | [
[
"Liu",
"Yiheng",
""
],
[
"Zhou",
"Wengang",
""
],
[
"Liu",
"Jianzhuang",
""
],
[
"Qi",
"Guojun",
""
],
[
"Tian",
"Qi",
""
],
[
"Li",
"Houqiang",
""
]
] | Person re-identification is a crucial task of identifying pedestrians of interest across multiple surveillance camera views. In person re-identification, a pedestrian is usually represented with features extracted from a rectangular image region that inevitably contains the scene background, which incurs ambiguity to d... |
1710.00675 | Martin Chmel\'ik | Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu | Sensor Synthesis for POMDPs with Reachability Objectives | arXiv admin note: text overlap with arXiv:1511.08456 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Partially observable Markov decision processes (POMDPs) are widely used in
probabilistic planning problems in which an agent interacts with an environment
using noisy and imprecise sensors. We study a setting in which the sensors are
only partially defined and the goal is to synthesize "weakest" additional
sensors, s... | [
{
"created": "Fri, 29 Sep 2017 08:27:24 GMT",
"version": "v1"
}
] | 2017-10-03 | [
[
"Chatterjee",
"Krishnendu",
""
],
[
"Chmelik",
"Martin",
""
],
[
"Topcu",
"Ufuk",
""
]
] | Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize "weakest" additional sensors, suc... |
2211.10193 | Ibrahim Alabdulmohsin | Amr Khalifa, Michael C. Mozer, Hanie Sedghi, Behnam Neyshabur, Ibrahim
Alabdulmohsin | Layer-Stack Temperature Scaling | 10 pages, 7 figures, 3 tables | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent works demonstrate that early layers in a neural network contain useful
information for prediction. Inspired by this, we show that extending
temperature scaling across all layers improves both calibration and accuracy.
We call this procedure "layer-stack temperature scaling" (LATES). Informally,
LATES grants ea... | [
{
"created": "Fri, 18 Nov 2022 12:34:00 GMT",
"version": "v1"
}
] | 2022-11-21 | [
[
"Khalifa",
"Amr",
""
],
[
"Mozer",
"Michael C.",
""
],
[
"Sedghi",
"Hanie",
""
],
[
"Neyshabur",
"Behnam",
""
],
[
"Alabdulmohsin",
"Ibrahim",
""
]
] | Recent works demonstrate that early layers in a neural network contain useful information for prediction. Inspired by this, we show that extending temperature scaling across all layers improves both calibration and accuracy. We call this procedure "layer-stack temperature scaling" (LATES). Informally, LATES grants each... |
2310.10106 | Can Cui | Can Cui (MULTISPEECH), Imran Ahamad Sheikh, Mostafa Sadeghi
(MULTISPEECH), Emmanuel Vincent (MULTISPEECH) | End-to-end Multichannel Speaker-Attributed ASR: Speaker Guided Decoder
and Input Feature Analysis | 2023 IEEE Automatic Speech Recognition and Understanding Workshop
(ASRU 2023), Dec 2023, Taipei, Taiwan | null | null | null | cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an end-to-end multichannel speaker-attributed automatic speech
recognition (MC-SA-ASR) system that combines a Conformer-based encoder with
multi-frame crosschannel attention and a speaker-attributed Transformer-based
decoder. To the best of our knowledge, this is the first model that efficiently
integrates... | [
{
"created": "Mon, 16 Oct 2023 06:40:18 GMT",
"version": "v1"
}
] | 2023-10-17 | [
[
"Cui",
"Can",
"",
"MULTISPEECH"
],
[
"Sheikh",
"Imran Ahamad",
"",
"MULTISPEECH"
],
[
"Sadeghi",
"Mostafa",
"",
"MULTISPEECH"
],
[
"Vincent",
"Emmanuel",
"",
"MULTISPEECH"
]
] | We present an end-to-end multichannel speaker-attributed automatic speech recognition (MC-SA-ASR) system that combines a Conformer-based encoder with multi-frame crosschannel attention and a speaker-attributed Transformer-based decoder. To the best of our knowledge, this is the first model that efficiently integrates A... |
1908.09072 | Zhaobing Kang | Zhaobing Kang, Wei Zou and Zheng Zhu | Camera Pose Correction in SLAM Based on Bias Values of Map Points | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accurate camera pose estimation result is essential for visual SLAM (VSLAM).
This paper presents a novel pose correction method to improve the accuracy of
the VSLAM system. Firstly, the relationship between the camera pose estimation
error and bias values of map points is derived based on the optimized function
in VS... | [
{
"created": "Sat, 24 Aug 2019 02:07:51 GMT",
"version": "v1"
}
] | 2019-08-27 | [
[
"Kang",
"Zhaobing",
""
],
[
"Zou",
"Wei",
""
],
[
"Zhu",
"Zheng",
""
]
] | Accurate camera pose estimation result is essential for visual SLAM (VSLAM). This paper presents a novel pose correction method to improve the accuracy of the VSLAM system. Firstly, the relationship between the camera pose estimation error and bias values of map points is derived based on the optimized function in VSLA... |
1403.1974 | Jaspinder Pal | Jaspinder Pal Singh | Designing an FPGA Synthesizable Computer Vision Algorithm to Detect the
Greening of Potatoes | 5 pages, 8 figures, 2 tables, "Published with International Journal
of Engineering Trends and Technology (IJETT)" ISSN:2231-5381.
http://www.ijettjournal.org. published by seventh sense research group | International Journal of Engineering Trends and Technology(IJETT),
V8(8),438-442 February 2014 | 10.14445/22315381/IJETT-V8P275 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Potato quality control has improved in the last years thanks to automation
techniques like machine vision, mainly making the classification task between
different quality degrees faster, safer and less subjective. In our study we
are going to design a computer vision algorithm for grading of potatoes
according to the... | [
{
"created": "Sat, 8 Mar 2014 14:59:46 GMT",
"version": "v1"
}
] | 2014-03-11 | [
[
"Singh",
"Jaspinder Pal",
""
]
] | Potato quality control has improved in the last years thanks to automation techniques like machine vision, mainly making the classification task between different quality degrees faster, safer and less subjective. In our study we are going to design a computer vision algorithm for grading of potatoes according to the g... |
2301.10874 | Rohitash Chandra | Tianyi Wang, Rodney Beard, John Hawkins, Rohitash Chandra | Recursive deep learning framework for forecasting the decadal world
economic outlook | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Gross domestic product (GDP) is the most widely used indicator in
macroeconomics and the main tool for measuring a country's economic ouput. Due
to the diversity and complexity of the world economy, a wide range of models
have been used, but there are challenges in making decadal GDP forecasts given
unexpected change... | [
{
"created": "Wed, 25 Jan 2023 23:47:34 GMT",
"version": "v1"
}
] | 2023-01-30 | [
[
"Wang",
"Tianyi",
""
],
[
"Beard",
"Rodney",
""
],
[
"Hawkins",
"John",
""
],
[
"Chandra",
"Rohitash",
""
]
] | Gross domestic product (GDP) is the most widely used indicator in macroeconomics and the main tool for measuring a country's economic ouput. Due to the diversity and complexity of the world economy, a wide range of models have been used, but there are challenges in making decadal GDP forecasts given unexpected changes ... |
2004.03688 | Juan Banda | Juan M. Banda, Ramya Tekumalla, Guanyu Wang, Jingyuan Yu, Tuo Liu,
Yuning Ding, Katya Artemova, Elena Tutubalina, Gerardo Chowell | A large-scale COVID-19 Twitter chatter dataset for open scientific
research -- an international collaboration | 8 pages, 1 figure 2 table. Update: new version of paper with
up-to-date statistics and new co-authors | null | 10.3390/epidemiologia2030024 | null | cs.SI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the COVID-19 pandemic continues its march around the world, an
unprecedented amount of open data is being generated for genetics and
epidemiological research. The unparalleled rate at which many research groups
around the world are releasing data and publications on the ongoing pandemic is
allowing other scientist... | [
{
"created": "Tue, 7 Apr 2020 20:25:26 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Nov 2020 16:20:38 GMT",
"version": "v2"
}
] | 2021-08-10 | [
[
"Banda",
"Juan M.",
""
],
[
"Tekumalla",
"Ramya",
""
],
[
"Wang",
"Guanyu",
""
],
[
"Yu",
"Jingyuan",
""
],
[
"Liu",
"Tuo",
""
],
[
"Ding",
"Yuning",
""
],
[
"Artemova",
"Katya",
""
],
[
"Tutubalina... | As the COVID-19 pandemic continues its march around the world, an unprecedented amount of open data is being generated for genetics and epidemiological research. The unparalleled rate at which many research groups around the world are releasing data and publications on the ongoing pandemic is allowing other scientists ... |
1101.5687 | Alex Bronstein | Jonathan Pokrass, Alexander M. Bronstein, Michael M. Bronstein | A correspondence-less approach to matching of deformable shapes | Preprint submitted to Intl. Conference on Scale Space and Variational
Methods (SSVM'11) | null | null | null | cs.CV cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Finding a match between partially available deformable shapes is a
challenging problem with numerous applications. The problem is usually
approached by computing local descriptors on a pair of shapes and then
establishing a point-wise correspondence between the two. In this paper, we
introduce an alternative correspo... | [
{
"created": "Sat, 29 Jan 2011 10:37:23 GMT",
"version": "v1"
}
] | 2011-02-01 | [
[
"Pokrass",
"Jonathan",
""
],
[
"Bronstein",
"Alexander M.",
""
],
[
"Bronstein",
"Michael M.",
""
]
] | Finding a match between partially available deformable shapes is a challenging problem with numerous applications. The problem is usually approached by computing local descriptors on a pair of shapes and then establishing a point-wise correspondence between the two. In this paper, we introduce an alternative correspond... |
1008.0047 | Yong Cheng | Yong Cheng (Student Member, IEEE), Vincent K. N. Lau (Senior Member,
IEEE), and Yi Long | A Scalable Limited Feedback Design for Network MIMO using Per-Cell
Product Codebook | 11 pages, 5 figures, Accepted to the IEEE transactions on Wireless
Communication | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-sa/3.0/ | In network MIMO systems, channel state information is required at the
transmitter side to multiplex users in the spatial domain. Since perfect
channel knowledge is difficult to obtain in practice, \emph{limited feedback}
is a widely accepted solution. The {\em dynamic number of cooperating BSs} and
{\em heterogeneous... | [
{
"created": "Sat, 31 Jul 2010 03:49:42 GMT",
"version": "v1"
}
] | 2012-07-07 | [
[
"Cheng",
"Yong",
"",
"Student Member, IEEE"
],
[
"Lau",
"Vincent K. N.",
"",
"Senior Member,\n IEEE"
],
[
"Long",
"Yi",
""
]
] | In network MIMO systems, channel state information is required at the transmitter side to multiplex users in the spatial domain. Since perfect channel knowledge is difficult to obtain in practice, \emph{limited feedback} is a widely accepted solution. The {\em dynamic number of cooperating BSs} and {\em heterogeneous p... |
1811.00602 | Leonhard Spiegelberg | Lorenzo De Stefani, Leonhard F. Spiegelberg, Tim Kraska, Eli Upfal | VizRec: A framework for secure data exploration via visual
representation | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual representations of data (visualizations) are tools of great importance
and widespread use in data analytics as they provide users visual insight to
patterns in the observed data in a simple and effective way. However, since
visualizations tools are applied to sample data, there is a a risk of
visualizing rando... | [
{
"created": "Thu, 1 Nov 2018 19:35:11 GMT",
"version": "v1"
}
] | 2018-11-05 | [
[
"De Stefani",
"Lorenzo",
""
],
[
"Spiegelberg",
"Leonhard F.",
""
],
[
"Kraska",
"Tim",
""
],
[
"Upfal",
"Eli",
""
]
] | Visual representations of data (visualizations) are tools of great importance and widespread use in data analytics as they provide users visual insight to patterns in the observed data in a simple and effective way. However, since visualizations tools are applied to sample data, there is a a risk of visualizing random ... |
1603.07410 | Erkang Zhu | Erkang Zhu, Fatemeh Nargesian, Ken Q. Pu, Ren\'ee J. Miller | LSH Ensemble: Internet-Scale Domain Search | To appear in VLDB 2016 | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of domain search where a domain is a set of distinct
values from an unspecified universe. We use Jaccard set containment, defined as
$|Q \cap X|/|Q|$, as the relevance measure of a domain $X$ to a query domain
$Q$. Our choice of Jaccard set containment over Jaccard similarity makes our
work parti... | [
{
"created": "Thu, 24 Mar 2016 01:43:28 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Mar 2016 00:52:45 GMT",
"version": "v2"
},
{
"created": "Mon, 4 Apr 2016 18:54:13 GMT",
"version": "v3"
},
{
"created": "Sat, 23 Jul 2016 04:47:58 GMT",
"version": "v4"
}
] | 2016-07-26 | [
[
"Zhu",
"Erkang",
""
],
[
"Nargesian",
"Fatemeh",
""
],
[
"Pu",
"Ken Q.",
""
],
[
"Miller",
"Renée J.",
""
]
] | We study the problem of domain search where a domain is a set of distinct values from an unspecified universe. We use Jaccard set containment, defined as $|Q \cap X|/|Q|$, as the relevance measure of a domain $X$ to a query domain $Q$. Our choice of Jaccard set containment over Jaccard similarity makes our work particu... |
1101.6038 | Jose Antonio Martin H | Jose Antonio Martin H | A polynomial 3-colorability algorithm with automatic generation of NO
3-colorability (i.e. Co-NP) short proofs | null | null | null | null | cs.DM cs.CC cs.DS math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, an algorithm for determining 3-colorability, i.e. the decision
problem (YES/NO), in planar graphs is presented. The algorithm, although not
exact (it could produce false positives) has two very important features: (i)
it has polynomial complexity and (ii) for every "NO" answer, a "short" proof is
gener... | [
{
"created": "Mon, 31 Jan 2011 17:47:39 GMT",
"version": "v1"
}
] | 2011-02-01 | [
[
"H",
"Jose Antonio Martin",
""
]
] | In this paper, an algorithm for determining 3-colorability, i.e. the decision problem (YES/NO), in planar graphs is presented. The algorithm, although not exact (it could produce false positives) has two very important features: (i) it has polynomial complexity and (ii) for every "NO" answer, a "short" proof is generat... |
1504.01782 | Abbas Kiani | Abbas Kiani and Nirwan Ansari | Profit Maximization for Geographical Dispersed Green Data Centers | null | IEEE Transactions on Smart Grid, 2016 | 10.1109/TSG.2016.2562565 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper aims at maximizing the profit associated with running
geographically dispersed green data centers, which offer multiple classes of
service. To this end, we formulate an optimization framework which relies on
the accuracy of the G/D/1 queue in characterizing the workload distribution,
and taps on the merits... | [
{
"created": "Tue, 7 Apr 2015 23:39:59 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Aug 2015 00:05:21 GMT",
"version": "v2"
},
{
"created": "Wed, 25 Nov 2015 20:21:43 GMT",
"version": "v3"
}
] | 2018-02-07 | [
[
"Kiani",
"Abbas",
""
],
[
"Ansari",
"Nirwan",
""
]
] | This paper aims at maximizing the profit associated with running geographically dispersed green data centers, which offer multiple classes of service. To this end, we formulate an optimization framework which relies on the accuracy of the G/D/1 queue in characterizing the workload distribution, and taps on the merits o... |
2008.00017 | Kevin Fu | Kevin Fu, Tadayoshi Kohno, Daniel Lopresti, Elizabeth Mynatt, Klara
Nahrstedt, Shwetak Patel, Debra Richardson, and Ben Zorn | Safety, Security, and Privacy Threats Posed by Accelerating Trends in
the Internet of Things | A Computing Community Consortium (CCC) white paper, 9 pages | null | null | null | cs.CY cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Internet of Things (IoT) is already transforming industries, cities, and
homes. The economic value of this transformation across all industries is
estimated to be trillions of dollars and the societal impact on energy
efficiency, health, and productivity are enormous. Alongside potential benefits
of interconnecte... | [
{
"created": "Fri, 31 Jul 2020 18:04:20 GMT",
"version": "v1"
}
] | 2020-08-04 | [
[
"Fu",
"Kevin",
""
],
[
"Kohno",
"Tadayoshi",
""
],
[
"Lopresti",
"Daniel",
""
],
[
"Mynatt",
"Elizabeth",
""
],
[
"Nahrstedt",
"Klara",
""
],
[
"Patel",
"Shwetak",
""
],
[
"Richardson",
"Debra",
""
],
[... | The Internet of Things (IoT) is already transforming industries, cities, and homes. The economic value of this transformation across all industries is estimated to be trillions of dollars and the societal impact on energy efficiency, health, and productivity are enormous. Alongside potential benefits of interconnected ... |
2406.15396 | Pi Wei Chen | Jerry Chun-Wei Lin, Pi-Wei Chen, Chao-Chun Chen | Feature Purified Transformer With Cross-level Feature Guiding Decoder
For Multi-class OOD and Anomaly Deteciton | 12 pages | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reconstruction networks are prevalently used in unsupervised anomaly and
Out-of-Distribution (OOD) detection due to their independence from labeled
anomaly data. However, in multi-class datasets, the effectiveness of anomaly
detection is often compromised by the models' generalized reconstruction
capabilities, which ... | [
{
"created": "Tue, 30 Apr 2024 16:45:51 GMT",
"version": "v1"
}
] | 2024-06-25 | [
[
"Lin",
"Jerry Chun-Wei",
""
],
[
"Chen",
"Pi-Wei",
""
],
[
"Chen",
"Chao-Chun",
""
]
] | Reconstruction networks are prevalently used in unsupervised anomaly and Out-of-Distribution (OOD) detection due to their independence from labeled anomaly data. However, in multi-class datasets, the effectiveness of anomaly detection is often compromised by the models' generalized reconstruction capabilities, which al... |
2107.12566 | Nicholas Springer | Nicholas Springer (1), Wu-chang Feng (1) ((1) Portland State
University) | Thunder CTF: Learning Cloud Security on a Dime | 5 pages, 3 figures | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Organizations have rapidly shifted infrastructure and applications over to
public cloud computing services such as AWS (Amazon Web Services), Google Cloud
Platform, and Azure. Unfortunately, such services have security models that are
substantially different and more complex than traditional enterprise security
model... | [
{
"created": "Tue, 27 Jul 2021 03:01:47 GMT",
"version": "v1"
}
] | 2021-07-28 | [
[
"Springer",
"Nicholas",
""
],
[
"Feng",
"Wu-chang",
""
]
] | Organizations have rapidly shifted infrastructure and applications over to public cloud computing services such as AWS (Amazon Web Services), Google Cloud Platform, and Azure. Unfortunately, such services have security models that are substantially different and more complex than traditional enterprise security models.... |
1804.11207 | Pei Li | Pei Li, Bingyu Shen, Weishan Dong | An Anti-fraud System for Car Insurance Claim Based on Visual Evidence | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatically scene understanding using machine learning algorithms has been
widely applied to different industries to reduce the cost of manual labor.
Nowadays, insurance companies launch express vehicle insurance claim and
settlement by allowing customers uploading pictures taken by mobile devices.
This kind of ins... | [
{
"created": "Mon, 30 Apr 2018 14:03:22 GMT",
"version": "v1"
}
] | 2018-05-01 | [
[
"Li",
"Pei",
""
],
[
"Shen",
"Bingyu",
""
],
[
"Dong",
"Weishan",
""
]
] | Automatically scene understanding using machine learning algorithms has been widely applied to different industries to reduce the cost of manual labor. Nowadays, insurance companies launch express vehicle insurance claim and settlement by allowing customers uploading pictures taken by mobile devices. This kind of insur... |
1511.01306 | J\'er\'emy Emile Cohen | Jeremy E. Cohen | About Notations in Multiway Array Processing | null | null | null | null | cs.NA | http://creativecommons.org/licenses/by-sa/4.0/ | This paper gives an overview of notations used in multiway array processing.
We redefine the vectorization and matricization operators to comply with some
properties of the Kronecker product. The tensor product and Kronecker product
are also represented with two different symbols, and it is shown how these
notations ... | [
{
"created": "Wed, 4 Nov 2015 12:38:56 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Feb 2016 16:46:59 GMT",
"version": "v2"
}
] | 2016-02-04 | [
[
"Cohen",
"Jeremy E.",
""
]
] | This paper gives an overview of notations used in multiway array processing. We redefine the vectorization and matricization operators to comply with some properties of the Kronecker product. The tensor product and Kronecker product are also represented with two different symbols, and it is shown how these notations le... |
2002.11616 | Xiaoyu Xiang | Xiaoyu Xiang, Yapeng Tian, Yulun Zhang, Yun Fu, Jan P. Allebach,
Chenliang Xu | Zooming Slow-Mo: Fast and Accurate One-Stage Space-Time Video
Super-Resolution | This work is accepted in CVPR 2020. The source code and pre-trained
model are available on https://github.com/Mukosame/Zooming-Slow-Mo-CVPR-2020.
12 pages, 10 figures | null | null | null | cs.CV cs.MM eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we explore the space-time video super-resolution task, which
aims to generate a high-resolution (HR) slow-motion video from a low frame rate
(LFR), low-resolution (LR) video. A simple solution is to split it into two
sub-tasks: video frame interpolation (VFI) and video super-resolution (VSR).
However, ... | [
{
"created": "Wed, 26 Feb 2020 16:59:48 GMT",
"version": "v1"
}
] | 2020-02-27 | [
[
"Xiang",
"Xiaoyu",
""
],
[
"Tian",
"Yapeng",
""
],
[
"Zhang",
"Yulun",
""
],
[
"Fu",
"Yun",
""
],
[
"Allebach",
"Jan P.",
""
],
[
"Xu",
"Chenliang",
""
]
] | In this paper, we explore the space-time video super-resolution task, which aims to generate a high-resolution (HR) slow-motion video from a low frame rate (LFR), low-resolution (LR) video. A simple solution is to split it into two sub-tasks: video frame interpolation (VFI) and video super-resolution (VSR). However, te... |
2011.09563 | Hanqing Chao | Jiajin Zhang, Hanqing Chao, Pingkun Yan | Robustified Domain Adaptation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unsupervised domain adaptation (UDA) is widely used to transfer knowledge
from a labeled source domain to an unlabeled target domain with different data
distribution. While extensive studies attested that deep learning models are
vulnerable to adversarial attacks, the adversarial robustness of models in
domain adapta... | [
{
"created": "Wed, 18 Nov 2020 22:21:54 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Mar 2021 21:18:25 GMT",
"version": "v2"
}
] | 2021-03-26 | [
[
"Zhang",
"Jiajin",
""
],
[
"Chao",
"Hanqing",
""
],
[
"Yan",
"Pingkun",
""
]
] | Unsupervised domain adaptation (UDA) is widely used to transfer knowledge from a labeled source domain to an unlabeled target domain with different data distribution. While extensive studies attested that deep learning models are vulnerable to adversarial attacks, the adversarial robustness of models in domain adaptati... |
1702.01844 | Tianyi Pan | Tianyi Pan, Alan Kuhnle, Xiang Li and My T. Thai | Popular Topics Spread Faster: New Dimension for Influence Propagation in
Online Social Networks | null | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Information can propagate among Online Social Network (OSN) users at a high
speed, which makes the OSNs become important platforms for viral marketing.
Although the viral marketing related problems in OSNs have been extensively
studied in the past decade, the existing works all assume known propagation
rates and are ... | [
{
"created": "Tue, 7 Feb 2017 01:59:03 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Aug 2017 01:48:39 GMT",
"version": "v2"
}
] | 2017-08-28 | [
[
"Pan",
"Tianyi",
""
],
[
"Kuhnle",
"Alan",
""
],
[
"Li",
"Xiang",
""
],
[
"Thai",
"My T.",
""
]
] | Information can propagate among Online Social Network (OSN) users at a high speed, which makes the OSNs become important platforms for viral marketing. Although the viral marketing related problems in OSNs have been extensively studied in the past decade, the existing works all assume known propagation rates and are no... |
2110.05371 | Pablo Moriano | Jonathan Bryan and Pablo Moriano | Graph-Based Machine Learning Improves Just-in-Time Defect Prediction | 22 pages, 2 figures, 4 tables; references added; expanded results to
match baseline conditions | PLoS ONE 18(4): e0284077, 2023 | 10.1371/journal.pone.0284077 | null | cs.SE cs.LG cs.SI stat.ML | http://creativecommons.org/licenses/by/4.0/ | The increasing complexity of today's software requires the contribution of
thousands of developers. This complex collaboration structure makes developers
more likely to introduce defect-prone changes that lead to software faults.
Determining when these defect-prone changes are introduced has proven
challenging, and u... | [
{
"created": "Mon, 11 Oct 2021 16:00:02 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Jun 2022 13:39:57 GMT",
"version": "v2"
},
{
"created": "Fri, 14 Apr 2023 16:02:35 GMT",
"version": "v3"
}
] | 2023-04-17 | [
[
"Bryan",
"Jonathan",
""
],
[
"Moriano",
"Pablo",
""
]
] | The increasing complexity of today's software requires the contribution of thousands of developers. This complex collaboration structure makes developers more likely to introduce defect-prone changes that lead to software faults. Determining when these defect-prone changes are introduced has proven challenging, and usi... |
2306.15644 | Chiori Hori Ph.D. | Chiori Hori, Puyuan Peng, David Harwath, Xinyu Liu, Kei Ota, Siddarth
Jain, Radu Corcodel, Devesh Jha, Diego Romeres, Jonathan Le Roux | Style-transfer based Speech and Audio-visual Scene Understanding for
Robot Action Sequence Acquisition from Videos | Accepted to Interspeech2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To realize human-robot collaboration, robots need to execute actions for new
tasks according to human instructions given finite prior knowledge. Human
experts can share their knowledge of how to perform a task with a robot through
multi-modal instructions in their demonstrations, showing a sequence of
short-horizon s... | [
{
"created": "Tue, 27 Jun 2023 17:37:53 GMT",
"version": "v1"
}
] | 2023-06-28 | [
[
"Hori",
"Chiori",
""
],
[
"Peng",
"Puyuan",
""
],
[
"Harwath",
"David",
""
],
[
"Liu",
"Xinyu",
""
],
[
"Ota",
"Kei",
""
],
[
"Jain",
"Siddarth",
""
],
[
"Corcodel",
"Radu",
""
],
[
"Jha",
"Deve... | To realize human-robot collaboration, robots need to execute actions for new tasks according to human instructions given finite prior knowledge. Human experts can share their knowledge of how to perform a task with a robot through multi-modal instructions in their demonstrations, showing a sequence of short-horizon ste... |
0805.0893 | EDA Publishing Association | T. Veijola, Giorgio De Pasquale, Aurelio Som\`a | Comparison Between Damping Coefficients of Measured Perforated
Micromechanical Test Structures and Compact Models | Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838) | Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008) | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Measured damping coefficients of six different perforated micromechanical
test structures are compared with damping coefficients given by published
compact models. The motion of the perforated plates is almost translational,
the surface shape is rectangular, and the perforation is uniform validating the
assumptions m... | [
{
"created": "Wed, 7 May 2008 09:17:47 GMT",
"version": "v1"
}
] | 2008-12-18 | [
[
"Veijola",
"T.",
""
],
[
"De Pasquale",
"Giorgio",
""
],
[
"Somà",
"Aurelio",
""
]
] | Measured damping coefficients of six different perforated micromechanical test structures are compared with damping coefficients given by published compact models. The motion of the perforated plates is almost translational, the surface shape is rectangular, and the perforation is uniform validating the assumptions mad... |
2111.04703 | Tajuddin Manhar Mohammed | Tajuddin Manhar Mohammed, Lakshmanan Nataraj, Satish Chikkagoudar,
Shivkumar Chandrasekaran, B.S. Manjunath | HAPSSA: Holistic Approach to PDF Malware Detection Using Signal and
Statistical Analysis | Submitted version - MILCOM 2021 IEEE Military Communications
Conference | null | null | null | cs.CR cs.LG eess.SP | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Malicious PDF documents present a serious threat to various security
organizations that require modern threat intelligence platforms to effectively
analyze and characterize the identity and behavior of PDF malware.
State-of-the-art approaches use machine learning (ML) to learn features that
characterize PDF malware. ... | [
{
"created": "Mon, 8 Nov 2021 18:32:47 GMT",
"version": "v1"
}
] | 2021-11-09 | [
[
"Mohammed",
"Tajuddin Manhar",
""
],
[
"Nataraj",
"Lakshmanan",
""
],
[
"Chikkagoudar",
"Satish",
""
],
[
"Chandrasekaran",
"Shivkumar",
""
],
[
"Manjunath",
"B. S.",
""
]
] | Malicious PDF documents present a serious threat to various security organizations that require modern threat intelligence platforms to effectively analyze and characterize the identity and behavior of PDF malware. State-of-the-art approaches use machine learning (ML) to learn features that characterize PDF malware. Ho... |
1804.09650 | Dinh-Luan Nguyen | Dinh-Luan Nguyen, Kai Cao and Anil K. Jain | Automatic Latent Fingerprint Segmentation | Accepted (Oral) in BTAS 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a simple but effective method for automatic latent fingerprint
segmentation, called SegFinNet. SegFinNet takes a latent image as an input and
outputs a binary mask highlighting the friction ridge pattern. Our algorithm
combines fully convolutional neural network and detection-based approaches to
process th... | [
{
"created": "Wed, 25 Apr 2018 16:09:02 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Sep 2018 02:20:28 GMT",
"version": "v2"
}
] | 2018-09-05 | [
[
"Nguyen",
"Dinh-Luan",
""
],
[
"Cao",
"Kai",
""
],
[
"Jain",
"Anil K.",
""
]
] | We present a simple but effective method for automatic latent fingerprint segmentation, called SegFinNet. SegFinNet takes a latent image as an input and outputs a binary mask highlighting the friction ridge pattern. Our algorithm combines fully convolutional neural network and detection-based approaches to process the ... |
1511.01568 | EPTCS | Jaap Boender (Middlesex University), Florian Kamm\"uller (Middlesex
University), Rajagopal Nagarajan (Middlesex University) | Formalization of Quantum Protocols using Coq | In Proceedings QPL 2015, arXiv:1511.01181 | EPTCS 195, 2015, pp. 71-83 | 10.4204/EPTCS.195.6 | null | cs.LO cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Quantum Information Processing, which is an exciting area of research at the
intersection of physics and computer science, has great potential for
influencing the future development of information processing systems. The
building of practical, general purpose Quantum Computers may be some years into
the future. Howev... | [
{
"created": "Thu, 5 Nov 2015 01:42:01 GMT",
"version": "v1"
}
] | 2015-11-06 | [
[
"Boender",
"Jaap",
"",
"Middlesex University"
],
[
"Kammüller",
"Florian",
"",
"Middlesex\n University"
],
[
"Nagarajan",
"Rajagopal",
"",
"Middlesex University"
]
] | Quantum Information Processing, which is an exciting area of research at the intersection of physics and computer science, has great potential for influencing the future development of information processing systems. The building of practical, general purpose Quantum Computers may be some years into the future. However... |
1902.05052 | Peeter Laud | Aivo Toots and Reedik Tuuling and Maksym Yerokhin and Marlon Dumas and
Luciano Garc\'ia-Ba\~nuelos and Peeter Laud and Raimundas Matulevi\v{c}ius
and Alisa Pankova and Martin Pettai and Pille Pullonen and Jake Tom | Business Process Privacy Analysis in Pleak | Appears at 22nd International Conference on Fundamental Approaches to
Software Engineering (FASE), April 2019 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pleak is a tool to capture and analyze privacy-enhanced business process
models to characterize and quantify to what extent the outputs of a process
leak information about its inputs. Pleak incorporates an extensible set of
analysis plugins, which enable users to inspect potential leakages at multiple
levels of detai... | [
{
"created": "Wed, 13 Feb 2019 18:32:01 GMT",
"version": "v1"
}
] | 2019-02-14 | [
[
"Toots",
"Aivo",
""
],
[
"Tuuling",
"Reedik",
""
],
[
"Yerokhin",
"Maksym",
""
],
[
"Dumas",
"Marlon",
""
],
[
"García-Bañuelos",
"Luciano",
""
],
[
"Laud",
"Peeter",
""
],
[
"Matulevičius",
"Raimundas",
""... | Pleak is a tool to capture and analyze privacy-enhanced business process models to characterize and quantify to what extent the outputs of a process leak information about its inputs. Pleak incorporates an extensible set of analysis plugins, which enable users to inspect potential leakages at multiple levels of detail. |
2310.11626 | Brenda Praggastis PhD | Brenda Praggastis, Sinan Aksoy, Dustin Arendt, Mark Bonicillo, Cliff
Joslyn, Emilie Purvine, Madelyn Shapiro, Ji Young Yun | HyperNetX: A Python package for modeling complex network data as
hypergraphs | 3 pages, 2 figures | null | null | null | cs.MS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | HyperNetX (HNX) is an open source Python library for the analysis and
visualization of complex network data modeled as hypergraphs. Initially
released in 2019, HNX facilitates exploratory data analysis of complex networks
using algebraic topology, combinatorics, and generalized hypergraph and graph
theoretical method... | [
{
"created": "Tue, 17 Oct 2023 23:24:11 GMT",
"version": "v1"
}
] | 2023-10-19 | [
[
"Praggastis",
"Brenda",
""
],
[
"Aksoy",
"Sinan",
""
],
[
"Arendt",
"Dustin",
""
],
[
"Bonicillo",
"Mark",
""
],
[
"Joslyn",
"Cliff",
""
],
[
"Purvine",
"Emilie",
""
],
[
"Shapiro",
"Madelyn",
""
],
[
... | HyperNetX (HNX) is an open source Python library for the analysis and visualization of complex network data modeled as hypergraphs. Initially released in 2019, HNX facilitates exploratory data analysis of complex networks using algebraic topology, combinatorics, and generalized hypergraph and graph theoretical methods ... |
2311.13764 | Christoph Grunau | Mohsen Ghaffari and Christoph Grunau and V\'aclav Rozho\v{n} | Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations
via Pairwise Independence | null | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | We present a novel technique for work-efficient parallel derandomization, for
algorithms that rely on the concentration of measure bounds such as Chernoff,
Hoeffding, and Bernstein inequalities. Our method increases the algorithm's
computational work and depth by only polylogarithmic factors. Before our work,
the onl... | [
{
"created": "Thu, 23 Nov 2023 01:30:25 GMT",
"version": "v1"
}
] | 2023-11-27 | [
[
"Ghaffari",
"Mohsen",
""
],
[
"Grunau",
"Christoph",
""
],
[
"Rozhoň",
"Václav",
""
]
] | We present a novel technique for work-efficient parallel derandomization, for algorithms that rely on the concentration of measure bounds such as Chernoff, Hoeffding, and Bernstein inequalities. Our method increases the algorithm's computational work and depth by only polylogarithmic factors. Before our work, the only ... |
1607.07570 | Mark Newman | Xiao Zhang, Cristopher Moore, and M. E. J. Newman | Random graph models for dynamic networks | 15 pages, four figures | Eur. Phys. J. B 90, 200 (2017) | 10.1140/epjb/e2017-80122-8 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose generalizations of a number of standard network models, including
the classic random graph, the configuration model, and the stochastic block
model, to the case of time-varying networks. We assume that the presence and
absence of edges are governed by continuous-time Markov processes with rate
parameters t... | [
{
"created": "Tue, 26 Jul 2016 07:37:25 GMT",
"version": "v1"
}
] | 2018-05-02 | [
[
"Zhang",
"Xiao",
""
],
[
"Moore",
"Cristopher",
""
],
[
"Newman",
"M. E. J.",
""
]
] | We propose generalizations of a number of standard network models, including the classic random graph, the configuration model, and the stochastic block model, to the case of time-varying networks. We assume that the presence and absence of edges are governed by continuous-time Markov processes with rate parameters tha... |
2303.01377 | Daniel Sens | Daniel Sens and Ario Sadafi, Francesco Paolo Casale, Nassir Navab,
Carsten Marr | BEL: A Bag Embedding Loss for Transformer enhances Multiple Instance
Whole Slide Image Classification | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multiple Instance Learning (MIL) has become the predominant approach for
classification tasks on gigapixel histopathology whole slide images (WSIs).
Within the MIL framework, single WSIs (bags) are decomposed into patches
(instances), with only WSI-level annotation available. Recent MIL approaches
produce highly info... | [
{
"created": "Thu, 2 Mar 2023 16:02:55 GMT",
"version": "v1"
}
] | 2023-03-03 | [
[
"Sens",
"Daniel",
""
],
[
"Sadafi",
"Ario",
""
],
[
"Casale",
"Francesco Paolo",
""
],
[
"Navab",
"Nassir",
""
],
[
"Marr",
"Carsten",
""
]
] | Multiple Instance Learning (MIL) has become the predominant approach for classification tasks on gigapixel histopathology whole slide images (WSIs). Within the MIL framework, single WSIs (bags) are decomposed into patches (instances), with only WSI-level annotation available. Recent MIL approaches produce highly inform... |
2305.07299 | Yanmin Wu | Yanmin Wu, Yunzhou Zhang, Delong Zhu, Zhiqiang Deng, Wenkai Sun, Xin
Chen, Jian Zhang | An Object SLAM Framework for Association, Mapping, and High-Level Tasks | Accepted by IEEE Transactions on Robotics(T-RO) | IEEE Transactions on Robotics, vol. 39, no. 4, pp. 2912-2932, Aug.
2023 | 10.1109/TRO.2023.3273180 | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Object SLAM is considered increasingly significant for robot high-level
perception and decision-making. Existing studies fall short in terms of data
association, object representation, and semantic mapping and frequently rely on
additional assumptions, limiting their performance. In this paper, we present a
comprehen... | [
{
"created": "Fri, 12 May 2023 08:10:14 GMT",
"version": "v1"
}
] | 2023-10-09 | [
[
"Wu",
"Yanmin",
""
],
[
"Zhang",
"Yunzhou",
""
],
[
"Zhu",
"Delong",
""
],
[
"Deng",
"Zhiqiang",
""
],
[
"Sun",
"Wenkai",
""
],
[
"Chen",
"Xin",
""
],
[
"Zhang",
"Jian",
""
]
] | Object SLAM is considered increasingly significant for robot high-level perception and decision-making. Existing studies fall short in terms of data association, object representation, and semantic mapping and frequently rely on additional assumptions, limiting their performance. In this paper, we present a comprehensi... |
1911.07104 | Farzaneh Khoshnevisan | Farzaneh Khoshnevisan, Zhewen Fan | RSM-GAN: A Convolutional Recurrent GAN for Anomaly Detection in
Contaminated Seasonal Multivariate Time Series | 8 pages, 5 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robust anomaly detection is a requirement for monitoring complex modern
systems with applications such as cyber-security, fraud prevention, and
maintenance. These systems generate multiple correlated time series that are
highly seasonal and noisy. This paper presents a novel unsupervised deep
learning architecture fo... | [
{
"created": "Sat, 16 Nov 2019 21:45:38 GMT",
"version": "v1"
}
] | 2019-11-19 | [
[
"Khoshnevisan",
"Farzaneh",
""
],
[
"Fan",
"Zhewen",
""
]
] | Robust anomaly detection is a requirement for monitoring complex modern systems with applications such as cyber-security, fraud prevention, and maintenance. These systems generate multiple correlated time series that are highly seasonal and noisy. This paper presents a novel unsupervised deep learning architecture for ... |
1908.02548 | Will Nash | W.T. Nash, C.J. Powell, T. Drummond, N. Birbilis | Automated Corrosion Detection Using Crowd Sourced Training for Deep
Learning | presubmission, computer vision, deep learning | null | null | null | cs.HC eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The automated detection of corrosion from images (i.e., photographs) or video
(i.e., drone footage) presents significant advantages in terms of corrosion
monitoring. Such advantages include access to remote locations, mitigation of
risk to inspectors, cost savings and monitoring speed. The automated detection
of corr... | [
{
"created": "Sun, 4 Aug 2019 00:44:15 GMT",
"version": "v1"
}
] | 2019-08-08 | [
[
"Nash",
"W. T.",
""
],
[
"Powell",
"C. J.",
""
],
[
"Drummond",
"T.",
""
],
[
"Birbilis",
"N.",
""
]
] | The automated detection of corrosion from images (i.e., photographs) or video (i.e., drone footage) presents significant advantages in terms of corrosion monitoring. Such advantages include access to remote locations, mitigation of risk to inspectors, cost savings and monitoring speed. The automated detection of corros... |
2205.01906 | Xue Bin Peng | Xue Bin Peng, Yunrong Guo, Lina Halper, Sergey Levine, Sanja Fidler | ASE: Large-Scale Reusable Adversarial Skill Embeddings for Physically
Simulated Characters | null | null | 10.1145/3528223.3530110 | null | cs.GR cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | The incredible feats of athleticism demonstrated by humans are made possible
in part by a vast repertoire of general-purpose motor skills, acquired through
years of practice and experience. These skills not only enable humans to
perform complex tasks, but also provide powerful priors for guiding their
behaviors when ... | [
{
"created": "Wed, 4 May 2022 06:13:28 GMT",
"version": "v1"
},
{
"created": "Thu, 5 May 2022 17:25:14 GMT",
"version": "v2"
}
] | 2022-05-06 | [
[
"Peng",
"Xue Bin",
""
],
[
"Guo",
"Yunrong",
""
],
[
"Halper",
"Lina",
""
],
[
"Levine",
"Sergey",
""
],
[
"Fidler",
"Sanja",
""
]
] | The incredible feats of athleticism demonstrated by humans are made possible in part by a vast repertoire of general-purpose motor skills, acquired through years of practice and experience. These skills not only enable humans to perform complex tasks, but also provide powerful priors for guiding their behaviors when le... |
1411.4972 | An Zeng | Hao Liao, An Zeng, Yi-Cheng Zhang | Towards an objective ranking in online reputation systems: the effect of
the rating projection | 6 pages, 4 figures, 3 tables | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Online reputation systems are commonly used by e-commerce providers nowadays.
In order to generate an objective ranking of online items' quality according to
users' ratings, many sophisticated algorithms have been proposed in the
literature. In this paper, instead of proposing new algorithms we focus on a
more fundam... | [
{
"created": "Sat, 15 Nov 2014 15:22:08 GMT",
"version": "v1"
}
] | 2014-11-19 | [
[
"Liao",
"Hao",
""
],
[
"Zeng",
"An",
""
],
[
"Zhang",
"Yi-Cheng",
""
]
] | Online reputation systems are commonly used by e-commerce providers nowadays. In order to generate an objective ranking of online items' quality according to users' ratings, many sophisticated algorithms have been proposed in the literature. In this paper, instead of proposing new algorithms we focus on a more fundamen... |
1910.03227 | Soumyabrata Dev | Soumyabrata Dev, Hossein Javidnia, Murhaf Hossari, Matthew Nicholson,
Killian McCabe, Atul Nautiyal, Clare Conran, Jian Tang, Wei Xu, and
Fran\c{c}ois Piti\'e | Identifying Candidate Spaces for Advert Implantation | Published in Proc. IEEE 7th International Conference on Computer
Science and Network Technology, 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Virtual advertising is an important and promising feature in the area of
online advertising. It involves integrating adverts onto live or recorded
videos for product placements and targeted advertisements. Such integration of
adverts is primarily done by video editors in the post-production stage, which
is cumbersome... | [
{
"created": "Tue, 8 Oct 2019 06:12:53 GMT",
"version": "v1"
}
] | 2019-10-09 | [
[
"Dev",
"Soumyabrata",
""
],
[
"Javidnia",
"Hossein",
""
],
[
"Hossari",
"Murhaf",
""
],
[
"Nicholson",
"Matthew",
""
],
[
"McCabe",
"Killian",
""
],
[
"Nautiyal",
"Atul",
""
],
[
"Conran",
"Clare",
""
],
... | Virtual advertising is an important and promising feature in the area of online advertising. It involves integrating adverts onto live or recorded videos for product placements and targeted advertisements. Such integration of adverts is primarily done by video editors in the post-production stage, which is cumbersome a... |
1708.03421 | Leila Kosseim | Andre Cianflone and Leila Kosseim | N-gram and Neural Language Models for Discriminating Similar Languages | 8 pages | Proceedings of the Third Workshop on NLP for Similar Languages,
Varieties and Dialects (VarDial3). A workshop of the 26th International
Conference on Computational Linguistics (COLING 2016, Osaka, Japan), pp
243-250 (2016) | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes our submission (named clac) to the 2016 Discriminating
Similar Languages (DSL) shared task. We participated in the closed Sub-task 1
(Set A) with two separate machine learning techniques. The first approach is a
character based Convolution Neural Network with a bidirectional long short term
memor... | [
{
"created": "Fri, 11 Aug 2017 02:27:26 GMT",
"version": "v1"
}
] | 2017-08-14 | [
[
"Cianflone",
"Andre",
""
],
[
"Kosseim",
"Leila",
""
]
] | This paper describes our submission (named clac) to the 2016 Discriminating Similar Languages (DSL) shared task. We participated in the closed Sub-task 1 (Set A) with two separate machine learning techniques. The first approach is a character based Convolution Neural Network with a bidirectional long short term memory ... |
2404.14435 | Shixuan Gu | Shixuan Gu, Jason Ken Adhinarta, Mikhail Bessmeltsev, Jiancheng Yang,
Jessica Zhang, Daniel Berger, Jeff W. Lichtman, Hanspeter Pfister, and
Donglai Wei | FreSeg: Frenet-Frame-based Part Segmentation for 3D Curvilinear
Structures | 10 pages, 4 figures | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | Part segmentation is a crucial task for 3D curvilinear structures like neuron
dendrites and blood vessels, enabling the analysis of dendritic spines and
aneurysms with scientific and clinical significance. However, their diversely
winded morphology poses a generalization challenge to existing deep learning
methods, w... | [
{
"created": "Fri, 19 Apr 2024 16:40:24 GMT",
"version": "v1"
}
] | 2024-04-24 | [
[
"Gu",
"Shixuan",
""
],
[
"Adhinarta",
"Jason Ken",
""
],
[
"Bessmeltsev",
"Mikhail",
""
],
[
"Yang",
"Jiancheng",
""
],
[
"Zhang",
"Jessica",
""
],
[
"Berger",
"Daniel",
""
],
[
"Lichtman",
"Jeff W.",
""
... | Part segmentation is a crucial task for 3D curvilinear structures like neuron dendrites and blood vessels, enabling the analysis of dendritic spines and aneurysms with scientific and clinical significance. However, their diversely winded morphology poses a generalization challenge to existing deep learning methods, whi... |
2407.20463 | Rakesh Mundlamuri | Rakesh Mundlamuri, Rajeev Gangula, Florian Kaltenberger, Raymond Knopp | 5G NR Positioning with OpenAirInterface: Tools and Methodologies | null | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | The fifth-generation new radio (5G NR) technology is expected to provide
precise and reliable positioning capabilities along with high data rates. The
Third Generation Partnership Project (3GPP) has started introducing positioning
techniques from Release-16 based on time, angle, and signal strength using
reference si... | [
{
"created": "Mon, 29 Jul 2024 23:42:12 GMT",
"version": "v1"
}
] | 2024-07-31 | [
[
"Mundlamuri",
"Rakesh",
""
],
[
"Gangula",
"Rajeev",
""
],
[
"Kaltenberger",
"Florian",
""
],
[
"Knopp",
"Raymond",
""
]
] | The fifth-generation new radio (5G NR) technology is expected to provide precise and reliable positioning capabilities along with high data rates. The Third Generation Partnership Project (3GPP) has started introducing positioning techniques from Release-16 based on time, angle, and signal strength using reference sign... |
2310.17164 | Mohana Prasad Sathya Moorthy | Long-Huei Chen, Mohana Prasad Sathya Moorthy, and Pratyaksh Sharma | Bridging Phylogeny and Taxonomy with Protein-protein Interaction
Networks | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | The protein-protein interaction (PPI) network provides an overview of the
complex biological reactions vital to an organism's metabolism and survival.
Even though in the past PPI network were compared across organisms in detail,
there has not been large-scale research on how individual PPI networks reflect
on the spe... | [
{
"created": "Thu, 26 Oct 2023 05:32:33 GMT",
"version": "v1"
}
] | 2023-10-27 | [
[
"Chen",
"Long-Huei",
""
],
[
"Moorthy",
"Mohana Prasad Sathya",
""
],
[
"Sharma",
"Pratyaksh",
""
]
] | The protein-protein interaction (PPI) network provides an overview of the complex biological reactions vital to an organism's metabolism and survival. Even though in the past PPI network were compared across organisms in detail, there has not been large-scale research on how individual PPI networks reflect on the speci... |
1712.01640 | Dawit Mureja Argaw | Malinda Vania and Dawit Mureja and Deukhee Lee | Automatic Spine Segmentation using Convolutional Neural Network via
Redundant Generation of Class Labels for 3D Spine Modeling | 18 pages, 5 figures, 3 tables | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There has been a significant increase from 2010 to 2016 in the number of
people suffering from spine problems. The automatic image segmentation of the
spine obtained from a computed tomography (CT) image is important for
diagnosing spine conditions and for performing surgery with computer-assisted
surgery systems. Th... | [
{
"created": "Wed, 29 Nov 2017 16:19:07 GMT",
"version": "v1"
}
] | 2017-12-06 | [
[
"Vania",
"Malinda",
""
],
[
"Mureja",
"Dawit",
""
],
[
"Lee",
"Deukhee",
""
]
] | There has been a significant increase from 2010 to 2016 in the number of people suffering from spine problems. The automatic image segmentation of the spine obtained from a computed tomography (CT) image is important for diagnosing spine conditions and for performing surgery with computer-assisted surgery systems. The ... |
1802.10303 | Abolfazl Asudeh | Abolfazl Asudeh and Azade Nazi and Nan Zhang and Gautam Das and H. V.
Jagadish | RRR: Rank-Regret Representative | null | null | 10.1145/3299869.3300080 | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Selecting the best items in a dataset is a common task in data exploration.
However, the concept of "best" lies in the eyes of the beholder: different
users may consider different attributes more important, and hence arrive at
different rankings. Nevertheless, one can remove "dominated" items and create a
"representa... | [
{
"created": "Wed, 28 Feb 2018 08:24:02 GMT",
"version": "v1"
},
{
"created": "Sat, 3 Mar 2018 17:14:31 GMT",
"version": "v2"
}
] | 2023-04-27 | [
[
"Asudeh",
"Abolfazl",
""
],
[
"Nazi",
"Azade",
""
],
[
"Zhang",
"Nan",
""
],
[
"Das",
"Gautam",
""
],
[
"Jagadish",
"H. V.",
""
]
] | Selecting the best items in a dataset is a common task in data exploration. However, the concept of "best" lies in the eyes of the beholder: different users may consider different attributes more important, and hence arrive at different rankings. Nevertheless, one can remove "dominated" items and create a "representati... |
2106.01135 | Abdellah Aznag | Abdellah Aznag, Vineet Goyal and Noemie Perivier | MNL-Bandit with Knapsacks: a near-optimal algorithm | Improved the regret bound/assumptions. Corrected the abstract | null | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a dynamic assortment selection problem where a seller has a fixed
inventory of $N$ substitutable products and faces an unknown demand that
arrives sequentially over $T$ periods. In each period, the seller needs to
decide on the assortment of products (satisfying certain constraints) to offer
to the custom... | [
{
"created": "Wed, 2 Jun 2021 13:05:34 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Feb 2023 22:18:42 GMT",
"version": "v2"
},
{
"created": "Sat, 20 Jan 2024 17:23:05 GMT",
"version": "v3"
},
{
"created": "Tue, 23 Jan 2024 16:52:16 GMT",
"version": "v4"
},
{
"cr... | 2024-01-25 | [
[
"Aznag",
"Abdellah",
""
],
[
"Goyal",
"Vineet",
""
],
[
"Perivier",
"Noemie",
""
]
] | We consider a dynamic assortment selection problem where a seller has a fixed inventory of $N$ substitutable products and faces an unknown demand that arrives sequentially over $T$ periods. In each period, the seller needs to decide on the assortment of products (satisfying certain constraints) to offer to the customer... |
1602.05256 | Wichai Shanklin | Wichai Shanklin | 2D SEM images turn into 3D object models | null | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The scanning electron microscopy (SEM) is probably one the most fascinating
examination approach that has been used since more than two decades to detailed
inspection of micro scale objects. Most of the scanning electron microscopes
could only produce 2D images that could not assist operational analysis of
microscopi... | [
{
"created": "Wed, 17 Feb 2016 00:41:58 GMT",
"version": "v1"
}
] | 2016-02-18 | [
[
"Shanklin",
"Wichai",
""
]
] | The scanning electron microscopy (SEM) is probably one the most fascinating examination approach that has been used since more than two decades to detailed inspection of micro scale objects. Most of the scanning electron microscopes could only produce 2D images that could not assist operational analysis of microscopic ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.