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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2210.01055 | Tianyu Huang | Tianyu Huang, Bowen Dong, Yunhan Yang, Xiaoshui Huang, Rynson W.H.
Lau, Wanli Ouyang, Wangmeng Zuo | CLIP2Point: Transfer CLIP to Point Cloud Classification with Image-Depth
Pre-training | Accepted by ICCV2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Pre-training across 3D vision and language remains under development because
of limited training data. Recent works attempt to transfer vision-language
pre-training models to 3D vision. PointCLIP converts point cloud data to
multi-view depth maps, adopting CLIP for shape classification. However, its
performance is re... | [
{
"created": "Mon, 3 Oct 2022 16:13:14 GMT",
"version": "v1"
},
{
"created": "Sun, 20 Nov 2022 12:08:19 GMT",
"version": "v2"
},
{
"created": "Wed, 23 Aug 2023 03:24:13 GMT",
"version": "v3"
}
] | 2023-08-24 | [
[
"Huang",
"Tianyu",
""
],
[
"Dong",
"Bowen",
""
],
[
"Yang",
"Yunhan",
""
],
[
"Huang",
"Xiaoshui",
""
],
[
"Lau",
"Rynson W. H.",
""
],
[
"Ouyang",
"Wanli",
""
],
[
"Zuo",
"Wangmeng",
""
]
] | Pre-training across 3D vision and language remains under development because of limited training data. Recent works attempt to transfer vision-language pre-training models to 3D vision. PointCLIP converts point cloud data to multi-view depth maps, adopting CLIP for shape classification. However, its performance is rest... |
2304.07162 | Thomas Neele | Thomas Neele, Jaco van de Pol | Operations on Fixpoint Equation Systems | null | Logical Methods in Computer Science, Volume 20, Issue 3 (July 10,
2024) lmcs:11199 | 10.46298/lmcs-20(3:5)2024 | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | We study operations on fixpoint equation systems (FES) over arbitrary
complete lattices. We investigate under which conditions these operations, such
as substituting variables by their definition, and swapping the ordering of
equations, preserve the solution of a FES. We provide rigorous,
computer-checked proofs. Alo... | [
{
"created": "Fri, 14 Apr 2023 14:35:18 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Feb 2024 14:23:48 GMT",
"version": "v2"
},
{
"created": "Tue, 14 May 2024 08:49:22 GMT",
"version": "v3"
},
{
"created": "Tue, 9 Jul 2024 11:24:33 GMT",
"version": "v4"
}
] | 2024-08-07 | [
[
"Neele",
"Thomas",
""
],
[
"van de Pol",
"Jaco",
""
]
] | We study operations on fixpoint equation systems (FES) over arbitrary complete lattices. We investigate under which conditions these operations, such as substituting variables by their definition, and swapping the ordering of equations, preserve the solution of a FES. We provide rigorous, computer-checked proofs. Along... |
2201.04678 | Weidong Luo | Weidong Luo | Polynomial Turing Compressions for Some Graph Problems Parameterized by
Modular-Width | 18 pages | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A polynomial Turing compression (PTC) for a parameterized problem $L$ is a
polynomial time Turing machine that has access to an oracle for a problem $L'$
such that a polynomial in the input parameter bounds each query. Meanwhile, a
polynomial (many-one) compression (PC) can be regarded as a restricted variant
of PTC ... | [
{
"created": "Wed, 12 Jan 2022 20:12:41 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Apr 2022 16:59:42 GMT",
"version": "v2"
},
{
"created": "Thu, 14 Dec 2023 04:17:26 GMT",
"version": "v3"
}
] | 2023-12-15 | [
[
"Luo",
"Weidong",
""
]
] | A polynomial Turing compression (PTC) for a parameterized problem $L$ is a polynomial time Turing machine that has access to an oracle for a problem $L'$ such that a polynomial in the input parameter bounds each query. Meanwhile, a polynomial (many-one) compression (PC) can be regarded as a restricted variant of PTC wh... |
0908.2083 | Janusz Brzozowski | J. Brzozowski, G. Jir\'askov\'a, B. Li | Quotient complexity of ideal languages | 24 pages, 9 .eepic figures, 2 tables, use llncs.cls | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the state complexity of regular operations in the class of ideal
languages. A language L over an alphabet Sigma is a right (left) ideal if it
satisfies L = L Sigma* (L = Sigma* L). It is a two-sided ideal if L = Sigma* L
Sigma *, and an all-sided ideal if it is the shuffle of Sigma* with L. We
prefer the ter... | [
{
"created": "Fri, 14 Aug 2009 15:24:15 GMT",
"version": "v1"
}
] | 2009-08-17 | [
[
"Brzozowski",
"J.",
""
],
[
"Jirásková",
"G.",
""
],
[
"Li",
"B.",
""
]
] | We study the state complexity of regular operations in the class of ideal languages. A language L over an alphabet Sigma is a right (left) ideal if it satisfies L = L Sigma* (L = Sigma* L). It is a two-sided ideal if L = Sigma* L Sigma *, and an all-sided ideal if it is the shuffle of Sigma* with L. We prefer the term ... |
2108.11299 | Tobias Lorenz | Tobias Lorenz, Marta Kwiatkowska, Mario Fritz | Certifiers Make Neural Networks Vulnerable to Availability Attacks | Published at 16th ACM Workshop on Artificial Intelligence and
Security (AISec '23) | null | 10.1145/3605764.3623917 | null | cs.LG cs.CR cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To achieve reliable, robust, and safe AI systems, it is vital to implement
fallback strategies when AI predictions cannot be trusted. Certifiers for
neural networks are a reliable way to check the robustness of these
predictions. They guarantee for some predictions that a certain class of
manipulations or attacks cou... | [
{
"created": "Wed, 25 Aug 2021 15:49:10 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Mar 2022 09:42:15 GMT",
"version": "v2"
},
{
"created": "Fri, 13 May 2022 12:11:56 GMT",
"version": "v3"
},
{
"created": "Sun, 2 Oct 2022 16:58:47 GMT",
"version": "v4"
},
{
"cre... | 2023-10-04 | [
[
"Lorenz",
"Tobias",
""
],
[
"Kwiatkowska",
"Marta",
""
],
[
"Fritz",
"Mario",
""
]
] | To achieve reliable, robust, and safe AI systems, it is vital to implement fallback strategies when AI predictions cannot be trusted. Certifiers for neural networks are a reliable way to check the robustness of these predictions. They guarantee for some predictions that a certain class of manipulations or attacks could... |
2004.12091 | Onur G\"unl\"u Dr.-Ing. | Onur G\"unl\"u, Peter Trifonov, Muah Kim, Rafael F. Schaefer, and
Vladimir Sidorenko | Randomized Nested Polar Subcode Constructions for Privacy, Secrecy, and
Storage | Shorter version to appear in 2020 IEEE International Symposium on
Information Theory and Applications. Decoding complexity results are added | null | null | null | cs.IT cs.CR cs.MM eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider polar subcodes (PSCs), which are polar codes (PCs) with
dynamically-frozen symbols, to increase the minimum distance as compared to
corresponding PCs. A randomized nested PSC construction with a low-rate PSC and
a high-rate PC, is proposed for list and sequential successive cancellation
decoders. This cod... | [
{
"created": "Sat, 25 Apr 2020 08:57:17 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Jun 2020 12:57:02 GMT",
"version": "v2"
},
{
"created": "Wed, 29 Jul 2020 10:26:19 GMT",
"version": "v3"
}
] | 2020-07-30 | [
[
"Günlü",
"Onur",
""
],
[
"Trifonov",
"Peter",
""
],
[
"Kim",
"Muah",
""
],
[
"Schaefer",
"Rafael F.",
""
],
[
"Sidorenko",
"Vladimir",
""
]
] | We consider polar subcodes (PSCs), which are polar codes (PCs) with dynamically-frozen symbols, to increase the minimum distance as compared to corresponding PCs. A randomized nested PSC construction with a low-rate PSC and a high-rate PC, is proposed for list and sequential successive cancellation decoders. This code ... |
2012.07959 | Li-Yi Wei | Peihan Tu, Li-Yi Wei, Koji Yatani, Takeo Igarashi, Matthias Zwicker | Continuous Curve Textures | null | null | 10.1145/3414685.3417780 | null | cs.GR | http://creativecommons.org/licenses/by/4.0/ | Repetitive patterns are ubiquitous in natural and human-made objects, and can
be created with a variety of tools and methods. Manual authoring provides
unmatched degree of freedom and control, but can require significant artistic
expertise and manual labor. Computational methods can automate parts of the
manual creat... | [
{
"created": "Mon, 14 Dec 2020 21:51:17 GMT",
"version": "v1"
}
] | 2020-12-16 | [
[
"Tu",
"Peihan",
""
],
[
"Wei",
"Li-Yi",
""
],
[
"Yatani",
"Koji",
""
],
[
"Igarashi",
"Takeo",
""
],
[
"Zwicker",
"Matthias",
""
]
] | Repetitive patterns are ubiquitous in natural and human-made objects, and can be created with a variety of tools and methods. Manual authoring provides unmatched degree of freedom and control, but can require significant artistic expertise and manual labor. Computational methods can automate parts of the manual creatio... |
2212.14527 | Sikun Yang | Sikun Yang, Hongyuan Zha | Estimating Latent Population Flows from Aggregated Data via Inversing
Multi-Marginal Optimal Transport | null | null | null | null | cs.LG | http://creativecommons.org/publicdomain/zero/1.0/ | We study the problem of estimating latent population flows from aggregated
count data. This problem arises when individual trajectories are not available
due to privacy issues or measurement fidelity. Instead, the aggregated
observations are measured over discrete-time points, for estimating the
population flows amon... | [
{
"created": "Fri, 30 Dec 2022 03:03:23 GMT",
"version": "v1"
}
] | 2023-01-02 | [
[
"Yang",
"Sikun",
""
],
[
"Zha",
"Hongyuan",
""
]
] | We study the problem of estimating latent population flows from aggregated count data. This problem arises when individual trajectories are not available due to privacy issues or measurement fidelity. Instead, the aggregated observations are measured over discrete-time points, for estimating the population flows among ... |
1612.04164 | Stefan Wagner | Sebastian V\"ost and Stefan Wagner | Keeping Continuous Deliveries Safe | 4 pages, 3 figures | ICSE-C '17 Proceedings of the 39th International Conference on
Software Engineering Companion, pages 259-261. IEEE, 2017 | 10.1109/ICSE-C.2017.135 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Allowing swift release cycles, Continuous Delivery has become popular in
application software development and is starting to be applied in
safety-critical domains such as the automotive industry. These domains require
thorough analysis regarding safety constraints, which can be achieved by formal
verification and the... | [
{
"created": "Tue, 13 Dec 2016 13:38:24 GMT",
"version": "v1"
}
] | 2017-11-15 | [
[
"Vöst",
"Sebastian",
""
],
[
"Wagner",
"Stefan",
""
]
] | Allowing swift release cycles, Continuous Delivery has become popular in application software development and is starting to be applied in safety-critical domains such as the automotive industry. These domains require thorough analysis regarding safety constraints, which can be achieved by formal verification and the e... |
2404.03099 | Leonardo Ferreira Guilhoto | Leonardo Ferreira Guilhoto, Paris Perdikaris | Composite Bayesian Optimization In Function Spaces Using NEON -- Neural
Epistemic Operator Networks | null | null | null | null | cs.LG cs.AI cs.CE cs.IT math.IT stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Operator learning is a rising field of scientific computing where inputs or
outputs of a machine learning model are functions defined in
infinite-dimensional spaces. In this paper, we introduce NEON (Neural Epistemic
Operator Networks), an architecture for generating predictions with uncertainty
using a single operat... | [
{
"created": "Wed, 3 Apr 2024 22:42:37 GMT",
"version": "v1"
}
] | 2024-04-05 | [
[
"Guilhoto",
"Leonardo Ferreira",
""
],
[
"Perdikaris",
"Paris",
""
]
] | Operator learning is a rising field of scientific computing where inputs or outputs of a machine learning model are functions defined in infinite-dimensional spaces. In this paper, we introduce NEON (Neural Epistemic Operator Networks), an architecture for generating predictions with uncertainty using a single operator... |
1802.10233 | Daniel Lemire | Edmon Begoli, Jes\'us Camacho Rodr\'iguez, Julian Hyde, Michael J.
Mior, Daniel Lemire | Apache Calcite: A Foundational Framework for Optimized Query Processing
Over Heterogeneous Data Sources | SIGMOD'18 | null | 10.1145/3183713.3190662 | null | cs.DB | http://creativecommons.org/licenses/by/4.0/ | Apache Calcite is a foundational software framework that provides query
processing, optimization, and query language support to many popular
open-source data processing systems such as Apache Hive, Apache Storm, Apache
Flink, Druid, and MapD. Calcite's architecture consists of a modular and
extensible query optimizer... | [
{
"created": "Wed, 28 Feb 2018 02:10:36 GMT",
"version": "v1"
}
] | 2020-10-09 | [
[
"Begoli",
"Edmon",
""
],
[
"Rodríguez",
"Jesús Camacho",
""
],
[
"Hyde",
"Julian",
""
],
[
"Mior",
"Michael J.",
""
],
[
"Lemire",
"Daniel",
""
]
] | Apache Calcite is a foundational software framework that provides query processing, optimization, and query language support to many popular open-source data processing systems such as Apache Hive, Apache Storm, Apache Flink, Druid, and MapD. Calcite's architecture consists of a modular and extensible query optimizer w... |
2006.05814 | Paul Mireault | Paul Mireault | Implementation Strategies for Multidimensional Spreadsheets | 12 Pages, 18 Colour Figures. arXiv admin note: text overlap with
arXiv:1801.09777 | Proceedings of the EuSpRIG 2019 Conference "Spreadsheet Risk
Management", Browns, Covent Garden, London, pp103-114, ISBN:
978-1-905404-56-8 | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Seasoned Excel developers were invited to participate in a challenge to
implement a spreadsheet with multi-dimensional variables. We analyzed their
spreadsheet to see the different implement strategies employed. We identified
two strategies: most participants used a projection of three or
four-dimensional variables o... | [
{
"created": "Thu, 4 Jun 2020 21:12:06 GMT",
"version": "v1"
}
] | 2020-06-11 | [
[
"Mireault",
"Paul",
""
]
] | Seasoned Excel developers were invited to participate in a challenge to implement a spreadsheet with multi-dimensional variables. We analyzed their spreadsheet to see the different implement strategies employed. We identified two strategies: most participants used a projection of three or four-dimensional variables on ... |
2004.00307 | Filipe Assun\c{c}\~ao | Filipe Assun\c{c}\~ao, Nuno Louren\c{c}o, Bernardete Ribeiro, and
Penousal Machado | Evolution of Scikit-Learn Pipelines with Dynamic Structured Grammatical
Evolution | EvoApps 2020 | null | null | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The deployment of Machine Learning (ML) models is a difficult and
time-consuming job that comprises a series of sequential and correlated tasks
that go from the data pre-processing, and the design and extraction of
features, to the choice of the ML algorithm and its parameterisation. The task
is even more challenging... | [
{
"created": "Wed, 1 Apr 2020 09:31:34 GMT",
"version": "v1"
}
] | 2020-04-02 | [
[
"Assunção",
"Filipe",
""
],
[
"Lourenço",
"Nuno",
""
],
[
"Ribeiro",
"Bernardete",
""
],
[
"Machado",
"Penousal",
""
]
] | The deployment of Machine Learning (ML) models is a difficult and time-consuming job that comprises a series of sequential and correlated tasks that go from the data pre-processing, and the design and extraction of features, to the choice of the ML algorithm and its parameterisation. The task is even more challenging c... |
2407.03059 | Mariia Vladimirova | Mariia Vladimirova, Federico Pavone, Eustache Diemert | FairJob: A Real-World Dataset for Fairness in Online Systems | 24 pages, 15 figures | null | null | null | cs.LG cs.AI cs.CY stat.ML | http://creativecommons.org/licenses/by/4.0/ | We introduce a fairness-aware dataset for job recommendation in advertising,
designed to foster research in algorithmic fairness within real-world
scenarios. It was collected and prepared to comply with privacy standards and
business confidentiality. An additional challenge is the lack of access to
protected user att... | [
{
"created": "Wed, 3 Jul 2024 12:30:39 GMT",
"version": "v1"
}
] | 2024-07-04 | [
[
"Vladimirova",
"Mariia",
""
],
[
"Pavone",
"Federico",
""
],
[
"Diemert",
"Eustache",
""
]
] | We introduce a fairness-aware dataset for job recommendation in advertising, designed to foster research in algorithmic fairness within real-world scenarios. It was collected and prepared to comply with privacy standards and business confidentiality. An additional challenge is the lack of access to protected user attri... |
2001.10721 | Shunchuan Yang | Yu Cheng, Guangzhi Chen, Xiang-Hua Wang, and Shunchuan Yang | Investigation of Numerical Dispersion with Time Step of The FDTD
Methods: Avoiding Erroneous Conclusions | null | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is widely thought that small time steps lead to small numerical errors in
the finite-difference time-domain (FDTD) simulations. In this paper, we
investigated how time steps impact on numerical dispersion of two FDTD methods
including the FDTD(2,2) method and the FDTD(2,4) method. Through rigorously
analytical and... | [
{
"created": "Wed, 29 Jan 2020 08:28:46 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Feb 2020 16:46:30 GMT",
"version": "v2"
}
] | 2020-02-21 | [
[
"Cheng",
"Yu",
""
],
[
"Chen",
"Guangzhi",
""
],
[
"Wang",
"Xiang-Hua",
""
],
[
"Yang",
"Shunchuan",
""
]
] | It is widely thought that small time steps lead to small numerical errors in the finite-difference time-domain (FDTD) simulations. In this paper, we investigated how time steps impact on numerical dispersion of two FDTD methods including the FDTD(2,2) method and the FDTD(2,4) method. Through rigorously analytical and n... |
2205.09453 | Roxana Danger | Roxana Danger | Differential Privacy: What is all the noise about? | 27 pages, 7 figures | null | null | null | cs.CR cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Differential Privacy (DP) is a formal definition of privacy that provides
rigorous guarantees against risks of privacy breaches during data processing.
It makes no assumptions about the knowledge or computational power of
adversaries, and provides an interpretable, quantifiable and composable
formalism. DP has been a... | [
{
"created": "Thu, 19 May 2022 10:12:29 GMT",
"version": "v1"
}
] | 2022-05-20 | [
[
"Danger",
"Roxana",
""
]
] | Differential Privacy (DP) is a formal definition of privacy that provides rigorous guarantees against risks of privacy breaches during data processing. It makes no assumptions about the knowledge or computational power of adversaries, and provides an interpretable, quantifiable and composable formalism. DP has been act... |
1807.04118 | Takumi Ichimura | Takumi Ichimura, Takuya Uemoto, Akira Hara | Emergence of Altruism Behavior for Multi Feeding Areas in Army Ant
Social Evolutionary System | 6 pages, 11 figures | Proc. of 2014 IEEE International Conference on Systems, Man, and
Cybernetics (IEEE SMC 2014) | 10.1109/SMC.2014.6973902 | null | cs.MA cs.ET cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Army ants perform the altruism that an ant sacrifices its own well-being for
the benefit of another ants. Army ants build bridges using their own bodies
along the path from a food to the nest. We developed the army ant inspired
social evolutionary system which can perform the altruism. The system has 2
kinds of ant a... | [
{
"created": "Tue, 10 Jul 2018 04:40:38 GMT",
"version": "v1"
}
] | 2018-07-12 | [
[
"Ichimura",
"Takumi",
""
],
[
"Uemoto",
"Takuya",
""
],
[
"Hara",
"Akira",
""
]
] | Army ants perform the altruism that an ant sacrifices its own well-being for the benefit of another ants. Army ants build bridges using their own bodies along the path from a food to the nest. We developed the army ant inspired social evolutionary system which can perform the altruism. The system has 2 kinds of ant age... |
2106.11097 | Pengfei Xiong | Han Fang, Pengfei Xiong, Luhui Xu, Yu Chen | CLIP2Video: Mastering Video-Text Retrieval via Image CLIP | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present CLIP2Video network to transfer the image-language pre-training
model to video-text retrieval in an end-to-end manner. Leading approaches in
the domain of video-and-language learning try to distill the spatio-temporal
video features and multi-modal interaction between videos and languages from a
large-scale... | [
{
"created": "Mon, 21 Jun 2021 13:30:33 GMT",
"version": "v1"
}
] | 2021-06-22 | [
[
"Fang",
"Han",
""
],
[
"Xiong",
"Pengfei",
""
],
[
"Xu",
"Luhui",
""
],
[
"Chen",
"Yu",
""
]
] | We present CLIP2Video network to transfer the image-language pre-training model to video-text retrieval in an end-to-end manner. Leading approaches in the domain of video-and-language learning try to distill the spatio-temporal video features and multi-modal interaction between videos and languages from a large-scale v... |
0906.2135 | Michael Nelson | Herbert Van de Sompel, Carl Lagoze, Michael L. Nelson, Simeon Warner,
Robert Sanderson, Pete Johnston | Adding eScience Assets to the Data Web | 10 pages, 7 figures. Proceedings of Linked Data on the Web (LDOW2009)
Workshop | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Aggregations of Web resources are increasingly important in scholarship as it
adopts new methods that are data-centric, collaborative, and networked-based.
The same notion of aggregations of resources is common to the mashed-up,
socially networked information environment of Web 2.0. We present a mechanism
to identify... | [
{
"created": "Thu, 11 Jun 2009 15:33:37 GMT",
"version": "v1"
}
] | 2009-06-12 | [
[
"Van de Sompel",
"Herbert",
""
],
[
"Lagoze",
"Carl",
""
],
[
"Nelson",
"Michael L.",
""
],
[
"Warner",
"Simeon",
""
],
[
"Sanderson",
"Robert",
""
],
[
"Johnston",
"Pete",
""
]
] | Aggregations of Web resources are increasingly important in scholarship as it adopts new methods that are data-centric, collaborative, and networked-based. The same notion of aggregations of resources is common to the mashed-up, socially networked information environment of Web 2.0. We present a mechanism to identify a... |
1312.6461 | Sho Sonoda | Sho Sonoda, Noboru Murata | Nonparametric Weight Initialization of Neural Networks via Integral
Representation | For ICLR2014, revised into 9 pages; revised into 12 pages (with
supplements) | null | null | null | cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A new initialization method for hidden parameters in a neural network is
proposed. Derived from the integral representation of the neural network, a
nonparametric probability distribution of hidden parameters is introduced. In
this proposal, hidden parameters are initialized by samples drawn from this
distribution, a... | [
{
"created": "Mon, 23 Dec 2013 03:23:04 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Dec 2013 02:54:29 GMT",
"version": "v2"
},
{
"created": "Wed, 19 Feb 2014 20:02:05 GMT",
"version": "v3"
}
] | 2014-02-20 | [
[
"Sonoda",
"Sho",
""
],
[
"Murata",
"Noboru",
""
]
] | A new initialization method for hidden parameters in a neural network is proposed. Derived from the integral representation of the neural network, a nonparametric probability distribution of hidden parameters is introduced. In this proposal, hidden parameters are initialized by samples drawn from this distribution, and... |
1811.06295 | Chen Du | Chen Du, Chunheng Wang, Yanna Wang, Cunzhao Shi, Baihua Xiao | Selective Feature Connection Mechanism: Concatenating Multi-layer CNN
Features with a Feature Selector | The paper is under consideration at Pattern Recognition Letters | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Different layers of deep convolutional neural networks(CNNs) can encode
different-level information. High-layer features always contain more semantic
information, and low-layer features contain more detail information. However,
low-layer features suffer from the background clutter and semantic ambiguity.
During visua... | [
{
"created": "Thu, 15 Nov 2018 10:58:21 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Apr 2019 05:53:51 GMT",
"version": "v2"
},
{
"created": "Sun, 21 Apr 2019 07:44:13 GMT",
"version": "v3"
}
] | 2019-04-23 | [
[
"Du",
"Chen",
""
],
[
"Wang",
"Chunheng",
""
],
[
"Wang",
"Yanna",
""
],
[
"Shi",
"Cunzhao",
""
],
[
"Xiao",
"Baihua",
""
]
] | Different layers of deep convolutional neural networks(CNNs) can encode different-level information. High-layer features always contain more semantic information, and low-layer features contain more detail information. However, low-layer features suffer from the background clutter and semantic ambiguity. During visual ... |
1902.09759 | Shuai Wang | Shuai Wang, Minghua Xia, and Yik-Chung Wu | Joint Communication and Motion Energy Minimization in UGV Backscatter
Communication | Proc. IEEE ICC'19, Shanghai, China, May 2019, 6 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While backscatter communication emerges as a promising solution to reduce
power consumption at IoT devices, the transmission range of backscatter
communication is short. To this end, this work integrates unmanned ground
vehicles (UGVs) into the backscatter system. With such a scheme, the UGV could
facilitate the comm... | [
{
"created": "Tue, 26 Feb 2019 06:55:37 GMT",
"version": "v1"
}
] | 2019-02-27 | [
[
"Wang",
"Shuai",
""
],
[
"Xia",
"Minghua",
""
],
[
"Wu",
"Yik-Chung",
""
]
] | While backscatter communication emerges as a promising solution to reduce power consumption at IoT devices, the transmission range of backscatter communication is short. To this end, this work integrates unmanned ground vehicles (UGVs) into the backscatter system. With such a scheme, the UGV could facilitate the commun... |
2210.09347 | Huy Ha | Alper Canberk, Cheng Chi, Huy Ha, Benjamin Burchfiel, Eric Cousineau,
Siyuan Feng, Shuran Song | Cloth Funnels: Canonicalized-Alignment for Multi-Purpose Garment
Manipulation | 8 pages, 8 figures, website at https://clothfunnels.cs.columbia.edu/ | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Automating garment manipulation is challenging due to extremely high
variability in object configurations. To reduce this intrinsic variation, we
introduce the task of "canonicalized-alignment" that simplifies downstream
applications by reducing the possible garment configurations. This task can be
considered as "clo... | [
{
"created": "Mon, 17 Oct 2022 18:36:59 GMT",
"version": "v1"
}
] | 2022-10-19 | [
[
"Canberk",
"Alper",
""
],
[
"Chi",
"Cheng",
""
],
[
"Ha",
"Huy",
""
],
[
"Burchfiel",
"Benjamin",
""
],
[
"Cousineau",
"Eric",
""
],
[
"Feng",
"Siyuan",
""
],
[
"Song",
"Shuran",
""
]
] | Automating garment manipulation is challenging due to extremely high variability in object configurations. To reduce this intrinsic variation, we introduce the task of "canonicalized-alignment" that simplifies downstream applications by reducing the possible garment configurations. This task can be considered as "cloth... |
2201.01391 | Ademola Okerinde | Ademola Okerinde and Sam Hoggatt and Divya Vani Lakkireddy and Nolan
Brubaker and William Hsu and Lior Shamir and Brian Spiesman | Self-Supervised Approach to Addressing Zero-Shot Learning Problem | null | The 4th International Conference on Computing and Data Science
(CONF-CDS 2022) | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | In recent years, self-supervised learning has had significant success in
applications involving computer vision and natural language processing. The
type of pretext task is important to this boost in performance. One common
pretext task is the measure of similarity and dissimilarity between pairs of
images. In this s... | [
{
"created": "Wed, 5 Jan 2022 00:08:36 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Jan 2022 14:09:29 GMT",
"version": "v2"
}
] | 2022-01-24 | [
[
"Okerinde",
"Ademola",
""
],
[
"Hoggatt",
"Sam",
""
],
[
"Lakkireddy",
"Divya Vani",
""
],
[
"Brubaker",
"Nolan",
""
],
[
"Hsu",
"William",
""
],
[
"Shamir",
"Lior",
""
],
[
"Spiesman",
"Brian",
""
]
] | In recent years, self-supervised learning has had significant success in applications involving computer vision and natural language processing. The type of pretext task is important to this boost in performance. One common pretext task is the measure of similarity and dissimilarity between pairs of images. In this sce... |
2205.03651 | Manjanna Basappa | Vishwanath R. Singireddy and Manjanna Basappa | Dispersing Facilities on Planar Segment and Circle Amidst Repulsion | 16 figures | null | null | null | cs.CG | http://creativecommons.org/licenses/by/4.0/ | In this paper we consider the problem of locating $k$ obnoxious facilities
(congruent disks of maximum radius) amidst $n$ demand points (existing
repulsive facility sites) ordered from left to right in the plane so that none
of the existing facility sites are affected (no demand point falls in the
interior of the dis... | [
{
"created": "Sat, 7 May 2022 13:16:04 GMT",
"version": "v1"
},
{
"created": "Thu, 12 May 2022 11:17:01 GMT",
"version": "v2"
}
] | 2022-05-13 | [
[
"Singireddy",
"Vishwanath R.",
""
],
[
"Basappa",
"Manjanna",
""
]
] | In this paper we consider the problem of locating $k$ obnoxious facilities (congruent disks of maximum radius) amidst $n$ demand points (existing repulsive facility sites) ordered from left to right in the plane so that none of the existing facility sites are affected (no demand point falls in the interior of the disks... |
2401.06826 | Jialiang Tang | Jialiang Tang, Shuo Chen, Gang Niu, Hongyuan Zhu, Joey Tianyi Zhou,
Chen Gong, Masashi Sugiyama | Direct Distillation between Different Domains | null | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge Distillation (KD) aims to learn a compact student network using
knowledge from a large pre-trained teacher network, where both networks are
trained on data from the same distribution. However, in practical applications,
the student network may be required to perform in a new scenario (i.e., the
target domai... | [
{
"created": "Fri, 12 Jan 2024 02:48:51 GMT",
"version": "v1"
}
] | 2024-01-17 | [
[
"Tang",
"Jialiang",
""
],
[
"Chen",
"Shuo",
""
],
[
"Niu",
"Gang",
""
],
[
"Zhu",
"Hongyuan",
""
],
[
"Zhou",
"Joey Tianyi",
""
],
[
"Gong",
"Chen",
""
],
[
"Sugiyama",
"Masashi",
""
]
] | Knowledge Distillation (KD) aims to learn a compact student network using knowledge from a large pre-trained teacher network, where both networks are trained on data from the same distribution. However, in practical applications, the student network may be required to perform in a new scenario (i.e., the target domain)... |
2312.16174 | Yujiao Hu | Yujiao Hu, Qingmin Jia, Yuao Yao, Yong Lee, Mengjie Lee, Chenyi Wang,
Xiaomao Zhou, Renchao Xie, F. Richard Yu | Industrial Internet of Things Intelligence Empowering Smart
Manufacturing: A Literature Review | Accepted by IoTJ | IEEE Internet of Things Journal,2024 | 10.1109/JIOT.2024.3367692 | null | cs.AI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The fiercely competitive business environment and increasingly personalized
customization needs are driving the digital transformation and upgrading of the
manufacturing industry. IIoT intelligence, which can provide innovative and
efficient solutions for various aspects of the manufacturing value chain,
illuminates ... | [
{
"created": "Sat, 2 Dec 2023 06:08:39 GMT",
"version": "v1"
},
{
"created": "Thu, 22 Feb 2024 02:28:57 GMT",
"version": "v2"
}
] | 2024-02-23 | [
[
"Hu",
"Yujiao",
""
],
[
"Jia",
"Qingmin",
""
],
[
"Yao",
"Yuao",
""
],
[
"Lee",
"Yong",
""
],
[
"Lee",
"Mengjie",
""
],
[
"Wang",
"Chenyi",
""
],
[
"Zhou",
"Xiaomao",
""
],
[
"Xie",
"Renchao",
... | The fiercely competitive business environment and increasingly personalized customization needs are driving the digital transformation and upgrading of the manufacturing industry. IIoT intelligence, which can provide innovative and efficient solutions for various aspects of the manufacturing value chain, illuminates th... |
1907.05205 | Vidyasagar Sadhu | Vidyasagar Sadhu, Sanjana Devaraj, Dario Pompili | Towards Ultra-low-power Realization of Analog Joint Source-Channel
Coding using MOSFETs | 5 pages, IEEE ISCAS 2019. arXiv admin note: text overlap with
arXiv:1907.00968 | 2019 IEEE International Symposium on Circuits and Systems (ISCAS),
Sapporo, Japan, 2019, pp. 1-5 | 10.1109/ISCAS.2019.8702302 | null | cs.ET cs.NI eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Certain sensing applications such as Internet of Things (IoTs), where the
sensing phenomenon may change rapidly in both time and space, requires sensors
that consume ultra-low power (so that they do not need to be put to sleep
leading to loss of temporal and spatial resolution) and have low costs (for
high density de... | [
{
"created": "Sun, 30 Jun 2019 06:46:58 GMT",
"version": "v1"
}
] | 2019-07-12 | [
[
"Sadhu",
"Vidyasagar",
""
],
[
"Devaraj",
"Sanjana",
""
],
[
"Pompili",
"Dario",
""
]
] | Certain sensing applications such as Internet of Things (IoTs), where the sensing phenomenon may change rapidly in both time and space, requires sensors that consume ultra-low power (so that they do not need to be put to sleep leading to loss of temporal and spatial resolution) and have low costs (for high density depl... |
1902.04742 | Vaishnavh Nagarajan | Vaishnavh Nagarajan, J. Zico Kolter | Uniform convergence may be unable to explain generalization in deep
learning | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Aimed at explaining the surprisingly good generalization behavior of
overparameterized deep networks, recent works have developed a variety of
generalization bounds for deep learning, all based on the fundamental
learning-theoretic technique of uniform convergence. While it is well-known
that many of these existing b... | [
{
"created": "Wed, 13 Feb 2019 05:09:38 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Apr 2019 17:20:02 GMT",
"version": "v2"
},
{
"created": "Thu, 19 Dec 2019 20:09:41 GMT",
"version": "v3"
},
{
"created": "Sun, 17 Oct 2021 20:04:09 GMT",
"version": "v4"
}
] | 2021-10-19 | [
[
"Nagarajan",
"Vaishnavh",
""
],
[
"Kolter",
"J. Zico",
""
]
] | Aimed at explaining the surprisingly good generalization behavior of overparameterized deep networks, recent works have developed a variety of generalization bounds for deep learning, all based on the fundamental learning-theoretic technique of uniform convergence. While it is well-known that many of these existing bou... |
2311.10372 | Kaiwen Ning | Zibin Zheng and Kaiwen Ning and Yanlin Wang and Jingwen Zhang and Dewu
Zheng and Mingxi Ye and Jiachi Chen | A Survey of Large Language Models for Code: Evolution, Benchmarking, and
Future Trends | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | General large language models (LLMs), represented by ChatGPT, have
demonstrated significant potential in tasks such as code generation in software
engineering. This has led to the development of specialized LLMs for software
engineering, known as Code LLMs. A considerable portion of Code LLMs is derived
from general ... | [
{
"created": "Fri, 17 Nov 2023 07:55:16 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Jan 2024 05:41:51 GMT",
"version": "v2"
}
] | 2024-01-09 | [
[
"Zheng",
"Zibin",
""
],
[
"Ning",
"Kaiwen",
""
],
[
"Wang",
"Yanlin",
""
],
[
"Zhang",
"Jingwen",
""
],
[
"Zheng",
"Dewu",
""
],
[
"Ye",
"Mingxi",
""
],
[
"Chen",
"Jiachi",
""
]
] | General large language models (LLMs), represented by ChatGPT, have demonstrated significant potential in tasks such as code generation in software engineering. This has led to the development of specialized LLMs for software engineering, known as Code LLMs. A considerable portion of Code LLMs is derived from general LL... |
1806.00801 | Gui-Song Xia | Pu Jin, Gui-Song Xia, Fan Hu, Qikai Lu, Liangpei Zhang | AID++: An Updated Version of AID on Scene Classification | IGARSS'18 conference paper | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Aerial image scene classification is a fundamental problem for understanding
high-resolution remote sensing images and has become an active research task in
the field of remote sensing due to its important role in a wide range of
applications. However, the limitations of existing datasets for scene
classification, su... | [
{
"created": "Sun, 3 Jun 2018 14:40:20 GMT",
"version": "v1"
}
] | 2018-06-05 | [
[
"Jin",
"Pu",
""
],
[
"Xia",
"Gui-Song",
""
],
[
"Hu",
"Fan",
""
],
[
"Lu",
"Qikai",
""
],
[
"Zhang",
"Liangpei",
""
]
] | Aerial image scene classification is a fundamental problem for understanding high-resolution remote sensing images and has become an active research task in the field of remote sensing due to its important role in a wide range of applications. However, the limitations of existing datasets for scene classification, such... |
1809.02768 | Yifan Gao | Yifan Gao, Lidong Bing, Piji Li, Irwin King, Michael R. Lyu | Generating Distractors for Reading Comprehension Questions from Real
Examinations | AAAI2019 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the task of distractor generation for multiple choice reading
comprehension questions from examinations. In contrast to all previous works,
we do not aim at preparing words or short phrases distractors, instead, we
endeavor to generate longer and semantic-rich distractors which are closer to
distractor... | [
{
"created": "Sat, 8 Sep 2018 07:11:15 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Dec 2018 07:04:50 GMT",
"version": "v2"
}
] | 2018-12-19 | [
[
"Gao",
"Yifan",
""
],
[
"Bing",
"Lidong",
""
],
[
"Li",
"Piji",
""
],
[
"King",
"Irwin",
""
],
[
"Lyu",
"Michael R.",
""
]
] | We investigate the task of distractor generation for multiple choice reading comprehension questions from examinations. In contrast to all previous works, we do not aim at preparing words or short phrases distractors, instead, we endeavor to generate longer and semantic-rich distractors which are closer to distractors ... |
2308.16822 | Arthur Leroy | Chunchao Ma, Arthur Leroy, Mauricio Alvarez | Latent Variable Multi-output Gaussian Processes for Hierarchical
Datasets | 29 pages | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Multi-output Gaussian processes (MOGPs) have been introduced to deal with
multiple tasks by exploiting the correlations between different outputs.
Generally, MOGPs models assume a flat correlation structure between the
outputs. However, such a formulation does not account for more elaborate
relationships, for instanc... | [
{
"created": "Thu, 31 Aug 2023 15:52:35 GMT",
"version": "v1"
}
] | 2023-09-01 | [
[
"Ma",
"Chunchao",
""
],
[
"Leroy",
"Arthur",
""
],
[
"Alvarez",
"Mauricio",
""
]
] | Multi-output Gaussian processes (MOGPs) have been introduced to deal with multiple tasks by exploiting the correlations between different outputs. Generally, MOGPs models assume a flat correlation structure between the outputs. However, such a formulation does not account for more elaborate relationships, for instance,... |
1909.03723 | Marco Virgolin | Marco Virgolin, Ziyuan Wang, Tanja Alderliesten, Peter A. N. Bosman | Machine learning for automatic construction of pseudo-realistic
pediatric abdominal phantoms | Currently submitted to SPIE Medical Imaging journal | null | null | null | cs.LG physics.med-ph stat.AP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine Learning (ML) is proving extremely beneficial in many healthcare
applications. In pediatric oncology, retrospective studies that investigate the
relationship between treatment and late adverse effects still rely on simple
heuristics. To assess the effects of radiation therapy, treatment plans are
typically si... | [
{
"created": "Mon, 9 Sep 2019 09:38:22 GMT",
"version": "v1"
}
] | 2019-09-10 | [
[
"Virgolin",
"Marco",
""
],
[
"Wang",
"Ziyuan",
""
],
[
"Alderliesten",
"Tanja",
""
],
[
"Bosman",
"Peter A. N.",
""
]
] | Machine Learning (ML) is proving extremely beneficial in many healthcare applications. In pediatric oncology, retrospective studies that investigate the relationship between treatment and late adverse effects still rely on simple heuristics. To assess the effects of radiation therapy, treatment plans are typically simu... |
2004.07798 | Neil Lutz | Jack H. Lutz, Neil Lutz, Elvira Mayordomo | Extending the Reach of the Point-to-Set Principle | null | null | null | null | cs.CC math.CA math.MG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled
the theory of computing to be used to answer open questions about fractal
geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions,
meaning that their statements do not involve computation or related aspects of
logic.
In... | [
{
"created": "Thu, 16 Apr 2020 17:43:37 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Oct 2020 19:28:01 GMT",
"version": "v2"
},
{
"created": "Sat, 13 Feb 2021 22:53:18 GMT",
"version": "v3"
}
] | 2021-02-16 | [
[
"Lutz",
"Jack H.",
""
],
[
"Lutz",
"Neil",
""
],
[
"Mayordomo",
"Elvira",
""
]
] | The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that their statements do not involve computation or related aspects of logic. In thi... |
1104.0919 | Benjamin Burton | Benjamin A. Burton and Mathias Hiron | Locating regions in a sequence under density constraints | 17 pages, 8 figures; v2: minor revisions, additional explanations; to
appear in SIAM Journal on Computing | SIAM Journal on Computing 42 (2013), no. 3, 1201-1215 | 10.1137/110830605 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Several biological problems require the identification of regions in a
sequence where some feature occurs within a target density range: examples
including the location of GC-rich regions, identification of CpG islands, and
sequence matching. Mathematically, this corresponds to searching a string of 0s
and 1s for a s... | [
{
"created": "Tue, 5 Apr 2011 19:42:00 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Apr 2013 21:14:45 GMT",
"version": "v2"
}
] | 2013-08-15 | [
[
"Burton",
"Benjamin A.",
""
],
[
"Hiron",
"Mathias",
""
]
] | Several biological problems require the identification of regions in a sequence where some feature occurs within a target density range: examples including the location of GC-rich regions, identification of CpG islands, and sequence matching. Mathematically, this corresponds to searching a string of 0s and 1s for a sub... |
1902.06531 | Yansong Gao Dr | Yansong Gao, Chang Xu, Derui Wang, Shiping Chen, Damith C.Ranasinghe,
Surya Nepal | STRIP: A Defence Against Trojan Attacks on Deep Neural Networks | 13 pages | In 2019 Annual Computer Security Applications Conference (ACSAC
19), December 9-13, 2019, San Juan, PR, USA. ACM, New York, NY, USA | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A recent trojan attack on deep neural network (DNN) models is one insidious
variant of data poisoning attacks. Trojan attacks exploit an effective backdoor
created in a DNN model by leveraging the difficulty in interpretability of the
learned model to misclassify any inputs signed with the attacker's chosen
trojan tr... | [
{
"created": "Mon, 18 Feb 2019 11:49:33 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Jan 2020 03:27:26 GMT",
"version": "v2"
}
] | 2020-01-20 | [
[
"Gao",
"Yansong",
""
],
[
"Xu",
"Chang",
""
],
[
"Wang",
"Derui",
""
],
[
"Chen",
"Shiping",
""
],
[
"Ranasinghe",
"Damith C.",
""
],
[
"Nepal",
"Surya",
""
]
] | A recent trojan attack on deep neural network (DNN) models is one insidious variant of data poisoning attacks. Trojan attacks exploit an effective backdoor created in a DNN model by leveraging the difficulty in interpretability of the learned model to misclassify any inputs signed with the attacker's chosen trojan trig... |
1905.04849 | Cai Shaofeng | Shaofeng Cai, Yao Shu, Wei Wang, Beng Chin Ooi | Dynamic Routing Networks | 10 pages, 3 figures, 3 tables | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The deployment of deep neural networks in real-world applications is mostly
restricted by their high inference costs. Extensive efforts have been made to
improve the accuracy with expert-designed or algorithm-searched architectures.
However, the incremental improvement is typically achieved with increasingly
more exp... | [
{
"created": "Mon, 13 May 2019 03:45:42 GMT",
"version": "v1"
},
{
"created": "Thu, 23 May 2019 16:45:18 GMT",
"version": "v2"
},
{
"created": "Thu, 24 Oct 2019 04:47:36 GMT",
"version": "v3"
},
{
"created": "Tue, 28 Jul 2020 16:26:29 GMT",
"version": "v4"
},
{
"c... | 2020-11-10 | [
[
"Cai",
"Shaofeng",
""
],
[
"Shu",
"Yao",
""
],
[
"Wang",
"Wei",
""
],
[
"Ooi",
"Beng Chin",
""
]
] | The deployment of deep neural networks in real-world applications is mostly restricted by their high inference costs. Extensive efforts have been made to improve the accuracy with expert-designed or algorithm-searched architectures. However, the incremental improvement is typically achieved with increasingly more expen... |
1405.4100 | Cristian Prisacariu | Cristian Prisacariu | Higher Dimensional Modal Logic | null | null | null | null | cs.LO | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Higher dimensional automata (HDA) are a model of concurrency that can express
most of the traditional partial order models like Mazurkiewicz traces, pomsets,
event structures, or Petri nets. Modal logics, interpreted over Kripke
structures, are the logics for reasoning about sequential behavior and
interleaved concur... | [
{
"created": "Fri, 16 May 2014 09:11:38 GMT",
"version": "v1"
}
] | 2014-05-19 | [
[
"Prisacariu",
"Cristian",
""
]
] | Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or Petri nets. Modal logics, interpreted over Kripke structures, are the logics for reasoning about sequential behavior and interleaved concurre... |
1704.08045 | Quynh Nguyen | Quynh Nguyen and Matthias Hein | The loss surface of deep and wide neural networks | ICML 2017. Main results now hold for larger classes of loss functions | null | null | null | cs.LG cs.AI cs.CV cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While the optimization problem behind deep neural networks is highly
non-convex, it is frequently observed in practice that training deep networks
seems possible without getting stuck in suboptimal points. It has been argued
that this is the case as all local minima are close to being globally optimal.
We show that t... | [
{
"created": "Wed, 26 Apr 2017 10:24:54 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Jun 2017 19:43:39 GMT",
"version": "v2"
}
] | 2017-06-14 | [
[
"Nguyen",
"Quynh",
""
],
[
"Hein",
"Matthias",
""
]
] | While the optimization problem behind deep neural networks is highly non-convex, it is frequently observed in practice that training deep networks seems possible without getting stuck in suboptimal points. It has been argued that this is the case as all local minima are close to being globally optimal. We show that thi... |
1911.09845 | Jun Gao | Jun Gao, Wei Bi, Xiaojiang Liu, Junhui Li, Guodong Zhou, Shuming Shi | A Discrete CVAE for Response Generation on Short-Text Conversation | Accepted for publication at EMNLP 2019 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural conversation models such as encoder-decoder models are easy to
generate bland and generic responses. Some researchers propose to use the
conditional variational autoencoder(CVAE) which maximizes the lower bound on
the conditional log-likelihood on a continuous latent variable. With different
sampled la-tent va... | [
{
"created": "Fri, 22 Nov 2019 04:14:31 GMT",
"version": "v1"
}
] | 2019-11-25 | [
[
"Gao",
"Jun",
""
],
[
"Bi",
"Wei",
""
],
[
"Liu",
"Xiaojiang",
""
],
[
"Li",
"Junhui",
""
],
[
"Zhou",
"Guodong",
""
],
[
"Shi",
"Shuming",
""
]
] | Neural conversation models such as encoder-decoder models are easy to generate bland and generic responses. Some researchers propose to use the conditional variational autoencoder(CVAE) which maximizes the lower bound on the conditional log-likelihood on a continuous latent variable. With different sampled la-tent vari... |
1701.04551 | Mingchao Yu | Mingchao Yu, Parastoo Sadeghi | Approximating Throughput and Packet Decoding Delay in Linear Network
Coded Wireless Broadcast | 5 pages, 2 figures, 1 table, submitted to ISIT2017 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study a wireless packet broadcast system that uses linear
network coding (LNC) to help receivers recover data packets that are missing
due to packet erasures. We study two intertwined performance metrics, namely
throughput and average packet decoding delay (APDD) and establish strong/weak
approximat... | [
{
"created": "Tue, 17 Jan 2017 07:26:00 GMT",
"version": "v1"
}
] | 2017-01-18 | [
[
"Yu",
"Mingchao",
""
],
[
"Sadeghi",
"Parastoo",
""
]
] | In this paper, we study a wireless packet broadcast system that uses linear network coding (LNC) to help receivers recover data packets that are missing due to packet erasures. We study two intertwined performance metrics, namely throughput and average packet decoding delay (APDD) and establish strong/weak approximatio... |
2404.00367 | Yan Zhang Main | Bin Wang, Yan Zhang, Yan Ma, Yaohui Jin, Yanyan Xu | SA-LSPL:Sequence-Aware Long- and Short- Term Preference Learning for
next POI recommendation | null | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The next Point of Interest (POI) recommendation aims to recommend the next
POI for users at a specific time. As users' check-in records can be viewed as a
long sequence, methods based on Recurrent Neural Networks (RNNs) have recently
shown good applicability to this task. However, existing methods often struggle
to f... | [
{
"created": "Sat, 30 Mar 2024 13:40:25 GMT",
"version": "v1"
}
] | 2024-04-02 | [
[
"Wang",
"Bin",
""
],
[
"Zhang",
"Yan",
""
],
[
"Ma",
"Yan",
""
],
[
"Jin",
"Yaohui",
""
],
[
"Xu",
"Yanyan",
""
]
] | The next Point of Interest (POI) recommendation aims to recommend the next POI for users at a specific time. As users' check-in records can be viewed as a long sequence, methods based on Recurrent Neural Networks (RNNs) have recently shown good applicability to this task. However, existing methods often struggle to ful... |
1303.5759 | Hong Xu | Hong Xu | An Efficient Implementation of Belief Function Propagation | Appears in Proceedings of the Seventh Conference on Uncertainty in
Artificial Intelligence (UAI1991) | null | null | UAI-P-1991-PG-425-432 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The local computation technique (Shafer et al. 1987, Shafer and Shenoy 1988,
Shenoy and Shafer 1986) is used for propagating belief functions in so called a
Markov Tree. In this paper, we describe an efficient implementation of belief
function propagation on the basis of the local computation technique. The
presented... | [
{
"created": "Wed, 20 Mar 2013 15:34:07 GMT",
"version": "v1"
}
] | 2013-03-26 | [
[
"Xu",
"Hong",
""
]
] | The local computation technique (Shafer et al. 1987, Shafer and Shenoy 1988, Shenoy and Shafer 1986) is used for propagating belief functions in so called a Markov Tree. In this paper, we describe an efficient implementation of belief function propagation on the basis of the local computation technique. The presented m... |
2204.07936 | Jessica Leu | Jessica Leu, Yujiao Cheng, Changliu Liu, Masayoshi Tomizuka | Robust Task Planning for Assembly Lines with Human-Robot Collaboration | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Efficient and robust task planning for a human-robot collaboration (HRC)
system remains challenging. The human-aware task planner needs to assign jobs
to both robots and human workers so that they can work collaboratively to
achieve better time efficiency. However, the complexity of the tasks and the
stochastic natur... | [
{
"created": "Sun, 17 Apr 2022 05:54:01 GMT",
"version": "v1"
}
] | 2022-04-19 | [
[
"Leu",
"Jessica",
""
],
[
"Cheng",
"Yujiao",
""
],
[
"Liu",
"Changliu",
""
],
[
"Tomizuka",
"Masayoshi",
""
]
] | Efficient and robust task planning for a human-robot collaboration (HRC) system remains challenging. The human-aware task planner needs to assign jobs to both robots and human workers so that they can work collaboratively to achieve better time efficiency. However, the complexity of the tasks and the stochastic nature ... |
2104.10715 | Rishab Khincha | Utkarsh Sarawgi, Rishab Khincha, Wazeer Zulfikar, Satrajit Ghosh,
Pattie Maes | Uncertainty-Aware Boosted Ensembling in Multi-Modal Settings | Accepted at IJCNN 2021, to appear in IEEE proceedings. Equal
contributions from US, RK and WZ | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Reliability of machine learning (ML) systems is crucial in safety-critical
applications such as healthcare, and uncertainty estimation is a widely
researched method to highlight the confidence of ML systems in deployment.
Sequential and parallel ensemble techniques have shown improved performance of
ML systems in mul... | [
{
"created": "Wed, 21 Apr 2021 18:28:13 GMT",
"version": "v1"
}
] | 2021-04-23 | [
[
"Sarawgi",
"Utkarsh",
""
],
[
"Khincha",
"Rishab",
""
],
[
"Zulfikar",
"Wazeer",
""
],
[
"Ghosh",
"Satrajit",
""
],
[
"Maes",
"Pattie",
""
]
] | Reliability of machine learning (ML) systems is crucial in safety-critical applications such as healthcare, and uncertainty estimation is a widely researched method to highlight the confidence of ML systems in deployment. Sequential and parallel ensemble techniques have shown improved performance of ML systems in multi... |
2005.03210 | Dylan Losey | Hong Jun Jeon, Dylan P. Losey, Dorsa Sadigh | Shared Autonomy with Learned Latent Actions | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Assistive robots enable people with disabilities to conduct everyday tasks on
their own. However, these tasks can be complex, containing both coarse reaching
motions and fine-grained manipulation. For example, when eating, not only does
one need to move to the correct food item, but they must also precisely
manipulat... | [
{
"created": "Thu, 7 May 2020 02:39:56 GMT",
"version": "v1"
},
{
"created": "Mon, 11 May 2020 16:50:25 GMT",
"version": "v2"
}
] | 2020-05-12 | [
[
"Jeon",
"Hong Jun",
""
],
[
"Losey",
"Dylan P.",
""
],
[
"Sadigh",
"Dorsa",
""
]
] | Assistive robots enable people with disabilities to conduct everyday tasks on their own. However, these tasks can be complex, containing both coarse reaching motions and fine-grained manipulation. For example, when eating, not only does one need to move to the correct food item, but they must also precisely manipulate ... |
cs/0605060 | Rajiv Ranjan Mr. | Rajiv Ranjan, Aaron Harwood and Rajkumar Buyya | A Case for Cooperative and Incentive-Based Coupling of Distributed
Clusters | 22 pages, extended version of the conference paper published at IEEE
Cluster'05, Boston, MA | In Proceedings of the 7th IEEE International Conference on Cluster
Computing (Cluster 2005), IEEE Computer Society Press, September 27 - 30,
2005, Boston, Massachusetts, USA. | 10.1109/CLUSTR.2005.347038 | null | cs.DC | null | Research interest in Grid computing has grown significantly over the past
five years. Management of distributed resources is one of the key issues in
Grid computing. Central to management of resources is the effectiveness of
resource allocation as it determines the overall utility of the system. The
current approache... | [
{
"created": "Mon, 15 May 2006 10:21:22 GMT",
"version": "v1"
}
] | 2016-11-18 | [
[
"Ranjan",
"Rajiv",
""
],
[
"Harwood",
"Aaron",
""
],
[
"Buyya",
"Rajkumar",
""
]
] | Research interest in Grid computing has grown significantly over the past five years. Management of distributed resources is one of the key issues in Grid computing. Central to management of resources is the effectiveness of resource allocation as it determines the overall utility of the system. The current approaches ... |
1507.06462 | Matteo Sammartino | Roberto Bruni, Ugo Montanari, Matteo Sammartino | A coalgebraic semantics for causality in Petri nets | Accepted by Journal of Logical and Algebraic Methods in Programming | null | 10.1016/j.jlamp.2015.07.003 | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | In this paper we revisit some pioneering efforts to equip Petri nets with
compact operational models for expressing causality. The models we propose have
a bisimilarity relation and a minimal representative for each equivalence
class, and they can be fully explained as coalgebras on a presheaf category on
an index ca... | [
{
"created": "Thu, 23 Jul 2015 12:08:22 GMT",
"version": "v1"
}
] | 2015-07-24 | [
[
"Bruni",
"Roberto",
""
],
[
"Montanari",
"Ugo",
""
],
[
"Sammartino",
"Matteo",
""
]
] | In this paper we revisit some pioneering efforts to equip Petri nets with compact operational models for expressing causality. The models we propose have a bisimilarity relation and a minimal representative for each equivalence class, and they can be fully explained as coalgebras on a presheaf category on an index cate... |
2205.01643 | Jinze Yu | Jinze Yu, Jiaming Liu, Xiaobao Wei, Haoyi Zhou, Yohei Nakata, Denis
Gudovskiy, Tomoyuki Okuno, Jianxin Li, Kurt Keutzer, Shanghang Zhang | MTTrans: Cross-Domain Object Detection with Mean-Teacher Transformer | Accepted by ECCV 2022 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Recently, DEtection TRansformer (DETR), an end-to-end object detection
pipeline, has achieved promising performance. However, it requires large-scale
labeled data and suffers from domain shift, especially when no labeled data is
available in the target domain. To solve this problem, we propose an end-to-end
cross-dom... | [
{
"created": "Tue, 3 May 2022 17:11:55 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Aug 2022 09:55:23 GMT",
"version": "v2"
}
] | 2022-08-17 | [
[
"Yu",
"Jinze",
""
],
[
"Liu",
"Jiaming",
""
],
[
"Wei",
"Xiaobao",
""
],
[
"Zhou",
"Haoyi",
""
],
[
"Nakata",
"Yohei",
""
],
[
"Gudovskiy",
"Denis",
""
],
[
"Okuno",
"Tomoyuki",
""
],
[
"Li",
"J... | Recently, DEtection TRansformer (DETR), an end-to-end object detection pipeline, has achieved promising performance. However, it requires large-scale labeled data and suffers from domain shift, especially when no labeled data is available in the target domain. To solve this problem, we propose an end-to-end cross-domai... |
2006.01304 | Kyungmi Lee | Kyungmi Lee, Anantha P. Chandrakasan | Rethinking Empirical Evaluation of Adversarial Robustness Using
First-Order Attack Methods | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We identify three common cases that lead to overestimation of adversarial
accuracy against bounded first-order attack methods, which is popularly used as
a proxy for adversarial robustness in empirical studies. For each case, we
propose compensation methods that either address sources of inaccurate gradient
computati... | [
{
"created": "Mon, 1 Jun 2020 22:55:09 GMT",
"version": "v1"
}
] | 2020-06-03 | [
[
"Lee",
"Kyungmi",
""
],
[
"Chandrakasan",
"Anantha P.",
""
]
] | We identify three common cases that lead to overestimation of adversarial accuracy against bounded first-order attack methods, which is popularly used as a proxy for adversarial robustness in empirical studies. For each case, we propose compensation methods that either address sources of inaccurate gradient computation... |
1511.03518 | Ya-Hui An | Ya-Hui An, Qiang Dong, Chong-Jing Sun, Da-Cheng Nie and Yan Fu | Diffusion-like recommendation with enhanced similarity of objects | null | Physica A: Statistical Mechanics and its Applications 461 (2016)
708-715 | 10.1016/j.physa.2016.06.027 | null | cs.IR cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In last decades, diversity and accuracy have been regarded as two important
measures in evaluating a recommendation model. However, a clear concern is that
a model focusing excessively on one measure will put the other one at risk,
thus it is not easy to greatly improve diversity and accuracy simultaneously.
In this ... | [
{
"created": "Wed, 11 Nov 2015 14:43:32 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Oct 2018 06:13:15 GMT",
"version": "v2"
}
] | 2018-10-17 | [
[
"An",
"Ya-Hui",
""
],
[
"Dong",
"Qiang",
""
],
[
"Sun",
"Chong-Jing",
""
],
[
"Nie",
"Da-Cheng",
""
],
[
"Fu",
"Yan",
""
]
] | In last decades, diversity and accuracy have been regarded as two important measures in evaluating a recommendation model. However, a clear concern is that a model focusing excessively on one measure will put the other one at risk, thus it is not easy to greatly improve diversity and accuracy simultaneously. In this pa... |
2003.09986 | Yao Qiang | Yao Qiang, Xin Li, Dongxiao Zhu | Toward Tag-free Aspect Based Sentiment Analysis: A Multiple Attention
Network Approach | to appear in the proceedings of IJCNN'20 | null | null | null | cs.CL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing aspect based sentiment analysis (ABSA) approaches leverage various
neural network models to extract the aspect sentiments via learning
aspect-specific feature representations. However, these approaches heavily rely
on manual tagging of user reviews according to the predefined aspects as the
input, a laboriou... | [
{
"created": "Sun, 22 Mar 2020 20:18:20 GMT",
"version": "v1"
}
] | 2020-03-24 | [
[
"Qiang",
"Yao",
""
],
[
"Li",
"Xin",
""
],
[
"Zhu",
"Dongxiao",
""
]
] | Existing aspect based sentiment analysis (ABSA) approaches leverage various neural network models to extract the aspect sentiments via learning aspect-specific feature representations. However, these approaches heavily rely on manual tagging of user reviews according to the predefined aspects as the input, a laborious ... |
2103.10241 | Ke Lai | Ke Lai, Jing Lei, Yansha Deng, Lei Wen, Gaojie Chen | Analyzing Uplink Grant-free Sparse Code Multiple Access System in
Massive IoT Networks | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Grant-free sparse code multiple access (GF-SCMA) is considered to be a
promising multiple access candidate for future wireless networks. In this
paper, we focus on characterizing the performance of uplink GF-SCMA schemes in
a network with ubiquitous connections, such as the Internet of Things (IoT)
networks. To provi... | [
{
"created": "Thu, 18 Mar 2021 13:23:23 GMT",
"version": "v1"
}
] | 2021-03-19 | [
[
"Lai",
"Ke",
""
],
[
"Lei",
"Jing",
""
],
[
"Deng",
"Yansha",
""
],
[
"Wen",
"Lei",
""
],
[
"Chen",
"Gaojie",
""
]
] | Grant-free sparse code multiple access (GF-SCMA) is considered to be a promising multiple access candidate for future wireless networks. In this paper, we focus on characterizing the performance of uplink GF-SCMA schemes in a network with ubiquitous connections, such as the Internet of Things (IoT) networks. To provide... |
0710.3279 | Meixia Tao | Meixia Tao, Ying-Chang Liang and Fan Zhang | Resource Allocation for Delay Differentiated Traffic in Multiuser OFDM
Systems | 29 pages, 8 figures, submitted to IEEE Transactions on Wireless
Communications | null | 10.1109/ICC.2006.255331 | null | cs.NI cs.IT math.IT | null | Most existing work on adaptive allocation of subcarriers and power in
multiuser orthogonal frequency division multiplexing (OFDM) systems has focused
on homogeneous traffic consisting solely of either delay-constrained data
(guaranteed service) or non-delay-constrained data (best-effort service). In
this paper, we in... | [
{
"created": "Wed, 17 Oct 2007 12:04:34 GMT",
"version": "v1"
}
] | 2016-11-15 | [
[
"Tao",
"Meixia",
""
],
[
"Liang",
"Ying-Chang",
""
],
[
"Zhang",
"Fan",
""
]
] | Most existing work on adaptive allocation of subcarriers and power in multiuser orthogonal frequency division multiplexing (OFDM) systems has focused on homogeneous traffic consisting solely of either delay-constrained data (guaranteed service) or non-delay-constrained data (best-effort service). In this paper, we inve... |
cs/0110052 | Nandlal L. Sarda | N. L. Sarda and Ankur Jain | Mragyati : A System for Keyword-based Searching in Databases | null | null | null | null | cs.DB | null | The web, through many search engine sites, has popularized the keyword-based
search paradigm, where a user can specify a string of keywords and expect to
retrieve relevant documents, possibly ranked by their relevance to the query.
Since a lot of information is stored in databases (and not as HTML documents),
it is i... | [
{
"created": "Thu, 25 Oct 2001 08:55:57 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Sarda",
"N. L.",
""
],
[
"Jain",
"Ankur",
""
]
] | The web, through many search engine sites, has popularized the keyword-based search paradigm, where a user can specify a string of keywords and expect to retrieve relevant documents, possibly ranked by their relevance to the query. Since a lot of information is stored in databases (and not as HTML documents), it is imp... |
2407.12101 | Marc Pickett | Marc Pickett, Jeremy Hartman, Ayan Kumar Bhowmick, Raquib-ul Alam,
Aditya Vempaty | Better RAG using Relevant Information Gain | 4 page paper submitted to EMNLP | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | A common way to extend the memory of large language models (LLMs) is by
retrieval augmented generation (RAG), which inserts text retrieved from a
larger memory into an LLM's context window. However, the context window is
typically limited to several thousand tokens, which limits the number of
retrieved passages that ... | [
{
"created": "Tue, 16 Jul 2024 18:09:21 GMT",
"version": "v1"
}
] | 2024-07-18 | [
[
"Pickett",
"Marc",
""
],
[
"Hartman",
"Jeremy",
""
],
[
"Bhowmick",
"Ayan Kumar",
""
],
[
"Alam",
"Raquib-ul",
""
],
[
"Vempaty",
"Aditya",
""
]
] | A common way to extend the memory of large language models (LLMs) is by retrieval augmented generation (RAG), which inserts text retrieved from a larger memory into an LLM's context window. However, the context window is typically limited to several thousand tokens, which limits the number of retrieved passages that ca... |
2002.06075 | David Aparicio | David Apar\'icio, Ricardo Barata, Jo\~ao Bravo, Jo\~ao Tiago
Ascens\~ao, Pedro Bizarro | ARMS: Automated rules management system for fraud detection | 11 pages, 12 figures, submitted to KDD '20 Applied Data Science Track | null | null | null | cs.LG cs.AI cs.DB stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fraud detection is essential in financial services, with the potential of
greatly reducing criminal activities and saving considerable resources for
businesses and customers. We address online fraud detection, which consists of
classifying incoming transactions as either legitimate or fraudulent in
real-time. Modern ... | [
{
"created": "Fri, 14 Feb 2020 15:29:59 GMT",
"version": "v1"
}
] | 2020-02-17 | [
[
"Aparício",
"David",
""
],
[
"Barata",
"Ricardo",
""
],
[
"Bravo",
"João",
""
],
[
"Ascensão",
"João Tiago",
""
],
[
"Bizarro",
"Pedro",
""
]
] | Fraud detection is essential in financial services, with the potential of greatly reducing criminal activities and saving considerable resources for businesses and customers. We address online fraud detection, which consists of classifying incoming transactions as either legitimate or fraudulent in real-time. Modern fr... |
1505.00346 | Azra Abtahi | Azra Abtahi, M. Modarres-Hashemi, Farokh Marvasti, and Foroogh S.
Tabataba | Power Allocation and Measurement Matrix Design for Block CS-Based
Distributed MIMO Radars | The paper is accepted in Elseveir Aerospace Science and Technology | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multiple-input multiple-output (MIMO) radars offer higher resolution, better
target detection, and more accurate target parameter estimation. Due to the
sparsity of the targets in space-velocity domain, we can exploit Compressive
Sensing (CS) to improve the performance of MIMO radars when the sampling rate
is much le... | [
{
"created": "Sat, 2 May 2015 14:49:50 GMT",
"version": "v1"
},
{
"created": "Tue, 20 Oct 2015 15:33:49 GMT",
"version": "v2"
},
{
"created": "Tue, 8 Mar 2016 19:21:16 GMT",
"version": "v3"
}
] | 2016-03-09 | [
[
"Abtahi",
"Azra",
""
],
[
"Modarres-Hashemi",
"M.",
""
],
[
"Marvasti",
"Farokh",
""
],
[
"Tabataba",
"Foroogh S.",
""
]
] | Multiple-input multiple-output (MIMO) radars offer higher resolution, better target detection, and more accurate target parameter estimation. Due to the sparsity of the targets in space-velocity domain, we can exploit Compressive Sensing (CS) to improve the performance of MIMO radars when the sampling rate is much less... |
1304.5940 | Emil Bj\"ornson | Nafiseh Shariati and Emil Bj\"ornson and Mats Bengtsson and M\'erouane
Debbah | Low-Complexity Channel Estimation in Large-Scale MIMO using Polynomial
Expansion | Published at IEEE International Symposium on Personal, Indoor and
Mobile Radio Communications (PIMRC 2013), 8-11 September 2013, 6 pages, 4
figures, 1 table | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers pilot-based channel estimation in large-scale
multiple-input multiple-output (MIMO) communication systems, also known as
"massive MIMO". Unlike previous works on this topic, which mainly considered
the impact of inter-cell disturbance due to pilot reuse (so-called pilot
contamination), we are con... | [
{
"created": "Mon, 22 Apr 2013 13:17:32 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Jul 2013 07:42:18 GMT",
"version": "v2"
}
] | 2013-07-18 | [
[
"Shariati",
"Nafiseh",
""
],
[
"Björnson",
"Emil",
""
],
[
"Bengtsson",
"Mats",
""
],
[
"Debbah",
"Mérouane",
""
]
] | This paper considers pilot-based channel estimation in large-scale multiple-input multiple-output (MIMO) communication systems, also known as "massive MIMO". Unlike previous works on this topic, which mainly considered the impact of inter-cell disturbance due to pilot reuse (so-called pilot contamination), we are conce... |
2007.08147 | Michel Rigo | E. Charlier, A. Massuir, M. Rigo, E. Rowland | Ultimate periodicity problem for linear numeration systems | 39 pages, 2 figures. This is an improved version of the original
submission. It clarifies some arguments taking into account several comments
from reviews | International Journal of Algebra and Computation 32 (2022) 561-596 | 10.1142/S0218196722500254 | null | cs.DM math.CO math.NT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the following decision problem. Given a numeration system $U$ and
a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy
$U$-representations is recognized by a finite automaton, decide whether or not
$X$ is ultimately periodic. We prove that this problem is decidable for a large
class of... | [
{
"created": "Thu, 16 Jul 2020 07:12:39 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Dec 2021 12:08:35 GMT",
"version": "v2"
}
] | 2023-09-04 | [
[
"Charlier",
"E.",
""
],
[
"Massuir",
"A.",
""
],
[
"Rigo",
"M.",
""
],
[
"Rowland",
"E.",
""
]
] | We address the following decision problem. Given a numeration system $U$ and a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy $U$-representations is recognized by a finite automaton, decide whether or not $X$ is ultimately periodic. We prove that this problem is decidable for a large class of n... |
2103.01169 | Luca Maria Aiello | Sanja Scepanovic, Luca Maria Aiello, Ke Zhou, Sagar Joglekar, Daniele
Quercia | The Healthy States of America: Creating a Health Taxonomy with Social
Media | In proceedings of the International Conference on Web and Social
Media (ICWSM'21) | null | null | null | cs.CY cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Since the uptake of social media, researchers have mined online discussions
to track the outbreak and evolution of specific diseases or chronic conditions
such as influenza or depression. To broaden the set of diseases under study, we
developed a Deep Learning tool for Natural Language Processing that extracts
mentio... | [
{
"created": "Mon, 1 Mar 2021 18:07:47 GMT",
"version": "v1"
}
] | 2021-03-02 | [
[
"Scepanovic",
"Sanja",
""
],
[
"Aiello",
"Luca Maria",
""
],
[
"Zhou",
"Ke",
""
],
[
"Joglekar",
"Sagar",
""
],
[
"Quercia",
"Daniele",
""
]
] | Since the uptake of social media, researchers have mined online discussions to track the outbreak and evolution of specific diseases or chronic conditions such as influenza or depression. To broaden the set of diseases under study, we developed a Deep Learning tool for Natural Language Processing that extracts mentions... |
2406.04829 | Zijia An | Zijia An, Boyu Diao, Libo Huang, Ruiqi Liu, Zhulin An, Yongjun Xu | EGOR: Efficient Generated Objects Replay for incremental object
detection | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Incremental object detection aims to simultaneously maintain old-class
accuracy and detect emerging new-class objects in incremental data. Most
existing distillation-based methods underperform when unlabeled old-class
objects are absent in the incremental dataset. While the absence can be
mitigated by generating old-... | [
{
"created": "Fri, 7 Jun 2024 10:54:40 GMT",
"version": "v1"
}
] | 2024-06-10 | [
[
"An",
"Zijia",
""
],
[
"Diao",
"Boyu",
""
],
[
"Huang",
"Libo",
""
],
[
"Liu",
"Ruiqi",
""
],
[
"An",
"Zhulin",
""
],
[
"Xu",
"Yongjun",
""
]
] | Incremental object detection aims to simultaneously maintain old-class accuracy and detect emerging new-class objects in incremental data. Most existing distillation-based methods underperform when unlabeled old-class objects are absent in the incremental dataset. While the absence can be mitigated by generating old-cl... |
2209.02298 | Dipankar Chaki | Manan Choksi, Dipankar Chaki, Abdallah Lakhdari, Athman Bouguettaya | You Are What You Use: Usage-based Profiling in IoT Environments | 4 pages, 2 figures | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Habit extraction is essential to automate services and provide appliance
usage insights in the smart home environment. However, habit extraction comes
with plenty of challenges in viewing typical start and end times for particular
activities. This paper introduces a novel way of identifying habits using an
ensemble o... | [
{
"created": "Tue, 6 Sep 2022 08:51:08 GMT",
"version": "v1"
}
] | 2022-09-07 | [
[
"Choksi",
"Manan",
""
],
[
"Chaki",
"Dipankar",
""
],
[
"Lakhdari",
"Abdallah",
""
],
[
"Bouguettaya",
"Athman",
""
]
] | Habit extraction is essential to automate services and provide appliance usage insights in the smart home environment. However, habit extraction comes with plenty of challenges in viewing typical start and end times for particular activities. This paper introduces a novel way of identifying habits using an ensemble of ... |
2111.01909 | Wang Guangjun | Guangjun Wang | Geometrical holographic display | null | null | null | null | cs.GR physics.optics | http://creativecommons.org/licenses/by/4.0/ | Is it possible to realize a holographic display with commercial available
components and devices? Is it possible to manipulate light to reconstruct light
field without using coherent light and complicated optical components? Is it
possible to minimize the amount of date involved in building 3D scenes? Is it
possible ... | [
{
"created": "Mon, 1 Nov 2021 11:56:23 GMT",
"version": "v1"
}
] | 2021-11-04 | [
[
"Wang",
"Guangjun",
""
]
] | Is it possible to realize a holographic display with commercial available components and devices? Is it possible to manipulate light to reconstruct light field without using coherent light and complicated optical components? Is it possible to minimize the amount of date involved in building 3D scenes? Is it possible to... |
2405.11210 | Emilio Mart\'inez-Pa\~neda | C. Cui, P. Bortot, M. Ortolani, E. Mart\'inez-Pa\~neda | Computational predictions of hydrogen-assisted fatigue crack growth | null | null | null | null | cs.CE cond-mat.mtrl-sci physics.app-ph physics.chem-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A new model is presented to predict hydrogen-assisted fatigue. The model
combines a phase field description of fracture and fatigue, stress-assisted
hydrogen diffusion, and a toughness degradation formulation with cyclic and
hydrogen contributions. Hydrogen-assisted fatigue crack growth predictions
exhibit an excelle... | [
{
"created": "Sat, 18 May 2024 07:34:48 GMT",
"version": "v1"
}
] | 2024-05-21 | [
[
"Cui",
"C.",
""
],
[
"Bortot",
"P.",
""
],
[
"Ortolani",
"M.",
""
],
[
"Martínez-Pañeda",
"E.",
""
]
] | A new model is presented to predict hydrogen-assisted fatigue. The model combines a phase field description of fracture and fatigue, stress-assisted hydrogen diffusion, and a toughness degradation formulation with cyclic and hydrogen contributions. Hydrogen-assisted fatigue crack growth predictions exhibit an excellent... |
1006.5686 | Steven Weber | Nan Xie, Steven Weber | Geometric Approximations of Some Aloha-like Stability Regions | Presented at IEEE ISIT 2010 (Austin, TX) | null | 10.1109/ISIT.2010.5513425 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most bounds on the stability region of Aloha give necessary and sufficient
conditions for the stability of an arrival rate vector under a specific
contention probability (control) vector. But such results do not yield
easy-to-check bounds on the overall Aloha stability region because they
potentially require checking... | [
{
"created": "Tue, 29 Jun 2010 17:32:13 GMT",
"version": "v1"
}
] | 2016-11-18 | [
[
"Xie",
"Nan",
""
],
[
"Weber",
"Steven",
""
]
] | Most bounds on the stability region of Aloha give necessary and sufficient conditions for the stability of an arrival rate vector under a specific contention probability (control) vector. But such results do not yield easy-to-check bounds on the overall Aloha stability region because they potentially require checking m... |
1507.04438 | Akbar Rafiey | Binay Bhattacharya, Ante \'Custi\'c, Akbar Rafiey, Arash Rafiey,
Vladyslav Sokol | Approximation Algorithms for Generalized MST and TSP in Grid Clusters | null | null | null | null | cs.DM cs.CG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a special case of the generalized minimum spanning tree problem
(GMST) and the generalized travelling salesman problem (GTSP) where we are
given a set of points inside the integer grid (in Euclidean plane) where each
grid cell is $1 \times 1$. In the MST version of the problem, the goal is to
find a minim... | [
{
"created": "Thu, 16 Jul 2015 03:00:41 GMT",
"version": "v1"
}
] | 2015-07-17 | [
[
"Bhattacharya",
"Binay",
""
],
[
"Ćustić",
"Ante",
""
],
[
"Rafiey",
"Akbar",
""
],
[
"Rafiey",
"Arash",
""
],
[
"Sokol",
"Vladyslav",
""
]
] | We consider a special case of the generalized minimum spanning tree problem (GMST) and the generalized travelling salesman problem (GTSP) where we are given a set of points inside the integer grid (in Euclidean plane) where each grid cell is $1 \times 1$. In the MST version of the problem, the goal is to find a minimum... |
2404.03225 | Xu Wang | Xu Wang, Tian Ye, Rajgopal Kannan, Viktor Prasanna | FACTUAL: A Novel Framework for Contrastive Learning Based Robust SAR
Image Classification | 2024 IEEE Radar Conference | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Learning (DL) Models for Synthetic Aperture Radar (SAR) Automatic Target
Recognition (ATR), while delivering improved performance, have been shown to be
quite vulnerable to adversarial attacks. Existing works improve robustness by
training models on adversarial samples. However, by focusing mostly on attacks
tha... | [
{
"created": "Thu, 4 Apr 2024 06:20:22 GMT",
"version": "v1"
}
] | 2024-04-05 | [
[
"Wang",
"Xu",
""
],
[
"Ye",
"Tian",
""
],
[
"Kannan",
"Rajgopal",
""
],
[
"Prasanna",
"Viktor",
""
]
] | Deep Learning (DL) Models for Synthetic Aperture Radar (SAR) Automatic Target Recognition (ATR), while delivering improved performance, have been shown to be quite vulnerable to adversarial attacks. Existing works improve robustness by training models on adversarial samples. However, by focusing mostly on attacks that ... |
2003.09148 | Nico Messikommer | Nico Messikommer, Daniel Gehrig, Antonio Loquercio, Davide Scaramuzza | Event-based Asynchronous Sparse Convolutional Networks | null | European Conference on Computer Vision (ECCV), 2020 | null | null | cs.CV cs.LG eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Event cameras are bio-inspired sensors that respond to per-pixel brightness
changes in the form of asynchronous and sparse "events". Recently, pattern
recognition algorithms, such as learning-based methods, have made significant
progress with event cameras by converting events into synchronous dense,
image-like repre... | [
{
"created": "Fri, 20 Mar 2020 08:39:49 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Jul 2020 15:52:12 GMT",
"version": "v2"
}
] | 2020-07-20 | [
[
"Messikommer",
"Nico",
""
],
[
"Gehrig",
"Daniel",
""
],
[
"Loquercio",
"Antonio",
""
],
[
"Scaramuzza",
"Davide",
""
]
] | Event cameras are bio-inspired sensors that respond to per-pixel brightness changes in the form of asynchronous and sparse "events". Recently, pattern recognition algorithms, such as learning-based methods, have made significant progress with event cameras by converting events into synchronous dense, image-like represe... |
2203.12412 | Ahmet Caner Y\"uz\"ug\"uler | Ahmet Caner Y\"uz\"ug\"uler, Nikolaos Dimitriadis, Pascal Frossard | U-Boost NAS: Utilization-Boosted Differentiable Neural Architecture
Search | null | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | Optimizing resource utilization in target platforms is key to achieving high
performance during DNN inference. While optimizations have been proposed for
inference latency, memory footprint, and energy consumption, prior
hardware-aware neural architecture search (NAS) methods have omitted resource
utilization, preven... | [
{
"created": "Wed, 23 Mar 2022 13:44:15 GMT",
"version": "v1"
}
] | 2022-03-24 | [
[
"Yüzügüler",
"Ahmet Caner",
""
],
[
"Dimitriadis",
"Nikolaos",
""
],
[
"Frossard",
"Pascal",
""
]
] | Optimizing resource utilization in target platforms is key to achieving high performance during DNN inference. While optimizations have been proposed for inference latency, memory footprint, and energy consumption, prior hardware-aware neural architecture search (NAS) methods have omitted resource utilization, preventi... |
1608.04309 | Yasin Yazicioglu | A. Yasin Yazicioglu, Waseem Abbas, and Magnus Egerstedt | Graph Distances and Controllability of Networks | Accepted to the IEEE Transactions on Automatic Control | null | 10.1109/TAC.2016.2546180 | null | cs.SY cs.SI math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this technical note, we study the controllability of diffusively coupled
networks from a graph theoretic perspective. We consider leader-follower
networks, where the external control inputs are injected to only some of the
agents, namely the leaders. Our main result relates the controllability of such
systems to t... | [
{
"created": "Mon, 15 Aug 2016 15:51:42 GMT",
"version": "v1"
}
] | 2016-08-17 | [
[
"Yazicioglu",
"A. Yasin",
""
],
[
"Abbas",
"Waseem",
""
],
[
"Egerstedt",
"Magnus",
""
]
] | In this technical note, we study the controllability of diffusively coupled networks from a graph theoretic perspective. We consider leader-follower networks, where the external control inputs are injected to only some of the agents, namely the leaders. Our main result relates the controllability of such systems to the... |
1911.06489 | Yanjie Gou | Yanjie Gou, Yinjie Lei, Lingqiao Liu, Pingping Zhang, Xi Peng | Improving Distant Supervised Relation Extraction by Dynamic Neural
Network | 29 pages, 8 figures | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distant Supervised Relation Extraction (DSRE) is usually formulated as a
problem of classifying a bag of sentences that contain two query entities, into
the predefined relation classes. Most existing methods consider those relation
classes as distinct semantic categories while ignoring their potential
connection to q... | [
{
"created": "Fri, 15 Nov 2019 06:31:13 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Dec 2019 04:29:41 GMT",
"version": "v2"
}
] | 2019-12-16 | [
[
"Gou",
"Yanjie",
""
],
[
"Lei",
"Yinjie",
""
],
[
"Liu",
"Lingqiao",
""
],
[
"Zhang",
"Pingping",
""
],
[
"Peng",
"Xi",
""
]
] | Distant Supervised Relation Extraction (DSRE) is usually formulated as a problem of classifying a bag of sentences that contain two query entities, into the predefined relation classes. Most existing methods consider those relation classes as distinct semantic categories while ignoring their potential connection to que... |
2303.01277 | Meng Zhang | Meng Zhang, Qinghao Hu, Peng Sun, Yonggang Wen, Tianwei Zhang | Boosting Distributed Full-graph GNN Training with Asynchronous One-bit
Communication | null | null | null | null | cs.DC cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Training Graph Neural Networks (GNNs) on large graphs is challenging due to
the conflict between the high memory demand and limited GPU memory. Recently,
distributed full-graph GNN training has been widely adopted to tackle this
problem. However, the substantial inter-GPU communication overhead can cause
severe throu... | [
{
"created": "Thu, 2 Mar 2023 14:02:39 GMT",
"version": "v1"
}
] | 2023-03-03 | [
[
"Zhang",
"Meng",
""
],
[
"Hu",
"Qinghao",
""
],
[
"Sun",
"Peng",
""
],
[
"Wen",
"Yonggang",
""
],
[
"Zhang",
"Tianwei",
""
]
] | Training Graph Neural Networks (GNNs) on large graphs is challenging due to the conflict between the high memory demand and limited GPU memory. Recently, distributed full-graph GNN training has been widely adopted to tackle this problem. However, the substantial inter-GPU communication overhead can cause severe through... |
2001.00182 | Francesco Malandrino | Christian Vitale and Carla Fabiana Chiasserini and Francesco
Malandrino and Senay Semu Tadesse | Characterizing Delay and Control Traffic of the Cellular MME with IoT
Support | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the main use cases for advanced cellular networks is represented by
massive Internet-of-things (MIoT), i.e., an enormous number of IoT devices that
transmit data toward the cellular network infrastructure. To make cellular MIoT
a reality, data transfer and control procedures specifically designed for the
suppo... | [
{
"created": "Wed, 1 Jan 2020 10:14:54 GMT",
"version": "v1"
}
] | 2020-01-03 | [
[
"Vitale",
"Christian",
""
],
[
"Chiasserini",
"Carla Fabiana",
""
],
[
"Malandrino",
"Francesco",
""
],
[
"Tadesse",
"Senay Semu",
""
]
] | One of the main use cases for advanced cellular networks is represented by massive Internet-of-things (MIoT), i.e., an enormous number of IoT devices that transmit data toward the cellular network infrastructure. To make cellular MIoT a reality, data transfer and control procedures specifically designed for the support... |
1412.2824 | Yu Zhang | Vignesh Narayanan, Yu Zhang, Nathaniel Mendoza and Subbarao
Kambhampati | Plan or not: Remote Human-robot Teaming with Incomplete Task Information | null | null | null | null | cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human-robot interaction can be divided into two categories based on the
physical distance between the human and robot: remote and proximal. In proximal
interaction, the human and robot often engage in close coordination; in remote
interaction, the human and robot are less coupled due to communication
constraints. As ... | [
{
"created": "Tue, 9 Dec 2014 01:05:59 GMT",
"version": "v1"
}
] | 2014-12-10 | [
[
"Narayanan",
"Vignesh",
""
],
[
"Zhang",
"Yu",
""
],
[
"Mendoza",
"Nathaniel",
""
],
[
"Kambhampati",
"Subbarao",
""
]
] | Human-robot interaction can be divided into two categories based on the physical distance between the human and robot: remote and proximal. In proximal interaction, the human and robot often engage in close coordination; in remote interaction, the human and robot are less coupled due to communication constraints. As a ... |
2405.00251 | Dylan Green | Dylan Green, William Harvey, Saeid Naderiparizi, Matthew Niedoba,
Yunpeng Liu, Xiaoxuan Liang, Jonathan Lavington, Ke Zhang, Vasileios Lioutas,
Setareh Dabiri, Adam Scibior, Berend Zwartsenberg, Frank Wood | Semantically Consistent Video Inpainting with Conditional Diffusion
Models | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Current state-of-the-art methods for video inpainting typically rely on
optical flow or attention-based approaches to inpaint masked regions by
propagating visual information across frames. While such approaches have led to
significant progress on standard benchmarks, they struggle with tasks that
require the synthes... | [
{
"created": "Tue, 30 Apr 2024 23:49:26 GMT",
"version": "v1"
}
] | 2024-05-02 | [
[
"Green",
"Dylan",
""
],
[
"Harvey",
"William",
""
],
[
"Naderiparizi",
"Saeid",
""
],
[
"Niedoba",
"Matthew",
""
],
[
"Liu",
"Yunpeng",
""
],
[
"Liang",
"Xiaoxuan",
""
],
[
"Lavington",
"Jonathan",
""
],
... | Current state-of-the-art methods for video inpainting typically rely on optical flow or attention-based approaches to inpaint masked regions by propagating visual information across frames. While such approaches have led to significant progress on standard benchmarks, they struggle with tasks that require the synthesis... |
2405.07481 | Xiaoyi Zhang | Tianci Bi, Xiaoyi Zhang, Zhizheng Zhang, Wenxuan Xie, Cuiling Lan, Yan
Lu and Nanning Zheng | Text Grouping Adapter: Adapting Pre-trained Text Detector for Layout
Analysis | Accepted to CVPR 2024 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Significant progress has been made in scene text detection models since the
rise of deep learning, but scene text layout analysis, which aims to group
detected text instances as paragraphs, has not kept pace. Previous works either
treated text detection and grouping using separate models, or train a model
from scratc... | [
{
"created": "Mon, 13 May 2024 05:48:35 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"Bi",
"Tianci",
""
],
[
"Zhang",
"Xiaoyi",
""
],
[
"Zhang",
"Zhizheng",
""
],
[
"Xie",
"Wenxuan",
""
],
[
"Lan",
"Cuiling",
""
],
[
"Lu",
"Yan",
""
],
[
"Zheng",
"Nanning",
""
]
] | Significant progress has been made in scene text detection models since the rise of deep learning, but scene text layout analysis, which aims to group detected text instances as paragraphs, has not kept pace. Previous works either treated text detection and grouping using separate models, or train a model from scratch ... |
2308.16635 | Jin Liu | Jin Liu, Xi Wang, Xiaomeng Fu, Yesheng Chai, Cai Yu, Jiao Dai, Jizhong
Han | MFR-Net: Multi-faceted Responsive Listening Head Generation via
Denoising Diffusion Model | Accepted by ACM MM 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Face-to-face communication is a common scenario including roles of speakers
and listeners. Most existing research methods focus on producing speaker
videos, while the generation of listener heads remains largely overlooked.
Responsive listening head generation is an important task that aims to model
face-to-face comm... | [
{
"created": "Thu, 31 Aug 2023 11:10:28 GMT",
"version": "v1"
}
] | 2023-09-01 | [
[
"Liu",
"Jin",
""
],
[
"Wang",
"Xi",
""
],
[
"Fu",
"Xiaomeng",
""
],
[
"Chai",
"Yesheng",
""
],
[
"Yu",
"Cai",
""
],
[
"Dai",
"Jiao",
""
],
[
"Han",
"Jizhong",
""
]
] | Face-to-face communication is a common scenario including roles of speakers and listeners. Most existing research methods focus on producing speaker videos, while the generation of listener heads remains largely overlooked. Responsive listening head generation is an important task that aims to model face-to-face commun... |
2209.12248 | Rui He | Rui He, Zehua Fu, Qingjie Liu, Yunhong Wang, Xunxun Chen | D$^{\bf{3}}$: Duplicate Detection Decontaminator for Multi-Athlete
Tracking in Sports Videos | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Tracking multiple athletes in sports videos is a very challenging
Multi-Object Tracking (MOT) task, since athletes often have the same appearance
and are intimately covered with each other, making a common occlusion problem
becomes an abhorrent duplicate detection. In this paper, the duplicate
detection is newly and ... | [
{
"created": "Sun, 25 Sep 2022 15:46:39 GMT",
"version": "v1"
}
] | 2022-09-27 | [
[
"He",
"Rui",
""
],
[
"Fu",
"Zehua",
""
],
[
"Liu",
"Qingjie",
""
],
[
"Wang",
"Yunhong",
""
],
[
"Chen",
"Xunxun",
""
]
] | Tracking multiple athletes in sports videos is a very challenging Multi-Object Tracking (MOT) task, since athletes often have the same appearance and are intimately covered with each other, making a common occlusion problem becomes an abhorrent duplicate detection. In this paper, the duplicate detection is newly and pr... |
1802.01958 | Philipp Harzig | Philipp Harzig, Stephan Brehm, Rainer Lienhart, Carolin Kaiser, Ren\'e
Schallner | Multimodal Image Captioning for Marketing Analysis | 4 pages, 1 figure, accepted at MIPR2018 | null | 10.1109/MIPR.2018.00035 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatically captioning images with natural language sentences is an
important research topic. State of the art models are able to produce
human-like sentences. These models typically describe the depicted scene as a
whole and do not target specific objects of interest or emotional relationships
between these object... | [
{
"created": "Tue, 6 Feb 2018 14:23:32 GMT",
"version": "v1"
},
{
"created": "Mon, 6 May 2019 10:35:53 GMT",
"version": "v2"
}
] | 2019-08-07 | [
[
"Harzig",
"Philipp",
""
],
[
"Brehm",
"Stephan",
""
],
[
"Lienhart",
"Rainer",
""
],
[
"Kaiser",
"Carolin",
""
],
[
"Schallner",
"René",
""
]
] | Automatically captioning images with natural language sentences is an important research topic. State of the art models are able to produce human-like sentences. These models typically describe the depicted scene as a whole and do not target specific objects of interest or emotional relationships between these objects ... |
2007.11348 | Ori Shapira | Ori Shapira and Ran Levy | Massive Multi-Document Summarization of Product Reviews with Weak
Supervision | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Product reviews summarization is a type of Multi-Document Summarization (MDS)
task in which the summarized document sets are often far larger than in
traditional MDS (up to tens of thousands of reviews). We highlight this
difference and coin the term "Massive Multi-Document Summarization" (MMDS) to
denote an MDS task... | [
{
"created": "Wed, 22 Jul 2020 11:22:57 GMT",
"version": "v1"
}
] | 2020-07-23 | [
[
"Shapira",
"Ori",
""
],
[
"Levy",
"Ran",
""
]
] | Product reviews summarization is a type of Multi-Document Summarization (MDS) task in which the summarized document sets are often far larger than in traditional MDS (up to tens of thousands of reviews). We highlight this difference and coin the term "Massive Multi-Document Summarization" (MMDS) to denote an MDS task t... |
1503.05157 | Jeremy Debattista | Jeremy Debattista, Santiago Londo\~no, Christoph Lange, S\"oren Auer | Quality Assessment of Linked Datasets using Probabilistic Approximation | 15 pages, 2 figures, To appear in ESWC 2015 proceedings | null | null | null | cs.DB cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the increasing application of Linked Open Data, assessing the quality of
datasets by computing quality metrics becomes an issue of crucial importance.
For large and evolving datasets, an exact, deterministic computation of the
quality metrics is too time consuming or expensive. We employ probabilistic
techniques... | [
{
"created": "Tue, 17 Mar 2015 18:39:22 GMT",
"version": "v1"
}
] | 2015-03-18 | [
[
"Debattista",
"Jeremy",
""
],
[
"Londoño",
"Santiago",
""
],
[
"Lange",
"Christoph",
""
],
[
"Auer",
"Sören",
""
]
] | With the increasing application of Linked Open Data, assessing the quality of datasets by computing quality metrics becomes an issue of crucial importance. For large and evolving datasets, an exact, deterministic computation of the quality metrics is too time consuming or expensive. We employ probabilistic techniques s... |
2102.12606 | Nahyun Kwon | Nahyun Kwon, Chen Liang and Jeeeun Kim | 3D4ALL: Toward an Inclusive Pipeline to Classify 3D Contents | 9 pages, 2 figures, TExSS, ACM IUI 2021 Workshops | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Algorithmic content moderation manages an explosive number of user-created
content shared online everyday. Despite a massive number of 3D designs that are
free to be downloaded, shared, and 3D printed by the users, detecting
sensitivity with transparency and fairness has been controversial. Although
sensitive 3D cont... | [
{
"created": "Wed, 24 Feb 2021 23:58:07 GMT",
"version": "v1"
}
] | 2021-02-26 | [
[
"Kwon",
"Nahyun",
""
],
[
"Liang",
"Chen",
""
],
[
"Kim",
"Jeeeun",
""
]
] | Algorithmic content moderation manages an explosive number of user-created content shared online everyday. Despite a massive number of 3D designs that are free to be downloaded, shared, and 3D printed by the users, detecting sensitivity with transparency and fairness has been controversial. Although sensitive 3D conten... |
2204.11965 | Mohamed Raed El Aoun | Mohamed Raed El aoun, Heng Li, Foutse Khomh, Lionel Tidjon | Bug Characteristics in Quantum Software Ecosystem | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the advance in quantum computing in recent years, quantum software
becomes vital for exploring the full potential of quantum computing systems.
Quantum programming is different from classical programming, for example, the
state of a quantum program is probabilistic in nature, and a quantum computer
is error-pron... | [
{
"created": "Mon, 25 Apr 2022 20:59:46 GMT",
"version": "v1"
}
] | 2022-04-27 | [
[
"aoun",
"Mohamed Raed El",
""
],
[
"Li",
"Heng",
""
],
[
"Khomh",
"Foutse",
""
],
[
"Tidjon",
"Lionel",
""
]
] | With the advance in quantum computing in recent years, quantum software becomes vital for exploring the full potential of quantum computing systems. Quantum programming is different from classical programming, for example, the state of a quantum program is probabilistic in nature, and a quantum computer is error-prone ... |
2307.09742 | Guanbin Li | Ganlong Zhao, Guanbin Li, Yipeng Qin, Yizhou Yu | Improved Distribution Matching for Dataset Condensation | CVPR2023 | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dataset Condensation aims to condense a large dataset into a smaller one
while maintaining its ability to train a well-performing model, thus reducing
the storage cost and training effort in deep learning applications. However,
conventional dataset condensation methods are optimization-oriented and
condense the datas... | [
{
"created": "Wed, 19 Jul 2023 04:07:33 GMT",
"version": "v1"
}
] | 2023-07-20 | [
[
"Zhao",
"Ganlong",
""
],
[
"Li",
"Guanbin",
""
],
[
"Qin",
"Yipeng",
""
],
[
"Yu",
"Yizhou",
""
]
] | Dataset Condensation aims to condense a large dataset into a smaller one while maintaining its ability to train a well-performing model, thus reducing the storage cost and training effort in deep learning applications. However, conventional dataset condensation methods are optimization-oriented and condense the dataset... |
1406.1516 | Zhiguo Ding | Zhiguo Ding and Zheng Yang and Pingzhi Fan and H. Vincent Poor | On the Performance of Non-Orthogonal Multiple Access in 5G Systems with
Randomly Deployed Users | null | null | 10.1109/LSP.2014.2343971 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this letter, the performance of non-orthogonal multiple access (NOMA) is
investigated in a cellular downlink scenario with randomly deployed users. The
developed analytical results show that NOMA can achieve superior performance in
terms of ergodic sum rates; however, the outage performance of NOMA depends
critica... | [
{
"created": "Thu, 5 Jun 2014 20:36:58 GMT",
"version": "v1"
}
] | 2015-06-19 | [
[
"Ding",
"Zhiguo",
""
],
[
"Yang",
"Zheng",
""
],
[
"Fan",
"Pingzhi",
""
],
[
"Poor",
"H. Vincent",
""
]
] | In this letter, the performance of non-orthogonal multiple access (NOMA) is investigated in a cellular downlink scenario with randomly deployed users. The developed analytical results show that NOMA can achieve superior performance in terms of ergodic sum rates; however, the outage performance of NOMA depends criticall... |
1906.05797 | Julian Straub | Julian Straub, Thomas Whelan, Lingni Ma, Yufan Chen, Erik Wijmans,
Simon Green, Jakob J. Engel, Raul Mur-Artal, Carl Ren, Shobhit Verma, Anton
Clarkson, Mingfei Yan, Brian Budge, Yajie Yan, Xiaqing Pan, June Yon, Yuyang
Zou, Kimberly Leon, Nigel Carter, Jesus Briales, Tyler Gillingham, Elias
Mueggler, Luis Pesq... | The Replica Dataset: A Digital Replica of Indoor Spaces | null | null | null | null | cs.CV cs.GR eess.IV | http://creativecommons.org/licenses/by/4.0/ | We introduce Replica, a dataset of 18 highly photo-realistic 3D indoor scene
reconstructions at room and building scale. Each scene consists of a dense
mesh, high-resolution high-dynamic-range (HDR) textures, per-primitive semantic
class and instance information, and planar mirror and glass reflectors. The
goal of Re... | [
{
"created": "Thu, 13 Jun 2019 16:29:58 GMT",
"version": "v1"
}
] | 2019-06-14 | [
[
"Straub",
"Julian",
""
],
[
"Whelan",
"Thomas",
""
],
[
"Ma",
"Lingni",
""
],
[
"Chen",
"Yufan",
""
],
[
"Wijmans",
"Erik",
""
],
[
"Green",
"Simon",
""
],
[
"Engel",
"Jakob J.",
""
],
[
"Mur-Artal"... | We introduce Replica, a dataset of 18 highly photo-realistic 3D indoor scene reconstructions at room and building scale. Each scene consists of a dense mesh, high-resolution high-dynamic-range (HDR) textures, per-primitive semantic class and instance information, and planar mirror and glass reflectors. The goal of Repl... |
2308.07783 | Mohammad Baradaran | Mohammad Baradaran, Robert Bergevin | Future Video Prediction from a Single Frame for Video Anomaly Detection | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Video anomaly detection (VAD) is an important but challenging task in
computer vision. The main challenge rises due to the rarity of training samples
to model all anomaly cases. Hence, semi-supervised anomaly detection methods
have gotten more attention, since they focus on modeling normals and they
detect anomalies ... | [
{
"created": "Tue, 15 Aug 2023 14:04:50 GMT",
"version": "v1"
}
] | 2023-08-16 | [
[
"Baradaran",
"Mohammad",
""
],
[
"Bergevin",
"Robert",
""
]
] | Video anomaly detection (VAD) is an important but challenging task in computer vision. The main challenge rises due to the rarity of training samples to model all anomaly cases. Hence, semi-supervised anomaly detection methods have gotten more attention, since they focus on modeling normals and they detect anomalies by... |
1809.00251 | Adrian Viera | Leonardo Le\'on, Felipe Moreno-Vera, Renato Castro, Jos\'e Nav\'io,
Marco Capcha | Car Monitoring System in Apartment Garages by Small Autonomous Car using
Deep Learning | 13 pages, 12 figures, Version 1 accepted in SimBig 2018. Improving to
get better results | null | null | null | cs.CV cs.LG cs.RO | http://creativecommons.org/publicdomain/zero/1.0/ | Currently, there is an increase in the number of Peruvian families living in
apartments instead of houses for the lots of advantage; However, in some cases
there are troubles such as robberies of goods that are usually left at the
parking lots or the entrance of strangers that use the tenants parking lots
(this last ... | [
{
"created": "Sat, 1 Sep 2018 21:00:58 GMT",
"version": "v1"
},
{
"created": "Sat, 29 Sep 2018 01:00:32 GMT",
"version": "v2"
},
{
"created": "Sat, 14 Sep 2019 21:40:42 GMT",
"version": "v3"
}
] | 2019-09-17 | [
[
"León",
"Leonardo",
""
],
[
"Moreno-Vera",
"Felipe",
""
],
[
"Castro",
"Renato",
""
],
[
"Navío",
"José",
""
],
[
"Capcha",
"Marco",
""
]
] | Currently, there is an increase in the number of Peruvian families living in apartments instead of houses for the lots of advantage; However, in some cases there are troubles such as robberies of goods that are usually left at the parking lots or the entrance of strangers that use the tenants parking lots (this last tr... |
2204.06736 | EPTCS | Alexander Bolotov (University of Westminster) | On the Expressive Power of the Normal Form for Branching-Time Temporal
Logics | In Proceedings NCL 2022, arXiv:2204.06359 | EPTCS 358, 2022, pp. 254-269 | 10.4204/EPTCS.358.19 | null | cs.FL cs.LO | http://creativecommons.org/licenses/by/4.0/ | With the emerging applications that involve complex distributed systems
branching-time specifications are specifically important as they reflect
dynamic and non-deterministic nature of such applications. We describe the
expressive power of a simple yet powerful branching-time specification
framework -- branching-time... | [
{
"created": "Thu, 14 Apr 2022 03:28:29 GMT",
"version": "v1"
}
] | 2022-04-15 | [
[
"Bolotov",
"Alexander",
"",
"University of Westminster"
]
] | With the emerging applications that involve complex distributed systems branching-time specifications are specifically important as they reflect dynamic and non-deterministic nature of such applications. We describe the expressive power of a simple yet powerful branching-time specification framework -- branching-time n... |
2103.08720 | Weilong Ren | Weilong Ren, Xiang Lian, Kambiz Ghazinour | Online Topic-Aware Entity Resolution Over Incomplete Data Streams
(Technical Report) | Technical report of the paper entitled "Online Topic-Aware Entity
Resolution Over Incomplete Data Streams", published on SIGMOD 2021 | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In many real applications such as the data integration, social network
analysis, and the Semantic Web, the entity resolution (ER) is an important and
fundamental problem, which identifies and links the same real-world entities
from various data sources. While prior works usually consider ER over static
and complete d... | [
{
"created": "Mon, 15 Mar 2021 21:06:12 GMT",
"version": "v1"
}
] | 2021-03-17 | [
[
"Ren",
"Weilong",
""
],
[
"Lian",
"Xiang",
""
],
[
"Ghazinour",
"Kambiz",
""
]
] | In many real applications such as the data integration, social network analysis, and the Semantic Web, the entity resolution (ER) is an important and fundamental problem, which identifies and links the same real-world entities from various data sources. While prior works usually consider ER over static and complete dat... |
2109.09300 | Jieming Zhou | Jieming Zhou, Tong Zhang, Pengfei Fang, Lars Petersson, Mehrtash
Harandi | Feature Correlation Aggregation: on the Path to Better Graph Neural
Networks | null | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Prior to the introduction of Graph Neural Networks (GNNs), modeling and
analyzing irregular data, particularly graphs, was thought to be the Achilles'
heel of deep learning. The core concept of GNNs is to find a representation by
recursively aggregating the representations of a central node and those of its
neighbors... | [
{
"created": "Mon, 20 Sep 2021 05:04:26 GMT",
"version": "v1"
}
] | 2021-09-22 | [
[
"Zhou",
"Jieming",
""
],
[
"Zhang",
"Tong",
""
],
[
"Fang",
"Pengfei",
""
],
[
"Petersson",
"Lars",
""
],
[
"Harandi",
"Mehrtash",
""
]
] | Prior to the introduction of Graph Neural Networks (GNNs), modeling and analyzing irregular data, particularly graphs, was thought to be the Achilles' heel of deep learning. The core concept of GNNs is to find a representation by recursively aggregating the representations of a central node and those of its neighbors. ... |
2311.14704 | Ezequiel Santos | David de Oliveira Lemes, Ezequiel Fran\c{c}a dos Santos, Eduardo
Romanek, Celso Fujimoto, Adriano Felix Valente | An\'alise e modelagem de jogos digitais: Relato de uma experi\^encia
educacional utlizando PBL em um grupo multidisciplinar | in Portuguese language | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Traditional software engineering education generally emphasizes strict
collaboration and technical skills However active teaching strategies where
students actively engage with the material transitioning from passive observers
to active manipulators of realworld tools have shown effectiveness in software
engineering ... | [
{
"created": "Sat, 11 Nov 2023 20:28:51 GMT",
"version": "v1"
}
] | 2023-11-28 | [
[
"Lemes",
"David de Oliveira",
""
],
[
"Santos",
"Ezequiel França dos",
""
],
[
"Romanek",
"Eduardo",
""
],
[
"Fujimoto",
"Celso",
""
],
[
"Valente",
"Adriano Felix",
""
]
] | Traditional software engineering education generally emphasizes strict collaboration and technical skills However active teaching strategies where students actively engage with the material transitioning from passive observers to active manipulators of realworld tools have shown effectiveness in software engineering Th... |
2204.11046 | Yueqi Xie | Yueqi Xie, Peilin Zhou, Sunghun Kim | Decoupled Side Information Fusion for Sequential Recommendation | Accepted to SIGIR 2022 | null | null | null | cs.IR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Side information fusion for sequential recommendation (SR) aims to
effectively leverage various side information to enhance the performance of
next-item prediction. Most state-of-the-art methods build on self-attention
networks and focus on exploring various solutions to integrate the item
embedding and side informat... | [
{
"created": "Sat, 23 Apr 2022 10:53:36 GMT",
"version": "v1"
}
] | 2022-04-26 | [
[
"Xie",
"Yueqi",
""
],
[
"Zhou",
"Peilin",
""
],
[
"Kim",
"Sunghun",
""
]
] | Side information fusion for sequential recommendation (SR) aims to effectively leverage various side information to enhance the performance of next-item prediction. Most state-of-the-art methods build on self-attention networks and focus on exploring various solutions to integrate the item embedding and side informatio... |
1012.5248 | Sergey Verlan | Ion Petre, Sergey Verlan | Matrix Insertion-Deletion Systems | null | null | null | null | cs.FL cs.CC cs.CL cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this article, we consider for the first time the operations of insertion
and deletion working in a matrix controlled manner. We show that, similarly as
in the case of context-free productions, the computational power is strictly
increased when using a matrix control: computational completeness can be
obtained by s... | [
{
"created": "Thu, 23 Dec 2010 17:00:40 GMT",
"version": "v1"
}
] | 2010-12-24 | [
[
"Petre",
"Ion",
""
],
[
"Verlan",
"Sergey",
""
]
] | In this article, we consider for the first time the operations of insertion and deletion working in a matrix controlled manner. We show that, similarly as in the case of context-free productions, the computational power is strictly increased when using a matrix control: computational completeness can be obtained by sys... |
2401.09234 | Alfredo Go\~ni Sarriguren | Alfredo Go\~ni Sarriguren | SARRIGUREN: a polynomial-time complete algorithm for random $k$-SAT with
relatively dense clauses | 23 pages, 2 figures, 8 tables, algorithms, results and data in
http://bdi.si.ehu.es/bdi/sarriguren | null | null | null | cs.DS cs.CC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | SARRIGUREN, a new complete algorithm for SAT based on counting clauses (which
is valid also for Unique-SAT and #SAT) is described, analyzed and tested.
Although existing complete algorithms for SAT perform slower with clauses with
many literals, that is an advantage for SARRIGUREN, because the more literals
are in th... | [
{
"created": "Wed, 17 Jan 2024 14:23:55 GMT",
"version": "v1"
}
] | 2024-01-18 | [
[
"Sarriguren",
"Alfredo Goñi",
""
]
] | SARRIGUREN, a new complete algorithm for SAT based on counting clauses (which is valid also for Unique-SAT and #SAT) is described, analyzed and tested. Although existing complete algorithms for SAT perform slower with clauses with many literals, that is an advantage for SARRIGUREN, because the more literals are in the ... |
2002.09107 | Iretiayo Akinola | Iretiayo Akinola, Jacob Varley and Dmitry Kalashnikov | Learning Precise 3D Manipulation from Multiple Uncalibrated Cameras | Accepted at International Conference on Robotics and Automation (ICRA
2020) | null | null | null | cs.RO cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we present an effective multi-view approach to closed-loop
end-to-end learning of precise manipulation tasks that are 3D in nature. Our
method learns to accomplish these tasks using multiple statically placed but
uncalibrated RGB camera views without building an explicit 3D representation
such as a poin... | [
{
"created": "Fri, 21 Feb 2020 03:28:42 GMT",
"version": "v1"
},
{
"created": "Wed, 31 Mar 2021 18:48:24 GMT",
"version": "v2"
}
] | 2021-04-02 | [
[
"Akinola",
"Iretiayo",
""
],
[
"Varley",
"Jacob",
""
],
[
"Kalashnikov",
"Dmitry",
""
]
] | In this work, we present an effective multi-view approach to closed-loop end-to-end learning of precise manipulation tasks that are 3D in nature. Our method learns to accomplish these tasks using multiple statically placed but uncalibrated RGB camera views without building an explicit 3D representation such as a pointc... |
2011.11545 | Xuhong Wang | Xuhong Wang, Ding Lyu, Mengjian Li, Yang Xia, Qi Yang, Xinwen Wang,
Xinguang Wang, Ping Cui, Yupu Yang, Bowen Sun, Zhenyu Guo | APAN: Asynchronous Propagation Attention Network for Real-time Temporal
Graph Embedding | In Proceedings of the 2021 International Conference on Management of
Data (SIGMOD/PODS '21) | null | 10.1145/3448016.3457564 | null | cs.AI cs.DB cs.SI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Limited by the time complexity of querying k-hop neighbors in a graph
database, most graph algorithms cannot be deployed online and execute
millisecond-level inference. This problem dramatically limits the potential of
applying graph algorithms in certain areas, such as financial fraud detection.
Therefore, we propos... | [
{
"created": "Mon, 23 Nov 2020 16:58:50 GMT",
"version": "v1"
},
{
"created": "Fri, 27 Nov 2020 03:12:47 GMT",
"version": "v2"
},
{
"created": "Wed, 16 Dec 2020 02:35:09 GMT",
"version": "v3"
},
{
"created": "Fri, 26 Mar 2021 05:42:05 GMT",
"version": "v4"
}
] | 2021-07-06 | [
[
"Wang",
"Xuhong",
""
],
[
"Lyu",
"Ding",
""
],
[
"Li",
"Mengjian",
""
],
[
"Xia",
"Yang",
""
],
[
"Yang",
"Qi",
""
],
[
"Wang",
"Xinwen",
""
],
[
"Wang",
"Xinguang",
""
],
[
"Cui",
"Ping",
"... | Limited by the time complexity of querying k-hop neighbors in a graph database, most graph algorithms cannot be deployed online and execute millisecond-level inference. This problem dramatically limits the potential of applying graph algorithms in certain areas, such as financial fraud detection. Therefore, we propose ... |
1908.05905 | Omar Sami Oubbati | Omar Sami Oubbati and Noureddine Chaib and Abderrahmane Lakas and
Salim Bitam | On-Demand Routing for Urban VANETs using Cooperating UAVs | 6 pages, 7 figures, conference | 2018 International Conference on Smart Communications in Network
Technologies (SaCoNeT) | 10.1109/SaCoNeT.2018.8585453 | null | cs.NI cs.IT cs.SI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vehicular ad hoc networks (VANETs) are characterized by frequent routing path
failures due to the high mobility caused by the sudden changes of the direction
of vehicles. The routing paths between two different vehicles should be
established with this challenge in mind. Stability and connectedness are a
mandatory con... | [
{
"created": "Fri, 16 Aug 2019 09:21:05 GMT",
"version": "v1"
}
] | 2019-08-19 | [
[
"Oubbati",
"Omar Sami",
""
],
[
"Chaib",
"Noureddine",
""
],
[
"Lakas",
"Abderrahmane",
""
],
[
"Bitam",
"Salim",
""
]
] | Vehicular ad hoc networks (VANETs) are characterized by frequent routing path failures due to the high mobility caused by the sudden changes of the direction of vehicles. The routing paths between two different vehicles should be established with this challenge in mind. Stability and connectedness are a mandatory condi... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.