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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2106.01805 | Tiange Xiang | Tiange Xiang, Chaoyi Zhang, Yang Song, Siqi Liu, Hongliang Yuan,
Weidong Cai | Partial Graph Reasoning for Neural Network Regularization | Technical report | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Regularizers help deep neural networks prevent feature co-adaptations.
Dropout, as a commonly used regularization technique, stochastically disables
neuron activations during network optimization. However, such complete feature
disposal can affect the feature representation and network understanding.
Toward better de... | [
{
"created": "Thu, 3 Jun 2021 12:57:01 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Jan 2022 09:01:59 GMT",
"version": "v2"
}
] | 2022-01-25 | [
[
"Xiang",
"Tiange",
""
],
[
"Zhang",
"Chaoyi",
""
],
[
"Song",
"Yang",
""
],
[
"Liu",
"Siqi",
""
],
[
"Yuan",
"Hongliang",
""
],
[
"Cai",
"Weidong",
""
]
] | Regularizers help deep neural networks prevent feature co-adaptations. Dropout, as a commonly used regularization technique, stochastically disables neuron activations during network optimization. However, such complete feature disposal can affect the feature representation and network understanding. Toward better desc... |
2403.07072 | Kurt Butler | Kurt Butler, Guanchao Feng, Petar M. Djuric | Explainable Learning with Gaussian Processes | 38 pages, 7 figures | null | null | null | cs.LG eess.SP | http://creativecommons.org/licenses/by/4.0/ | The field of explainable artificial intelligence (XAI) attempts to develop
methods that provide insight into how complicated machine learning methods make
predictions. Many methods of explanation have focused on the concept of feature
attribution, a decomposition of the model's prediction into individual
contribution... | [
{
"created": "Mon, 11 Mar 2024 18:03:02 GMT",
"version": "v1"
}
] | 2024-03-13 | [
[
"Butler",
"Kurt",
""
],
[
"Feng",
"Guanchao",
""
],
[
"Djuric",
"Petar M.",
""
]
] | The field of explainable artificial intelligence (XAI) attempts to develop methods that provide insight into how complicated machine learning methods make predictions. Many methods of explanation have focused on the concept of feature attribution, a decomposition of the model's prediction into individual contributions ... |
1601.06908 | Jerome Lacan | Alexandre Soro, Jerome Lacan, Vincent Roca, Valentin Savin and Mathieu
Cunche | Enhanced Recursive Reed-Muller Erasure Decoding | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work have shown that Reed-Muller (RM) codes achieve the erasure
channel capacity. However, this performance is obtained with maximum-likelihood
decoding which can be costly for practical applications. In this paper, we
propose an encoding/decoding scheme for Reed-Muller codes on the packet erasure
channel base... | [
{
"created": "Tue, 26 Jan 2016 07:13:00 GMT",
"version": "v1"
}
] | 2016-01-27 | [
[
"Soro",
"Alexandre",
""
],
[
"Lacan",
"Jerome",
""
],
[
"Roca",
"Vincent",
""
],
[
"Savin",
"Valentin",
""
],
[
"Cunche",
"Mathieu",
""
]
] | Recent work have shown that Reed-Muller (RM) codes achieve the erasure channel capacity. However, this performance is obtained with maximum-likelihood decoding which can be costly for practical applications. In this paper, we propose an encoding/decoding scheme for Reed-Muller codes on the packet erasure channel based ... |
2406.08444 | Wei-Tung Lin | Wei-Tung Lin and Yong-Xiang Lin and Jyun-Wei Chen and Kai-Lung Hua | PixMamba: Leveraging State Space Models in a Dual-Level Architecture for
Underwater Image Enhancement | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Underwater Image Enhancement (UIE) is critical for marine research and
exploration but hindered by complex color distortions and severe blurring.
Recent deep learning-based methods have achieved remarkable results, yet these
methods struggle with high computational costs and insufficient global
modeling, resulting in... | [
{
"created": "Wed, 12 Jun 2024 17:34:38 GMT",
"version": "v1"
}
] | 2024-06-13 | [
[
"Lin",
"Wei-Tung",
""
],
[
"Lin",
"Yong-Xiang",
""
],
[
"Chen",
"Jyun-Wei",
""
],
[
"Hua",
"Kai-Lung",
""
]
] | Underwater Image Enhancement (UIE) is critical for marine research and exploration but hindered by complex color distortions and severe blurring. Recent deep learning-based methods have achieved remarkable results, yet these methods struggle with high computational costs and insufficient global modeling, resulting in l... |
1410.7330 | Edvin Wedin | Peter Hegarty, Anders Martinsson and Edvin Wedin | The Hegselmann-Krause dynamics on the circle converge | 9 pages, 2 figures. Version 2: A small error in the proof of Theorem
1.1 is corrected and an acknowledgement added. Bibliography updated | null | null | null | cs.SY math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the Hegselmann-Krause dynamics on a one-dimensional torus and
provide the first proof of convergence of this system. The proof requires only
fairly minor modifications of existing methods for proving convergence in
Euclidean space.
| [
{
"created": "Mon, 27 Oct 2014 17:50:12 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Apr 2015 17:19:06 GMT",
"version": "v2"
}
] | 2015-04-07 | [
[
"Hegarty",
"Peter",
""
],
[
"Martinsson",
"Anders",
""
],
[
"Wedin",
"Edvin",
""
]
] | We consider the Hegselmann-Krause dynamics on a one-dimensional torus and provide the first proof of convergence of this system. The proof requires only fairly minor modifications of existing methods for proving convergence in Euclidean space. |
1309.1264 | EPTCS | Kenichi Morita (Hiroshima University) | Reversible Logic Elements with Memory and Their Universality | In Proceedings MCU 2013, arXiv:1309.1043 | EPTCS 128, 2013, pp. 3-14 | 10.4204/EPTCS.128.3 | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reversible computing is a paradigm of computation that reflects physical
reversibility, one of the fundamental microscopic laws of Nature. In this
survey, we discuss topics on reversible logic elements with memory (RLEM),
which can be used to build reversible computing systems, and their
universality. An RLEM is call... | [
{
"created": "Thu, 5 Sep 2013 08:06:55 GMT",
"version": "v1"
}
] | 2013-09-06 | [
[
"Morita",
"Kenichi",
"",
"Hiroshima University"
]
] | Reversible computing is a paradigm of computation that reflects physical reversibility, one of the fundamental microscopic laws of Nature. In this survey, we discuss topics on reversible logic elements with memory (RLEM), which can be used to build reversible computing systems, and their universality. An RLEM is called... |
1510.07176 | Marco Levorato | Qing Han, Chenxi Wang, Marco Levorato and Osvaldo Simeone | On the Effect of Fronthaul Latency on ARQ in C-RAN Systems | Submitted | null | null | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the Cloud Radio Access Network (C-RAN) architecture, a Control Unit (CU)
implements the baseband processing functionalities of a cluster of Base
Stations (BSs), which are connected to it through a fronthaul network. This
architecture enables centralized processing at the CU, and hence the
implementation of enhance... | [
{
"created": "Sat, 24 Oct 2015 19:16:59 GMT",
"version": "v1"
}
] | 2015-10-27 | [
[
"Han",
"Qing",
""
],
[
"Wang",
"Chenxi",
""
],
[
"Levorato",
"Marco",
""
],
[
"Simeone",
"Osvaldo",
""
]
] | In the Cloud Radio Access Network (C-RAN) architecture, a Control Unit (CU) implements the baseband processing functionalities of a cluster of Base Stations (BSs), which are connected to it through a fronthaul network. This architecture enables centralized processing at the CU, and hence the implementation of enhanced ... |
1801.09796 | Maiara F. Bollauf | Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I. R. Costa | Communication-Efficient Search for an Approximate Closest Lattice Point | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of finding the closest lattice point to a vector in
n-dimensional Euclidean space when each component of the vector is available at
a distinct node in a network. Our objectives are (i) minimize the communication
cost and (ii) obtain the error probability. The approximate closest lattice
point ... | [
{
"created": "Mon, 29 Jan 2018 23:31:36 GMT",
"version": "v1"
}
] | 2018-01-31 | [
[
"Bollauf",
"Maiara F.",
""
],
[
"Vaishampayan",
"Vinay A.",
""
],
[
"Costa",
"Sueli I. R.",
""
]
] | We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a network. Our objectives are (i) minimize the communication cost and (ii) obtain the error probability. The approximate closest lattice point co... |
1311.0536 | Nikos Bikakis | Nikos Bikakis, Chrisa Tsinaraki, Ioannis Stavrakantonakis, Nektarios
Gioldasis, Stavros Christodoulakis | The SPARQL2XQuery Interoperability Framework. Utilizing Schema Mapping,
Schema Transformation and Query Translation to Integrate XML and the Semantic
Web | To appear in World Wide Web Journal (WWWJ), Springer 2013 | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Web of Data is an open environment consisting of a great number of large
inter-linked RDF datasets from various domains. In this environment,
organizations and companies adopt the Linked Data practices utilizing Semantic
Web (SW) technologies, in order to publish their data and offer SPARQL
endpoints (i.e., SPARQ... | [
{
"created": "Sun, 3 Nov 2013 21:57:48 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Dec 2013 00:20:14 GMT",
"version": "v2"
},
{
"created": "Thu, 2 Jan 2014 02:53:19 GMT",
"version": "v3"
}
] | 2014-01-03 | [
[
"Bikakis",
"Nikos",
""
],
[
"Tsinaraki",
"Chrisa",
""
],
[
"Stavrakantonakis",
"Ioannis",
""
],
[
"Gioldasis",
"Nektarios",
""
],
[
"Christodoulakis",
"Stavros",
""
]
] | The Web of Data is an open environment consisting of a great number of large inter-linked RDF datasets from various domains. In this environment, organizations and companies adopt the Linked Data practices utilizing Semantic Web (SW) technologies, in order to publish their data and offer SPARQL endpoints (i.e., SPARQL-... |
1302.2167 | Kartik Venkat | Kartik Venkat, Tsachy Weissman, Yair Carmon and Shlomo Shamai | Information, Estimation, and Lookahead in the Gaussian channel | 30 pages, 10 figures, submitted to IEEE Transactions on Information
Theory | null | 10.1109/TSP.2016.2544748 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider mean squared estimation with lookahead of a continuous-time
signal corrupted by additive white Gaussian noise. We show that the mutual
information rate function, i.e., the mutual information rate as function of the
signal-to-noise ratio (SNR), does not, in general, determine the minimum mean
squared error... | [
{
"created": "Fri, 8 Feb 2013 22:33:26 GMT",
"version": "v1"
}
] | 2016-11-18 | [
[
"Venkat",
"Kartik",
""
],
[
"Weissman",
"Tsachy",
""
],
[
"Carmon",
"Yair",
""
],
[
"Shamai",
"Shlomo",
""
]
] | We consider mean squared estimation with lookahead of a continuous-time signal corrupted by additive white Gaussian noise. We show that the mutual information rate function, i.e., the mutual information rate as function of the signal-to-noise ratio (SNR), does not, in general, determine the minimum mean squared error (... |
2101.12584 | Yakup Kutlu | Yakup Kutlu, Z\"ulf\"u Alanoglu, Ahmet G\"ok\c{c}en, Mustafa Yeniad | Raspberry Pi Based Intelligent Robot that Recognizes and Places Puzzle
Objects | 5 pages, in Turkish language, 8 figures, journal of intelligent
systems with applications | null | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by/4.0/ | In this study; in order to diagnose congestive heart failure (CHF) patients,
non-linear secondorder difference plot (SODP) obtained from raw 256 Hz sampled
frequency and windowed record with different time of ECG records are used. All
of the data rows are labelled with their belongings to classify much more
realistic... | [
{
"created": "Wed, 20 Jan 2021 18:58:59 GMT",
"version": "v1"
}
] | 2021-02-01 | [
[
"Kutlu",
"Yakup",
""
],
[
"Alanoglu",
"Zülfü",
""
],
[
"Gökçen",
"Ahmet",
""
],
[
"Yeniad",
"Mustafa",
""
]
] | In this study; in order to diagnose congestive heart failure (CHF) patients, non-linear secondorder difference plot (SODP) obtained from raw 256 Hz sampled frequency and windowed record with different time of ECG records are used. All of the data rows are labelled with their belongings to classify much more realistical... |
2209.02851 | Deepthi Raghunandan | Deepthi Raghunandan, Aayushi Roy, Shenzhi Shi, Niklas Elmqvist, and
Leilani Battle | Code Code Evolution: Understanding How People Change Data Science
Notebooks Over Time | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Sensemaking is the iterative process of identifying, extracting, and
explaining insights from data, where each iteration is referred to as the
"sensemaking loop." Although recent work observes snapshots of the sensemaking
loop within computational notebooks, none measure shifts in sensemaking
behaviors over time -- b... | [
{
"created": "Tue, 6 Sep 2022 23:24:24 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Sep 2022 14:07:16 GMT",
"version": "v2"
}
] | 2022-09-09 | [
[
"Raghunandan",
"Deepthi",
""
],
[
"Roy",
"Aayushi",
""
],
[
"Shi",
"Shenzhi",
""
],
[
"Elmqvist",
"Niklas",
""
],
[
"Battle",
"Leilani",
""
]
] | Sensemaking is the iterative process of identifying, extracting, and explaining insights from data, where each iteration is referred to as the "sensemaking loop." Although recent work observes snapshots of the sensemaking loop within computational notebooks, none measure shifts in sensemaking behaviors over time -- bet... |
1510.00571 | Jeff Erickson | Hsien-Chih Chang and Jeff Erickson | Electrical Reduction, Homotopy Moves, and Defect | 27 pages, 15 figures | null | null | null | cs.CG math.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove the first nontrivial worst-case lower bounds for two closely related
problems. First, $\Omega(n^{3/2})$ degree-1 reductions, series-parallel
reductions, and $\Delta$Y transformations are required in the worst case to
reduce an $n$-vertex plane graph to a single vertex or edge. The lower bound is
achieved by ... | [
{
"created": "Fri, 2 Oct 2015 12:03:29 GMT",
"version": "v1"
}
] | 2015-10-05 | [
[
"Chang",
"Hsien-Chih",
""
],
[
"Erickson",
"Jeff",
""
]
] | We prove the first nontrivial worst-case lower bounds for two closely related problems. First, $\Omega(n^{3/2})$ degree-1 reductions, series-parallel reductions, and $\Delta$Y transformations are required in the worst case to reduce an $n$-vertex plane graph to a single vertex or edge. The lower bound is achieved by an... |
2105.12900 | Weijia Xu | Weijia Xu, Shuming Ma, Dongdong Zhang, Marine Carpuat | How Does Distilled Data Complexity Impact the Quality and Confidence of
Non-Autoregressive Machine Translation? | Findings of ACL 2021 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While non-autoregressive (NAR) models are showing great promise for machine
translation, their use is limited by their dependence on knowledge distillation
from autoregressive models. To address this issue, we seek to understand why
distillation is so effective. Prior work suggests that distilled training data
is les... | [
{
"created": "Thu, 27 May 2021 01:19:11 GMT",
"version": "v1"
}
] | 2021-05-28 | [
[
"Xu",
"Weijia",
""
],
[
"Ma",
"Shuming",
""
],
[
"Zhang",
"Dongdong",
""
],
[
"Carpuat",
"Marine",
""
]
] | While non-autoregressive (NAR) models are showing great promise for machine translation, their use is limited by their dependence on knowledge distillation from autoregressive models. To address this issue, we seek to understand why distillation is so effective. Prior work suggests that distilled training data is less ... |
2009.01664 | Kai Dresia | Kai Dresia, Simon Jentzsch, G\"unther Waxenegger-Wilfing, Robson Hahn,
Jan Deeken, Michael Oschwald, Fabio Mota | Multidisciplinary Design Optimization of Reusable Launch Vehicles for
Different Propellants and Objectives | null | null | 10.2514/1.A34944 | null | cs.NE cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Identifying the optimal design of a new launch vehicle is most important
since design decisions made in the early development phase limit the vehicles'
later performance and determines the associated costs. Reusing the first stage
via retro-propulsive landing increases the complexity even more. Therefore, we
develop ... | [
{
"created": "Thu, 3 Sep 2020 13:48:54 GMT",
"version": "v1"
}
] | 2021-02-17 | [
[
"Dresia",
"Kai",
""
],
[
"Jentzsch",
"Simon",
""
],
[
"Waxenegger-Wilfing",
"Günther",
""
],
[
"Hahn",
"Robson",
""
],
[
"Deeken",
"Jan",
""
],
[
"Oschwald",
"Michael",
""
],
[
"Mota",
"Fabio",
""
]
] | Identifying the optimal design of a new launch vehicle is most important since design decisions made in the early development phase limit the vehicles' later performance and determines the associated costs. Reusing the first stage via retro-propulsive landing increases the complexity even more. Therefore, we develop an... |
2308.06378 | Mojtaba Yeganejou | Mojtaba Yeganejou, Kimia Honari, Ryan Kluzinski, Scott Dick, Michael
Lipsett, James Miller | DCNFIS: Deep Convolutional Neuro-Fuzzy Inference System | null | null | null | null | cs.AI cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A key challenge in eXplainable Artificial Intelligence is the well-known
tradeoff between the transparency of an algorithm (i.e., how easily a human can
directly understand the algorithm, as opposed to receiving a post-hoc
explanation), and its accuracy. We report on the design of a new deep network
that achieves imp... | [
{
"created": "Fri, 11 Aug 2023 20:32:39 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Sep 2023 17:20:48 GMT",
"version": "v2"
},
{
"created": "Sun, 17 Mar 2024 14:10:15 GMT",
"version": "v3"
}
] | 2024-03-19 | [
[
"Yeganejou",
"Mojtaba",
""
],
[
"Honari",
"Kimia",
""
],
[
"Kluzinski",
"Ryan",
""
],
[
"Dick",
"Scott",
""
],
[
"Lipsett",
"Michael",
""
],
[
"Miller",
"James",
""
]
] | A key challenge in eXplainable Artificial Intelligence is the well-known tradeoff between the transparency of an algorithm (i.e., how easily a human can directly understand the algorithm, as opposed to receiving a post-hoc explanation), and its accuracy. We report on the design of a new deep network that achieves impro... |
cs/0601124 | Onur Kaya | Onur Kaya and Sennur Ulukus | Power Control for User Cooperation | Submitted to IEEE Transactions on Wireless Communications, October
2005 | null | null | null | cs.IT math.IT | null | For a fading Gaussian multiple access channel with user cooperation, we
obtain the optimal power allocation policies that maximize the rates achievable
by block Markov superposition coding. The optimal policies result in a coding
scheme that is simpler than the one for a general multiple access channel with
generaliz... | [
{
"created": "Mon, 30 Jan 2006 12:21:25 GMT",
"version": "v1"
}
] | 2007-07-13 | [
[
"Kaya",
"Onur",
""
],
[
"Ulukus",
"Sennur",
""
]
] | For a fading Gaussian multiple access channel with user cooperation, we obtain the optimal power allocation policies that maximize the rates achievable by block Markov superposition coding. The optimal policies result in a coding scheme that is simpler than the one for a general multiple access channel with generalized... |
2302.05061 | Zhen Wang | Zhen Wang, Peide Zhu, Jie Yang | ControversialQA: Exploring Controversy in Question Answering | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Controversy is widespread online. Previous studies mainly define controversy
based on vague assumptions of its relation to sentiment such as hate speech and
offensive words. This paper introduces the first question-answering dataset
that defines content controversy by user perception, i.e., votes from plenty of
users... | [
{
"created": "Fri, 10 Feb 2023 05:39:29 GMT",
"version": "v1"
}
] | 2023-02-13 | [
[
"Wang",
"Zhen",
""
],
[
"Zhu",
"Peide",
""
],
[
"Yang",
"Jie",
""
]
] | Controversy is widespread online. Previous studies mainly define controversy based on vague assumptions of its relation to sentiment such as hate speech and offensive words. This paper introduces the first question-answering dataset that defines content controversy by user perception, i.e., votes from plenty of users. ... |
2110.01794 | Yi Sui | Yi Sui, Ga Wu, Scott Sanner | Multi-axis Attentive Prediction for Sparse EventData: An Application to
Crime Prediction | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Spatiotemporal prediction of event data is a challenging task with a long
history of research. While recent work in spatiotemporal prediction has
leveraged deep sequential models that substantially improve over classical
approaches, these models are prone to overfitting when the observation is
extremely sparse, as in... | [
{
"created": "Tue, 5 Oct 2021 02:38:46 GMT",
"version": "v1"
}
] | 2021-10-06 | [
[
"Sui",
"Yi",
""
],
[
"Wu",
"Ga",
""
],
[
"Sanner",
"Scott",
""
]
] | Spatiotemporal prediction of event data is a challenging task with a long history of research. While recent work in spatiotemporal prediction has leveraged deep sequential models that substantially improve over classical approaches, these models are prone to overfitting when the observation is extremely sparse, as in t... |
1907.08456 | Frederik Kratzert | Frederik Kratzert, Daniel Klotz, Guy Shalev, G\"unter Klambauer, Sepp
Hochreiter, Grey Nearing | Towards Learning Universal, Regional, and Local Hydrological Behaviors
via Machine-Learning Applied to Large-Sample Datasets | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Regional rainfall-runoff modeling is an old but still mostly out-standing
problem in Hydrological Sciences. The problem currently is that traditional
hydrological models degrade significantly in performance when calibrated for
multiple basins together instead of for a single basin alone. In this paper, we
propose a n... | [
{
"created": "Fri, 19 Jul 2019 10:52:12 GMT",
"version": "v1"
},
{
"created": "Sun, 10 Nov 2019 15:03:52 GMT",
"version": "v2"
}
] | 2019-11-12 | [
[
"Kratzert",
"Frederik",
""
],
[
"Klotz",
"Daniel",
""
],
[
"Shalev",
"Guy",
""
],
[
"Klambauer",
"Günter",
""
],
[
"Hochreiter",
"Sepp",
""
],
[
"Nearing",
"Grey",
""
]
] | Regional rainfall-runoff modeling is an old but still mostly out-standing problem in Hydrological Sciences. The problem currently is that traditional hydrological models degrade significantly in performance when calibrated for multiple basins together instead of for a single basin alone. In this paper, we propose a nov... |
2407.00389 | Yuan-Gen Wang | Chao Zhou, Xiaowen Shi and Yuan-Gen Wang | Query-Efficient Hard-Label Black-Box Attack against Vision Transformers | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent studies have revealed that vision transformers (ViTs) face similar
security risks from adversarial attacks as deep convolutional neural networks
(CNNs). However, directly applying attack methodology on CNNs to ViTs has been
demonstrated to be ineffective since the ViTs typically work on patch-wise
encoding. Th... | [
{
"created": "Sat, 29 Jun 2024 10:09:12 GMT",
"version": "v1"
}
] | 2024-07-02 | [
[
"Zhou",
"Chao",
""
],
[
"Shi",
"Xiaowen",
""
],
[
"Wang",
"Yuan-Gen",
""
]
] | Recent studies have revealed that vision transformers (ViTs) face similar security risks from adversarial attacks as deep convolutional neural networks (CNNs). However, directly applying attack methodology on CNNs to ViTs has been demonstrated to be ineffective since the ViTs typically work on patch-wise encoding. This... |
2306.04950 | Jun Zhao | Jun Zhao, Xin Zhao, Wenyu Zhan, Qi Zhang, Tao Gui, Zhongyu Wei, Yunwen
Chen, Xiang Gao, Xuanjing Huang | Open Set Relation Extraction via Unknown-Aware Training | Accepted by ACL2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The existing supervised relation extraction methods have achieved impressive
performance in a closed-set setting, where the relations during both training
and testing remain the same. In a more realistic open-set setting, unknown
relations may appear in the test set. Due to the lack of supervision signals
from unknow... | [
{
"created": "Thu, 8 Jun 2023 05:45:25 GMT",
"version": "v1"
}
] | 2023-06-09 | [
[
"Zhao",
"Jun",
""
],
[
"Zhao",
"Xin",
""
],
[
"Zhan",
"Wenyu",
""
],
[
"Zhang",
"Qi",
""
],
[
"Gui",
"Tao",
""
],
[
"Wei",
"Zhongyu",
""
],
[
"Chen",
"Yunwen",
""
],
[
"Gao",
"Xiang",
""
]... | The existing supervised relation extraction methods have achieved impressive performance in a closed-set setting, where the relations during both training and testing remain the same. In a more realistic open-set setting, unknown relations may appear in the test set. Due to the lack of supervision signals from unknown ... |
2408.05097 | Paolo Mandica | Paolo Mandica, Luca Franco, Konstantinos Kallidromitis, Suzanne
Petryk, Fabio Galasso | Hyperbolic Learning with Multimodal Large Language Models | ECCV 2024 - Beyond Euclidean Workshop | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hyperbolic embeddings have demonstrated their effectiveness in capturing
measures of uncertainty and hierarchical relationships across various
deep-learning tasks, including image segmentation and active learning. However,
their application in modern vision-language models (VLMs) has been limited. A
notable exception... | [
{
"created": "Fri, 9 Aug 2024 14:39:15 GMT",
"version": "v1"
}
] | 2024-08-12 | [
[
"Mandica",
"Paolo",
""
],
[
"Franco",
"Luca",
""
],
[
"Kallidromitis",
"Konstantinos",
""
],
[
"Petryk",
"Suzanne",
""
],
[
"Galasso",
"Fabio",
""
]
] | Hyperbolic embeddings have demonstrated their effectiveness in capturing measures of uncertainty and hierarchical relationships across various deep-learning tasks, including image segmentation and active learning. However, their application in modern vision-language models (VLMs) has been limited. A notable exception i... |
2301.02359 | Jinming Zhuang | Jinming Zhuang, Jason Lau, Hanchen Ye, Zhuoping Yang, Yubo Du, Jack
Lo, Kristof Denolf, Stephen Neuendorffer, Alex Jones, Jingtong Hu, Deming
Chen, Jason Cong, Peipei Zhou | CHARM: Composing Heterogeneous Accelerators for Matrix Multiply on
Versal ACAP Architecture | null | null | null | null | cs.AR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Dense matrix multiply (MM) serves as one of the most heavily used kernels in
deep learning applications. To cope with the high computation demands of these
applications, heterogeneous architectures featuring both FPGA and dedicated
ASIC accelerators have emerged as promising platforms. For example, the
AMD/Xilinx Ver... | [
{
"created": "Fri, 6 Jan 2023 02:05:54 GMT",
"version": "v1"
}
] | 2023-01-09 | [
[
"Zhuang",
"Jinming",
""
],
[
"Lau",
"Jason",
""
],
[
"Ye",
"Hanchen",
""
],
[
"Yang",
"Zhuoping",
""
],
[
"Du",
"Yubo",
""
],
[
"Lo",
"Jack",
""
],
[
"Denolf",
"Kristof",
""
],
[
"Neuendorffer",
... | Dense matrix multiply (MM) serves as one of the most heavily used kernels in deep learning applications. To cope with the high computation demands of these applications, heterogeneous architectures featuring both FPGA and dedicated ASIC accelerators have emerged as promising platforms. For example, the AMD/Xilinx Versa... |
2010.09464 | Vanja Dosko\v{c} | Vanja Dosko\v{c} and Timo K\"otzing | Mapping Monotonic Restrictions in Inductive Inference | null | null | null | null | cs.LG cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In language learning in the limit we investigate computable devices
(learners) learning formal languages. Through the years, many natural
restrictions have been imposed on the studied learners. As such, monotonic
restrictions always enjoyed particular attention as, although being a natural
requirement, monotonic lear... | [
{
"created": "Thu, 15 Oct 2020 08:54:30 GMT",
"version": "v1"
}
] | 2020-10-20 | [
[
"Doskoč",
"Vanja",
""
],
[
"Kötzing",
"Timo",
""
]
] | In language learning in the limit we investigate computable devices (learners) learning formal languages. Through the years, many natural restrictions have been imposed on the studied learners. As such, monotonic restrictions always enjoyed particular attention as, although being a natural requirement, monotonic learne... |
1901.11211 | Weiwen Jiang | Weiwen Jiang, Xinyi Zhang, Edwin H.-M. Sha, Lei Yang, Qingfeng Zhuge,
Yiyu Shi, Jingtong Hu | Accuracy vs. Efficiency: Achieving Both through FPGA-Implementation
Aware Neural Architecture Search | 6 pages, 8 figures, 1 table, accepted by DAC | null | null | null | cs.DC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A fundamental question lies in almost every application of deep neural
networks: what is the optimal neural architecture given a specific dataset?
Recently, several Neural Architecture Search (NAS) frameworks have been
developed that use reinforcement learning and evolutionary algorithm to search
for the solution. Ho... | [
{
"created": "Thu, 31 Jan 2019 04:57:16 GMT",
"version": "v1"
}
] | 2019-02-04 | [
[
"Jiang",
"Weiwen",
""
],
[
"Zhang",
"Xinyi",
""
],
[
"Sha",
"Edwin H. -M.",
""
],
[
"Yang",
"Lei",
""
],
[
"Zhuge",
"Qingfeng",
""
],
[
"Shi",
"Yiyu",
""
],
[
"Hu",
"Jingtong",
""
]
] | A fundamental question lies in almost every application of deep neural networks: what is the optimal neural architecture given a specific dataset? Recently, several Neural Architecture Search (NAS) frameworks have been developed that use reinforcement learning and evolutionary algorithm to search for the solution. Howe... |
2311.12755 | Carine Rebello | Carine Menezes Rebello, Johannes J\"aschkea, and Idelfonso B. R.
Nogueira | Digital Twin Framework for Optimal and Autonomous Decision-Making in
Cyber-Physical Systems: Enhancing Reliability and Adaptability in the Oil and
Gas Industry | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | The concept of creating a virtual copy of a complete Cyber-Physical System
opens up numerous possibilities, including real-time assessments of the
physical environment and continuous learning from the system to provide
reliable and precise information. This process, known as the twinning process
or the development of... | [
{
"created": "Tue, 21 Nov 2023 18:02:52 GMT",
"version": "v1"
}
] | 2023-11-22 | [
[
"Rebello",
"Carine Menezes",
""
],
[
"Jäschkea",
"Johannes",
""
],
[
"Nogueira",
"Idelfonso B. R.",
""
]
] | The concept of creating a virtual copy of a complete Cyber-Physical System opens up numerous possibilities, including real-time assessments of the physical environment and continuous learning from the system to provide reliable and precise information. This process, known as the twinning process or the development of a... |
2011.03909 | Filipp Skomorokhov | Filipp Skomorokhov (1 and 2) and George Ovchinnikov (2) ((1) Moscow
Institute of Physics and Technology, (2) Skolkovo Institute of Science and
Technology) | Reinforcement Learning for Assignment problem | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper is dedicated to the application of reinforcement learning combined
with neural networks to the general formulation of user scheduling problem. Our
simulator resembles real world problems by means of stochastic changes in
environment. We applied Q-learning based method to the number of dynamic
simulations a... | [
{
"created": "Sun, 8 Nov 2020 06:25:50 GMT",
"version": "v1"
}
] | 2020-11-10 | [
[
"Skomorokhov",
"Filipp",
"",
"1 and 2"
],
[
"Ovchinnikov",
"George",
""
]
] | This paper is dedicated to the application of reinforcement learning combined with neural networks to the general formulation of user scheduling problem. Our simulator resembles real world problems by means of stochastic changes in environment. We applied Q-learning based method to the number of dynamic simulations and... |
2403.17883 | Liang Chao | Chao Liang, Jianwen Jiang, Tianyun Zhong, Gaojie Lin, Zhengkun Rong,
Jiaqi Yang, Yongming Zhu | Superior and Pragmatic Talking Face Generation with Teacher-Student
Framework | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Talking face generation technology creates talking videos from arbitrary
appearance and motion signal, with the "arbitrary" offering ease of use but
also introducing challenges in practical applications. Existing methods work
well with standard inputs but suffer serious performance degradation with
intricate real-wor... | [
{
"created": "Tue, 26 Mar 2024 17:13:17 GMT",
"version": "v1"
}
] | 2024-03-27 | [
[
"Liang",
"Chao",
""
],
[
"Jiang",
"Jianwen",
""
],
[
"Zhong",
"Tianyun",
""
],
[
"Lin",
"Gaojie",
""
],
[
"Rong",
"Zhengkun",
""
],
[
"Yang",
"Jiaqi",
""
],
[
"Zhu",
"Yongming",
""
]
] | Talking face generation technology creates talking videos from arbitrary appearance and motion signal, with the "arbitrary" offering ease of use but also introducing challenges in practical applications. Existing methods work well with standard inputs but suffer serious performance degradation with intricate real-world... |
0912.3980 | William Jackson | Jamal A. Hussein, Mumtaz A. AlMukhtar | Fair Exchange of Digital Signatures using RSA-based CEMBS and Offline
STTP | null | Journal of Computing, Volume 1, Issue 1, pp 87-91, December 2009 | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the essential security services needed to safeguard online
transactions is fair exchange. In fair exchange protocols two parties can
exchange their signatures in a fair manner, so that either each party gain the
other's signature or no one obtain anything useful. This paper examines
security solutions for achi... | [
{
"created": "Sun, 20 Dec 2009 05:15:22 GMT",
"version": "v1"
}
] | 2009-12-22 | [
[
"Hussein",
"Jamal A.",
""
],
[
"AlMukhtar",
"Mumtaz A.",
""
]
] | One of the essential security services needed to safeguard online transactions is fair exchange. In fair exchange protocols two parties can exchange their signatures in a fair manner, so that either each party gain the other's signature or no one obtain anything useful. This paper examines security solutions for achiev... |
1311.5018 | Teodor Cioaca | Teodor Cioaca and Horea Caramizaru | On the impact of explicit or semi-implicit integration methods over the
stability of real-time numerical simulations | Submitted to the ROMAI Journal of Applied Mathematics. Presented at
the CAIM 2013 Conference on Applied and Industrial Mathematics | null | null | null | cs.GR | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Physics-based animation of soft or rigid bodies for real-time applications
often suffers from numerical instabilities. We analyse one of the most common
sources of unwanted behaviour: the numerical integration strategy. To assess
the impact of popular integration methods, we consider a scenario where soft
and hard co... | [
{
"created": "Wed, 20 Nov 2013 11:30:03 GMT",
"version": "v1"
}
] | 2013-11-21 | [
[
"Cioaca",
"Teodor",
""
],
[
"Caramizaru",
"Horea",
""
]
] | Physics-based animation of soft or rigid bodies for real-time applications often suffers from numerical instabilities. We analyse one of the most common sources of unwanted behaviour: the numerical integration strategy. To assess the impact of popular integration methods, we consider a scenario where soft and hard cons... |
2301.11509 | Jose Antonio Lara Benitez | J. Antonio Lara Benitez, Takashi Furuya, Florian Faucher, Anastasis
Kratsios, Xavier Tricoche, Maarten V. de Hoop | Out-of-distributional risk bounds for neural operators with applications
to the Helmholtz equation | null | null | null | null | cs.LG cs.NA math.NA stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite their remarkable success in approximating a wide range of operators
defined by PDEs, existing neural operators (NOs) do not necessarily perform
well for all physics problems. We focus here on high-frequency waves to
highlight possible shortcomings. To resolve these, we propose a subfamily of
NOs enabling an e... | [
{
"created": "Fri, 27 Jan 2023 03:02:12 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Apr 2023 03:06:03 GMT",
"version": "v2"
},
{
"created": "Tue, 4 Jul 2023 22:42:47 GMT",
"version": "v3"
}
] | 2023-07-06 | [
[
"Benitez",
"J. Antonio Lara",
""
],
[
"Furuya",
"Takashi",
""
],
[
"Faucher",
"Florian",
""
],
[
"Kratsios",
"Anastasis",
""
],
[
"Tricoche",
"Xavier",
""
],
[
"de Hoop",
"Maarten V.",
""
]
] | Despite their remarkable success in approximating a wide range of operators defined by PDEs, existing neural operators (NOs) do not necessarily perform well for all physics problems. We focus here on high-frequency waves to highlight possible shortcomings. To resolve these, we propose a subfamily of NOs enabling an enh... |
2305.00350 | Korawat Tanwisuth | Korawat Tanwisuth, Shujian Zhang, Huangjie Zheng, Pengcheng He,
Mingyuan Zhou | POUF: Prompt-oriented unsupervised fine-tuning for large pre-trained
models | ICML 2023; PyTorch code is available at
https://github.com/korawat-tanwisuth/POUF | null | null | null | cs.LG cs.AI cs.CL cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Through prompting, large-scale pre-trained models have become more expressive
and powerful, gaining significant attention in recent years. Though these big
models have zero-shot capabilities, in general, labeled data are still required
to adapt them to downstream tasks. To overcome this critical limitation, we
propos... | [
{
"created": "Sat, 29 Apr 2023 22:05:22 GMT",
"version": "v1"
}
] | 2023-05-02 | [
[
"Tanwisuth",
"Korawat",
""
],
[
"Zhang",
"Shujian",
""
],
[
"Zheng",
"Huangjie",
""
],
[
"He",
"Pengcheng",
""
],
[
"Zhou",
"Mingyuan",
""
]
] | Through prompting, large-scale pre-trained models have become more expressive and powerful, gaining significant attention in recent years. Though these big models have zero-shot capabilities, in general, labeled data are still required to adapt them to downstream tasks. To overcome this critical limitation, we propose ... |
1504.03213 | Paolo Di Francesco | Paolo Di Francesco, Francesco Malandrino, Tim K. Forde, Luiz A.
DaSilva | A Sharing- and Competition-Aware Framework for Cellular Network
Evolution Planning | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile network operators are facing the difficult task of significantly
increasing capacity to meet projected demand while keeping CAPEX and OPEX down.
We argue that infrastructure sharing is a key consideration in operators'
planning of the evolution of their networks, and that such planning can be
viewed as a stage... | [
{
"created": "Mon, 13 Apr 2015 15:19:48 GMT",
"version": "v1"
}
] | 2015-04-14 | [
[
"Di Francesco",
"Paolo",
""
],
[
"Malandrino",
"Francesco",
""
],
[
"Forde",
"Tim K.",
""
],
[
"DaSilva",
"Luiz A.",
""
]
] | Mobile network operators are facing the difficult task of significantly increasing capacity to meet projected demand while keeping CAPEX and OPEX down. We argue that infrastructure sharing is a key consideration in operators' planning of the evolution of their networks, and that such planning can be viewed as a stage i... |
1708.08142 | Rodrigo de Lamare | R. C. de Lamare and Andr\'e Flores | Study of Set-Membership Kernel Adaptive Algorithms and Applications | 4 figures, 6 pages | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adaptive algorithms based on kernel structures have been a topic of
significant research over the past few years. The main advantage is that they
form a family of universal approximators, offering an elegant solution to
problems with nonlinearities. Nevertheless these methods deal with kernel
expansions, creating a g... | [
{
"created": "Sun, 27 Aug 2017 21:41:48 GMT",
"version": "v1"
}
] | 2017-08-29 | [
[
"de Lamare",
"R. C.",
""
],
[
"Flores",
"André",
""
]
] | Adaptive algorithms based on kernel structures have been a topic of significant research over the past few years. The main advantage is that they form a family of universal approximators, offering an elegant solution to problems with nonlinearities. Nevertheless these methods deal with kernel expansions, creating a gro... |
2007.10144 | Guy Aridor | Guy Aridor and Yishay Mansour and Aleksandrs Slivkins and Zhiwei
Steven Wu | Competing Bandits: The Perils of Exploration Under Competition | merged and extended version of arXiv:1702.08533 and arXiv:1902.05590 | null | null | null | cs.GT cs.LG econ.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most online platforms strive to learn from interactions with users, and many
engage in exploration: making potentially suboptimal choices for the sake of
acquiring new information. We study the interplay between exploration and
competition: how such platforms balance the exploration for learning and the
competition f... | [
{
"created": "Mon, 20 Jul 2020 14:19:08 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Sep 2020 13:07:42 GMT",
"version": "v2"
},
{
"created": "Tue, 22 Dec 2020 14:59:25 GMT",
"version": "v3"
},
{
"created": "Tue, 2 Mar 2021 21:00:18 GMT",
"version": "v4"
},
{
"cr... | 2022-12-06 | [
[
"Aridor",
"Guy",
""
],
[
"Mansour",
"Yishay",
""
],
[
"Slivkins",
"Aleksandrs",
""
],
[
"Wu",
"Zhiwei Steven",
""
]
] | Most online platforms strive to learn from interactions with users, and many engage in exploration: making potentially suboptimal choices for the sake of acquiring new information. We study the interplay between exploration and competition: how such platforms balance the exploration for learning and the competition for... |
1407.7072 | Seungyeon Kim | Seungyeon Kim, Haesun Park, Guy Lebanon | Fast Spammer Detection Using Structural Rank | 8 pages, 1 figure | null | null | null | cs.IR cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Comments for a product or a news article are rapidly growing and became a
medium of measuring quality products or services. Consequently, spammers have
been emerged in this area to bias them toward their favor. In this paper, we
propose an efficient spammer detection method using structural rank of author
specific te... | [
{
"created": "Fri, 25 Jul 2014 22:33:49 GMT",
"version": "v1"
}
] | 2014-07-29 | [
[
"Kim",
"Seungyeon",
""
],
[
"Park",
"Haesun",
""
],
[
"Lebanon",
"Guy",
""
]
] | Comments for a product or a news article are rapidly growing and became a medium of measuring quality products or services. Consequently, spammers have been emerged in this area to bias them toward their favor. In this paper, we propose an efficient spammer detection method using structural rank of author specific term... |
1808.00143 | Rodrigo de Lamare | R. M. Oliveira and R. C. de Lamare | Study of Polarization-Driven Shortening for Polar Codes Designed with
the Gaussian Approximation | 5 pages, 3 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a polarization-driven (PD) shortening technique for the
design of rate-compatible polar codes. The proposed shortening strategy
consists of reducing the generator matrix by relating its row index with the
channel polarization index. We assume that the shortened bits are known by both
the encoder a... | [
{
"created": "Wed, 1 Aug 2018 02:34:45 GMT",
"version": "v1"
}
] | 2018-08-02 | [
[
"Oliveira",
"R. M.",
""
],
[
"de Lamare",
"R. C.",
""
]
] | This paper presents a polarization-driven (PD) shortening technique for the design of rate-compatible polar codes. The proposed shortening strategy consists of reducing the generator matrix by relating its row index with the channel polarization index. We assume that the shortened bits are known by both the encoder and... |
2303.13558 | Yu Dong | Yu Dong, Jie Liang, Longbing Cao, Daniel Catchpoole | ClinicLens: Visual Analytics for Exploring and Optimizing the Testing
Capacity of Clinics given Uncertainty | null | null | null | null | cs.HC cs.GR | http://creativecommons.org/licenses/by/4.0/ | Clinic testing plays a critical role in containing infectious diseases such
as COVID-19. However, one of the key research questions in fighting such
pandemics is how to optimize testing capacities across clinics. In particular,
domain experts expect to know exactly how to adjust the features that may
affect testing c... | [
{
"created": "Thu, 23 Mar 2023 01:34:56 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Mar 2023 06:11:53 GMT",
"version": "v2"
}
] | 2023-03-29 | [
[
"Dong",
"Yu",
""
],
[
"Liang",
"Jie",
""
],
[
"Cao",
"Longbing",
""
],
[
"Catchpoole",
"Daniel",
""
]
] | Clinic testing plays a critical role in containing infectious diseases such as COVID-19. However, one of the key research questions in fighting such pandemics is how to optimize testing capacities across clinics. In particular, domain experts expect to know exactly how to adjust the features that may affect testing cap... |
1808.00356 | Yongsung Kim | Yongsung Kim, Adam Fourney, Ece Kamar | Studying Preferences and Concerns about Information Disclosure in Email
Notifications | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The proliferation of network-connected devices and applications has resulted
in people receiving dozens, or hundreds, of notifications per day. When people
are in the presence of others, each notification poses some risk of accidental
information disclosure; onlookers may see notifications appear above the lock
scree... | [
{
"created": "Wed, 1 Aug 2018 15:07:14 GMT",
"version": "v1"
}
] | 2018-08-02 | [
[
"Kim",
"Yongsung",
""
],
[
"Fourney",
"Adam",
""
],
[
"Kamar",
"Ece",
""
]
] | The proliferation of network-connected devices and applications has resulted in people receiving dozens, or hundreds, of notifications per day. When people are in the presence of others, each notification poses some risk of accidental information disclosure; onlookers may see notifications appear above the lock screen ... |
1805.01325 | Li Zhang | Li Zhang | Choice revision on belief bases | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this contribution we explore choice revision, a sort of belief change in
which the new information is represented by a set of sentences and the agent
could accept some of the sentences while rejecting the others. We propose a
generalized version of expansion operation called partial expansion for
developing models... | [
{
"created": "Thu, 3 May 2018 14:30:20 GMT",
"version": "v1"
}
] | 2018-05-04 | [
[
"Zhang",
"Li",
""
]
] | In this contribution we explore choice revision, a sort of belief change in which the new information is represented by a set of sentences and the agent could accept some of the sentences while rejecting the others. We propose a generalized version of expansion operation called partial expansion for developing models o... |
1712.07861 | Pierre Hauweele | Gauvain Devillez, Pierre Hauweele, Hadrien M\'elot | PHOEG Helps Obtaining Extremal Graphs | 6 pages, 9 figures, 1 table, technical paper | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Extremal Graph Theory aims to determine bounds for graph invariants as well
as the graphs attaining those bounds.
We are currently developping PHOEG, an ecosystem of tools designed to help
researchers in Extremal Graph Theory.
It uses a big relational database of undirected graphs and works with the
convex hull o... | [
{
"created": "Thu, 21 Dec 2017 10:31:46 GMT",
"version": "v1"
}
] | 2017-12-22 | [
[
"Devillez",
"Gauvain",
""
],
[
"Hauweele",
"Pierre",
""
],
[
"Mélot",
"Hadrien",
""
]
] | Extremal Graph Theory aims to determine bounds for graph invariants as well as the graphs attaining those bounds. We are currently developping PHOEG, an ecosystem of tools designed to help researchers in Extremal Graph Theory. It uses a big relational database of undirected graphs and works with the convex hull of the ... |
2405.01803 | Geyu Huang | Xin Tan, Yan Gong, Geyu Huang, Haohua Wu, Li Zhang | How to Gain Commit Rights in Modern Top Open Source Communities? | 23 pages,5 figures,FSE 2024 | Proceedings of the ACM on Software Engineering (PACMSE) Issue FSE
2024 | 10.1145/3660784 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The success of open source software (OSS) projects relies on voluntary
contributions from various community roles.Being a committer signifies gaining
trust and higher privileges. Substantial studies have focused on the
requirements of becoming a committer, but most of them are based on interviews
or several hypothese... | [
{
"created": "Fri, 3 May 2024 01:23:06 GMT",
"version": "v1"
},
{
"created": "Mon, 6 May 2024 06:31:21 GMT",
"version": "v2"
},
{
"created": "Thu, 16 May 2024 10:16:20 GMT",
"version": "v3"
}
] | 2024-05-17 | [
[
"Tan",
"Xin",
""
],
[
"Gong",
"Yan",
""
],
[
"Huang",
"Geyu",
""
],
[
"Wu",
"Haohua",
""
],
[
"Zhang",
"Li",
""
]
] | The success of open source software (OSS) projects relies on voluntary contributions from various community roles.Being a committer signifies gaining trust and higher privileges. Substantial studies have focused on the requirements of becoming a committer, but most of them are based on interviews or several hypotheses,... |
2209.04800 | Fouad Sukkar | Fouad Sukkar, Jennifer Wakulicz, Ki Myung Brian Lee, Weiming Zhi, and
Robert Fitch | Multi-query Robotic Manipulator Task Sequencing with Gromov-Hausdorff
Approximations | Submitted to IEEE Transactions on Robotics (TRO). 15 Pages. 13
Figures | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robotic manipulator applications often require efficient online motion
planning. When completing multiple tasks, sequence order and choice of goal
configuration can have a drastic impact on planning performance. This is well
known as the robot task sequencing problem (RTSP). Existing general purpose
RTSP algorithms a... | [
{
"created": "Sun, 11 Sep 2022 06:31:55 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Jul 2024 14:34:53 GMT",
"version": "v2"
}
] | 2024-07-23 | [
[
"Sukkar",
"Fouad",
""
],
[
"Wakulicz",
"Jennifer",
""
],
[
"Lee",
"Ki Myung Brian",
""
],
[
"Zhi",
"Weiming",
""
],
[
"Fitch",
"Robert",
""
]
] | Robotic manipulator applications often require efficient online motion planning. When completing multiple tasks, sequence order and choice of goal configuration can have a drastic impact on planning performance. This is well known as the robot task sequencing problem (RTSP). Existing general purpose RTSP algorithms are... |
2110.11414 | Alice Ruget | Alice Ruget, Max Tyler, Germ\'an Mora Mart\'in, Stirling Scholes, Feng
Zhu, Istvan Gyongy, Brent Hearn, Steve McLaughlin, Abderrahim Halimi,
Jonathan Leach | Real-time, low-cost multi-person 3D pose estimation | null | null | 10.17861/e85a6eae-13f9-4bcd-9dff-73f8107c09a2 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | The process of tracking human anatomy in computer vision is referred to pose
estimation, and it is used in fields ranging from gaming to surveillance.
Three-dimensional pose estimation traditionally requires advanced equipment,
such as multiple linked intensity cameras or high-resolution time-of-flight
cameras to pro... | [
{
"created": "Mon, 11 Oct 2021 12:42:00 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Aug 2022 10:56:07 GMT",
"version": "v2"
},
{
"created": "Wed, 24 Aug 2022 14:57:58 GMT",
"version": "v3"
}
] | 2022-08-25 | [
[
"Ruget",
"Alice",
""
],
[
"Tyler",
"Max",
""
],
[
"Martín",
"Germán Mora",
""
],
[
"Scholes",
"Stirling",
""
],
[
"Zhu",
"Feng",
""
],
[
"Gyongy",
"Istvan",
""
],
[
"Hearn",
"Brent",
""
],
[
"McLaug... | The process of tracking human anatomy in computer vision is referred to pose estimation, and it is used in fields ranging from gaming to surveillance. Three-dimensional pose estimation traditionally requires advanced equipment, such as multiple linked intensity cameras or high-resolution time-of-flight cameras to produ... |
2405.16542 | Yang Cao | Yang Cao, and Wei Zhang | Mamba4KT:An Efficient and Effective Mamba-based Knowledge Tracing Model | null | null | null | null | cs.AI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge tracing (KT) enhances student learning by leveraging past
performance to predict future performance. Current research utilizes models
based on attention mechanisms and recurrent neural network structures to
capture long-term dependencies and correlations between exercises, aiming to
improve model accuracy. ... | [
{
"created": "Sun, 26 May 2024 12:26:03 GMT",
"version": "v1"
}
] | 2024-05-28 | [
[
"Cao",
"Yang",
""
],
[
"Zhang",
"Wei",
""
]
] | Knowledge tracing (KT) enhances student learning by leveraging past performance to predict future performance. Current research utilizes models based on attention mechanisms and recurrent neural network structures to capture long-term dependencies and correlations between exercises, aiming to improve model accuracy. Du... |
2304.02737 | Melissa Dell | Jacob Carlson and Tom Bryan and Melissa Dell | Efficient OCR for Building a Diverse Digital History | null | null | null | null | cs.CV cs.DL econ.GN q-fin.EC | http://creativecommons.org/licenses/by/4.0/ | Thousands of users consult digital archives daily, but the information they
can access is unrepresentative of the diversity of documentary history. The
sequence-to-sequence architecture typically used for optical character
recognition (OCR) - which jointly learns a vision and language model - is
poorly extensible to ... | [
{
"created": "Wed, 5 Apr 2023 20:36:04 GMT",
"version": "v1"
},
{
"created": "Thu, 25 Jul 2024 20:49:45 GMT",
"version": "v2"
}
] | 2024-07-29 | [
[
"Carlson",
"Jacob",
""
],
[
"Bryan",
"Tom",
""
],
[
"Dell",
"Melissa",
""
]
] | Thousands of users consult digital archives daily, but the information they can access is unrepresentative of the diversity of documentary history. The sequence-to-sequence architecture typically used for optical character recognition (OCR) - which jointly learns a vision and language model - is poorly extensible to lo... |
2112.00708 | Wei Ren | Wei Ren, Eleftherios Vlahakis, Nikolaos Athanasopoulos and Raphael
Jungers | Optimal Resource Scheduling and Allocation in Distributed Computing
Systems | This work has been submitted to ACC2022 | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | The essence of distributed computing systems is how to schedule incoming
requests and how to allocate all computing nodes to minimize both time and
computation costs. In this paper, we propose a cost-aware optimal scheduling
and allocation strategy for distributed computing systems while minimizing the
cost function ... | [
{
"created": "Fri, 15 Oct 2021 11:45:32 GMT",
"version": "v1"
}
] | 2021-12-02 | [
[
"Ren",
"Wei",
""
],
[
"Vlahakis",
"Eleftherios",
""
],
[
"Athanasopoulos",
"Nikolaos",
""
],
[
"Jungers",
"Raphael",
""
]
] | The essence of distributed computing systems is how to schedule incoming requests and how to allocate all computing nodes to minimize both time and computation costs. In this paper, we propose a cost-aware optimal scheduling and allocation strategy for distributed computing systems while minimizing the cost function in... |
2202.13328 | Idan Amir | Idan Amir, Roi Livni, Nathan Srebro | Thinking Outside the Ball: Optimal Learning with Gradient Descent for
Generalized Linear Stochastic Convex Optimization | null | null | null | null | cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider linear prediction with a convex Lipschitz loss, or more
generally, stochastic convex optimization problems of generalized linear form,
i.e.~where each instantaneous loss is a scalar convex function of a linear
function. We show that in this setting, early stopped Gradient Descent (GD),
without any explici... | [
{
"created": "Sun, 27 Feb 2022 09:41:43 GMT",
"version": "v1"
},
{
"created": "Sun, 30 Oct 2022 13:16:36 GMT",
"version": "v2"
}
] | 2022-11-01 | [
[
"Amir",
"Idan",
""
],
[
"Livni",
"Roi",
""
],
[
"Srebro",
"Nathan",
""
]
] | We consider linear prediction with a convex Lipschitz loss, or more generally, stochastic convex optimization problems of generalized linear form, i.e.~where each instantaneous loss is a scalar convex function of a linear function. We show that in this setting, early stopped Gradient Descent (GD), without any explicit ... |
2202.02131 | Konstantina Nikita S | Panagiota Karatza, Kalliopi V. Dalakleidi, Maria Athanasiou,
Konstantina S. Nikita | Interpretability methods of machine learning algorithms with
applications in breast cancer diagnosis | 2021 43rd Annual International Conference of the IEEE Engineering in
Medicine & Biology Society (EMBC) | null | 10.1109/EMBC46164.2021.9630556 | null | cs.LG cs.AI physics.med-ph | http://creativecommons.org/licenses/by/4.0/ | Early detection of breast cancer is a powerful tool towards decreasing its
socioeconomic burden. Although, artificial intelligence (AI) methods have shown
remarkable results towards this goal, their "black box" nature hinders their
wide adoption in clinical practice. To address the need for AI guided breast
cancer di... | [
{
"created": "Fri, 4 Feb 2022 13:41:30 GMT",
"version": "v1"
}
] | 2022-02-07 | [
[
"Karatza",
"Panagiota",
""
],
[
"Dalakleidi",
"Kalliopi V.",
""
],
[
"Athanasiou",
"Maria",
""
],
[
"Nikita",
"Konstantina S.",
""
]
] | Early detection of breast cancer is a powerful tool towards decreasing its socioeconomic burden. Although, artificial intelligence (AI) methods have shown remarkable results towards this goal, their "black box" nature hinders their wide adoption in clinical practice. To address the need for AI guided breast cancer diag... |
2306.02739 | Benjamin Alt | Benjamin Alt, Franklin Kenghagho Kenfack, Andrei Haidu, Darko Katic,
Rainer J\"akel, Michael Beetz | Knowledge-Driven Robot Program Synthesis from Human VR Demonstrations | 10 pages, 11 figures, accepted at the 20th International Conference
on Principles of Knowledge Representation and Reasoning (KR2023,
https://kr.org/KR2023) | null | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Aging societies, labor shortages and increasing wage costs call for
assistance robots capable of autonomously performing a wide array of real-world
tasks. Such open-ended robotic manipulation requires not only powerful
knowledge representations and reasoning (KR&R) algorithms, but also methods for
humans to instruct ... | [
{
"created": "Mon, 5 Jun 2023 09:37:53 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Jul 2023 08:57:00 GMT",
"version": "v2"
}
] | 2023-07-04 | [
[
"Alt",
"Benjamin",
""
],
[
"Kenfack",
"Franklin Kenghagho",
""
],
[
"Haidu",
"Andrei",
""
],
[
"Katic",
"Darko",
""
],
[
"Jäkel",
"Rainer",
""
],
[
"Beetz",
"Michael",
""
]
] | Aging societies, labor shortages and increasing wage costs call for assistance robots capable of autonomously performing a wide array of real-world tasks. Such open-ended robotic manipulation requires not only powerful knowledge representations and reasoning (KR&R) algorithms, but also methods for humans to instruct ro... |
1710.04688 | Shadrokh Samavi | Shadrokh Samavi and Mohammad Reza Jahangir | Reduction of Look Up Tables for Computation of Reciprocal of Square
Roots | 6 pages, 8 figures, 3 tables | null | null | null | cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Among many existing algorithms, convergence methods are the most popular
means of computing square root and the reciprocal of square root of numbers. An
initial approximation is required in these methods. Look up tables (LUT) are
employed to produce the initial approximation. In this paper a number of
methods are sug... | [
{
"created": "Thu, 12 Oct 2017 19:00:24 GMT",
"version": "v1"
}
] | 2017-10-16 | [
[
"Samavi",
"Shadrokh",
""
],
[
"Jahangir",
"Mohammad Reza",
""
]
] | Among many existing algorithms, convergence methods are the most popular means of computing square root and the reciprocal of square root of numbers. An initial approximation is required in these methods. Look up tables (LUT) are employed to produce the initial approximation. In this paper a number of methods are sugge... |
2305.10846 | Jesse Heyninck | Jesse Heyninck and Bart Bogaerts | Non-deterministic approximation operators: ultimate operators,
semi-equilibrium semantics and aggregates (full version) | Paper presented at the 39th International Conference on Logic
Programming (ICLP 2023) | null | null | null | cs.AI cs.LO | http://creativecommons.org/licenses/by/4.0/ | Approximation fixpoint theory (AFT) is an abstract and general algebraic
framework for studying the semantics of non-monotonic logics. In recent work,
AFT was generalized to non-deterministic operators, i.e.\ operators whose range
are sets of elements rather than single elements. In this paper, we make three
further ... | [
{
"created": "Thu, 18 May 2023 09:59:12 GMT",
"version": "v1"
}
] | 2023-05-19 | [
[
"Heyninck",
"Jesse",
""
],
[
"Bogaerts",
"Bart",
""
]
] | Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of non-monotonic logics. In recent work, AFT was generalized to non-deterministic operators, i.e.\ operators whose range are sets of elements rather than single elements. In this paper, we make three further co... |
2102.03939 | Nikolaos Zioulis Mr. | Nikolaos Zioulis, Federico Alvarez, Dimitrios Zarpalas, Petros Daras | Single-Shot Cuboids: Geodesics-based End-to-end Manhattan Aligned Layout
Estimation from Spherical Panoramas | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | It has been shown that global scene understanding tasks like layout
estimation can benefit from wider field of views, and specifically spherical
panoramas. While much progress has been made recently, all previous approaches
rely on intermediate representations and postprocessing to produce
Manhattan-aligned estimates... | [
{
"created": "Sun, 7 Feb 2021 22:52:59 GMT",
"version": "v1"
},
{
"created": "Tue, 9 Feb 2021 08:46:37 GMT",
"version": "v2"
}
] | 2021-02-10 | [
[
"Zioulis",
"Nikolaos",
""
],
[
"Alvarez",
"Federico",
""
],
[
"Zarpalas",
"Dimitrios",
""
],
[
"Daras",
"Petros",
""
]
] | It has been shown that global scene understanding tasks like layout estimation can benefit from wider field of views, and specifically spherical panoramas. While much progress has been made recently, all previous approaches rely on intermediate representations and postprocessing to produce Manhattan-aligned estimates. ... |
2406.11342 | Zhao Zhuo | Zhao Zhuo, Rongzhen Li, Kai Liu, Huhai Zou, KaiMao Li, Jie Yu, Tianhao
Sun, Qingbo Wu | KAOS: Large Model Multi-Agent Operating System | The content is highly controversial and needs to be withdrawn | null | null | null | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The intelligent interaction model based on large models reduces the
differences in user experience across various system platforms but faces
challenges in multi-agent collaboration and resource sharing. To demonstrate a
uniform user experience across different foundational software platforms and
address resource coor... | [
{
"created": "Mon, 17 Jun 2024 08:59:32 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Aug 2024 08:42:18 GMT",
"version": "v2"
},
{
"created": "Fri, 9 Aug 2024 01:45:39 GMT",
"version": "v3"
}
] | 2024-08-12 | [
[
"Zhuo",
"Zhao",
""
],
[
"Li",
"Rongzhen",
""
],
[
"Liu",
"Kai",
""
],
[
"Zou",
"Huhai",
""
],
[
"Li",
"KaiMao",
""
],
[
"Yu",
"Jie",
""
],
[
"Sun",
"Tianhao",
""
],
[
"Wu",
"Qingbo",
""
]
... | The intelligent interaction model based on large models reduces the differences in user experience across various system platforms but faces challenges in multi-agent collaboration and resource sharing. To demonstrate a uniform user experience across different foundational software platforms and address resource coordi... |
2106.11569 | Herv\'e Tal\'e Kalachi | Herv\'e Tale Kalachi and Hermann Tchatchiem Kamche | On the Rank Decoding Problem Over Finite Principal Ideal Rings | 20 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rank decoding problem has been the subject of much attention in this last
decade. This problem, which is at the base of the security of public-key
cryptosystems based on rank metric codes, is traditionally studied over finite
fields. But the recent generalizations of certain classes of rank-metric codes
from fini... | [
{
"created": "Tue, 22 Jun 2021 06:59:10 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Mar 2022 12:21:47 GMT",
"version": "v2"
},
{
"created": "Mon, 15 Aug 2022 14:19:47 GMT",
"version": "v3"
}
] | 2022-08-16 | [
[
"Kalachi",
"Hervé Tale",
""
],
[
"Kamche",
"Hermann Tchatchiem",
""
]
] | The rank decoding problem has been the subject of much attention in this last decade. This problem, which is at the base of the security of public-key cryptosystems based on rank metric codes, is traditionally studied over finite fields. But the recent generalizations of certain classes of rank-metric codes from finite... |
1505.04713 | Merlin Sheeba | G. Merlin Sheeba, Alamelu Nachiappan, P.H. Pavan Kumar, Prateek | Placement Of Energy Aware Wireless Mesh Nodes For E-Learning In Green
Campuses | 10 pages,4 figures | International Journal on Cybernetics & Informatics (IJCI) Vol. 4,
No. 2, April 2015 | 10.5121/ijci.2015.4218 | null | cs.NI | http://creativecommons.org/licenses/by/3.0/ | Energy efficiency solutions are more vital for Green Mesh Network (GMN)
campuses. Today students are benefited using these e-learning methodologies.
Renewable energies such as solar, wind, hydro has tremendous applications on
energy efficient wireless networks for sustaining the ever growing traffic
demands. One of t... | [
{
"created": "Mon, 18 May 2015 16:42:16 GMT",
"version": "v1"
}
] | 2015-05-19 | [
[
"Sheeba",
"G. Merlin",
""
],
[
"Nachiappan",
"Alamelu",
""
],
[
"Kumar",
"P. H. Pavan",
""
],
[
"Prateek",
"",
""
]
] | Energy efficiency solutions are more vital for Green Mesh Network (GMN) campuses. Today students are benefited using these e-learning methodologies. Renewable energies such as solar, wind, hydro has tremendous applications on energy efficient wireless networks for sustaining the ever growing traffic demands. One of the... |
2406.16219 | Stefanos Chaliasos | Stefanos Chaliasos, Denis Firsov, Benjamin Livshits | Towards a Formal Foundation for Blockchain Rollups | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Blockchains like Bitcoin and Ethereum have revolutionized digital
transactions, yet scalability issues persist. Layer 2 solutions, such as
validity proof Rollups (ZK-Rollups), aim to address these challenges by
processing transactions off-chain and validating them on the main chain.
However, concerns remain about sec... | [
{
"created": "Sun, 23 Jun 2024 21:12:19 GMT",
"version": "v1"
}
] | 2024-06-25 | [
[
"Chaliasos",
"Stefanos",
""
],
[
"Firsov",
"Denis",
""
],
[
"Livshits",
"Benjamin",
""
]
] | Blockchains like Bitcoin and Ethereum have revolutionized digital transactions, yet scalability issues persist. Layer 2 solutions, such as validity proof Rollups (ZK-Rollups), aim to address these challenges by processing transactions off-chain and validating them on the main chain. However, concerns remain about secur... |
2210.08472 | Yuan-Gen Wang | Chao Zhou, Yuan-Gen Wang, Guopu Zhu | Object-Attentional Untargeted Adversarial Attack | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks are facing severe threats from adversarial attacks. Most
existing black-box attacks fool target model by generating either global
perturbations or local patches. However, both global perturbations and local
patches easily cause annoying visual artifacts in adversarial example. Compared
with some ... | [
{
"created": "Sun, 16 Oct 2022 07:45:13 GMT",
"version": "v1"
}
] | 2022-10-18 | [
[
"Zhou",
"Chao",
""
],
[
"Wang",
"Yuan-Gen",
""
],
[
"Zhu",
"Guopu",
""
]
] | Deep neural networks are facing severe threats from adversarial attacks. Most existing black-box attacks fool target model by generating either global perturbations or local patches. However, both global perturbations and local patches easily cause annoying visual artifacts in adversarial example. Compared with some sm... |
1409.5980 | Kiran Garimella | Kiran Garimella, Ingmar Weber, Sonia Dal Cin | From "I love you babe" to "leave me alone" - Romantic Relationship
Breakups on Twitter | To appear in the 6th International Conference on Social Informatics
(SocInfo 2014), Barcelona | null | null | null | cs.SI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We use public data from Twitter to study the breakups of the romantic
relationships of 661 couples. Couples are identified through profile references
such as @user1 writing "@user2 is the best boyfriend ever!!". Using this data
set we find evidence for a number of existing hypotheses describing
psychological processe... | [
{
"created": "Sun, 21 Sep 2014 13:23:35 GMT",
"version": "v1"
}
] | 2014-09-23 | [
[
"Garimella",
"Kiran",
""
],
[
"Weber",
"Ingmar",
""
],
[
"Cin",
"Sonia Dal",
""
]
] | We use public data from Twitter to study the breakups of the romantic relationships of 661 couples. Couples are identified through profile references such as @user1 writing "@user2 is the best boyfriend ever!!". Using this data set we find evidence for a number of existing hypotheses describing psychological processes ... |
1508.02133 | Marek Szyku{\l}a | Vladimir V. Gusev, Marek Szyku{\l}a | On the Number of Synchronizing Colorings of Digraphs | CIAA 2015. The final publication is available at
http://link.springer.com/chapter/10.1007/978-3-319-22360-5_11 | In Implementation and Application of Automata (CIAA 2015), volume
9223 of LNCS, pages 127-139, Springer, 2015 | 10.1007/978-3-319-22360-5_11 | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We deal with $k$-out-regular directed multigraphs with loops (called simply
\emph{digraphs}). The edges of such a digraph can be colored by elements of
some fixed $k$-element set in such a way that outgoing edges of every vertex
have different colors. Such a coloring corresponds naturally to an automaton.
The road co... | [
{
"created": "Mon, 10 Aug 2015 06:15:24 GMT",
"version": "v1"
}
] | 2015-08-11 | [
[
"Gusev",
"Vladimir V.",
""
],
[
"Szykuła",
"Marek",
""
]
] | We deal with $k$-out-regular directed multigraphs with loops (called simply \emph{digraphs}). The edges of such a digraph can be colored by elements of some fixed $k$-element set in such a way that outgoing edges of every vertex have different colors. Such a coloring corresponds naturally to an automaton. The road colo... |
1205.1641 | Bhavesh Patel | B V Patel, B B Meshram | Content based video retrieval systems | 18 Pages | null | 10.5121/iju.2012.3202 | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the development of multimedia data types and available bandwidth there
is huge demand of video retrieval systems, as users shift from text based
retrieval systems to content based retrieval systems. Selection of extracted
features play an important role in content based video retrieval regardless of
video attrib... | [
{
"created": "Tue, 8 May 2012 09:27:29 GMT",
"version": "v1"
}
] | 2012-05-09 | [
[
"Patel",
"B V",
""
],
[
"Meshram",
"B B",
""
]
] | With the development of multimedia data types and available bandwidth there is huge demand of video retrieval systems, as users shift from text based retrieval systems to content based retrieval systems. Selection of extracted features play an important role in content based video retrieval regardless of video attribut... |
2103.06026 | Soeren Becker | Ana Juan Ferrer, Soeren Becker, Florian Schmidt, Lauritz Thamsen, Odej
Kao | Towards a Cognitive Compute Continuum: An Architecture for Ad-Hoc
Self-Managed Swarms | 8 pages, CCGrid 2021 Cloud2Things Workshop | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we introduce our vision of a Cognitive Computing Continuum to
address the changing IT service provisioning towards a distributed,
opportunistic, self-managed collaboration between heterogeneous devices outside
the traditional data center boundaries. The focal point of this continuum are
cognitive device... | [
{
"created": "Wed, 10 Mar 2021 12:56:00 GMT",
"version": "v1"
}
] | 2021-03-11 | [
[
"Ferrer",
"Ana Juan",
""
],
[
"Becker",
"Soeren",
""
],
[
"Schmidt",
"Florian",
""
],
[
"Thamsen",
"Lauritz",
""
],
[
"Kao",
"Odej",
""
]
] | In this paper we introduce our vision of a Cognitive Computing Continuum to address the changing IT service provisioning towards a distributed, opportunistic, self-managed collaboration between heterogeneous devices outside the traditional data center boundaries. The focal point of this continuum are cognitive devices,... |
2304.01041 | Haichao Liu | Haichao Liu, Kai Chen, Yulin Li, Zhenmin Huang, Jianghua Duan, Jun Ma | Integrated Behavior Planning and Motion Control for Autonomous Vehicles
with Traffic Rules Compliance | 7 pages, 5 figures, accepted for publication in The 2023 IEEE
International Conference on Robotics and Biomimetics (ROBIO) | null | null | null | cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this article, we propose an optimization-based integrated behavior
planning and motion control scheme, which is an interpretable and adaptable
urban autonomous driving solution that complies with complex traffic rules
while ensuring driving safety. Inherently, to ensure compliance with traffic
rules, an innovative... | [
{
"created": "Mon, 3 Apr 2023 14:44:52 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Nov 2023 18:19:08 GMT",
"version": "v2"
}
] | 2023-12-01 | [
[
"Liu",
"Haichao",
""
],
[
"Chen",
"Kai",
""
],
[
"Li",
"Yulin",
""
],
[
"Huang",
"Zhenmin",
""
],
[
"Duan",
"Jianghua",
""
],
[
"Ma",
"Jun",
""
]
] | In this article, we propose an optimization-based integrated behavior planning and motion control scheme, which is an interpretable and adaptable urban autonomous driving solution that complies with complex traffic rules while ensuring driving safety. Inherently, to ensure compliance with traffic rules, an innovative d... |
1706.04371 | Haozhe Xie | Haozhe Xie, Jie Li, Hanqing Xue | A survey of dimensionality reduction techniques based on random
projection | 10 pages, 6 figures | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dimensionality reduction techniques play important roles in the analysis of
big data. Traditional dimensionality reduction approaches, such as principal
component analysis (PCA) and linear discriminant analysis (LDA), have been
studied extensively in the past few decades. However, as the dimensionality of
data increa... | [
{
"created": "Wed, 14 Jun 2017 09:13:33 GMT",
"version": "v1"
},
{
"created": "Sat, 17 Jun 2017 04:09:17 GMT",
"version": "v2"
},
{
"created": "Fri, 27 Oct 2017 10:59:10 GMT",
"version": "v3"
},
{
"created": "Wed, 30 May 2018 12:47:50 GMT",
"version": "v4"
}
] | 2018-05-31 | [
[
"Xie",
"Haozhe",
""
],
[
"Li",
"Jie",
""
],
[
"Xue",
"Hanqing",
""
]
] | Dimensionality reduction techniques play important roles in the analysis of big data. Traditional dimensionality reduction approaches, such as principal component analysis (PCA) and linear discriminant analysis (LDA), have been studied extensively in the past few decades. However, as the dimensionality of data increase... |
1907.00468 | Erick Schmidt | Erick Schmidt, David Akopian | A Fast-rate WLAN Measurement Tool for Improved Miss-rate in Indoor
Navigation | null | Proceedings of the 31st International Technical Meeting of the
Satellite Division of The Institute of Navigation (ION GNSS+ 2018) | 10.33012/2018.16042 | null | cs.NI cs.PF cs.SE eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, location-based services (LBS) have steered attention to indoor
positioning systems (IPS). WLAN-based IPSs relying on received signal strength
(RSS) measurements such as fingerprinting are gaining popularity due to proven
high accuracy of their results. Typically, sets of RSS measurements at selected
locatio... | [
{
"created": "Sun, 30 Jun 2019 21:29:48 GMT",
"version": "v1"
}
] | 2019-07-02 | [
[
"Schmidt",
"Erick",
""
],
[
"Akopian",
"David",
""
]
] | Recently, location-based services (LBS) have steered attention to indoor positioning systems (IPS). WLAN-based IPSs relying on received signal strength (RSS) measurements such as fingerprinting are gaining popularity due to proven high accuracy of their results. Typically, sets of RSS measurements at selected locations... |
2107.09927 | Serafeim Moustakidis | Zoumpolia Dikopoulou, Serafeim Moustakidis, Patrik Karlsson | GLIME: A new graphical methodology for interpretable model-agnostic
explanations | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Explainable artificial intelligence (XAI) is an emerging new domain in which
a set of processes and tools allow humans to better comprehend the decisions
generated by black box models. However, most of the available XAI tools are
often limited to simple explanations mainly quantifying the impact of
individual feature... | [
{
"created": "Wed, 21 Jul 2021 08:06:40 GMT",
"version": "v1"
}
] | 2021-07-22 | [
[
"Dikopoulou",
"Zoumpolia",
""
],
[
"Moustakidis",
"Serafeim",
""
],
[
"Karlsson",
"Patrik",
""
]
] | Explainable artificial intelligence (XAI) is an emerging new domain in which a set of processes and tools allow humans to better comprehend the decisions generated by black box models. However, most of the available XAI tools are often limited to simple explanations mainly quantifying the impact of individual features ... |
1809.04993 | Diego Romeres | Diego Romeres, Devesh Jha, Alberto Dalla Libera, William Yerazunis and
Daniel Nikovski | Semiparametrical Gaussian Processes Learning of Forward Dynamical Models
for Navigating in a Circular Maze | 7 pages including the references, 5 figures. Changed title, improved
the structure of the article and the images | null | null | null | cs.RO cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a problem of model learning for the purpose of learning
how to navigate a ball to a goal state in a circular maze environment with two
degrees of freedom. The motion of the ball in the maze environment is
influenced by several non-linear effects such as dry friction and contacts,
which are difficu... | [
{
"created": "Thu, 13 Sep 2018 14:44:05 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Sep 2018 18:22:48 GMT",
"version": "v2"
}
] | 2018-09-20 | [
[
"Romeres",
"Diego",
""
],
[
"Jha",
"Devesh",
""
],
[
"Libera",
"Alberto Dalla",
""
],
[
"Yerazunis",
"William",
""
],
[
"Nikovski",
"Daniel",
""
]
] | This paper presents a problem of model learning for the purpose of learning how to navigate a ball to a goal state in a circular maze environment with two degrees of freedom. The motion of the ball in the maze environment is influenced by several non-linear effects such as dry friction and contacts, which are difficult... |
1705.00761 | Samir Abdelrahman | Mahmoud Mahdi, Samir Abdelrahman, Reem Bahgat, and Ismail Ismail | F-tree: an algorithm for clustering transactional data using frequency
tree | Appeared at Al-Azhar University Engineering Journal, JAUES, Vol.5,
No. 8, Dec 2010 | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clustering is an important data mining technique that groups similar data
records, recently categorical transaction clustering is received more
attention. In this research, we study the problem of categorical data
clustering for transactional data characterized with high dimensionality and
large volume. We propose a ... | [
{
"created": "Tue, 2 May 2017 01:55:44 GMT",
"version": "v1"
}
] | 2017-05-03 | [
[
"Mahdi",
"Mahmoud",
""
],
[
"Abdelrahman",
"Samir",
""
],
[
"Bahgat",
"Reem",
""
],
[
"Ismail",
"Ismail",
""
]
] | Clustering is an important data mining technique that groups similar data records, recently categorical transaction clustering is received more attention. In this research, we study the problem of categorical data clustering for transactional data characterized with high dimensionality and large volume. We propose a no... |
2308.05621 | Francesco Orabona | Francesco Orabona | Normalized Gradients for All | null | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this short note, I show how to adapt to H\"{o}lder smoothness using
normalized gradients in a black-box way. Moreover, the bound will depend on a
novel notion of local H\"{o}lder smoothness. The main idea directly comes from
Levy [2017].
| [
{
"created": "Thu, 10 Aug 2023 15:10:08 GMT",
"version": "v1"
}
] | 2023-08-11 | [
[
"Orabona",
"Francesco",
""
]
] | In this short note, I show how to adapt to H\"{o}lder smoothness using normalized gradients in a black-box way. Moreover, the bound will depend on a novel notion of local H\"{o}lder smoothness. The main idea directly comes from Levy [2017]. |
2210.05728 | Nikolas Lamb | Nikolas Lamb, Sean Banerjee, and Natasha Kholgade Banerjee | DeepMend: Learning Occupancy Functions to Represent Shape for Repair | To be published at ECCV 2020 (poster) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present DeepMend, a novel approach to reconstruct restorations to
fractured shapes using learned occupancy functions. Existing shape repair
approaches predict low-resolution voxelized restorations, or require symmetries
or access to a pre-existing complete oracle. We represent the occupancy of a
fractured shape as... | [
{
"created": "Tue, 11 Oct 2022 18:42:20 GMT",
"version": "v1"
}
] | 2022-10-13 | [
[
"Lamb",
"Nikolas",
""
],
[
"Banerjee",
"Sean",
""
],
[
"Banerjee",
"Natasha Kholgade",
""
]
] | We present DeepMend, a novel approach to reconstruct restorations to fractured shapes using learned occupancy functions. Existing shape repair approaches predict low-resolution voxelized restorations, or require symmetries or access to a pre-existing complete oracle. We represent the occupancy of a fractured shape as t... |
1711.09352 | Hisashi Shimodaira | Hisashi Shimodaira | Automatic Color Image Segmentation Using a Square Elemental Region-Based
Seeded Region Growing and Merging Method | 14 pages with 9 figures and 3 tables | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an efficient automatic color image segmentation method
using a seeded region growing and merging method based on square elemental
regions. Our segmentation method consists of the three steps: generating seed
regions, merging the regions, and applying a pixel-wise boundary determination
algorithm t... | [
{
"created": "Sun, 26 Nov 2017 09:19:05 GMT",
"version": "v1"
}
] | 2017-11-28 | [
[
"Shimodaira",
"Hisashi",
""
]
] | This paper presents an efficient automatic color image segmentation method using a seeded region growing and merging method based on square elemental regions. Our segmentation method consists of the three steps: generating seed regions, merging the regions, and applying a pixel-wise boundary determination algorithm to ... |
2308.14806 | Wentao Xu | Wentao Xu, Kazutoshi Sasahara | Domain-based user embedding for competing events on social media | Computational social science application | null | null | null | cs.CY cs.SI | http://creativecommons.org/licenses/by/4.0/ | Online social networks offer vast opportunities for computational social
science, but effective user embedding is crucial for downstream tasks.
Traditionally, researchers have used pre-defined network-based user features,
such as degree, and centrality measures, and/or content-based features, such as
posts and repost... | [
{
"created": "Mon, 28 Aug 2023 18:01:14 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Aug 2023 07:07:05 GMT",
"version": "v2"
}
] | 2023-08-31 | [
[
"Xu",
"Wentao",
""
],
[
"Sasahara",
"Kazutoshi",
""
]
] | Online social networks offer vast opportunities for computational social science, but effective user embedding is crucial for downstream tasks. Traditionally, researchers have used pre-defined network-based user features, such as degree, and centrality measures, and/or content-based features, such as posts and reposts.... |
1706.00523 | Michael Chertkov | Michael Chertkov and Alexander Korotkevich | Adiabatic approach for natural gas pipeline computations | 6 pages, 2 figures | null | null | LA-UR-17-22368 | cs.SY physics.flu-dyn | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider slowly evolving, i.e. ADIABATIC, operational regime within a
transmission level (continental scale) natural gas pipeline system. This allows
us to introduce a set of nodal equations of reduced complexity describing gas
transients in injection/consumption UNBALANCED (so-called line-pack) cases. We
discuss,... | [
{
"created": "Thu, 1 Jun 2017 23:36:55 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Aug 2017 22:20:44 GMT",
"version": "v2"
}
] | 2017-08-04 | [
[
"Chertkov",
"Michael",
""
],
[
"Korotkevich",
"Alexander",
""
]
] | We consider slowly evolving, i.e. ADIABATIC, operational regime within a transmission level (continental scale) natural gas pipeline system. This allows us to introduce a set of nodal equations of reduced complexity describing gas transients in injection/consumption UNBALANCED (so-called line-pack) cases. We discuss, i... |
1704.05915 | Yuri G. Gordienko | S. Stirenko, Yu. Gordienko, T. Shemsedinov, O. Alienin, Yu. Kochura,
N. Gordienko, A. Rojbi, J.R. L\'opez Benito, E. Artetxe Gonz\'alez | User-driven Intelligent Interface on the Basis of Multimodal Augmented
Reality and Brain-Computer Interaction for People with Functional
Disabilities | 10 pages, 11 figures, 1 table, submitted to Future of Information and
Communication Conference (FICC) 2018, 5-6 April 2018, Singapore | In: Arai K., Kapoor S., Bhatia R. (eds) Advances in Information
and Communication Networks. FICC 2018. Advances in Intelligent Systems and
Computing, vol 886, pp.612-631. Springer, Cham | 10.1007/978-3-030-03402-3_43 | null | cs.HC cs.AI cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The analysis of the current integration attempts of some modes and use cases
of user-machine interaction is presented. The new concept of the user-driven
intelligent interface is proposed on the basis of multimodal augmented reality
and brain-computer interaction for various applications: in disabilities
studies, edu... | [
{
"created": "Wed, 12 Apr 2017 21:03:52 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Aug 2017 22:51:53 GMT",
"version": "v2"
}
] | 2018-12-11 | [
[
"Stirenko",
"S.",
""
],
[
"Gordienko",
"Yu.",
""
],
[
"Shemsedinov",
"T.",
""
],
[
"Alienin",
"O.",
""
],
[
"Kochura",
"Yu.",
""
],
[
"Gordienko",
"N.",
""
],
[
"Rojbi",
"A.",
""
],
[
"Benito",
... | The analysis of the current integration attempts of some modes and use cases of user-machine interaction is presented. The new concept of the user-driven intelligent interface is proposed on the basis of multimodal augmented reality and brain-computer interaction for various applications: in disabilities studies, educa... |
1607.03848 | Minghui Jiang | Minghui Jiang | Periodicity of identifying codes in strips | added two references [2,3] and updated introduction | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An identifying code in a graph is a subset of vertices having a nonempty and
distinct intersection with the closed neighborhood of every vertex. We prove
that the infimum density of any identifying code in $S_k$ (an infinite strip of
$k$ rows in the square grid) can always be achieved by a periodic identifying
code w... | [
{
"created": "Wed, 13 Jul 2016 18:14:32 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Oct 2016 18:37:32 GMT",
"version": "v2"
}
] | 2016-10-18 | [
[
"Jiang",
"Minghui",
""
]
] | An identifying code in a graph is a subset of vertices having a nonempty and distinct intersection with the closed neighborhood of every vertex. We prove that the infimum density of any identifying code in $S_k$ (an infinite strip of $k$ rows in the square grid) can always be achieved by a periodic identifying code wit... |
1604.00066 | Wenbin Li | Wenbin Li, Seyedmajid Azimi, Ale\v{s} Leonardis, Mario Fritz | To Fall Or Not To Fall: A Visual Approach to Physical Stability
Prediction | null | null | null | null | cs.CV cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding physical phenomena is a key competence that enables humans and
animals to act and interact under uncertain perception in previously unseen
environments containing novel object and their configurations. Developmental
psychology has shown that such skills are acquired by infants from observations
at a ver... | [
{
"created": "Thu, 31 Mar 2016 21:53:32 GMT",
"version": "v1"
}
] | 2016-04-04 | [
[
"Li",
"Wenbin",
""
],
[
"Azimi",
"Seyedmajid",
""
],
[
"Leonardis",
"Aleš",
""
],
[
"Fritz",
"Mario",
""
]
] | Understanding physical phenomena is a key competence that enables humans and animals to act and interact under uncertain perception in previously unseen environments containing novel object and their configurations. Developmental psychology has shown that such skills are acquired by infants from observations at a very ... |
1709.05172 | Kamil Senel | Kamil Senel, Emil Bj\"ornson and Erik G. Larsson | Optimal Base Station Design with Limited Fronthaul: Massive Bandwidth or
Massive MIMO? | Accepted for publication in GC'17 Workshops - LSASLUB | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To reach a cost-efficient 5G architecture, the use of remote radio heads
connected through a fronthaul to baseband controllers is a promising solution.
However, the fronthaul links must support high bit rates as 5G networks are
projected to use wide bandwidths and many antennas. Upgrading all of the
existing fronthau... | [
{
"created": "Fri, 15 Sep 2017 12:15:53 GMT",
"version": "v1"
}
] | 2017-09-18 | [
[
"Senel",
"Kamil",
""
],
[
"Björnson",
"Emil",
""
],
[
"Larsson",
"Erik G.",
""
]
] | To reach a cost-efficient 5G architecture, the use of remote radio heads connected through a fronthaul to baseband controllers is a promising solution. However, the fronthaul links must support high bit rates as 5G networks are projected to use wide bandwidths and many antennas. Upgrading all of the existing fronthaul ... |
1802.05134 | Kamil Khadiev | Kamil Khadiev, Aliya Khadieva, Mansur Ziatdinov, Dmitry Kravchenko,
Alexander Rivosh, Ramis Yamilov and Ilnaz Mannapov | Quantum versus Classical Online Streaming Algorithms with Advice | arXiv admin note: substantial text overlap with arXiv:1710.09595 | null | null | null | cs.DS cs.CC quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider online algorithms with respect to the competitive ratio. Here, we
investigate quantum and classical one-way automata with non-constant size of
memory (streaming algorithms) as a model for online algorithms. We construct
problems that can be solved by quantum online streaming algorithms better than
by clas... | [
{
"created": "Tue, 13 Feb 2018 12:50:12 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Jun 2019 11:07:18 GMT",
"version": "v2"
}
] | 2019-06-24 | [
[
"Khadiev",
"Kamil",
""
],
[
"Khadieva",
"Aliya",
""
],
[
"Ziatdinov",
"Mansur",
""
],
[
"Kravchenko",
"Dmitry",
""
],
[
"Rivosh",
"Alexander",
""
],
[
"Yamilov",
"Ramis",
""
],
[
"Mannapov",
"Ilnaz",
""
]... | We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorithms) as a model for online algorithms. We construct problems that can be solved by quantum online streaming algorithms better than by classi... |
2310.18112 | Ayoub Raji | Ayoub Raji, Danilo Caporale, Francesco Gatti, Andrea Giove, Micaela
Verucchi, Davide Malatesta, Nicola Musiu, Alessandro Toschi, Silviu Roberto
Popitanu, Fabio Bagni, Massimiliano Bosi, Alexander Liniger, Marko Bertogna,
Daniele Morra, Francesco Amerotti, Luca Bartoli, Federico Martello, Riccardo
Porta | er.autopilot 1.0: The Full Autonomous Stack for Oval Racing at High
Speeds | Preprint: Accepted to Field Robotics "Opportunities and Challenges
with Autonomous Racing" Special Issue | Field Robotics, January 2024, Volume 4 | 10.55417/fr.2024004 | null | cs.RO cs.AI cs.CV cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Indy Autonomous Challenge (IAC) brought together for the first time in
history nine autonomous racing teams competing at unprecedented speed and in
head-to-head scenario, using independently developed software on open-wheel
racecars. This paper presents the complete software architecture used by team
TII EuroRaci... | [
{
"created": "Fri, 27 Oct 2023 12:52:34 GMT",
"version": "v1"
}
] | 2024-02-08 | [
[
"Raji",
"Ayoub",
""
],
[
"Caporale",
"Danilo",
""
],
[
"Gatti",
"Francesco",
""
],
[
"Giove",
"Andrea",
""
],
[
"Verucchi",
"Micaela",
""
],
[
"Malatesta",
"Davide",
""
],
[
"Musiu",
"Nicola",
""
],
[
... | The Indy Autonomous Challenge (IAC) brought together for the first time in history nine autonomous racing teams competing at unprecedented speed and in head-to-head scenario, using independently developed software on open-wheel racecars. This paper presents the complete software architecture used by team TII EuroRacing... |
1710.09300 | Filipe Alves Neto Verri | Filipe Alves Neto Verri, Renato Tin\'os, Liang Zhao | Feature learning in feature-sample networks using multi-objective
optimization | 7 pages, 4 figures | null | 10.1109/CEC.2018.8477891 | null | cs.AI cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data and knowledge representation are fundamental concepts in machine
learning. The quality of the representation impacts the performance of the
learning model directly. Feature learning transforms or enhances raw data to
structures that are effectively exploited by those models. In recent years,
several works have b... | [
{
"created": "Wed, 25 Oct 2017 15:18:27 GMT",
"version": "v1"
}
] | 2021-04-26 | [
[
"Verri",
"Filipe Alves Neto",
""
],
[
"Tinós",
"Renato",
""
],
[
"Zhao",
"Liang",
""
]
] | Data and knowledge representation are fundamental concepts in machine learning. The quality of the representation impacts the performance of the learning model directly. Feature learning transforms or enhances raw data to structures that are effectively exploited by those models. In recent years, several works have bee... |
2005.02829 | Aleem Akhtar Asif | Aleem Akhtar | Role of Apache Software Foundation in Big Data Projects | null | null | null | null | cs.SE cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the increase in amount of Big Data being generated each year, tools and
technologies developed and used for the purpose of storing, processing and
analyzing Big Data has also improved. Open-Source software has been an
important factor in the success and innovation in the field of Big Data while
Apache Software F... | [
{
"created": "Tue, 5 May 2020 11:12:59 GMT",
"version": "v1"
}
] | 2020-05-07 | [
[
"Akhtar",
"Aleem",
""
]
] | With the increase in amount of Big Data being generated each year, tools and technologies developed and used for the purpose of storing, processing and analyzing Big Data has also improved. Open-Source software has been an important factor in the success and innovation in the field of Big Data while Apache Software Fou... |
1909.13005 | Xiaojiang Peng | Qing Li, Xiaojiang Peng, Yu Qiao, Qiang Peng | Learning Category Correlations for Multi-label Image Recognition with
Graph Networks | 8 pages, 4 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-label image recognition is a task that predicts a set of object labels
in an image. As the objects co-occur in the physical world, it is desirable to
model label dependencies. Previous existing methods resort to either recurrent
networks or pre-defined label correlation graphs for this purpose. In this
paper, i... | [
{
"created": "Sat, 28 Sep 2019 02:03:25 GMT",
"version": "v1"
}
] | 2019-10-01 | [
[
"Li",
"Qing",
""
],
[
"Peng",
"Xiaojiang",
""
],
[
"Qiao",
"Yu",
""
],
[
"Peng",
"Qiang",
""
]
] | Multi-label image recognition is a task that predicts a set of object labels in an image. As the objects co-occur in the physical world, it is desirable to model label dependencies. Previous existing methods resort to either recurrent networks or pre-defined label correlation graphs for this purpose. In this paper, ins... |
1711.06507 | Irem Boybat | Irem Boybat, Manuel Le Gallo, S. R. Nandakumar, Timoleon Moraitis,
Thomas Parnell, Tomas Tuma, Bipin Rajendran, Yusuf Leblebici, Abu Sebastian,
Evangelos Eleftheriou | Neuromorphic computing with multi-memristive synapses | null | Nature Communications, volume 9, page 2514 (2018) | 10.1038/s41467-018-04933-y | null | cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neuromorphic computing has emerged as a promising avenue towards building the
next generation of intelligent computing systems. It has been proposed that
memristive devices, which exhibit history-dependent conductivity modulation,
could efficiently represent the synaptic weights in artificial neural networks.
However... | [
{
"created": "Fri, 17 Nov 2017 12:19:54 GMT",
"version": "v1"
},
{
"created": "Sun, 24 Feb 2019 10:27:27 GMT",
"version": "v2"
}
] | 2019-02-26 | [
[
"Boybat",
"Irem",
""
],
[
"Gallo",
"Manuel Le",
""
],
[
"Nandakumar",
"S. R.",
""
],
[
"Moraitis",
"Timoleon",
""
],
[
"Parnell",
"Thomas",
""
],
[
"Tuma",
"Tomas",
""
],
[
"Rajendran",
"Bipin",
""
],
[... | Neuromorphic computing has emerged as a promising avenue towards building the next generation of intelligent computing systems. It has been proposed that memristive devices, which exhibit history-dependent conductivity modulation, could efficiently represent the synaptic weights in artificial neural networks. However, ... |
2405.06886 | Yong Guan | Yong Guan, Dingxiao Liu, Jinchen Ma, Hao Peng, Xiaozhi Wang, Lei Hou,
Ru Li | Event GDR: Event-Centric Generative Document Retrieval | Accepted to WWW 2024 | null | null | null | cs.IR cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative document retrieval, an emerging paradigm in information retrieval,
learns to build connections between documents and identifiers within a single
model, garnering significant attention. However, there are still two
challenges: (1) neglecting inner-content correlation during document
representation; (2) lack... | [
{
"created": "Sat, 11 May 2024 02:55:11 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"Guan",
"Yong",
""
],
[
"Liu",
"Dingxiao",
""
],
[
"Ma",
"Jinchen",
""
],
[
"Peng",
"Hao",
""
],
[
"Wang",
"Xiaozhi",
""
],
[
"Hou",
"Lei",
""
],
[
"Li",
"Ru",
""
]
] | Generative document retrieval, an emerging paradigm in information retrieval, learns to build connections between documents and identifiers within a single model, garnering significant attention. However, there are still two challenges: (1) neglecting inner-content correlation during document representation; (2) lackin... |
1806.10044 | Johannes Zink | Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink | Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few
Bends | null | null | 10.1016/j.comgeo.2019.07.006 | null | cs.CG cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the following classes of beyond-planar graphs: 1-planar, IC-planar,
and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar,
and NIC-planar drawing, respectively. A drawing of a graph is 1-planar if every
edge is crossed at most once. A 1-planar drawing is IC-planar if no two pairs
of cr... | [
{
"created": "Tue, 26 Jun 2018 15:02:36 GMT",
"version": "v1"
},
{
"created": "Fri, 6 Jul 2018 11:57:24 GMT",
"version": "v2"
},
{
"created": "Tue, 28 Aug 2018 15:01:59 GMT",
"version": "v3"
},
{
"created": "Mon, 3 Sep 2018 13:58:52 GMT",
"version": "v4"
},
{
"cre... | 2019-08-12 | [
[
"Chaplick",
"Steven",
""
],
[
"Lipp",
"Fabian",
""
],
[
"Wolff",
"Alexander",
""
],
[
"Zink",
"Johannes",
""
]
] | We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, respectively. A drawing of a graph is 1-planar if every edge is crossed at most once. A 1-planar drawing is IC-planar if no two pairs of cros... |
2007.11199 | Jiahao Li | Jiahao Li, Meilin Cui, Jeeeun Kim, Xiang 'Anthony' Chen | Romeo: A Design Tool for Embedding Transformable Parts in 3D Models to
Robotically Augment Default Functionalities | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reconfiguring shapes of objects enables transforming existing passive objects
with robotic functionalities, e.g., a transformable coffee cup holder can be
attached to a chair's armrest, a piggy bank can reach out an arm to 'steal'
coins. Despite the advance in end-user 3D design and fabrication, it remains
challengin... | [
{
"created": "Wed, 22 Jul 2020 04:54:43 GMT",
"version": "v1"
}
] | 2020-07-23 | [
[
"Li",
"Jiahao",
""
],
[
"Cui",
"Meilin",
""
],
[
"Kim",
"Jeeeun",
""
],
[
"Chen",
"Xiang 'Anthony'",
""
]
] | Reconfiguring shapes of objects enables transforming existing passive objects with robotic functionalities, e.g., a transformable coffee cup holder can be attached to a chair's armrest, a piggy bank can reach out an arm to 'steal' coins. Despite the advance in end-user 3D design and fabrication, it remains challenging ... |
2109.03638 | Tiago Colliri | Tiago Colliri | Evaluating Presidential Support in the Brazilian House of
Representatives Through a Network-Based Approach | null | null | null | null | cs.SI physics.soc-ph | http://creativecommons.org/licenses/by/4.0/ | Conflicts between the executive and legislative powers are a common, and even
expected, characteristic of presidential systems, with some governments being
more successful in the activity of obtaining support from the Congress than
others. In the case of Brazil, specifically, this factor is considered crucial
in the ... | [
{
"created": "Wed, 8 Sep 2021 13:31:36 GMT",
"version": "v1"
}
] | 2021-09-09 | [
[
"Colliri",
"Tiago",
""
]
] | Conflicts between the executive and legislative powers are a common, and even expected, characteristic of presidential systems, with some governments being more successful in the activity of obtaining support from the Congress than others. In the case of Brazil, specifically, this factor is considered crucial in the so... |
2002.03485 | Dhairya Dalal | Dhairya Dalal and Byron V. Galbraith | Evaluating Sequence-to-Sequence Learning Models for If-Then Program
Synthesis | AAAI IPA workshop submission | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Implementing enterprise process automation often requires significant
technical expertise and engineering effort. It would be beneficial for
non-technical users to be able to describe a business process in natural
language and have an intelligent system generate the workflow that can be
automatically executed. A buil... | [
{
"created": "Mon, 10 Feb 2020 00:45:03 GMT",
"version": "v1"
}
] | 2020-02-11 | [
[
"Dalal",
"Dhairya",
""
],
[
"Galbraith",
"Byron V.",
""
]
] | Implementing enterprise process automation often requires significant technical expertise and engineering effort. It would be beneficial for non-technical users to be able to describe a business process in natural language and have an intelligent system generate the workflow that can be automatically executed. A buildi... |
2105.06072 | Jincheng Mei | Jincheng Mei, Yue Gao, Bo Dai, Csaba Szepesvari, Dale Schuurmans | Leveraging Non-uniformity in First-order Non-convex Optimization | 48 pages, 10 figures. Accepted at ICML 2021 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Classical global convergence results for first-order methods rely on uniform
smoothness and the \L{}ojasiewicz inequality. Motivated by properties of
objective functions that arise in machine learning, we propose a non-uniform
refinement of these notions, leading to \emph{Non-uniform Smoothness} (NS) and
\emph{Non-un... | [
{
"created": "Thu, 13 May 2021 04:23:07 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Sep 2021 21:13:47 GMT",
"version": "v2"
},
{
"created": "Thu, 2 Jun 2022 06:44:29 GMT",
"version": "v3"
}
] | 2022-06-03 | [
[
"Mei",
"Jincheng",
""
],
[
"Gao",
"Yue",
""
],
[
"Dai",
"Bo",
""
],
[
"Szepesvari",
"Csaba",
""
],
[
"Schuurmans",
"Dale",
""
]
] | Classical global convergence results for first-order methods rely on uniform smoothness and the \L{}ojasiewicz inequality. Motivated by properties of objective functions that arise in machine learning, we propose a non-uniform refinement of these notions, leading to \emph{Non-uniform Smoothness} (NS) and \emph{Non-unif... |
2205.06182 | Satwinder Singh | Satwinder Singh, Ruili Wang, Feng Hou | Improved Meta Learning for Low Resource Speech Recognition | Published in IEEE ICASSP 2022 | ICASSP 2022 - 2022 IEEE International Conference on Acoustics,
Speech and Signal Processing (ICASSP), 2022, pp. 4798-4802 | 10.1109/ICASSP43922.2022.9746899 | null | cs.CL cs.LG cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new meta learning based framework for low resource speech
recognition that improves the previous model agnostic meta learning (MAML)
approach. The MAML is a simple yet powerful meta learning approach. However,
the MAML presents some core deficiencies such as training instabilities and
slower convergence ... | [
{
"created": "Wed, 11 May 2022 15:50:47 GMT",
"version": "v1"
}
] | 2022-05-13 | [
[
"Singh",
"Satwinder",
""
],
[
"Wang",
"Ruili",
""
],
[
"Hou",
"Feng",
""
]
] | We propose a new meta learning based framework for low resource speech recognition that improves the previous model agnostic meta learning (MAML) approach. The MAML is a simple yet powerful meta learning approach. However, the MAML presents some core deficiencies such as training instabilities and slower convergence sp... |
1803.09622 | Jan Kelner | Jan M. Kelner, Bogdan Uljasz, Leszek Nowosielski (Military University
of Technology, Faculty of Electronics, Institute of Telecommunications,
Warsaw, Poland) | BER measurements in the evaluation of operation correctness of VSAT
modem traffic interfaces | 5 pages, 5 figures, 2 tables | 2018 14th International Conference on Advanced Trends in
Radioelectronics, Telecommunications and Computer Engineering (TCSET),
Lviv-Slavske, Ukraine, 20-24.02.2018., pp. 1-5 | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents using bit error rate (BER) measurements to evaluate
operation correctness of traffic (input-output) interfaces in modem of very
small aperture terminal (VSAT). Such functional tests are carried out, for
example, when purchasing communication equipment for armed forces. Generally,
available standar... | [
{
"created": "Mon, 26 Mar 2018 14:30:47 GMT",
"version": "v1"
}
] | 2018-03-28 | [
[
"Kelner",
"Jan M.",
"",
"Military University\n of Technology, Faculty of Electronics, Institute of Telecommunications,\n Warsaw, Poland"
],
[
"Uljasz",
"Bogdan",
"",
"Military University\n of Technology, Faculty of Electronics, Institute of Telecommunications,\n Warsaw, Pol... | This paper presents using bit error rate (BER) measurements to evaluate operation correctness of traffic (input-output) interfaces in modem of very small aperture terminal (VSAT). Such functional tests are carried out, for example, when purchasing communication equipment for armed forces. Generally, available standards... |
1310.0234 | Yuanming Shi | Yuanming Shi and Jun Zhang and Khaled B. Letaief | Group Sparse Beamforming for Green Cloud-RAN | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A cloud radio access network (Cloud-RAN) is a network architecture that holds
the promise of meeting the explosive growth of mobile data traffic. In this
architecture, all the baseband signal processing is shifted to a single
baseband unit (BBU) pool, which enables efficient resource allocation and
interference manag... | [
{
"created": "Tue, 1 Oct 2013 10:46:27 GMT",
"version": "v1"
}
] | 2013-10-02 | [
[
"Shi",
"Yuanming",
""
],
[
"Zhang",
"Jun",
""
],
[
"Letaief",
"Khaled B.",
""
]
] | A cloud radio access network (Cloud-RAN) is a network architecture that holds the promise of meeting the explosive growth of mobile data traffic. In this architecture, all the baseband signal processing is shifted to a single baseband unit (BBU) pool, which enables efficient resource allocation and interference managem... |
2006.11078 | Alexey Zaytsev | I. Fursov, A. Zaytsev, N. Kluchnikov, A. Kravchenko, E. Burnaev | Differentiable Language Model Adversarial Attacks on Categorical
Sequence Classifiers | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An adversarial attack paradigm explores various scenarios for the
vulnerability of deep learning models: minor changes of the input can force a
model failure. Most of the state of the art frameworks focus on adversarial
attacks for images and other structured model inputs, but not for categorical
sequences models.
... | [
{
"created": "Fri, 19 Jun 2020 11:25:36 GMT",
"version": "v1"
}
] | 2020-06-22 | [
[
"Fursov",
"I.",
""
],
[
"Zaytsev",
"A.",
""
],
[
"Kluchnikov",
"N.",
""
],
[
"Kravchenko",
"A.",
""
],
[
"Burnaev",
"E.",
""
]
] | An adversarial attack paradigm explores various scenarios for the vulnerability of deep learning models: minor changes of the input can force a model failure. Most of the state of the art frameworks focus on adversarial attacks for images and other structured model inputs, but not for categorical sequences models. Succ... |
cs/0602062 | Francois Denis | Fran\c{c}ois Denis (LIF), Yann Esposito (LIF), Amaury Habrard (LIF) | Learning rational stochastic languages | 15 pages | null | null | null | cs.LG | null | Given a finite set of words w1,...,wn independently drawn according to a
fixed unknown distribution law P called a stochastic language, an usual goal in
Grammatical Inference is to infer an estimate of P in some class of
probabilistic models, such as Probabilistic Automata (PA). Here, we study the
class of rational s... | [
{
"created": "Fri, 17 Feb 2006 08:57:44 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Denis",
"François",
"",
"LIF"
],
[
"Esposito",
"Yann",
"",
"LIF"
],
[
"Habrard",
"Amaury",
"",
"LIF"
]
] | Given a finite set of words w1,...,wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference is to infer an estimate of P in some class of probabilistic models, such as Probabilistic Automata (PA). Here, we study the class of rational sto... |
2203.13086 | Aibek Alanov | Pavel Andreev, Aibek Alanov, Oleg Ivanov, Dmitry Vetrov | HiFi++: a Unified Framework for Bandwidth Extension and Speech
Enhancement | Accepted to ICASSP 2023 | null | 10.1109/ICASSP49357.2023.10097255 | null | cs.SD cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative adversarial networks have recently demonstrated outstanding
performance in neural vocoding outperforming best autoregressive and flow-based
models. In this paper, we show that this success can be extended to other tasks
of conditional audio generation. In particular, building upon HiFi vocoders, we
propose... | [
{
"created": "Thu, 24 Mar 2022 14:25:51 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Sep 2022 14:02:06 GMT",
"version": "v2"
},
{
"created": "Sun, 30 Jul 2023 09:57:21 GMT",
"version": "v3"
},
{
"created": "Sun, 10 Dec 2023 13:52:10 GMT",
"version": "v4"
}
] | 2023-12-12 | [
[
"Andreev",
"Pavel",
""
],
[
"Alanov",
"Aibek",
""
],
[
"Ivanov",
"Oleg",
""
],
[
"Vetrov",
"Dmitry",
""
]
] | Generative adversarial networks have recently demonstrated outstanding performance in neural vocoding outperforming best autoregressive and flow-based models. In this paper, we show that this success can be extended to other tasks of conditional audio generation. In particular, building upon HiFi vocoders, we propose a... |
2201.01819 | Diana Kim | Diana Kim, Ahmed Elgammal, Marian Mazzone | Formal Analysis of Art: Proxy Learning of Visual Concepts from Style
Through Language Models | 23 pages, This paper is an extended version of a paper that will be
published at the 36th AAAI Conference on Artificial Intelligence, to beheld
in Vancouver, BC, Canada, February 22 - March 1, 2022 | null | null | null | cs.LG cs.CL cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a machine learning system that can quantify fine art paintings
with a set of visual elements and principles of art. This formal analysis is
fundamental for understanding art, but developing such a system is challenging.
Paintings have high visual complexities, but it is also difficult to collect
enough tra... | [
{
"created": "Wed, 5 Jan 2022 21:03:29 GMT",
"version": "v1"
}
] | 2022-01-14 | [
[
"Kim",
"Diana",
""
],
[
"Elgammal",
"Ahmed",
""
],
[
"Mazzone",
"Marian",
""
]
] | We present a machine learning system that can quantify fine art paintings with a set of visual elements and principles of art. This formal analysis is fundamental for understanding art, but developing such a system is challenging. Paintings have high visual complexities, but it is also difficult to collect enough train... |
2203.13888 | Jacob Rosenthal | David Brundage, Jacob Rosenthal, Ryan Carelli, Sophie Rand, Renato
Umeton, Massimo Loda, Luigi Marchionni | Whole Slide Image to DICOM Conversion as Event-Driven Cloud
Infrastructure | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The Digital Imaging and Communication in Medicine (DICOM) specification is
increasingly being adopted in digital pathology to promote data standardization
and interoperability. Efficient conversion of proprietary file formats into the
DICOM standard format is a key requirement for institutional adoption of DICOM,
nec... | [
{
"created": "Fri, 25 Mar 2022 19:55:49 GMT",
"version": "v1"
}
] | 2022-03-29 | [
[
"Brundage",
"David",
""
],
[
"Rosenthal",
"Jacob",
""
],
[
"Carelli",
"Ryan",
""
],
[
"Rand",
"Sophie",
""
],
[
"Umeton",
"Renato",
""
],
[
"Loda",
"Massimo",
""
],
[
"Marchionni",
"Luigi",
""
]
] | The Digital Imaging and Communication in Medicine (DICOM) specification is increasingly being adopted in digital pathology to promote data standardization and interoperability. Efficient conversion of proprietary file formats into the DICOM standard format is a key requirement for institutional adoption of DICOM, neces... |
1006.4903 | Frank Sottile | Luis David Garcia-Puente, Frank Sottile, Chungang Zhu | Toric degenerations of Bezier patches | 21 pages, many .eps figures | null | null | null | cs.GR math.AG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The control polygon of a Bezier curve is well-defined and has geometric
significance---there is a sequence of weights under which the limiting position
of the curve is the control polygon. For a Bezier surface patch, there are many
possible polyhedral control structures, and none are canonical. We propose a
not neces... | [
{
"created": "Fri, 25 Jun 2010 03:11:37 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Dec 2010 05:17:12 GMT",
"version": "v2"
}
] | 2011-01-04 | [
[
"Garcia-Puente",
"Luis David",
""
],
[
"Sottile",
"Frank",
""
],
[
"Zhu",
"Chungang",
""
]
] | The control polygon of a Bezier curve is well-defined and has geometric significance---there is a sequence of weights under which the limiting position of the curve is the control polygon. For a Bezier surface patch, there are many possible polyhedral control structures, and none are canonical. We propose a not necessa... |
1608.00187 | Ranjay Krishna | Cewu Lu, Ranjay Krishna, Michael Bernstein, Li Fei-Fei | Visual Relationship Detection with Language Priors | ECCV 2016 Oral | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual relationships capture a wide variety of interactions between pairs of
objects in images (e.g. "man riding bicycle" and "man pushing bicycle").
Consequently, the set of possible relationships is extremely large and it is
difficult to obtain sufficient training examples for all possible
relationships. Because of... | [
{
"created": "Sun, 31 Jul 2016 05:54:13 GMT",
"version": "v1"
}
] | 2016-08-02 | [
[
"Lu",
"Cewu",
""
],
[
"Krishna",
"Ranjay",
""
],
[
"Bernstein",
"Michael",
""
],
[
"Fei-Fei",
"Li",
""
]
] | Visual relationships capture a wide variety of interactions between pairs of objects in images (e.g. "man riding bicycle" and "man pushing bicycle"). Consequently, the set of possible relationships is extremely large and it is difficult to obtain sufficient training examples for all possible relationships. Because of t... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.