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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1407.1923 | Eli Fox-Epstein | Eli Fox-Epstein, Ryuhei Uehara | The Convex Configurations of "Sei Shonagon Chie no Ita" and Other
Dissection Puzzles | null | null | null | null | cs.CG math.HO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The tangram and Sei Shonagon Chie no Ita are popular dissection puzzles
consisting of seven pieces. Each puzzle can be formed by identifying edges from
sixteen identical right isosceles triangles. It is known that the tangram can
form 13 convex polygons. We show that Sei Shonagon Chie no Ita can form 16
convex polygo... | [
{
"created": "Tue, 8 Jul 2014 01:42:23 GMT",
"version": "v1"
}
] | 2014-07-09 | [
[
"Fox-Epstein",
"Eli",
""
],
[
"Uehara",
"Ryuhei",
""
]
] | The tangram and Sei Shonagon Chie no Ita are popular dissection puzzles consisting of seven pieces. Each puzzle can be formed by identifying edges from sixteen identical right isosceles triangles. It is known that the tangram can form 13 convex polygons. We show that Sei Shonagon Chie no Ita can form 16 convex polygons... |
2006.06341 | Tobias Kuhn | Timo Lek, Anna de Groot, Tobias Kuhn, Roser Morante | Provenance for Linguistic Corpora Through Nanopublications | null | In Proceedings of the 14th Linguistic Annotation Workshop (LAW),
co-located with COLING 2020 | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Research in Computational Linguistics is dependent on text corpora for
training and testing new tools and methodologies. While there exists a plethora
of annotated linguistic information, these corpora are often not interoperable
without significant manual work. Moreover, these annotations might have evolved
into dif... | [
{
"created": "Thu, 11 Jun 2020 11:30:30 GMT",
"version": "v1"
},
{
"created": "Mon, 2 Nov 2020 07:29:09 GMT",
"version": "v2"
}
] | 2020-11-03 | [
[
"Lek",
"Timo",
""
],
[
"de Groot",
"Anna",
""
],
[
"Kuhn",
"Tobias",
""
],
[
"Morante",
"Roser",
""
]
] | Research in Computational Linguistics is dependent on text corpora for training and testing new tools and methodologies. While there exists a plethora of annotated linguistic information, these corpora are often not interoperable without significant manual work. Moreover, these annotations might have evolved into diffe... |
0704.0217 | Wiroonsak Santipach | Wiroonsak Santipach and Michael L. Honig | Capacity of a Multiple-Antenna Fading Channel with a Quantized Precoding
Matrix | null | IEEE Trans. Inf. Theory, vol. 55, no. 3, pp. 1218--1234, March
2009 | 10.1109/TIT.2008.2011437 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a multiple-input multiple-output (MIMO) channel, feedback from the
receiver can be used to specify a transmit precoding matrix, which selectively
activates the strongest channel modes. Here we analyze the performance of
Random Vector Quantization (RVQ), in which the precoding matrix is selected
from a random co... | [
{
"created": "Mon, 2 Apr 2007 15:35:24 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Feb 2009 03:49:20 GMT",
"version": "v2"
}
] | 2010-08-27 | [
[
"Santipach",
"Wiroonsak",
""
],
[
"Honig",
"Michael L.",
""
]
] | Given a multiple-input multiple-output (MIMO) channel, feedback from the receiver can be used to specify a transmit precoding matrix, which selectively activates the strongest channel modes. Here we analyze the performance of Random Vector Quantization (RVQ), in which the precoding matrix is selected from a random code... |
1302.1064 | Dominik Kempa | Juha K\"arkk\"ainen and Dominik Kempa and Simon J. Puglisi | Lightweight Lempel-Ziv Parsing | 12 pages | null | 10.1007/978-3-642-38527-8_14 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a new approach to LZ77 factorization that uses O(n/d) words of
working space and O(dn) time for any d >= 1 (for polylogarithmic alphabet
sizes). We also describe carefully engineered implementations of alternative
approaches to lightweight LZ77 factorization. Extensive experiments show that
the new algor... | [
{
"created": "Tue, 5 Feb 2013 15:34:53 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Feb 2013 10:15:05 GMT",
"version": "v2"
}
] | 2020-12-11 | [
[
"Kärkkäinen",
"Juha",
""
],
[
"Kempa",
"Dominik",
""
],
[
"Puglisi",
"Simon J.",
""
]
] | We introduce a new approach to LZ77 factorization that uses O(n/d) words of working space and O(dn) time for any d >= 1 (for polylogarithmic alphabet sizes). We also describe carefully engineered implementations of alternative approaches to lightweight LZ77 factorization. Extensive experiments show that the new algorit... |
1805.10047 | Mamoru Komachi | Michiki Kurosawa, Yukio Matsumura, Hayahide Yamagishi, Mamoru Komachi | Japanese Predicate Conjugation for Neural Machine Translation | 6 pages; NAACL 2018 Student Research Workshop | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Neural machine translation (NMT) has a drawback in that can generate only
high-frequency words owing to the computational costs of the softmax function
in the output layer.
In Japanese-English NMT, Japanese predicate conjugation causes an increase in
vocabulary size. For example, one verb can have as many as 19 sur... | [
{
"created": "Fri, 25 May 2018 08:56:43 GMT",
"version": "v1"
}
] | 2018-05-28 | [
[
"Kurosawa",
"Michiki",
""
],
[
"Matsumura",
"Yukio",
""
],
[
"Yamagishi",
"Hayahide",
""
],
[
"Komachi",
"Mamoru",
""
]
] | Neural machine translation (NMT) has a drawback in that can generate only high-frequency words owing to the computational costs of the softmax function in the output layer. In Japanese-English NMT, Japanese predicate conjugation causes an increase in vocabulary size. For example, one verb can have as many as 19 surface... |
2203.01426 | Peng Zhou | Peng Zhou, Jason K. Eshraghian, Dong-Uk Choi, Sung-Mo Kang | SPICEprop: Backpropagating Errors Through Memristive Spiking Neural
Networks | null | null | null | null | cs.NE cs.AI cs.ET | http://creativecommons.org/licenses/by/4.0/ | We present a fully memristive spiking neural network (MSNN) consisting of
novel memristive neurons trained using the backpropagation through time (BPTT)
learning rule. Gradient descent is applied directly to the memristive
integrated-and-fire (MIF) neuron designed using analog SPICE circuit models,
which generates di... | [
{
"created": "Wed, 2 Mar 2022 21:34:43 GMT",
"version": "v1"
},
{
"created": "Tue, 8 Mar 2022 05:50:44 GMT",
"version": "v2"
},
{
"created": "Thu, 10 Mar 2022 01:09:51 GMT",
"version": "v3"
}
] | 2022-03-11 | [
[
"Zhou",
"Peng",
""
],
[
"Eshraghian",
"Jason K.",
""
],
[
"Choi",
"Dong-Uk",
""
],
[
"Kang",
"Sung-Mo",
""
]
] | We present a fully memristive spiking neural network (MSNN) consisting of novel memristive neurons trained using the backpropagation through time (BPTT) learning rule. Gradient descent is applied directly to the memristive integrated-and-fire (MIF) neuron designed using analog SPICE circuit models, which generates dist... |
2006.08754 | Kwang-Sung Jun | Kwang-Sung Jun, Chicheng Zhang | Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic
Optimality | accepted to NeurIPS'20; added the lower bound result | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study stochastic structured bandits for minimizing regret. The fact that
the popular optimistic algorithms do not achieve the asymptotic
instance-dependent regret optimality (asymptotic optimality for short) has
recently alluded researchers. On the other hand, it is known that one can
achieve bounded regret (i.e.,... | [
{
"created": "Mon, 15 Jun 2020 20:46:52 GMT",
"version": "v1"
},
{
"created": "Fri, 23 Oct 2020 01:51:16 GMT",
"version": "v2"
}
] | 2020-10-26 | [
[
"Jun",
"Kwang-Sung",
""
],
[
"Zhang",
"Chicheng",
""
]
] | We study stochastic structured bandits for minimizing regret. The fact that the popular optimistic algorithms do not achieve the asymptotic instance-dependent regret optimality (asymptotic optimality for short) has recently alluded researchers. On the other hand, it is known that one can achieve bounded regret (i.e., d... |
1510.03247 | Jason Dou | Lucy Chenyun Wu, Jason Xiaotian Dou, Danny Sleator, Alan Frieze, David
Miller | Impartial Redistricting: A Markov Chain Approach | about authorship naming problem, will fix soon | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The gerrymandering problem is a worldwide problem which sets great threat to
democracy and justice in district based elections. Thanks to partisan
redistricting commissions, district boundaries are often manipulated to benefit
incumbents. Since an independent commission is hard to come by, the possibility
of impartia... | [
{
"created": "Mon, 12 Oct 2015 12:11:51 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Oct 2015 12:26:31 GMT",
"version": "v2"
}
] | 2015-10-14 | [
[
"Wu",
"Lucy Chenyun",
""
],
[
"Dou",
"Jason Xiaotian",
""
],
[
"Sleator",
"Danny",
""
],
[
"Frieze",
"Alan",
""
],
[
"Miller",
"David",
""
]
] | The gerrymandering problem is a worldwide problem which sets great threat to democracy and justice in district based elections. Thanks to partisan redistricting commissions, district boundaries are often manipulated to benefit incumbents. Since an independent commission is hard to come by, the possibility of impartiall... |
1911.08619 | Shuwen Deng | Shuwen Deng, Wenjie Xiong, Jakub Szefer | A Benchmark Suite for Evaluating Caches' Vulnerability to Timing Attacks | 13 pages, 5 figures | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Timing-based side or covert channels in processor caches continue to present
a threat to computer systems, and they are the key to many of the recent
Spectre and Meltdown attacks. Based on improvements to an existing three-step
model for cache timing-based attacks, this work presents 88 Strong types of
theoretical ti... | [
{
"created": "Tue, 19 Nov 2019 22:38:16 GMT",
"version": "v1"
}
] | 2019-11-21 | [
[
"Deng",
"Shuwen",
""
],
[
"Xiong",
"Wenjie",
""
],
[
"Szefer",
"Jakub",
""
]
] | Timing-based side or covert channels in processor caches continue to present a threat to computer systems, and they are the key to many of the recent Spectre and Meltdown attacks. Based on improvements to an existing three-step model for cache timing-based attacks, this work presents 88 Strong types of theoretical timi... |
2302.05573 | Bin Liu | Bo Li, Xiaolin Wei, Fengwei Chen, Bin Liu | 3D Colored Shape Reconstruction from a Single RGB Image through
Diffusion | 9 pages, 8 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel 3d colored shape reconstruction method from a single RGB
image through diffusion model. Diffusion models have shown great development
potentials for high-quality 3D shape generation. However, most existing work
based on diffusion models only focus on geometric shape generation, they cannot
either a... | [
{
"created": "Sat, 11 Feb 2023 02:15:00 GMT",
"version": "v1"
}
] | 2023-02-14 | [
[
"Li",
"Bo",
""
],
[
"Wei",
"Xiaolin",
""
],
[
"Chen",
"Fengwei",
""
],
[
"Liu",
"Bin",
""
]
] | We propose a novel 3d colored shape reconstruction method from a single RGB image through diffusion model. Diffusion models have shown great development potentials for high-quality 3D shape generation. However, most existing work based on diffusion models only focus on geometric shape generation, they cannot either acc... |
2004.08715 | Ikuesan R. Adeyemi Dr. | Victor R. Kebande, Nickson M. Karie, Richard Adeyemi Ikuesan, Abdullah
Al-Ghushami, and H. S. Venter | Detecting Centralized Architecture-Based Botnets using Travelling
Salesperson Non-Deterministic Polynomial-Hard problem, TSP-NP Technique | 2019 IEEE Conference on Application, Information and Network Security
(AINS) | 2020 INSPEC Accession Number: 19300268 Electronic ISBN:
978-1-7281-3306-5 Print on Demand(PoD) ISBN: 978-1-7281-3307-2 | 10.1109/AINS47559.2019.8968710 | null | cs.CR cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The threats posed by botnets in the cyberspace continue to grow each day and
it has become very hard to detect or infiltrate the cynicism of bots. This, is
owing to the fact, that, the botnet developers each day, keep changing the
propagation and attack techniques. Currently, most of these attacks have been
centered ... | [
{
"created": "Sat, 18 Apr 2020 22:13:14 GMT",
"version": "v1"
}
] | 2020-04-21 | [
[
"Kebande",
"Victor R.",
""
],
[
"Karie",
"Nickson M.",
""
],
[
"Ikuesan",
"Richard Adeyemi",
""
],
[
"Al-Ghushami",
"Abdullah",
""
],
[
"Venter",
"H. S.",
""
]
] | The threats posed by botnets in the cyberspace continue to grow each day and it has become very hard to detect or infiltrate the cynicism of bots. This, is owing to the fact, that, the botnet developers each day, keep changing the propagation and attack techniques. Currently, most of these attacks have been centered on... |
1606.03752 | Kiran Venugopal | Kiran Venugopal and Robert W. Heath Jr | Location Based Performance Model for Indoor mmWave Wearable
Communication | presented at ICC 2016 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Simultaneous use of high-end wearable wireless devices like smart glasses is
challenging in a dense indoor environment due to the high nature of
interference. In this scenario, the millimeter wave (mmWave) band offers
promising potential for achieving gigabits per second throughput. Here we
propose a novel system mod... | [
{
"created": "Sun, 12 Jun 2016 18:38:26 GMT",
"version": "v1"
}
] | 2016-06-14 | [
[
"Venugopal",
"Kiran",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] | Simultaneous use of high-end wearable wireless devices like smart glasses is challenging in a dense indoor environment due to the high nature of interference. In this scenario, the millimeter wave (mmWave) band offers promising potential for achieving gigabits per second throughput. Here we propose a novel system model... |
2110.10905 | Xianyuan Zhan | Jin Li, Xianyuan Zhan, Zixu Xiao, Guyue Zhou | Efficient Robotic Manipulation Through Offline-to-Online Reinforcement
Learning and Goal-Aware State Information | null | null | null | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | End-to-end learning robotic manipulation with high data efficiency is one of
the key challenges in robotics. The latest methods that utilize human
demonstration data and unsupervised representation learning has proven to be a
promising direction to improve RL learning efficiency. The use of demonstration
data also al... | [
{
"created": "Thu, 21 Oct 2021 05:34:25 GMT",
"version": "v1"
}
] | 2021-10-22 | [
[
"Li",
"Jin",
""
],
[
"Zhan",
"Xianyuan",
""
],
[
"Xiao",
"Zixu",
""
],
[
"Zhou",
"Guyue",
""
]
] | End-to-end learning robotic manipulation with high data efficiency is one of the key challenges in robotics. The latest methods that utilize human demonstration data and unsupervised representation learning has proven to be a promising direction to improve RL learning efficiency. The use of demonstration data also allo... |
2403.00506 | Deborah N. Jakobi | Deborah N. Jakobi and Thomas Kern and David R. Reich and Patrick
Haller and Lena A. J\"ager | PoTeC: A German Naturalistic Eye-tracking-while-reading Corpus | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | The Potsdam Textbook Corpus (PoTeC) is a naturalistic
eye-tracking-while-reading corpus containing data from 75 participants reading
12 scientific texts. PoTeC is the first naturalistic eye-tracking-while-reading
corpus that contains eye-movements from domain-experts as well as novices in a
within-participant manipul... | [
{
"created": "Fri, 1 Mar 2024 13:07:39 GMT",
"version": "v1"
}
] | 2024-03-04 | [
[
"Jakobi",
"Deborah N.",
""
],
[
"Kern",
"Thomas",
""
],
[
"Reich",
"David R.",
""
],
[
"Haller",
"Patrick",
""
],
[
"Jäger",
"Lena A.",
""
]
] | The Potsdam Textbook Corpus (PoTeC) is a naturalistic eye-tracking-while-reading corpus containing data from 75 participants reading 12 scientific texts. PoTeC is the first naturalistic eye-tracking-while-reading corpus that contains eye-movements from domain-experts as well as novices in a within-participant manipulat... |
1211.2189 | Jannik Matuschke | Jannik Matuschke and Britta Peis | Lattices and maximum flow algorithms in planar graphs | null | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that the left/right relation on the set of s-t-paths of a plane graph
induces a so-called submodular lattice. If the embedding of the graph is
s-t-planar, this lattice is even consecutive. This implies that Ford and
Fulkerson's uppermost path algorithm for maximum flow in such graphs is indeed
a special case ... | [
{
"created": "Fri, 9 Nov 2012 17:02:11 GMT",
"version": "v1"
}
] | 2012-11-12 | [
[
"Matuschke",
"Jannik",
""
],
[
"Peis",
"Britta",
""
]
] | We show that the left/right relation on the set of s-t-paths of a plane graph induces a so-called submodular lattice. If the embedding of the graph is s-t-planar, this lattice is even consecutive. This implies that Ford and Fulkerson's uppermost path algorithm for maximum flow in such graphs is indeed a special case of... |
2306.05382 | Mingyu Jin | Haochen Xue, Mingyu Jin, Chong Zhang, Yuxuan Huang, Qian Weng, Xiaobo
Jin | Image Blending Algorithm with Automatic Mask Generation | 14 pages, 8 figures | International Conference on Neural Information Processing 2023 | 10.1007/978-981-99-8132-8_18 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In recent years, image blending has gained popularity for its ability to
create visually stunning content. However, the current image blending
algorithms mainly have the following problems: manually creating image blending
masks requires a lot of manpower and material resources; image blending
algorithms cannot effec... | [
{
"created": "Thu, 8 Jun 2023 17:31:24 GMT",
"version": "v1"
},
{
"created": "Sun, 11 Jun 2023 14:38:54 GMT",
"version": "v2"
},
{
"created": "Wed, 29 Nov 2023 06:49:12 GMT",
"version": "v3"
}
] | 2023-11-30 | [
[
"Xue",
"Haochen",
""
],
[
"Jin",
"Mingyu",
""
],
[
"Zhang",
"Chong",
""
],
[
"Huang",
"Yuxuan",
""
],
[
"Weng",
"Qian",
""
],
[
"Jin",
"Xiaobo",
""
]
] | In recent years, image blending has gained popularity for its ability to create visually stunning content. However, the current image blending algorithms mainly have the following problems: manually creating image blending masks requires a lot of manpower and material resources; image blending algorithms cannot effecti... |
1812.08032 | Cagatay Turkay | Cagatay Turkay, Nicola Pezzotti, Carsten Binnig, Hendrik Strobelt,
Barbara Hammer, Daniel A. Keim, Jean-Daniel Fekete, Themis Palpanas, Yunhai
Wang, Florin Rusu | Progressive Data Science: Potential and Challenges | null | null | null | null | cs.HC cs.DB cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data science requires time-consuming iterative manual activities. In
particular, activities such as data selection, preprocessing, transformation,
and mining, highly depend on iterative trial-and-error processes that could be
sped-up significantly by providing quick feedback on the impact of changes. The
idea of prog... | [
{
"created": "Wed, 19 Dec 2018 15:45:03 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Sep 2019 17:02:46 GMT",
"version": "v2"
}
] | 2019-09-13 | [
[
"Turkay",
"Cagatay",
""
],
[
"Pezzotti",
"Nicola",
""
],
[
"Binnig",
"Carsten",
""
],
[
"Strobelt",
"Hendrik",
""
],
[
"Hammer",
"Barbara",
""
],
[
"Keim",
"Daniel A.",
""
],
[
"Fekete",
"Jean-Daniel",
""
... | Data science requires time-consuming iterative manual activities. In particular, activities such as data selection, preprocessing, transformation, and mining, highly depend on iterative trial-and-error processes that could be sped-up significantly by providing quick feedback on the impact of changes. The idea of progre... |
1812.02872 | Yapeng Tian | Yapeng Tian, Chenxiao Guan, Justin Goodman, Marc Moore, Chenliang Xu | An Attempt towards Interpretable Audio-Visual Video Captioning | 11 pages, 4 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Automatically generating a natural language sentence to describe the content
of an input video is a very challenging problem. It is an essential multimodal
task in which auditory and visual contents are equally important. Although
audio information has been exploited to improve video captioning in previous
works, it ... | [
{
"created": "Fri, 7 Dec 2018 01:57:42 GMT",
"version": "v1"
}
] | 2018-12-10 | [
[
"Tian",
"Yapeng",
""
],
[
"Guan",
"Chenxiao",
""
],
[
"Goodman",
"Justin",
""
],
[
"Moore",
"Marc",
""
],
[
"Xu",
"Chenliang",
""
]
] | Automatically generating a natural language sentence to describe the content of an input video is a very challenging problem. It is an essential multimodal task in which auditory and visual contents are equally important. Although audio information has been exploited to improve video captioning in previous works, it is... |
1605.05109 | Seri Khoury | Amir Abboud, Keren Censor-Hillel and Seri Khoury | Near-Linear Lower Bounds for Distributed Distance Computations, Even in
Sparse Networks | null | null | null | null | cs.DC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop a new technique for constructing sparse graphs that allow us to
prove near-linear lower bounds on the round complexity of computing distances
in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower
bound for computing the diameter in sparse networks, which was previously known
only for... | [
{
"created": "Tue, 17 May 2016 11:02:16 GMT",
"version": "v1"
}
] | 2016-05-18 | [
[
"Abboud",
"Amir",
""
],
[
"Censor-Hillel",
"Keren",
""
],
[
"Khoury",
"Seri",
""
]
] | We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower bound for computing the diameter in sparse networks, which was previously known only for d... |
1705.02385 | Sylvia Boyd | Sylvia Boyd, Andr\'as Seb\"o | The Salesman's Improved Tours for Fundamental Classes | null | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Finding the exact integrality gap $\alpha$ for the LP relaxation of the
metric Travelling Salesman Problem (TSP) has been an open problem for over
thirty years, with little progress made. It is known that $4/3 \leq \alpha \leq
3/2$, and a famous conjecture states $\alpha = 4/3$. For this problem,
essentially two "fun... | [
{
"created": "Fri, 5 May 2017 20:05:24 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Oct 2018 21:50:55 GMT",
"version": "v2"
}
] | 2018-10-31 | [
[
"Boyd",
"Sylvia",
""
],
[
"Sebö",
"András",
""
]
] | Finding the exact integrality gap $\alpha$ for the LP relaxation of the metric Travelling Salesman Problem (TSP) has been an open problem for over thirty years, with little progress made. It is known that $4/3 \leq \alpha \leq 3/2$, and a famous conjecture states $\alpha = 4/3$. For this problem, essentially two "funda... |
2208.01639 | Simson Garfinkel | Simson Garfinkel and Jonathan Stewart | Sharpening Your Tools: Updating bulk_extractor for the 2020s | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bulk_extractor is a high-performance digital forensics tool written in C++.
Between 2018 and 2022 we updated the program from C++98 to C++17, performed a
complete code refactoring, and adopted a unit test framework. The new version
typically runs with 75\% more throughput than the previous version, which we
attribute... | [
{
"created": "Thu, 31 Mar 2022 17:45:46 GMT",
"version": "v1"
}
] | 2022-08-04 | [
[
"Garfinkel",
"Simson",
""
],
[
"Stewart",
"Jonathan",
""
]
] | Bulk_extractor is a high-performance digital forensics tool written in C++. Between 2018 and 2022 we updated the program from C++98 to C++17, performed a complete code refactoring, and adopted a unit test framework. The new version typically runs with 75\% more throughput than the previous version, which we attribute t... |
1509.02238 | Fangfang Li | Fangfang Li, Yanchang Zhao, Klaus Felsche, Guandong Xu, and Longbing
Cao | Coupling Analysis Between Twitter and Call Centre | 19 pages | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Social media has been contributing many research areas such as data mining,
recommender systems, time series analysis, etc. However, there are not many
successful applications regarding social media in government agencies. In fact,
lots of governments have social media accounts such as twitter and facebook.
More and ... | [
{
"created": "Tue, 8 Sep 2015 01:21:50 GMT",
"version": "v1"
}
] | 2016-11-06 | [
[
"Li",
"Fangfang",
""
],
[
"Zhao",
"Yanchang",
""
],
[
"Felsche",
"Klaus",
""
],
[
"Xu",
"Guandong",
""
],
[
"Cao",
"Longbing",
""
]
] | Social media has been contributing many research areas such as data mining, recommender systems, time series analysis, etc. However, there are not many successful applications regarding social media in government agencies. In fact, lots of governments have social media accounts such as twitter and facebook. More and mo... |
2001.10109 | Kriton Konstantinidis | Alexandros Haliassos, Kriton Konstantinidis, Danilo P. Mandic | Supervised Learning for Non-Sequential Data: A Canonical Polyadic
Decomposition Approach | Accepted at IEEE Transactions on Neural Networks and Learning Systems | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Efficient modelling of feature interactions underpins supervised learning for
non-sequential tasks, characterized by a lack of inherent ordering of features
(variables). The brute force approach of learning a parameter for each
interaction of every order comes at an exponential computational and memory
cost (Curse of... | [
{
"created": "Mon, 27 Jan 2020 22:38:40 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Apr 2020 09:10:27 GMT",
"version": "v2"
},
{
"created": "Tue, 30 Mar 2021 09:29:17 GMT",
"version": "v3"
}
] | 2021-03-31 | [
[
"Haliassos",
"Alexandros",
""
],
[
"Konstantinidis",
"Kriton",
""
],
[
"Mandic",
"Danilo P.",
""
]
] | Efficient modelling of feature interactions underpins supervised learning for non-sequential tasks, characterized by a lack of inherent ordering of features (variables). The brute force approach of learning a parameter for each interaction of every order comes at an exponential computational and memory cost (Curse of D... |
2401.01313 | Anku Rani | S.M Towhidul Islam Tonmoy, S M Mehedi Zaman, Vinija Jain, Anku Rani,
Vipula Rawte, Aman Chadha, Amitava Das | A Comprehensive Survey of Hallucination Mitigation Techniques in Large
Language Models | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | As Large Language Models (LLMs) continue to advance in their ability to write
human-like text, a key challenge remains around their tendency to hallucinate
generating content that appears factual but is ungrounded. This issue of
hallucination is arguably the biggest hindrance to safely deploying these
powerful LLMs i... | [
{
"created": "Tue, 2 Jan 2024 17:56:30 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Jan 2024 17:13:00 GMT",
"version": "v2"
},
{
"created": "Mon, 8 Jan 2024 16:19:17 GMT",
"version": "v3"
}
] | 2024-01-09 | [
[
"Tonmoy",
"S. M Towhidul Islam",
""
],
[
"Zaman",
"S M Mehedi",
""
],
[
"Jain",
"Vinija",
""
],
[
"Rani",
"Anku",
""
],
[
"Rawte",
"Vipula",
""
],
[
"Chadha",
"Aman",
""
],
[
"Das",
"Amitava",
""
]
] | As Large Language Models (LLMs) continue to advance in their ability to write human-like text, a key challenge remains around their tendency to hallucinate generating content that appears factual but is ungrounded. This issue of hallucination is arguably the biggest hindrance to safely deploying these powerful LLMs int... |
2404.06966 | Johannes Burchert | Johannes Burchert, Thorben Werner, Vijaya Krishna Yalavarthi, Diego
Coello de Portugal, Maximilian Stubbemann, and Lars Schmidt-Thieme | Are EEG Sequences Time Series? EEG Classification with Time Series
Models and Joint Subject Training | null | null | null | null | cs.LG eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As with most other data domains, EEG data analysis relies on rich
domain-specific preprocessing. Beyond such preprocessing, machine learners
would hope to deal with such data as with any other time series data. For EEG
classification many models have been developed with layer types and
architectures we typically do n... | [
{
"created": "Wed, 10 Apr 2024 12:24:05 GMT",
"version": "v1"
}
] | 2024-04-11 | [
[
"Burchert",
"Johannes",
""
],
[
"Werner",
"Thorben",
""
],
[
"Yalavarthi",
"Vijaya Krishna",
""
],
[
"de Portugal",
"Diego Coello",
""
],
[
"Stubbemann",
"Maximilian",
""
],
[
"Schmidt-Thieme",
"Lars",
""
]
] | As with most other data domains, EEG data analysis relies on rich domain-specific preprocessing. Beyond such preprocessing, machine learners would hope to deal with such data as with any other time series data. For EEG classification many models have been developed with layer types and architectures we typically do not... |
1007.4531 | Barak Fishbain | Barak Fishbain, Dorit S. Hochbaum, Stefan Mueller | Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision
Problems | null | Journal of Real-Time Image Processing, March 2016, Vol. 11, Issue
3, pp 589-609. (Online April 2013.) | 10.1007/s11554-013-0344-3. | null | cs.CV cs.DM math.CO math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rapid advances in image acquisition and storage technology underline the need
for algorithms that are capable of solving large scale image processing and
computer-vision problems. The minimum cut problem plays an important role in
processing many of these imaging problems such as, image and video
segmentation, stereo... | [
{
"created": "Mon, 26 Jul 2010 18:58:32 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Oct 2010 21:31:15 GMT",
"version": "v2"
}
] | 2016-10-14 | [
[
"Fishbain",
"Barak",
""
],
[
"Hochbaum",
"Dorit S.",
""
],
[
"Mueller",
"Stefan",
""
]
] | Rapid advances in image acquisition and storage technology underline the need for algorithms that are capable of solving large scale image processing and computer-vision problems. The minimum cut problem plays an important role in processing many of these imaging problems such as, image and video segmentation, stereo v... |
2109.04266 | Daniel Bakkelund | Daniel Bakkelund | An objective function for order preserving hierarchical clustering | 39 pages | null | null | null | cs.LG math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an objective function for similarity based hierarchical clustering
of partially ordered data that preserves the partial order. That is, if $x \le
y$, and if $[x]$ and $[y]$ are the respective clusters of $x$ and $y$, then
there is an order relation $\le'$ on the clusters for which $[x] \le' |y]$. The
theor... | [
{
"created": "Thu, 9 Sep 2021 13:35:01 GMT",
"version": "v1"
},
{
"created": "Fri, 31 Dec 2021 13:48:11 GMT",
"version": "v2"
},
{
"created": "Sun, 1 May 2022 07:32:39 GMT",
"version": "v3"
}
] | 2022-05-03 | [
[
"Bakkelund",
"Daniel",
""
]
] | We present an objective function for similarity based hierarchical clustering of partially ordered data that preserves the partial order. That is, if $x \le y$, and if $[x]$ and $[y]$ are the respective clusters of $x$ and $y$, then there is an order relation $\le'$ on the clusters for which $[x] \le' |y]$. The theory ... |
cs/0502073 | Maxime Crochemore | Maxime Crochemore (IGM), Jacques D\'esarm\'enien (IGM), Dominique
Perrin (IGM) | A note on the Burrows-Wheeler transformation | 2004 | null | null | CDP04tcs | cs.DS | null | We relate the Burrows-Wheeler transformation with a result in combinatorics
on words known as the Gessel-Reutenauer transformation.
| [
{
"created": "Thu, 17 Feb 2005 07:06:28 GMT",
"version": "v1"
}
] | 2016-08-16 | [
[
"Crochemore",
"Maxime",
"",
"IGM"
],
[
"Désarménien",
"Jacques",
"",
"IGM"
],
[
"Perrin",
"Dominique",
"",
"IGM"
]
] | We relate the Burrows-Wheeler transformation with a result in combinatorics on words known as the Gessel-Reutenauer transformation. |
2204.06299 | Sherzod Hakimov | Sherzod Hakimov and Gullal S. Cheema and Ralph Ewerth | TIB-VA at SemEval-2022 Task 5: A Multimodal Architecture for the
Detection and Classification of Misogynous Memes | Accepted for publication at SemEval-2022 Workshop, Task 5: MAMI -
Multimedia Automatic Misogyny Identification co-located with NAACL 2022 | null | null | null | cs.CL cs.AI cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The detection of offensive, hateful content on social media is a challenging
problem that affects many online users on a daily basis. Hateful content is
often used to target a group of people based on ethnicity, gender, religion and
other factors. The hate or contempt toward women has been increasing on social
platfo... | [
{
"created": "Wed, 13 Apr 2022 11:03:21 GMT",
"version": "v1"
}
] | 2022-04-14 | [
[
"Hakimov",
"Sherzod",
""
],
[
"Cheema",
"Gullal S.",
""
],
[
"Ewerth",
"Ralph",
""
]
] | The detection of offensive, hateful content on social media is a challenging problem that affects many online users on a daily basis. Hateful content is often used to target a group of people based on ethnicity, gender, religion and other factors. The hate or contempt toward women has been increasing on social platform... |
2403.09481 | Paloma Rabaey | Paloma Rabaey, Johannes Deleu, Stefan Heytens, Thomas Demeester | Clinical Reasoning over Tabular Data and Text with Bayesian Networks | AI in Medicine 2024 | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Bayesian networks are well-suited for clinical reasoning on tabular data, but
are less compatible with natural language data, for which neural networks
provide a successful framework. This paper compares and discusses strategies to
augment Bayesian networks with neural text representations, both in a
generative and d... | [
{
"created": "Thu, 14 Mar 2024 15:25:23 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Mar 2024 16:48:27 GMT",
"version": "v2"
},
{
"created": "Thu, 23 May 2024 13:41:19 GMT",
"version": "v3"
}
] | 2024-05-24 | [
[
"Rabaey",
"Paloma",
""
],
[
"Deleu",
"Johannes",
""
],
[
"Heytens",
"Stefan",
""
],
[
"Demeester",
"Thomas",
""
]
] | Bayesian networks are well-suited for clinical reasoning on tabular data, but are less compatible with natural language data, for which neural networks provide a successful framework. This paper compares and discusses strategies to augment Bayesian networks with neural text representations, both in a generative and dis... |
1902.06961 | Jason R.C. Nurse Dr | Mariam Nouh and Jason R.C. Nurse and Helena Webb and Michael Goldsmith | Cybercrime Investigators are Users Too! Understanding the
Socio-Technical Challenges Faced by Law Enforcement | 11 pages, Proceedings of the 2019 Workshop on Usable Security (USEC)
at Network and Distributed System Security Symposium (NDSS) | null | 10.14722/usec.2019.23032 | null | cs.HC cs.CR cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cybercrime investigators face numerous challenges when policing online
crimes. Firstly, the methods and processes they use when dealing with
traditional crimes do not necessarily apply in the cyber-world. Additionally,
cyber criminals are usually technologically-aware and constantly adapting and
developing new tools ... | [
{
"created": "Tue, 19 Feb 2019 09:25:10 GMT",
"version": "v1"
}
] | 2019-02-20 | [
[
"Nouh",
"Mariam",
""
],
[
"Nurse",
"Jason R. C.",
""
],
[
"Webb",
"Helena",
""
],
[
"Goldsmith",
"Michael",
""
]
] | Cybercrime investigators face numerous challenges when policing online crimes. Firstly, the methods and processes they use when dealing with traditional crimes do not necessarily apply in the cyber-world. Additionally, cyber criminals are usually technologically-aware and constantly adapting and developing new tools th... |
2210.14377 | Niharika S. D'Souza | Niharika S. D'Souza, Hongzhi Wang, Andrea Giovannini, Antonio
Foncubierta-Rodriguez, Kristen L. Beck, Orest Boyko, and Tanveer
Syeda-Mahmood | Fusing Modalities by Multiplexed Graph Neural Networks for Outcome
Prediction in Tuberculosis | Accepted into MICCAI 2022 | null | 10.1007/978-3-031-16449-1_28 | null | cs.LG cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | In a complex disease such as tuberculosis, the evidence for the disease and
its evolution may be present in multiple modalities such as clinical, genomic,
or imaging data. Effective patient-tailored outcome prediction and therapeutic
guidance will require fusing evidence from these modalities. Such multimodal
fusion ... | [
{
"created": "Tue, 25 Oct 2022 23:03:05 GMT",
"version": "v1"
}
] | 2022-10-27 | [
[
"D'Souza",
"Niharika S.",
""
],
[
"Wang",
"Hongzhi",
""
],
[
"Giovannini",
"Andrea",
""
],
[
"Foncubierta-Rodriguez",
"Antonio",
""
],
[
"Beck",
"Kristen L.",
""
],
[
"Boyko",
"Orest",
""
],
[
"Syeda-Mahmood",
... | In a complex disease such as tuberculosis, the evidence for the disease and its evolution may be present in multiple modalities such as clinical, genomic, or imaging data. Effective patient-tailored outcome prediction and therapeutic guidance will require fusing evidence from these modalities. Such multimodal fusion is... |
cs/0506043 | Kapil Bhattad | Krishna R. Narayanan and Kapil Bhattad | A Decision Feedback Based Scheme for Slepian-Wolf Coding of sources with
Hidden Markov Correlation | Submitted to IEEE Comm. Letters | null | 10.1109/LCOMM.2006.1633329 | null | cs.IT math.IT | null | We consider the problem of compression of two memoryless binary sources, the
correlation between which is defined by a Hidden Markov Model (HMM). We propose
a Decision Feedback (DF) based scheme which when used with low density parity
check codes results in compression close to the Slepian Wolf limits.
| [
{
"created": "Mon, 13 Jun 2005 13:17:21 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Narayanan",
"Krishna R.",
""
],
[
"Bhattad",
"Kapil",
""
]
] | We consider the problem of compression of two memoryless binary sources, the correlation between which is defined by a Hidden Markov Model (HMM). We propose a Decision Feedback (DF) based scheme which when used with low density parity check codes results in compression close to the Slepian Wolf limits. |
1904.10380 | Feng Huang | Feng Huang, Peter Balazs | Harmonic-aligned Frame Mask Based on Non-stationary Gabor Transform with
Application to Content-dependent Speaker Comparison | Interspeech2019 | null | null | null | cs.SD eess.AS math.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose harmonic-aligned frame mask for speech signals using
non-stationary Gabor transform (NSGT). A frame mask operates on the transfer
coefficients of a signal and consequently converts the signal into a
counterpart signal. It depicts the difference between the two signals. In
preceding studies, frame masks bas... | [
{
"created": "Tue, 23 Apr 2019 15:21:09 GMT",
"version": "v1"
}
] | 2019-04-24 | [
[
"Huang",
"Feng",
""
],
[
"Balazs",
"Peter",
""
]
] | We propose harmonic-aligned frame mask for speech signals using non-stationary Gabor transform (NSGT). A frame mask operates on the transfer coefficients of a signal and consequently converts the signal into a counterpart signal. It depicts the difference between the two signals. In preceding studies, frame masks based... |
2312.08584 | Ahmed Esmin Ph.D. | Thiago Bellotti Furtado, Ahmed Esmin | Hybrid Content Dynamic Recommendation System Based in Adapted Tags and
Applied to Digital Library | 35 pages, 8 figures | null | null | null | cs.IR cs.DL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The technological evolution of the library in the academic environment
brought a lot of information and documents that are available to access, but
these systems do not always have mechanisms to search in an integrated way the
relevant information for the user. To alleviate this problem, we propose a
recommendation s... | [
{
"created": "Thu, 14 Dec 2023 01:11:41 GMT",
"version": "v1"
}
] | 2023-12-15 | [
[
"Furtado",
"Thiago Bellotti",
""
],
[
"Esmin",
"Ahmed",
""
]
] | The technological evolution of the library in the academic environment brought a lot of information and documents that are available to access, but these systems do not always have mechanisms to search in an integrated way the relevant information for the user. To alleviate this problem, we propose a recommendation sys... |
2405.03838 | Eishi Arima | Eishi Arima, Minjoon Kang, Issa Saba, Josef Weidendorfer, Carsten
Trinitis, Martin Schulz | Optimizing Hardware Resource Partitioning and Job Allocations on Modern
GPUs under Power Caps | null | ICPP Workshops '22: Workshop Proceedings of the 51st International
Conference on Parallel Processing, August 2022, Article No.: 9 | 10.1145/3547276.3548630 | null | cs.DC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | CPU-GPU heterogeneous systems are now commonly used in HPC (High-Performance
Computing). However, improving the utilization and energy-efficiency of such
systems is still one of the most critical issues. As one single program
typically cannot fully utilize all resources within a node/chip, co-scheduling
(or co-locati... | [
{
"created": "Mon, 6 May 2024 20:40:38 GMT",
"version": "v1"
}
] | 2024-05-08 | [
[
"Arima",
"Eishi",
""
],
[
"Kang",
"Minjoon",
""
],
[
"Saba",
"Issa",
""
],
[
"Weidendorfer",
"Josef",
""
],
[
"Trinitis",
"Carsten",
""
],
[
"Schulz",
"Martin",
""
]
] | CPU-GPU heterogeneous systems are now commonly used in HPC (High-Performance Computing). However, improving the utilization and energy-efficiency of such systems is still one of the most critical issues. As one single program typically cannot fully utilize all resources within a node/chip, co-scheduling (or co-locating... |
2206.08856 | Ayush Gupta | Ayush Gupta, Ahmed Baza, Ekaterina Dorzhieva, Mert Alper, Mariia
Makarova, Stepan Perminov, Aleksey Fedoseev, Dzmitry Tsetserukou | SwarmHive: Heterogeneous Swarm of Drones for Robust Autonomous Landing
on Moving Robot | Accepted paper at IEEE Vehicular Technology Conference 2022 (IEEE VTC
2022), IEEE copyright | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The paper focuses on a heterogeneous swarm of drones to achieve a dynamic
landing of formation on a moving robot. This challenging task was not yet
achieved by scientists. The key technology is that instead of facilitating each
agent of the swarm of drones with computer vision that considerably increases
the payload ... | [
{
"created": "Fri, 17 Jun 2022 15:56:29 GMT",
"version": "v1"
}
] | 2022-06-20 | [
[
"Gupta",
"Ayush",
""
],
[
"Baza",
"Ahmed",
""
],
[
"Dorzhieva",
"Ekaterina",
""
],
[
"Alper",
"Mert",
""
],
[
"Makarova",
"Mariia",
""
],
[
"Perminov",
"Stepan",
""
],
[
"Fedoseev",
"Aleksey",
""
],
[
... | The paper focuses on a heterogeneous swarm of drones to achieve a dynamic landing of formation on a moving robot. This challenging task was not yet achieved by scientists. The key technology is that instead of facilitating each agent of the swarm of drones with computer vision that considerably increases the payload an... |
2312.09138 | Liyuan Zhu | Liyuan Zhu and Shengyu Huang and Konrad Schindler and Iro Armeni | Living Scenes: Multi-object Relocalization and Reconstruction in
Changing 3D Environments | CVPR 2024 camera-ready | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Research into dynamic 3D scene understanding has primarily focused on
short-term change tracking from dense observations, while little attention has
been paid to long-term changes with sparse observations. We address this gap
with MoRE, a novel approach for multi-object relocalization and reconstruction
in evolving e... | [
{
"created": "Thu, 14 Dec 2023 17:09:57 GMT",
"version": "v1"
},
{
"created": "Tue, 26 Mar 2024 18:16:26 GMT",
"version": "v2"
}
] | 2024-03-28 | [
[
"Zhu",
"Liyuan",
""
],
[
"Huang",
"Shengyu",
""
],
[
"Schindler",
"Konrad",
""
],
[
"Armeni",
"Iro",
""
]
] | Research into dynamic 3D scene understanding has primarily focused on short-term change tracking from dense observations, while little attention has been paid to long-term changes with sparse observations. We address this gap with MoRE, a novel approach for multi-object relocalization and reconstruction in evolving env... |
1612.01375 | Paolo Massioni | Paolo Massioni and G\'erard Scorletti | Consensus analysis of large-scale nonlinear homogeneous multi-agent
formations with polynomial dynamics | 6 pages, 5 figures | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Drawing inspiration from the theory of linear "decomposable systems", we
provide a method, based on linear matrix inequalities (LMIs), which makes it
possible to prove the convergence (or consensus) of a set of interacting agents
with polynomial dynamic. We also show that the use of a generalised version of
the famou... | [
{
"created": "Mon, 5 Dec 2016 14:40:20 GMT",
"version": "v1"
}
] | 2016-12-06 | [
[
"Massioni",
"Paolo",
""
],
[
"Scorletti",
"Gérard",
""
]
] | Drawing inspiration from the theory of linear "decomposable systems", we provide a method, based on linear matrix inequalities (LMIs), which makes it possible to prove the convergence (or consensus) of a set of interacting agents with polynomial dynamic. We also show that the use of a generalised version of the famous ... |
2108.02451 | Lei Zhu | Lei Zhu, Qi She, Duo Li, Yanye Lu, Xuejing Kang, Jie Hu, Changhu Wang | Unifying Nonlocal Blocks for Neural Networks | Accept by ICCV 2021 Conference | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The nonlocal-based blocks are designed for capturing long-range
spatial-temporal dependencies in computer vision tasks. Although having shown
excellent performance, they still lack the mechanism to encode the rich,
structured information among elements in an image or video. In this paper, to
theoretically analyze the... | [
{
"created": "Thu, 5 Aug 2021 08:34:12 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Aug 2021 07:26:15 GMT",
"version": "v2"
},
{
"created": "Tue, 17 Aug 2021 07:18:59 GMT",
"version": "v3"
}
] | 2021-08-18 | [
[
"Zhu",
"Lei",
""
],
[
"She",
"Qi",
""
],
[
"Li",
"Duo",
""
],
[
"Lu",
"Yanye",
""
],
[
"Kang",
"Xuejing",
""
],
[
"Hu",
"Jie",
""
],
[
"Wang",
"Changhu",
""
]
] | The nonlocal-based blocks are designed for capturing long-range spatial-temporal dependencies in computer vision tasks. Although having shown excellent performance, they still lack the mechanism to encode the rich, structured information among elements in an image or video. In this paper, to theoretically analyze the p... |
2102.11625 | Jukka Ruohonen | Jukka Ruohonen | Assessing the Readability of Policy Documents on the Digital Single
Market of the European Union | Proceedings of the Eighth International Conference on eDemocracy &
eGovernment (ICEDEG 2021), Quito (online), IEEE, pp. 205-209 | null | 10.1109/ICEDEG52154.2021.9530996 | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Today, literature skills are necessary. Engineering and other technical
professions are not an exception from this requirement. Traditionally,
technical reading and writing have been framed with a limited scope, containing
documentation, specifications, standards, and related text types. Nowadays,
however, the scope ... | [
{
"created": "Tue, 23 Feb 2021 11:01:11 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Sep 2021 13:33:10 GMT",
"version": "v2"
}
] | 2021-09-16 | [
[
"Ruohonen",
"Jukka",
""
]
] | Today, literature skills are necessary. Engineering and other technical professions are not an exception from this requirement. Traditionally, technical reading and writing have been framed with a limited scope, containing documentation, specifications, standards, and related text types. Nowadays, however, the scope co... |
1210.5443 | Robbert Van Renesse | Robbert van Renesse and H{\aa}vard Johansen and Nihar Naigaonkar and
Dag Johansen | Secure Abstraction with Code Capabilities | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose embedding executable code fragments in cryptographically protected
capabilities to enable flexible discretionary access control in cloud-like
computing infrastructures. We are developing this as part of a sports analytics
application that runs on a federation of public and enterprise clouds. The
capability... | [
{
"created": "Fri, 19 Oct 2012 15:17:28 GMT",
"version": "v1"
}
] | 2012-10-22 | [
[
"van Renesse",
"Robbert",
""
],
[
"Johansen",
"Håvard",
""
],
[
"Naigaonkar",
"Nihar",
""
],
[
"Johansen",
"Dag",
""
]
] | We propose embedding executable code fragments in cryptographically protected capabilities to enable flexible discretionary access control in cloud-like computing infrastructures. We are developing this as part of a sports analytics application that runs on a federation of public and enterprise clouds. The capability m... |
2105.00706 | Feng Xia | Feng Xia, Jiaying Liu, Jing Ren, Wei Wang, Xiangjie Kong | Turing Number: How Far Are You to A. M. Turing Award? | 8 pages, 3 figures | ACM SIGWEB Newsletter (2020) | 10.1145/3427478.3427483 | null | cs.SI cs.DL physics.data-an | http://creativecommons.org/licenses/by/4.0/ | The ACM A.M. Turing Award is commonly acknowledged as the highest distinction
in the realm of computer science. Since 1960s, it has been awarded to computer
scientists who made outstanding contributions. The significance of this award
is far-reaching to the laureates as well as their research teams. However,
unlike t... | [
{
"created": "Mon, 3 May 2021 09:28:36 GMT",
"version": "v1"
}
] | 2021-05-04 | [
[
"Xia",
"Feng",
""
],
[
"Liu",
"Jiaying",
""
],
[
"Ren",
"Jing",
""
],
[
"Wang",
"Wei",
""
],
[
"Kong",
"Xiangjie",
""
]
] | The ACM A.M. Turing Award is commonly acknowledged as the highest distinction in the realm of computer science. Since 1960s, it has been awarded to computer scientists who made outstanding contributions. The significance of this award is far-reaching to the laureates as well as their research teams. However, unlike the... |
cs/0411071 | Pontus Svenson | Hedvig Sidenbladh, Pontus Svenson, Johan Schubert | Comparing Multi-Target Trackers on Different Force Unit Levels | 9 pages | Proc SPIE Vol 5429, p 306-314 (2004) | 10.1117/12.542024 | null | cs.AI | null | Consider the problem of tracking a set of moving targets. Apart from the
tracking result, it is often important to know where the tracking fails, either
to steer sensors to that part of the state-space, or to inform a human operator
about the status and quality of the obtained information. An intuitive quality
measur... | [
{
"created": "Fri, 19 Nov 2004 13:12:40 GMT",
"version": "v1"
}
] | 2009-11-10 | [
[
"Sidenbladh",
"Hedvig",
""
],
[
"Svenson",
"Pontus",
""
],
[
"Schubert",
"Johan",
""
]
] | Consider the problem of tracking a set of moving targets. Apart from the tracking result, it is often important to know where the tracking fails, either to steer sensors to that part of the state-space, or to inform a human operator about the status and quality of the obtained information. An intuitive quality measure ... |
2108.09982 | Hyeongseok Son | Hyeongseok Son, Junyong Lee, Jonghyeop Lee, Sunghyun Cho, Seungyong
Lee | Recurrent Video Deblurring with Blur-Invariant Motion Estimation and
Pixel Volumes | 17 pages, Camera-ready version for ACM Transactions on Graphics (TOG)
2021 | ACM Transactions on Graphics, Vol. 40, No. 5, Article 185, 2021 | 10.1145/3453720 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For the success of video deblurring, it is essential to utilize information
from neighboring frames. Most state-of-the-art video deblurring methods adopt
motion compensation between video frames to aggregate information from multiple
frames that can help deblur a target frame. However, the motion compensation
methods... | [
{
"created": "Mon, 23 Aug 2021 07:36:49 GMT",
"version": "v1"
}
] | 2021-08-27 | [
[
"Son",
"Hyeongseok",
""
],
[
"Lee",
"Junyong",
""
],
[
"Lee",
"Jonghyeop",
""
],
[
"Cho",
"Sunghyun",
""
],
[
"Lee",
"Seungyong",
""
]
] | For the success of video deblurring, it is essential to utilize information from neighboring frames. Most state-of-the-art video deblurring methods adopt motion compensation between video frames to aggregate information from multiple frames that can help deblur a target frame. However, the motion compensation methods a... |
2210.05411 | Ramesh Doddaiah | Ramesh Doddaiah, Prathyush Parvatharaju, Elke Rundensteiner, Thomas
Hartvigsen | Class-Specific Explainability for Deep Time Series Classifiers | This paper is accepted in ICDM 2022 | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Explainability helps users trust deep learning solutions for time series
classification. However, existing explainability methods for multi-class time
series classifiers focus on one class at a time, ignoring relationships between
the classes. Instead, when a classifier is choosing between many classes, an
effective ... | [
{
"created": "Tue, 11 Oct 2022 12:37:15 GMT",
"version": "v1"
}
] | 2022-10-12 | [
[
"Doddaiah",
"Ramesh",
""
],
[
"Parvatharaju",
"Prathyush",
""
],
[
"Rundensteiner",
"Elke",
""
],
[
"Hartvigsen",
"Thomas",
""
]
] | Explainability helps users trust deep learning solutions for time series classification. However, existing explainability methods for multi-class time series classifiers focus on one class at a time, ignoring relationships between the classes. Instead, when a classifier is choosing between many classes, an effective ex... |
2308.02694 | Lennart Reimann | Lennart M. Reimann, Jonathan Wiesner, Dominik Sisejkovic, Farhad
Merchant and Rainer Leupers | SoftFlow: Automated HW-SW Confidentiality Verification for Embedded
Processors | 6 pages, accepted at 31st IFIP/IEEE Conference on Very Large Scale
Integration (VLSI-SoC 2023) | null | null | null | cs.CR cs.AR | http://creativecommons.org/licenses/by/4.0/ | Despite its ever-increasing impact, security is not considered as a design
objective in commercial electronic design automation (EDA) tools. This results
in vulnerabilities being overlooked during the software-hardware design
process. Specifically, vulnerabilities that allow leakage of sensitive data
might stay unnot... | [
{
"created": "Fri, 4 Aug 2023 20:11:46 GMT",
"version": "v1"
}
] | 2023-08-08 | [
[
"Reimann",
"Lennart M.",
""
],
[
"Wiesner",
"Jonathan",
""
],
[
"Sisejkovic",
"Dominik",
""
],
[
"Merchant",
"Farhad",
""
],
[
"Leupers",
"Rainer",
""
]
] | Despite its ever-increasing impact, security is not considered as a design objective in commercial electronic design automation (EDA) tools. This results in vulnerabilities being overlooked during the software-hardware design process. Specifically, vulnerabilities that allow leakage of sensitive data might stay unnotic... |
0707.3673 | Damien Chablat | Damien Chablat (IRCCyN), Jorge Angeles (CIM) | The Computation of All 4R Serial Spherical Wrists With an Isotropic
Architecture | null | Dans 2nd Workshop on Computational Kinematics - WCK, S\'eoul :
Cor\'ee, R\'epublique de (05/2001) | null | WCK-2001 | cs.RO | null | A spherical wrist of the serial type is said to be isotropic if it can attain
a posture whereby the singular values of its Jacobian matrix are all identical
and nonzero. What isotropy brings about is robustness to manufacturing,
assembly, and measurement errors, thereby guaranteeing a maximum orientation
accuracy. In... | [
{
"created": "Wed, 25 Jul 2007 06:51:53 GMT",
"version": "v1"
}
] | 2007-07-26 | [
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Angeles",
"Jorge",
"",
"CIM"
]
] | A spherical wrist of the serial type is said to be isotropic if it can attain a posture whereby the singular values of its Jacobian matrix are all identical and nonzero. What isotropy brings about is robustness to manufacturing, assembly, and measurement errors, thereby guaranteeing a maximum orientation accuracy. In t... |
2203.02574 | Tianxin Tao | Tianxin Tao, Xiaohang Zhan, Zhongquan Chen, Michiel van de Panne | Style-ERD: Responsive and Coherent Online Motion Style Transfer | CVPR 2022, project page:
https://tianxintao.github.io/Online-Motion-Style-Transfer | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motion style transfer is a common method for enriching character animation.
Motion style transfer algorithms are often designed for offline settings where
motions are processed in segments. However, for online animation applications,
such as realtime avatar animation from motion capture, motions need to be
processed ... | [
{
"created": "Fri, 4 Mar 2022 21:12:09 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Mar 2022 00:53:19 GMT",
"version": "v2"
}
] | 2022-03-30 | [
[
"Tao",
"Tianxin",
""
],
[
"Zhan",
"Xiaohang",
""
],
[
"Chen",
"Zhongquan",
""
],
[
"van de Panne",
"Michiel",
""
]
] | Motion style transfer is a common method for enriching character animation. Motion style transfer algorithms are often designed for offline settings where motions are processed in segments. However, for online animation applications, such as realtime avatar animation from motion capture, motions need to be processed as... |
2006.15207 | Jiefeng Chen | Jiefeng Chen, Yixuan Li, Xi Wu, Yingyu Liang, Somesh Jha | ATOM: Robustifying Out-of-distribution Detection Using Outlier Mining | Paper published at European Conference on Machine Learning (ECML'21) | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Detecting out-of-distribution (OOD) inputs is critical for safely deploying
deep learning models in an open-world setting. However, existing OOD detection
solutions can be brittle in the open world, facing various types of adversarial
OOD inputs. While methods leveraging auxiliary OOD data have emerged, our
analysis ... | [
{
"created": "Fri, 26 Jun 2020 20:58:05 GMT",
"version": "v1"
},
{
"created": "Sat, 3 Oct 2020 23:30:40 GMT",
"version": "v2"
},
{
"created": "Tue, 22 Jun 2021 22:09:39 GMT",
"version": "v3"
},
{
"created": "Wed, 30 Jun 2021 02:33:11 GMT",
"version": "v4"
}
] | 2021-07-01 | [
[
"Chen",
"Jiefeng",
""
],
[
"Li",
"Yixuan",
""
],
[
"Wu",
"Xi",
""
],
[
"Liang",
"Yingyu",
""
],
[
"Jha",
"Somesh",
""
]
] | Detecting out-of-distribution (OOD) inputs is critical for safely deploying deep learning models in an open-world setting. However, existing OOD detection solutions can be brittle in the open world, facing various types of adversarial OOD inputs. While methods leveraging auxiliary OOD data have emerged, our analysis on... |
1402.3766 | Pascal Vanier | Alex Borello (LACL), Julien Cervelle (LACL), Pascal Vanier | Turing degrees of limit sets of cellular automata | null | null | null | null | cs.FL nlin.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cellular automata are discrete dynamical systems and a model of computation.
The limit set of a cellular automaton consists of the configurations having an
infinite sequence of preimages. It is well known that these always contain a
computable point and that any non-trivial property on them is undecidable. We
go one ... | [
{
"created": "Sun, 16 Feb 2014 07:01:24 GMT",
"version": "v1"
}
] | 2014-02-18 | [
[
"Borello",
"Alex",
"",
"LACL"
],
[
"Cervelle",
"Julien",
"",
"LACL"
],
[
"Vanier",
"Pascal",
""
]
] | Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a computable point and that any non-trivial property on them is undecidable. We go one st... |
1806.07056 | Vuk Marojevic | Marti Floriach-Pigem, Guillem Xercavins-Torregrosa, Antoni
Gelonch-Bosch, Vuk Marojevic | Creating Tailored and Adaptive Network Services with the Open
Orchestration C-RAN Framework | IEEE 5G World Forum 2018 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Next generation wireless communications networks will leverage
software-defined radio and networking technologies, combined with cloud and fog
computing. A pool of resources can then be dynamically allocated to create
personalized network services (NSs). The enabling technologies are abstraction,
virtualization and c... | [
{
"created": "Tue, 19 Jun 2018 06:00:56 GMT",
"version": "v1"
}
] | 2018-06-20 | [
[
"Floriach-Pigem",
"Marti",
""
],
[
"Xercavins-Torregrosa",
"Guillem",
""
],
[
"Gelonch-Bosch",
"Antoni",
""
],
[
"Marojevic",
"Vuk",
""
]
] | Next generation wireless communications networks will leverage software-defined radio and networking technologies, combined with cloud and fog computing. A pool of resources can then be dynamically allocated to create personalized network services (NSs). The enabling technologies are abstraction, virtualization and con... |
1810.08711 | Seva Shneer | Seva Shneer and Alexander Stolyar | Stability conditions for a decentralised medium access algorithm:
single- and multi-hop networks | null | null | null | null | cs.IT math.IT math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a decentralised multi-access algorithm, motivated primarily by
the control of transmissions in a wireless network. For a finite single-hop
network with arbitrary interference constraints we prove stochastic stability
under the natural conditions. For infinite and finite single-hop networks, we
obtain broa... | [
{
"created": "Fri, 19 Oct 2018 23:10:00 GMT",
"version": "v1"
},
{
"created": "Fri, 31 May 2019 08:08:07 GMT",
"version": "v2"
}
] | 2019-06-03 | [
[
"Shneer",
"Seva",
""
],
[
"Stolyar",
"Alexander",
""
]
] | We consider a decentralised multi-access algorithm, motivated primarily by the control of transmissions in a wireless network. For a finite single-hop network with arbitrary interference constraints we prove stochastic stability under the natural conditions. For infinite and finite single-hop networks, we obtain broad ... |
0801.0452 | V. Sreekanth Annapureddy | V. Sreekanth Annapureddy and Venugopal V. Veeravalli | Sum Capacity of the Gaussian Interference Channel in the Low
Interference Regime | 6 pages, 4 figures, Proceedings of ITA Workshop, San Diego, CA,
Jan-Feb, 2008 | null | null | null | cs.IT math.IT | null | New upper bounds on the sum capacity of the two-user Gaussian interference
channel are derived. Using these bounds, it is shown that treating interference
as noise achieves the sum capacity if the interference levels are below certain
thresholds.
| [
{
"created": "Wed, 2 Jan 2008 23:11:39 GMT",
"version": "v1"
}
] | 2008-01-04 | [
[
"Annapureddy",
"V. Sreekanth",
""
],
[
"Veeravalli",
"Venugopal V.",
""
]
] | New upper bounds on the sum capacity of the two-user Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum capacity if the interference levels are below certain thresholds. |
2006.11684 | Yuan Shen | Yuan Shen, Shanduojiao Jiang, Yanlin Chen, Katie Driggs Campbell | To Explain or Not to Explain: A Study on the Necessity of Explanations
for Autonomous Vehicles | Won Best Paper Award at NeurIPS 2022 Progress and Challenges in
Building Trustworthy Embodied AI Workshop (TEA 2022) | null | null | null | cs.AI cs.HC | http://creativecommons.org/licenses/by/4.0/ | Explainable AI, in the context of autonomous systems, like self-driving cars,
has drawn broad interests from researchers. Recent studies have found that
providing explanations for autonomous vehicles' actions has many benefits
(e.g., increased trust and acceptance), but put little emphasis on when an
explanation is n... | [
{
"created": "Sun, 21 Jun 2020 00:38:24 GMT",
"version": "v1"
},
{
"created": "Sun, 30 Oct 2022 05:49:27 GMT",
"version": "v2"
},
{
"created": "Thu, 10 Nov 2022 21:44:34 GMT",
"version": "v3"
},
{
"created": "Wed, 21 Dec 2022 01:33:44 GMT",
"version": "v4"
}
] | 2022-12-22 | [
[
"Shen",
"Yuan",
""
],
[
"Jiang",
"Shanduojiao",
""
],
[
"Chen",
"Yanlin",
""
],
[
"Campbell",
"Katie Driggs",
""
]
] | Explainable AI, in the context of autonomous systems, like self-driving cars, has drawn broad interests from researchers. Recent studies have found that providing explanations for autonomous vehicles' actions has many benefits (e.g., increased trust and acceptance), but put little emphasis on when an explanation is nee... |
1109.1068 | Karteeka Pavan Kanadam | K. Karteeka Pavan, Allam Appa Rao, A. V. Dattatreya Rao | An Automatic Clustering Technique for Optimal Clusters | 12 pages, 5 figures, 2 tables | International journal of Computer Sciene Engineering and
Applications, Vol., No.4, 2011, pp 133-144 | 10.5121/ijcsea.2011.1412 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes a simple, automatic and efficient clustering algorithm,
namely, Automatic Merging for Optimal Clusters (AMOC) which aims to generate
nearly optimal clusters for the given datasets automatically. The AMOC is an
extension to standard k-means with a two phase iterative procedure combining
certain val... | [
{
"created": "Tue, 6 Sep 2011 05:34:28 GMT",
"version": "v1"
}
] | 2011-09-07 | [
[
"Pavan",
"K. Karteeka",
""
],
[
"Rao",
"Allam Appa",
""
],
[
"Rao",
"A. V. Dattatreya",
""
]
] | This paper proposes a simple, automatic and efficient clustering algorithm, namely, Automatic Merging for Optimal Clusters (AMOC) which aims to generate nearly optimal clusters for the given datasets automatically. The AMOC is an extension to standard k-means with a two phase iterative procedure combining certain valid... |
1705.04448 | TonTon Huang | TonTon Hsien-De Huang, and Hung-Yu Kao | R2-D2: ColoR-inspired Convolutional NeuRal Network (CNN)-based AndroiD
Malware Detections | Verison 2018/11/15, IEEE BigData 2018, Seattle, WA, USA, Dec 10-13,
2018. (Accepted) | null | null | null | cs.CR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The influence of Deep Learning on image identification and natural language
processing has attracted enormous attention globally. The convolution neural
network that can learn without prior extraction of features fits well in
response to the rapid iteration of Android malware. The traditional solution
for detecting A... | [
{
"created": "Fri, 12 May 2017 06:28:12 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Jul 2017 11:56:51 GMT",
"version": "v2"
},
{
"created": "Fri, 1 Sep 2017 16:10:48 GMT",
"version": "v3"
},
{
"created": "Tue, 5 Dec 2017 09:08:15 GMT",
"version": "v4"
},
{
"cre... | 2018-11-16 | [
[
"Huang",
"TonTon Hsien-De",
""
],
[
"Kao",
"Hung-Yu",
""
]
] | The influence of Deep Learning on image identification and natural language processing has attracted enormous attention globally. The convolution neural network that can learn without prior extraction of features fits well in response to the rapid iteration of Android malware. The traditional solution for detecting And... |
2311.10699 | George Cevora | Marcel Marais, Mate Hartstein, George Cevora | Using linear initialisation to improve speed of convergence and
fully-trained error in Autoencoders | null | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | Good weight initialisation is an important step in successful training of
Artificial Neural Networks. Over time a number of improvements have been
proposed to this process. In this paper we introduce a novel weight
initialisation technique called the Straddled Matrix Initialiser. This
initialisation technique is moti... | [
{
"created": "Fri, 17 Nov 2023 18:43:32 GMT",
"version": "v1"
}
] | 2023-11-20 | [
[
"Marais",
"Marcel",
""
],
[
"Hartstein",
"Mate",
""
],
[
"Cevora",
"George",
""
]
] | Good weight initialisation is an important step in successful training of Artificial Neural Networks. Over time a number of improvements have been proposed to this process. In this paper we introduce a novel weight initialisation technique called the Straddled Matrix Initialiser. This initialisation technique is motiva... |
2112.01068 | Quentin De Coninck | Quentin De Coninck | The Packet Number Space Debate in Multipath QUIC | 7 pages, submitted to ACM CCR | null | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | With a standardization process that attracted many interest, QUIC can been
seen as the next general-purpose transport protocol. Still, it does not provide
true multipath support yet, missing some use cases that MPTCP can address. To
fill that gap, the IETF recently adopted a multipath proposal merging all the
propose... | [
{
"created": "Thu, 2 Dec 2021 09:18:16 GMT",
"version": "v1"
}
] | 2021-12-03 | [
[
"De Coninck",
"Quentin",
""
]
] | With a standardization process that attracted many interest, QUIC can been seen as the next general-purpose transport protocol. Still, it does not provide true multipath support yet, missing some use cases that MPTCP can address. To fill that gap, the IETF recently adopted a multipath proposal merging all the proposed ... |
2207.02449 | Naoya Fujita | Naoya Fujita and Hiroshi Watanabe | Information Compression and Performance Evaluation of Tic-Tac-Toe's
Evaluation Function Using Singular Value Decomposition | 15 pages, 5 figures, Updated contents | null | 10.7566/JPSJ.92.034802 | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We approximated the evaluation function for the game Tic-Tac-Toe by singular
value decomposition (SVD) and investigated the effect of approximation accuracy
on winning rate. We first prepared the perfect evaluation function of
Tic-Tac-Toe and performed low-rank approximation by considering the evaluation
function as ... | [
{
"created": "Wed, 6 Jul 2022 05:40:32 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Jul 2022 12:40:24 GMT",
"version": "v2"
},
{
"created": "Tue, 13 Sep 2022 14:56:50 GMT",
"version": "v3"
},
{
"created": "Wed, 12 Oct 2022 06:53:38 GMT",
"version": "v4"
},
{
"cre... | 2023-03-22 | [
[
"Fujita",
"Naoya",
""
],
[
"Watanabe",
"Hiroshi",
""
]
] | We approximated the evaluation function for the game Tic-Tac-Toe by singular value decomposition (SVD) and investigated the effect of approximation accuracy on winning rate. We first prepared the perfect evaluation function of Tic-Tac-Toe and performed low-rank approximation by considering the evaluation function as a ... |
1904.02341 | Xin Huang | Xin Huang, Sungkweon Hong, Andreas Hofmann, Brian C. Williams | Online Risk-Bounded Motion Planning for Autonomous Vehicles in Dynamic
Environments | Accepted at ICAPS'19. 10 pages, 6 figures, 1 table | null | null | null | cs.RO cs.AI cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A crucial challenge to efficient and robust motion planning for autonomous
vehicles is understanding the intentions of the surrounding agents. Ignoring
the intentions of the other agents in dynamic environments can lead to risky or
over-conservative plans. In this work, we model the motion planning problem as
a parti... | [
{
"created": "Thu, 4 Apr 2019 04:19:38 GMT",
"version": "v1"
}
] | 2019-04-05 | [
[
"Huang",
"Xin",
""
],
[
"Hong",
"Sungkweon",
""
],
[
"Hofmann",
"Andreas",
""
],
[
"Williams",
"Brian C.",
""
]
] | A crucial challenge to efficient and robust motion planning for autonomous vehicles is understanding the intentions of the surrounding agents. Ignoring the intentions of the other agents in dynamic environments can lead to risky or over-conservative plans. In this work, we model the motion planning problem as a partial... |
1005.0218 | Olivier Teste | Faiza Ghozzi (IRIT), Franck Ravat (IRIT), Olivier Teste (IRIT), Gilles
Zurfluh (IRIT) | Contraintes pour mod\`ele et langage multidimensionnels | null | Bases de donn\'ees avanc\'ees 2003, Lyon : France (2003) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper defines a constraint-based model dedicated to multidimensional
databases. The model we define represents data through a constellation of facts
(subjects of analyse) associated to dimensions (axis of analyse), which are
possibly shared. Each dimension is organised according to several hierarchies
(views of ... | [
{
"created": "Mon, 3 May 2010 07:47:56 GMT",
"version": "v1"
}
] | 2010-05-20 | [
[
"Ghozzi",
"Faiza",
"",
"IRIT"
],
[
"Ravat",
"Franck",
"",
"IRIT"
],
[
"Teste",
"Olivier",
"",
"IRIT"
],
[
"Zurfluh",
"Gilles",
"",
"IRIT"
]
] | This paper defines a constraint-based model dedicated to multidimensional databases. The model we define represents data through a constellation of facts (subjects of analyse) associated to dimensions (axis of analyse), which are possibly shared. Each dimension is organised according to several hierarchies (views of an... |
2005.08396 | Peng Fu | Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger | A tutorial introduction to quantum circuit programming in dependently
typed Proto-Quipper | Added a section on related work and a paragraph explaining qubit
initialization and termination | LNCS 12227:153-168 (2020) | 10.1007/978-3-030-52482-1_9 | null | cs.PL quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce dependently typed Proto-Quipper, or Proto-Quipper-D for short,
an experimental quantum circuit programming language with linear dependent
types. We give several examples to illustrate how linear dependent types can
help in the construction of correct quantum circuits. Specifically, we show how
dependent ... | [
{
"created": "Sun, 17 May 2020 23:31:23 GMT",
"version": "v1"
},
{
"created": "Sat, 12 Dec 2020 18:31:19 GMT",
"version": "v2"
}
] | 2023-07-04 | [
[
"Fu",
"Peng",
""
],
[
"Kishida",
"Kohei",
""
],
[
"Ross",
"Neil J.",
""
],
[
"Selinger",
"Peter",
""
]
] | We introduce dependently typed Proto-Quipper, or Proto-Quipper-D for short, an experimental quantum circuit programming language with linear dependent types. We give several examples to illustrate how linear dependent types can help in the construction of correct quantum circuits. Specifically, we show how dependent ty... |
2306.11678 | Ignacio Jimenez Gallo | Pablo Alex L\'azaro, Ignacio Jim\'enez Gallo, Juan Rold\'an Aranda,
Alberto del Barrio Garc\'ia, Guillermo Botella Juan, Francisco Jim\'enez
Molinos | Design and simulation of memristor-based neural networks | null | null | null | null | cs.ET | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In recent times, neural networks have been gaining increasing importance in
fields such as pattern recognition and computer vision. However, their usage
entails significant energy and hardware costs, limiting the domains in which
this technology can be employed.
In this context, the feasibility of utilizing analog ... | [
{
"created": "Tue, 20 Jun 2023 16:56:11 GMT",
"version": "v1"
}
] | 2023-06-21 | [
[
"Lázaro",
"Pablo Alex",
""
],
[
"Gallo",
"Ignacio Jiménez",
""
],
[
"Aranda",
"Juan Roldán",
""
],
[
"García",
"Alberto del Barrio",
""
],
[
"Juan",
"Guillermo Botella",
""
],
[
"Molinos",
"Francisco Jiménez",
""
]
] | In recent times, neural networks have been gaining increasing importance in fields such as pattern recognition and computer vision. However, their usage entails significant energy and hardware costs, limiting the domains in which this technology can be employed. In this context, the feasibility of utilizing analog circ... |
1707.05653 | Chandrasekhar Bhagavatula | Chandrasekhar Bhagavatula, Chenchen Zhu, Khoa Luu, Marios Savvides | Faster Than Real-time Facial Alignment: A 3D Spatial Transformer Network
Approach in Unconstrained Poses | International Conference on Computer Vision (ICCV) 2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Facial alignment involves finding a set of landmark points on an image with a
known semantic meaning. However, this semantic meaning of landmark points is
often lost in 2D approaches where landmarks are either moved to visible
boundaries or ignored as the pose of the face changes. In order to extract
consistent align... | [
{
"created": "Tue, 18 Jul 2017 14:51:35 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Sep 2017 16:58:53 GMT",
"version": "v2"
}
] | 2017-09-11 | [
[
"Bhagavatula",
"Chandrasekhar",
""
],
[
"Zhu",
"Chenchen",
""
],
[
"Luu",
"Khoa",
""
],
[
"Savvides",
"Marios",
""
]
] | Facial alignment involves finding a set of landmark points on an image with a known semantic meaning. However, this semantic meaning of landmark points is often lost in 2D approaches where landmarks are either moved to visible boundaries or ignored as the pose of the face changes. In order to extract consistent alignme... |
1703.08433 | Ching-Lueh Chang | Ching-Lueh Chang | Metric random matchings with applications | arXiv admin note: substantial text overlap with arXiv:1702.03106 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let $(\{1,2,\ldots,n\},d)$ be a metric space. We analyze the expected value
and the variance of $\sum_{i=1}^{\lfloor
n/2\rfloor}\,d({\boldsymbol{\pi}}(2i-1),{\boldsymbol{\pi}}(2i))$ for a
uniformly random permutation ${\boldsymbol{\pi}}$ of $\{1,2,\ldots,n\}$,
leading to the following results: (I) Consider the proble... | [
{
"created": "Fri, 24 Mar 2017 14:44:04 GMT",
"version": "v1"
}
] | 2017-03-27 | [
[
"Chang",
"Ching-Lueh",
""
]
] | Let $(\{1,2,\ldots,n\},d)$ be a metric space. We analyze the expected value and the variance of $\sum_{i=1}^{\lfloor n/2\rfloor}\,d({\boldsymbol{\pi}}(2i-1),{\boldsymbol{\pi}}(2i))$ for a uniformly random permutation ${\boldsymbol{\pi}}$ of $\{1,2,\ldots,n\}$, leading to the following results: (I) Consider the problem ... |
2010.03001 | Giannis Bekoulis | Giannis Bekoulis, Christina Papagiannopoulou, Nikos Deligiannis | A Review on Fact Extraction and Verification | Preprint - Accepted for publication in ACM Computing Surveys | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the fact checking problem, which aims to identify the veracity of a
given claim. Specifically, we focus on the task of Fact Extraction and
VERification (FEVER) and its accompanied dataset. The task consists of the
subtasks of retrieving the relevant documents (and sentences) from Wikipedia
and validating whe... | [
{
"created": "Tue, 6 Oct 2020 20:05:43 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Oct 2020 20:35:52 GMT",
"version": "v2"
},
{
"created": "Mon, 19 Apr 2021 09:46:36 GMT",
"version": "v3"
},
{
"created": "Tue, 24 Aug 2021 15:40:14 GMT",
"version": "v4"
},
{
"cr... | 2021-11-22 | [
[
"Bekoulis",
"Giannis",
""
],
[
"Papagiannopoulou",
"Christina",
""
],
[
"Deligiannis",
"Nikos",
""
]
] | We study the fact checking problem, which aims to identify the veracity of a given claim. Specifically, we focus on the task of Fact Extraction and VERification (FEVER) and its accompanied dataset. The task consists of the subtasks of retrieving the relevant documents (and sentences) from Wikipedia and validating wheth... |
2003.03516 | Lingfeng Tao | Lingfeng Tao, Michael Bowman, Xu Zhou, Jiucai Zhang, Xiaoli Zhang | Learn and Transfer Knowledge of Preferred Assistance Strategies in
Semi-autonomous Telemanipulation | null | null | 10.1007/s10846-022-01596-2 | null | cs.RO cs.AI cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Enabling robots to provide effective assistance yet still accommodating the
operator's commands for telemanipulation of an object is very challenging
because robot's assistive action is not always intuitive for human operators
and human behaviors and preferences are sometimes ambiguous for the robot to
interpret. Alt... | [
{
"created": "Sat, 7 Mar 2020 04:49:57 GMT",
"version": "v1"
},
{
"created": "Sat, 19 Dec 2020 20:21:40 GMT",
"version": "v2"
}
] | 2023-09-15 | [
[
"Tao",
"Lingfeng",
""
],
[
"Bowman",
"Michael",
""
],
[
"Zhou",
"Xu",
""
],
[
"Zhang",
"Jiucai",
""
],
[
"Zhang",
"Xiaoli",
""
]
] | Enabling robots to provide effective assistance yet still accommodating the operator's commands for telemanipulation of an object is very challenging because robot's assistive action is not always intuitive for human operators and human behaviors and preferences are sometimes ambiguous for the robot to interpret. Altho... |
1612.06139 | Josep Crego | Josep Crego and Jean Senellart | Neural Machine Translation from Simplified Translations | Submitted to EACL 2017 Short paper | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Text simplification aims at reducing the lexical, grammatical and structural
complexity of a text while keeping the same meaning. In the context of machine
translation, we introduce the idea of simplified translations in order to boost
the learning ability of deep neural translation models. We conduct preliminary
exp... | [
{
"created": "Mon, 19 Dec 2016 11:50:58 GMT",
"version": "v1"
}
] | 2016-12-20 | [
[
"Crego",
"Josep",
""
],
[
"Senellart",
"Jean",
""
]
] | Text simplification aims at reducing the lexical, grammatical and structural complexity of a text while keeping the same meaning. In the context of machine translation, we introduce the idea of simplified translations in order to boost the learning ability of deep neural translation models. We conduct preliminary exper... |
2403.08828 | Balint Gyevnar | Balint Gyevnar and Stephanie Droop and Tadeg Quillien and Shay B.
Cohen and Neil R. Bramley and Christopher G. Lucas and Stefano V. Albrecht | People Attribute Purpose to Autonomous Vehicles When Explaining Their
Behavior | null | null | null | null | cs.HC cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cognitive science can help us understand which explanations people might
expect, and in which format they frame these explanations, whether causal,
counterfactual, or teleological (i.e., purpose-oriented). Understanding the
relevance of these concepts is crucial for building good explainable AI (XAI)
which offers rec... | [
{
"created": "Mon, 11 Mar 2024 11:48:50 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Apr 2024 17:43:10 GMT",
"version": "v2"
}
] | 2024-05-01 | [
[
"Gyevnar",
"Balint",
""
],
[
"Droop",
"Stephanie",
""
],
[
"Quillien",
"Tadeg",
""
],
[
"Cohen",
"Shay B.",
""
],
[
"Bramley",
"Neil R.",
""
],
[
"Lucas",
"Christopher G.",
""
],
[
"Albrecht",
"Stefano V.",
... | Cognitive science can help us understand which explanations people might expect, and in which format they frame these explanations, whether causal, counterfactual, or teleological (i.e., purpose-oriented). Understanding the relevance of these concepts is crucial for building good explainable AI (XAI) which offers recou... |
2108.05598 | Konstantinos Makantasis | Konstantinos Makantasis | AffRankNet+: Ranking Affect Using Privileged Information | 8 pages, 4 figures, 2021 9th International Conference on Affective
Computing and Intelligent Interaction Workshops and Demos (ACIIW) | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many of the affect modelling tasks present an asymmetric distribution of
information between training and test time; additional information is given
about the training data, which is not available at test time. Learning under
this setting is called Learning Under Privileged Information (LUPI). At the
same time, due t... | [
{
"created": "Thu, 12 Aug 2021 08:36:31 GMT",
"version": "v1"
}
] | 2021-08-13 | [
[
"Makantasis",
"Konstantinos",
""
]
] | Many of the affect modelling tasks present an asymmetric distribution of information between training and test time; additional information is given about the training data, which is not available at test time. Learning under this setting is called Learning Under Privileged Information (LUPI). At the same time, due to ... |
2104.06159 | Ivo Danihelka | Matteo Hessel, Ivo Danihelka, Fabio Viola, Arthur Guez, Simon Schmitt,
Laurent Sifre, Theophane Weber, David Silver, Hado van Hasselt | Muesli: Combining Improvements in Policy Optimization | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel policy update that combines regularized policy
optimization with model learning as an auxiliary loss. The update (henceforth
Muesli) matches MuZero's state-of-the-art performance on Atari. Notably, Muesli
does so without using deep search: it acts directly with a policy network and
has computation ... | [
{
"created": "Tue, 13 Apr 2021 13:04:29 GMT",
"version": "v1"
},
{
"created": "Thu, 31 Mar 2022 09:35:40 GMT",
"version": "v2"
}
] | 2022-04-01 | [
[
"Hessel",
"Matteo",
""
],
[
"Danihelka",
"Ivo",
""
],
[
"Viola",
"Fabio",
""
],
[
"Guez",
"Arthur",
""
],
[
"Schmitt",
"Simon",
""
],
[
"Sifre",
"Laurent",
""
],
[
"Weber",
"Theophane",
""
],
[
"Sil... | We propose a novel policy update that combines regularized policy optimization with model learning as an auxiliary loss. The update (henceforth Muesli) matches MuZero's state-of-the-art performance on Atari. Notably, Muesli does so without using deep search: it acts directly with a policy network and has computation sp... |
2207.04957 | Frederick Qiu | Frederick Qiu and Sahil Singla | Submodular Dominance and Applications | Appears in APPROX 2022, 21 pages, 1 figure | null | null | null | cs.DS cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In submodular optimization we often deal with the expected value of a
submodular function $f$ on a distribution $\mathcal{D}$ over sets of elements.
In this work we study such submodular expectations for negatively dependent
distributions. We introduce a natural notion of negative dependence, which we
call Weak Negat... | [
{
"created": "Mon, 11 Jul 2022 15:38:16 GMT",
"version": "v1"
}
] | 2022-07-13 | [
[
"Qiu",
"Frederick",
""
],
[
"Singla",
"Sahil",
""
]
] | In submodular optimization we often deal with the expected value of a submodular function $f$ on a distribution $\mathcal{D}$ over sets of elements. In this work we study such submodular expectations for negatively dependent distributions. We introduce a natural notion of negative dependence, which we call Weak Negativ... |
2301.09545 | Jesse Josua Benjamin | Jesse Josua Benjamin, Heidi Biggs, Arne Berger, Julija Rukanskait\.e,
Michael Heidt, Nick Merrill, James Pierce, Joseph Lindley | The Entoptic Field Camera as Metaphor-Driven Research-through-Design
with AI Technologies | To be published in Proceedings of the 2023 CHI Conference on Human
Factors in Computing Systems (CHI '23), April 23--28, 2023, Hamburg, Germany | null | 10.1145/3544548.3581175 | null | cs.HC cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Artificial intelligence (AI) technologies are widely deployed in smartphone
photography; and prompt-based image synthesis models have rapidly become
commonplace. In this paper, we describe a Research-through-Design (RtD) project
which explores this shift in the means and modes of image production via the
creation and... | [
{
"created": "Mon, 23 Jan 2023 17:03:54 GMT",
"version": "v1"
}
] | 2023-01-24 | [
[
"Benjamin",
"Jesse Josua",
""
],
[
"Biggs",
"Heidi",
""
],
[
"Berger",
"Arne",
""
],
[
"Rukanskaitė",
"Julija",
""
],
[
"Heidt",
"Michael",
""
],
[
"Merrill",
"Nick",
""
],
[
"Pierce",
"James",
""
],
[
... | Artificial intelligence (AI) technologies are widely deployed in smartphone photography; and prompt-based image synthesis models have rapidly become commonplace. In this paper, we describe a Research-through-Design (RtD) project which explores this shift in the means and modes of image production via the creation and u... |
2004.12274 | Baoyu Jing | Baoyu Jing, Zeya Wang, Eric Xing | Show, Describe and Conclude: On Exploiting the Structure Information of
Chest X-Ray Reports | ACL 2019 | null | 10.18653/v1/P19-1657 | null | cs.CL cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | Chest X-Ray (CXR) images are commonly used for clinical screening and
diagnosis. Automatically writing reports for these images can considerably
lighten the workload of radiologists for summarizing descriptive findings and
conclusive impressions. The complex structures between and within sections of
the reports pose ... | [
{
"created": "Sun, 26 Apr 2020 02:29:20 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Jul 2020 17:44:44 GMT",
"version": "v2"
}
] | 2020-07-24 | [
[
"Jing",
"Baoyu",
""
],
[
"Wang",
"Zeya",
""
],
[
"Xing",
"Eric",
""
]
] | Chest X-Ray (CXR) images are commonly used for clinical screening and diagnosis. Automatically writing reports for these images can considerably lighten the workload of radiologists for summarizing descriptive findings and conclusive impressions. The complex structures between and within sections of the reports pose a ... |
1911.10470 | Akari Asai Ms | Akari Asai, Kazuma Hashimoto, Hannaneh Hajishirzi, Richard Socher,
Caiming Xiong | Learning to Retrieve Reasoning Paths over Wikipedia Graph for Question
Answering | Published as a conference paper at ICLR 2020. Code is available at
https://github.com/AkariAsai/learning_to_retrieve_reasoning_paths | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Answering questions that require multi-hop reasoning at web-scale
necessitates retrieving multiple evidence documents, one of which often has
little lexical or semantic relationship to the question. This paper introduces
a new graph-based recurrent retrieval approach that learns to retrieve
reasoning paths over the W... | [
{
"created": "Sun, 24 Nov 2019 08:27:42 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Feb 2020 07:43:06 GMT",
"version": "v2"
}
] | 2020-02-17 | [
[
"Asai",
"Akari",
""
],
[
"Hashimoto",
"Kazuma",
""
],
[
"Hajishirzi",
"Hannaneh",
""
],
[
"Socher",
"Richard",
""
],
[
"Xiong",
"Caiming",
""
]
] | Answering questions that require multi-hop reasoning at web-scale necessitates retrieving multiple evidence documents, one of which often has little lexical or semantic relationship to the question. This paper introduces a new graph-based recurrent retrieval approach that learns to retrieve reasoning paths over the Wik... |
2406.08787 | Parisa Kordjamshidi | Sania Sinha, Tanawan Premsri, Parisa Kordjamshidi | A Survey on Compositional Learning of AI Models: Theoretical and
Experimetnal Practices | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compositional learning, mastering the ability to combine basic concepts and
construct more intricate ones, is crucial for human cognition, especially in
human language comprehension and visual perception. This notion is tightly
connected to generalization over unobserved situations. Despite its integral
role in intel... | [
{
"created": "Thu, 13 Jun 2024 03:46:21 GMT",
"version": "v1"
}
] | 2024-06-14 | [
[
"Sinha",
"Sania",
""
],
[
"Premsri",
"Tanawan",
""
],
[
"Kordjamshidi",
"Parisa",
""
]
] | Compositional learning, mastering the ability to combine basic concepts and construct more intricate ones, is crucial for human cognition, especially in human language comprehension and visual perception. This notion is tightly connected to generalization over unobserved situations. Despite its integral role in intelli... |
2311.01323 | Qizhang Li | Qizhang Li, Yiwen Guo, Wangmeng Zuo, Hao Chen | Towards Evaluating Transfer-based Attacks Systematically, Practically,
and Fairly | Accepted by NeurIPS 2023 | null | null | null | cs.LG cs.CR cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The adversarial vulnerability of deep neural networks (DNNs) has drawn great
attention due to the security risk of applying these models in real-world
applications. Based on transferability of adversarial examples, an increasing
number of transfer-based methods have been developed to fool black-box DNN
models whose a... | [
{
"created": "Thu, 2 Nov 2023 15:35:58 GMT",
"version": "v1"
}
] | 2023-11-03 | [
[
"Li",
"Qizhang",
""
],
[
"Guo",
"Yiwen",
""
],
[
"Zuo",
"Wangmeng",
""
],
[
"Chen",
"Hao",
""
]
] | The adversarial vulnerability of deep neural networks (DNNs) has drawn great attention due to the security risk of applying these models in real-world applications. Based on transferability of adversarial examples, an increasing number of transfer-based methods have been developed to fool black-box DNN models whose arc... |
2110.06758 | Fuqun Huang | Fuqun Huang and Lorenzo Strigini | HEDP: A Method for Early Forecasting Software Defects based on Human
Error Mechanisms | 30 pages, 5 figures, and 17 tables | IEEE Access-2023 | 10.1109/ACCESS.2023.3234490 | volume 11, page 3626-3652 | cs.SE cs.AI cs.CC cs.CY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | As the primary cause of software defects, human error is the key to
understanding, and perhaps to predicting and avoiding them. Little research has
been done to predict defects on the basis of the cognitive errors that cause
them. This paper proposes an approach to predicting software defects through
knowledge about ... | [
{
"created": "Wed, 13 Oct 2021 14:44:23 GMT",
"version": "v1"
}
] | 2023-01-18 | [
[
"Huang",
"Fuqun",
""
],
[
"Strigini",
"Lorenzo",
""
]
] | As the primary cause of software defects, human error is the key to understanding, and perhaps to predicting and avoiding them. Little research has been done to predict defects on the basis of the cognitive errors that cause them. This paper proposes an approach to predicting software defects through knowledge about th... |
1805.09521 | Ehsan Adeli | Mohammad Sabokrou, Masoud Pourreza, Mohsen Fayyaz, Rahim Entezari,
Mahmood Fathy, J\"urgen Gall, Ehsan Adeli | AVID: Adversarial Visual Irregularity Detection | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Real-time detection of irregularities in visual data is very invaluable and
useful in many prospective applications including surveillance, patient
monitoring systems, etc. With the surge of deep learning methods in the recent
years, researchers have tried a wide spectrum of methods for different
applications. Howeve... | [
{
"created": "Thu, 24 May 2018 06:23:45 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Jul 2018 22:37:53 GMT",
"version": "v2"
}
] | 2018-07-19 | [
[
"Sabokrou",
"Mohammad",
""
],
[
"Pourreza",
"Masoud",
""
],
[
"Fayyaz",
"Mohsen",
""
],
[
"Entezari",
"Rahim",
""
],
[
"Fathy",
"Mahmood",
""
],
[
"Gall",
"Jürgen",
""
],
[
"Adeli",
"Ehsan",
""
]
] | Real-time detection of irregularities in visual data is very invaluable and useful in many prospective applications including surveillance, patient monitoring systems, etc. With the surge of deep learning methods in the recent years, researchers have tried a wide spectrum of methods for different applications. However,... |
2307.06795 | Denis Coquenet | Denis Coquenet and Cl\'ement Rambour and Emanuele Dalsasso and Nicolas
Thome | Leveraging Vision-Language Foundation Models for Fine-Grained Downstream
Tasks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vision-language foundation models such as CLIP have shown impressive
zero-shot performance on many tasks and datasets, especially thanks to their
free-text inputs. However, they struggle to handle some downstream tasks, such
as fine-grained attribute detection and localization. In this paper, we propose
a multitask f... | [
{
"created": "Thu, 13 Jul 2023 15:05:34 GMT",
"version": "v1"
}
] | 2023-07-14 | [
[
"Coquenet",
"Denis",
""
],
[
"Rambour",
"Clément",
""
],
[
"Dalsasso",
"Emanuele",
""
],
[
"Thome",
"Nicolas",
""
]
] | Vision-language foundation models such as CLIP have shown impressive zero-shot performance on many tasks and datasets, especially thanks to their free-text inputs. However, they struggle to handle some downstream tasks, such as fine-grained attribute detection and localization. In this paper, we propose a multitask fin... |
2201.08679 | Rog\'erio Rossi | Rogerio Rossi and Kechi Hirama | Strategic Issues on Implementing a Software Process Improvement Program | InSITE Conference - Tampa, USA - 2015 | null | 10.28945/2193 | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Software technology has high impact on the global economy as in many sectors
of contemporary society. As a product enabling the most varied daily
activities, the software product has to be produced reflecting high quality.
Software quality is dependent on its development that is based in a large set
of software devel... | [
{
"created": "Sat, 15 Jan 2022 23:20:22 GMT",
"version": "v1"
}
] | 2022-01-24 | [
[
"Rossi",
"Rogerio",
""
],
[
"Hirama",
"Kechi",
""
]
] | Software technology has high impact on the global economy as in many sectors of contemporary society. As a product enabling the most varied daily activities, the software product has to be produced reflecting high quality. Software quality is dependent on its development that is based in a large set of software develop... |
1006.4444 | William Jackson | Bruno Osorno | Analysis of Microprocessor Based Protective Re-lay's (MBPR) Differential
Equation Algorithms | IEEE Publication Format,
https://sites.google.com/site/journalofcomputing/ | Journal of Computing, Vol. 2 No. 6, June 2010, NY, USA, ISSN
2151-9617 | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper analyses and explains from the systems point of view,
microprocessor based protective relay (MBPR) systems with emphasis on
differential equation algorithms. Presently, the application of protective
relaying in power systems, using MBPR systems, based on the differential
equation algorithm is valued more t... | [
{
"created": "Wed, 23 Jun 2010 08:29:36 GMT",
"version": "v1"
}
] | 2010-06-24 | [
[
"Osorno",
"Bruno",
""
]
] | This paper analyses and explains from the systems point of view, microprocessor based protective relay (MBPR) systems with emphasis on differential equation algorithms. Presently, the application of protective relaying in power systems, using MBPR systems, based on the differential equation algorithm is valued more tha... |
1806.09444 | Nikita Jaipuria | Nikita Jaipuria, Golnaz Habibi, Jonathan P. How | A Transferable Pedestrian Motion Prediction Model for Intersections with
Different Geometries | null | null | null | null | cs.LG cs.AI cs.RO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel framework for accurate pedestrian intent
prediction at intersections. Given some prior knowledge of the curbside
geometry, the presented framework can accurately predict pedestrian
trajectories, even in new intersections that it has not been trained on. This
is achieved by making use of th... | [
{
"created": "Mon, 25 Jun 2018 13:19:45 GMT",
"version": "v1"
}
] | 2018-06-26 | [
[
"Jaipuria",
"Nikita",
""
],
[
"Habibi",
"Golnaz",
""
],
[
"How",
"Jonathan P.",
""
]
] | This paper presents a novel framework for accurate pedestrian intent prediction at intersections. Given some prior knowledge of the curbside geometry, the presented framework can accurately predict pedestrian trajectories, even in new intersections that it has not been trained on. This is achieved by making use of the ... |
2101.08333 | Shuyang Li | Shuyang Li, Jin Cao, Mukund Sridhar, Henghui Zhu, Shang-Wen Li, Wael
Hamza, Julian McAuley | Zero-shot Generalization in Dialog State Tracking through Generative
Question Answering | Accepted as a Long Paper at EACL 2021 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dialog State Tracking (DST), an integral part of modern dialog systems, aims
to track user preferences and constraints (slots) in task-oriented dialogs. In
real-world settings with constantly changing services, DST systems must
generalize to new domains and unseen slot types. Existing methods for DST do
not generaliz... | [
{
"created": "Wed, 20 Jan 2021 21:47:20 GMT",
"version": "v1"
}
] | 2021-01-22 | [
[
"Li",
"Shuyang",
""
],
[
"Cao",
"Jin",
""
],
[
"Sridhar",
"Mukund",
""
],
[
"Zhu",
"Henghui",
""
],
[
"Li",
"Shang-Wen",
""
],
[
"Hamza",
"Wael",
""
],
[
"McAuley",
"Julian",
""
]
] | Dialog State Tracking (DST), an integral part of modern dialog systems, aims to track user preferences and constraints (slots) in task-oriented dialogs. In real-world settings with constantly changing services, DST systems must generalize to new domains and unseen slot types. Existing methods for DST do not generalize ... |
1912.05333 | Moein Hasani | Moein Hasani, Amin Nasim Saravi, Hassan Khotanlou | An Efficient Approach for Using Expectation Maximization Algorithm in
Capsule Networks | null | null | 10.1109/MVIP49855.2020.9116870 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Capsule Networks (CapsNets) are brand-new architectures that have shown
ground-breaking results in certain areas of Computer Vision (CV). In 2017,
Hinton and his team introduced CapsNets with routing-by-agreement in "Sabour et
al" and in a more recent paper "Matrix Capsules with EM Routing" they proposed
a more compl... | [
{
"created": "Wed, 11 Dec 2019 14:13:15 GMT",
"version": "v1"
},
{
"created": "Sun, 22 Dec 2019 11:35:25 GMT",
"version": "v2"
},
{
"created": "Fri, 31 Jul 2020 13:10:16 GMT",
"version": "v3"
}
] | 2020-08-03 | [
[
"Hasani",
"Moein",
""
],
[
"Saravi",
"Amin Nasim",
""
],
[
"Khotanlou",
"Hassan",
""
]
] | Capsule Networks (CapsNets) are brand-new architectures that have shown ground-breaking results in certain areas of Computer Vision (CV). In 2017, Hinton and his team introduced CapsNets with routing-by-agreement in "Sabour et al" and in a more recent paper "Matrix Capsules with EM Routing" they proposed a more complet... |
1911.04831 | Jonguk Kim | Jonguk Kim, Jeong-Han Yun, Hyoung Chun Kim | Anomaly Detection for Industrial Control Systems Using
Sequence-to-Sequence Neural Networks | Accepted to 5th Workshop on the Security of Industrial Control
Systems & of Cyber-Physical Systems (CyberICPS 2019) in conjunction with
ESORICS 2019 | null | null | null | cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This study proposes an anomaly detection method for operational data of
industrial control systems (ICSs). Sequence-to-sequence neural networks were
applied to train and predict ICS operational data and interpret their
time-series characteristic. The proposed method requires only a normal dataset
to understand ICS's ... | [
{
"created": "Tue, 12 Nov 2019 13:16:15 GMT",
"version": "v1"
}
] | 2019-11-13 | [
[
"Kim",
"Jonguk",
""
],
[
"Yun",
"Jeong-Han",
""
],
[
"Kim",
"Hyoung Chun",
""
]
] | This study proposes an anomaly detection method for operational data of industrial control systems (ICSs). Sequence-to-sequence neural networks were applied to train and predict ICS operational data and interpret their time-series characteristic. The proposed method requires only a normal dataset to understand ICS's no... |
1805.01823 | Jakub Gajarsk\'y | Jakub Gajarsk\'y, Petr Hlin\v{e}n\'y, Daniel Lokshtanov, Jan
Obdr\v{z}\'alek, M.S. Ramanujan | A New Perspective on FO Model Checking of Dense Graph Classes | null | null | null | null | cs.LO cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the first-order (FO) model checking problem of dense graphs, namely
those which have FO interpretations in (or are FO transductions of) some sparse
graph classes. We give a structural characterization of the graph classes which
are FO interpretable in graphs of bounded degree. This characterization allows
us... | [
{
"created": "Fri, 4 May 2018 15:29:16 GMT",
"version": "v1"
}
] | 2018-05-07 | [
[
"Gajarský",
"Jakub",
""
],
[
"Hliněný",
"Petr",
""
],
[
"Lokshtanov",
"Daniel",
""
],
[
"Obdržálek",
"Jan",
""
],
[
"Ramanujan",
"M. S.",
""
]
] | We study the first-order (FO) model checking problem of dense graphs, namely those which have FO interpretations in (or are FO transductions of) some sparse graph classes. We give a structural characterization of the graph classes which are FO interpretable in graphs of bounded degree. This characterization allows us t... |
2311.03526 | Fuyuan Lyu | Fuyuan Lyu, Yaochen Hu, Xing Tang, Yingxue Zhang, Ruiming Tang, Xue
Liu | Towards Automated Negative Sampling in Implicit Recommendation | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Negative sampling methods are vital in implicit recommendation models as they
allow us to obtain negative instances from massive unlabeled data. Most
existing approaches focus on sampling hard negative samples in various ways.
These studies are orthogonal to the recommendation model and implicit datasets.
However, su... | [
{
"created": "Mon, 6 Nov 2023 21:05:00 GMT",
"version": "v1"
}
] | 2023-11-08 | [
[
"Lyu",
"Fuyuan",
""
],
[
"Hu",
"Yaochen",
""
],
[
"Tang",
"Xing",
""
],
[
"Zhang",
"Yingxue",
""
],
[
"Tang",
"Ruiming",
""
],
[
"Liu",
"Xue",
""
]
] | Negative sampling methods are vital in implicit recommendation models as they allow us to obtain negative instances from massive unlabeled data. Most existing approaches focus on sampling hard negative samples in various ways. These studies are orthogonal to the recommendation model and implicit datasets. However, such... |
cs/0208005 | Ulrich Hillenbrand | Ulrich Hillenbrand and Gerd Hirzinger | Probabilistic Search for Object Segmentation and Recognition | 18 pages, 5 figures | Proceedings ECCV 2002, Lecture Notes in Computer Science Vol.
2352, pp. 791-806 | null | null | cs.CV | null | The problem of searching for a model-based scene interpretation is analyzed
within a probabilistic framework. Object models are formulated as generative
models for range data of the scene. A new statistical criterion, the truncated
object probability, is introduced to infer an optimal sequence of object
hypotheses to... | [
{
"created": "Mon, 5 Aug 2002 10:57:09 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Hillenbrand",
"Ulrich",
""
],
[
"Hirzinger",
"Gerd",
""
]
] | The problem of searching for a model-based scene interpretation is analyzed within a probabilistic framework. Object models are formulated as generative models for range data of the scene. A new statistical criterion, the truncated object probability, is introduced to infer an optimal sequence of object hypotheses to b... |
2306.10028 | Pengye Zhang | Huinan Sun, Guangliang Yu, Pengye Zhang, Bo Zhang, Xingxing Wang, Dong
Wang | Graph Based Long-Term And Short-Term Interest Model for Click-Through
Rate Prediction | CIKM 2022 accepted | null | 10.1145/3511808.3557336 | null | cs.IR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Click-through rate (CTR) prediction aims to predict the probability that the
user will click an item, which has been one of the key tasks in online
recommender and advertising systems. In such systems, rich user behavior (viz.
long- and short-term) has been proved to be of great value in capturing user
interests. Bot... | [
{
"created": "Mon, 5 Jun 2023 07:04:34 GMT",
"version": "v1"
}
] | 2023-06-21 | [
[
"Sun",
"Huinan",
""
],
[
"Yu",
"Guangliang",
""
],
[
"Zhang",
"Pengye",
""
],
[
"Zhang",
"Bo",
""
],
[
"Wang",
"Xingxing",
""
],
[
"Wang",
"Dong",
""
]
] | Click-through rate (CTR) prediction aims to predict the probability that the user will click an item, which has been one of the key tasks in online recommender and advertising systems. In such systems, rich user behavior (viz. long- and short-term) has been proved to be of great value in capturing user interests. Both ... |
2208.11210 | Andrea Gemelli | Davide del Bimbo and Andrea Gemelli and Simone Marinai | Data augmentation on graphs for table type classification | S+SSPR 2022 | null | 10.1007/978-3-031-23028-8_25 | null | cs.CV | http://creativecommons.org/licenses/by-sa/4.0/ | Tables are widely used in documents because of their compact and structured
representation of information. In particular, in scientific papers, tables can
sum up novel discoveries and summarize experimental results, making the
research comparable and easily understandable by scholars. Since the layout of
tables is hi... | [
{
"created": "Tue, 23 Aug 2022 21:54:46 GMT",
"version": "v1"
}
] | 2023-02-21 | [
[
"del Bimbo",
"Davide",
""
],
[
"Gemelli",
"Andrea",
""
],
[
"Marinai",
"Simone",
""
]
] | Tables are widely used in documents because of their compact and structured representation of information. In particular, in scientific papers, tables can sum up novel discoveries and summarize experimental results, making the research comparable and easily understandable by scholars. Since the layout of tables is high... |
2105.11794 | Diana C. Hernandez-Bocanegra | Diana C. Hernandez-Bocanegra and Juergen Ziegler | Effects of interactivity and presentation on review-based explanations
for recommendations | null | Human-Computer Interaction INTERACT 2021. INTERACT 2021. Lecture
Notes in Computer Science, vol 12933. Springer, Cham., 597-618 | 10.1007/978-3-030-85616-8_35 | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | User reviews have become an important source for recommending and explaining
products or services. Particularly, providing explanations based on user
reviews may improve users' perception of a recommender system (RS). However,
little is known about how review-based explanations can be effectively and
efficiently pres... | [
{
"created": "Tue, 25 May 2021 09:54:42 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Sep 2021 13:42:34 GMT",
"version": "v2"
}
] | 2021-09-06 | [
[
"Hernandez-Bocanegra",
"Diana C.",
""
],
[
"Ziegler",
"Juergen",
""
]
] | User reviews have become an important source for recommending and explaining products or services. Particularly, providing explanations based on user reviews may improve users' perception of a recommender system (RS). However, little is known about how review-based explanations can be effectively and efficiently presen... |
1804.05097 | Martin Holm Cservenka M.Sc. | Martin Holm Cservenka | Design and Implementation of Dynamic Memory Management in a Reversible
Object-Oriented Programming Language | Master's Thesis, 231 pages, 63 figures | null | null | null | cs.PL cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The reversible object-oriented programming language (ROOPL) was presented in
late 2016 and proved that object-oriented programming paradigms works in the
reversible setting. The language featured simple statically scoped objects
which made non-trivial programs tedious, if not impossible to write using the
limited too... | [
{
"created": "Thu, 12 Apr 2018 00:23:21 GMT",
"version": "v1"
}
] | 2018-04-17 | [
[
"Cservenka",
"Martin Holm",
""
]
] | The reversible object-oriented programming language (ROOPL) was presented in late 2016 and proved that object-oriented programming paradigms works in the reversible setting. The language featured simple statically scoped objects which made non-trivial programs tedious, if not impossible to write using the limited tools... |
2204.08474 | Raphael Petegrosso | Raphael Petegrosso, Vasistakrishna Baderdinni, Thibaud Senechal,
Benjamin L. Bullough | AB/BA analysis: A framework for estimating keyword spotting recall
improvement while maintaining audio privacy | Accepted to NAACL 2022 Industry Track | null | null | null | cs.SD cs.CR cs.LG eess.AS | http://creativecommons.org/licenses/by/4.0/ | Evaluation of keyword spotting (KWS) systems that detect keywords in speech
is a challenging task under realistic privacy constraints. The KWS is designed
to only collect data when the keyword is present, limiting the availability of
hard samples that may contain false negatives, and preventing direct estimation
of m... | [
{
"created": "Mon, 18 Apr 2022 13:52:22 GMT",
"version": "v1"
}
] | 2022-04-20 | [
[
"Petegrosso",
"Raphael",
""
],
[
"Baderdinni",
"Vasistakrishna",
""
],
[
"Senechal",
"Thibaud",
""
],
[
"Bullough",
"Benjamin L.",
""
]
] | Evaluation of keyword spotting (KWS) systems that detect keywords in speech is a challenging task under realistic privacy constraints. The KWS is designed to only collect data when the keyword is present, limiting the availability of hard samples that may contain false negatives, and preventing direct estimation of mod... |
1702.08104 | Mike Eichhorn | Mike Eichhorn, Christopher D. Williams, Ralf Bachmayer, Brad de Young | A Mission Planning System for the AUV "SLOCUM Glider" for the
Newfoundland and Labrador Shelf | 9 pages, 13 figures, OCEANS 2010 IEEE - Sydney, 24-27 May 2010 | null | 10.1109/OCEANSSYD.2010.5603919 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a system for mission planning for an autonomous
underwater vehicle in time-varying ocean currents. The mission planning system
is designed for the AUV "SLOCUM Glider" to collect oceanographic data along the
Newfoundland and Labrador Shelf. The data will be used in conjunction with a
numerical ocea... | [
{
"created": "Sun, 26 Feb 2017 22:38:50 GMT",
"version": "v1"
}
] | 2017-02-28 | [
[
"Eichhorn",
"Mike",
""
],
[
"Williams",
"Christopher D.",
""
],
[
"Bachmayer",
"Ralf",
""
],
[
"de Young",
"Brad",
""
]
] | This paper presents a system for mission planning for an autonomous underwater vehicle in time-varying ocean currents. The mission planning system is designed for the AUV "SLOCUM Glider" to collect oceanographic data along the Newfoundland and Labrador Shelf. The data will be used in conjunction with a numerical ocean ... |
2204.11302 | Uli Fahrenberg | Uli Fahrenberg | A Generic Approach to Quantitative Verification | Habilitation thesis | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This thesis is concerned with quantitative verification, that is, the
verification of quantitative properties of quantitative systems. These systems
are found in numerous applications, and their quantitative verification is
important, but also rather challenging. In particular, given that most systems
found in applic... | [
{
"created": "Sun, 24 Apr 2022 15:28:21 GMT",
"version": "v1"
}
] | 2022-04-26 | [
[
"Fahrenberg",
"Uli",
""
]
] | This thesis is concerned with quantitative verification, that is, the verification of quantitative properties of quantitative systems. These systems are found in numerous applications, and their quantitative verification is important, but also rather challenging. In particular, given that most systems found in applicat... |
2311.01477 | Liqiang Jing | Liqiang Jing and Ruosen Li and Yunmo Chen and Mengzhao Jia and Xinya
Du | FAITHSCORE: Evaluating Hallucinations in Large Vision-Language Models | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce FAITHSCORE (Faithfulness to Atomic Image Facts Score), a
reference-free and fine-grained evaluation metric that measures the
faithfulness of the generated free-form answers from large vision-language
models (LVLMs). The FAITHSCORE evaluation first identifies sub-sentences
containing descriptive statement... | [
{
"created": "Thu, 2 Nov 2023 01:21:45 GMT",
"version": "v1"
}
] | 2023-11-06 | [
[
"Jing",
"Liqiang",
""
],
[
"Li",
"Ruosen",
""
],
[
"Chen",
"Yunmo",
""
],
[
"Jia",
"Mengzhao",
""
],
[
"Du",
"Xinya",
""
]
] | We introduce FAITHSCORE (Faithfulness to Atomic Image Facts Score), a reference-free and fine-grained evaluation metric that measures the faithfulness of the generated free-form answers from large vision-language models (LVLMs). The FAITHSCORE evaluation first identifies sub-sentences containing descriptive statements ... |
1801.01552 | Matilde Marcolli | Yuri I. Manin and Matilde Marcolli | Asymptotic bounds for spherical codes | 34 pages amstex, 3 figures | null | 10.1070/IM8739 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The set of all error-correcting codes C over a fixed finite alphabet F of
cardinality q determines the set of code points in the unit square with
coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal
distance). The central problem of the theory of such codes consists in
maximizing simultaneous... | [
{
"created": "Thu, 4 Jan 2018 21:43:02 GMT",
"version": "v1"
}
] | 2019-09-04 | [
[
"Manin",
"Yuri I.",
""
],
[
"Marcolli",
"Matilde",
""
]
] | The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The central problem of the theory of such codes consists in maximizing simultaneously... |
2309.10171 | Yunhao Yang | Yunhao Yang, Jean-Rapha\"el Gaglione, Sandeep Chinchali, Ufuk Topcu | Specification-Driven Video Search via Foundation Models and Formal
Verification | 12 pages, 18 figures | null | null | null | cs.CV cs.FL | http://creativecommons.org/licenses/by/4.0/ | The increasing abundance of video data enables users to search for events of
interest, e.g., emergency incidents. Meanwhile, it raises new concerns, such as
the need for preserving privacy. Existing approaches to video search require
either manual inspection or a deep learning model with massive training. We
develop ... | [
{
"created": "Mon, 18 Sep 2023 21:40:08 GMT",
"version": "v1"
}
] | 2023-09-20 | [
[
"Yang",
"Yunhao",
""
],
[
"Gaglione",
"Jean-Raphaël",
""
],
[
"Chinchali",
"Sandeep",
""
],
[
"Topcu",
"Ufuk",
""
]
] | The increasing abundance of video data enables users to search for events of interest, e.g., emergency incidents. Meanwhile, it raises new concerns, such as the need for preserving privacy. Existing approaches to video search require either manual inspection or a deep learning model with massive training. We develop a ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.