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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2304.13081 | Jee Young Kim | Jee Young Kim, William Boag, Freya Gulamali, Alifia Hasan, Henry David
Jeffry Hogg, Mark Lifson, Deirdre Mulligan, Manesh Patel, Inioluwa Deborah
Raji, Ajai Sehgal, Keo Shaw, Danny Tobey, Alexandra Valladares, David Vidal,
Suresh Balu, Mark Sendak | Organizational Governance of Emerging Technologies: AI Adoption in
Healthcare | null | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Private and public sector structures and norms refine how emerging technology
is used in practice. In healthcare, despite a proliferation of AI adoption, the
organizational governance surrounding its use and integration is often poorly
understood. What the Health AI Partnership (HAIP) aims to do in this research
is t... | [
{
"created": "Tue, 25 Apr 2023 18:30:47 GMT",
"version": "v1"
},
{
"created": "Wed, 10 May 2023 20:27:23 GMT",
"version": "v2"
}
] | 2023-05-12 | [
[
"Kim",
"Jee Young",
""
],
[
"Boag",
"William",
""
],
[
"Gulamali",
"Freya",
""
],
[
"Hasan",
"Alifia",
""
],
[
"Hogg",
"Henry David Jeffry",
""
],
[
"Lifson",
"Mark",
""
],
[
"Mulligan",
"Deirdre",
""
],
... | Private and public sector structures and norms refine how emerging technology is used in practice. In healthcare, despite a proliferation of AI adoption, the organizational governance surrounding its use and integration is often poorly understood. What the Health AI Partnership (HAIP) aims to do in this research is to ... |
2407.07392 | Chashi Mahiul Islam | Chashi Mahiul Islam, Shaeke Salman, Montasir Shams, Xiuwen Liu, and
Piyush Kumar | Malicious Path Manipulations via Exploitation of Representation
Vulnerabilities of Vision-Language Navigation Systems | 8 pages, 5 figures. This paper has been accepted for publication at
the IEEE/RSJ International Conference on Intelligent Robots and Systems
(IROS) 2024 | null | null | null | cs.RO cs.AI cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Building on the unprecedented capabilities of large language models for
command understanding and zero-shot recognition of multi-modal vision-language
transformers, visual language navigation (VLN) has emerged as an effective way
to address multiple fundamental challenges toward a natural language interface
to robot ... | [
{
"created": "Wed, 10 Jul 2024 06:32:58 GMT",
"version": "v1"
}
] | 2024-07-11 | [
[
"Islam",
"Chashi Mahiul",
""
],
[
"Salman",
"Shaeke",
""
],
[
"Shams",
"Montasir",
""
],
[
"Liu",
"Xiuwen",
""
],
[
"Kumar",
"Piyush",
""
]
] | Building on the unprecedented capabilities of large language models for command understanding and zero-shot recognition of multi-modal vision-language transformers, visual language navigation (VLN) has emerged as an effective way to address multiple fundamental challenges toward a natural language interface to robot na... |
2303.18193 | Mallikarjun Byrasandra Ramalinga Reddy | Mallikarjun B R, Xingang Pan, Mohamed Elgharib, Christian Theobalt | GVP: Generative Volumetric Primitives | https://vcai.mpi-inf.mpg.de/projects/GVP/index.html | null | null | null | cs.CV cs.GR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Advances in 3D-aware generative models have pushed the boundary of image
synthesis with explicit camera control. To achieve high-resolution image
synthesis, several attempts have been made to design efficient generators, such
as hybrid architectures with both 3D and 2D components. However, such a design
compromises m... | [
{
"created": "Fri, 31 Mar 2023 16:50:23 GMT",
"version": "v1"
}
] | 2023-04-03 | [
[
"R",
"Mallikarjun B",
""
],
[
"Pan",
"Xingang",
""
],
[
"Elgharib",
"Mohamed",
""
],
[
"Theobalt",
"Christian",
""
]
] | Advances in 3D-aware generative models have pushed the boundary of image synthesis with explicit camera control. To achieve high-resolution image synthesis, several attempts have been made to design efficient generators, such as hybrid architectures with both 3D and 2D components. However, such a design compromises mul... |
2211.07501 | Yong-Lu Li | Yong-Lu Li, Hongwei Fan, Zuoyu Qiu, Yiming Dou, Liang Xu, Hao-Shu
Fang, Peiyang Guo, Haisheng Su, Dongliang Wang, Wei Wu, Cewu Lu | Discovering A Variety of Objects in Spatio-Temporal Human-Object
Interactions | Techniqual report. A part of the HAKE project. Project:
https://github.com/DirtyHarryLYL/HAKE-AVA | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spatio-temporal Human-Object Interaction (ST-HOI) detection aims at detecting
HOIs from videos, which is crucial for activity understanding. In daily HOIs,
humans often interact with a variety of objects, e.g., holding and touching
dozens of household items in cleaning. However, existing whole body-object
interaction... | [
{
"created": "Mon, 14 Nov 2022 16:33:54 GMT",
"version": "v1"
},
{
"created": "Fri, 18 Nov 2022 00:18:02 GMT",
"version": "v2"
}
] | 2022-11-21 | [
[
"Li",
"Yong-Lu",
""
],
[
"Fan",
"Hongwei",
""
],
[
"Qiu",
"Zuoyu",
""
],
[
"Dou",
"Yiming",
""
],
[
"Xu",
"Liang",
""
],
[
"Fang",
"Hao-Shu",
""
],
[
"Guo",
"Peiyang",
""
],
[
"Su",
"Haisheng",
... | Spatio-temporal Human-Object Interaction (ST-HOI) detection aims at detecting HOIs from videos, which is crucial for activity understanding. In daily HOIs, humans often interact with a variety of objects, e.g., holding and touching dozens of household items in cleaning. However, existing whole body-object interaction v... |
1909.05204 | Oded Naor | Oded Naor, Mathieu Baudet, Dahlia Malkhi, Alexander Spiegelman | Cogsworth: Byzantine View Synchronization | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most methods for Byzantine fault tolerance (BFT) in the partial synchrony
setting divide the local state of the nodes into views, and the transition from
one view to the next dictates a leader change. In order to provide liveness,
all honest nodes need to stay in the same view for a sufficiently long time.
This requi... | [
{
"created": "Wed, 11 Sep 2019 16:50:28 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Sep 2019 21:14:55 GMT",
"version": "v2"
},
{
"created": "Thu, 6 Feb 2020 17:09:00 GMT",
"version": "v3"
}
] | 2020-02-07 | [
[
"Naor",
"Oded",
""
],
[
"Baudet",
"Mathieu",
""
],
[
"Malkhi",
"Dahlia",
""
],
[
"Spiegelman",
"Alexander",
""
]
] | Most methods for Byzantine fault tolerance (BFT) in the partial synchrony setting divide the local state of the nodes into views, and the transition from one view to the next dictates a leader change. In order to provide liveness, all honest nodes need to stay in the same view for a sufficiently long time. This require... |
2205.06619 | Amra Omanovi\'c | Amra Omanovi\'c, Polona Oblak and Toma\v{z} Curk | FastSTMF: Efficient tropical matrix factorization algorithm for sparse
data | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Matrix factorization, one of the most popular methods in machine learning,
has recently benefited from introducing non-linearity in prediction tasks using
tropical semiring. The non-linearity enables a better fit to extreme values and
distributions, thus discovering high-variance patterns that differ from those
found... | [
{
"created": "Fri, 13 May 2022 13:13:06 GMT",
"version": "v1"
}
] | 2022-05-16 | [
[
"Omanović",
"Amra",
""
],
[
"Oblak",
"Polona",
""
],
[
"Curk",
"Tomaž",
""
]
] | Matrix factorization, one of the most popular methods in machine learning, has recently benefited from introducing non-linearity in prediction tasks using tropical semiring. The non-linearity enables a better fit to extreme values and distributions, thus discovering high-variance patterns that differ from those found b... |
1304.6709 | Rob Sanderson | Robert Sanderson, Paolo Ciccarese, Herbert Van de Sompel | Designing the W3C Open Annotation Data Model | 10 pages, 13 figures, accepted to ACM Conference on Web Science 2013 | null | null | null | cs.DL | http://creativecommons.org/licenses/by-nc-sa/3.0/ | The Open Annotation Core Data Model specifies an interoperable framework for
creating associations between related resources, called annotations, using a
methodology that conforms to the Architecture of the World Wide Web. Open
Annotations can easily be shared between platforms, with sufficient richness of
expression... | [
{
"created": "Wed, 24 Apr 2013 19:49:57 GMT",
"version": "v1"
}
] | 2013-04-25 | [
[
"Sanderson",
"Robert",
""
],
[
"Ciccarese",
"Paolo",
""
],
[
"Van de Sompel",
"Herbert",
""
]
] | The Open Annotation Core Data Model specifies an interoperable framework for creating associations between related resources, called annotations, using a methodology that conforms to the Architecture of the World Wide Web. Open Annotations can easily be shared between platforms, with sufficient richness of expression t... |
1405.4127 | Enrico Paolini | Enrico Paolini, Cedomir Stefanovic, Gianluigi Liva, Petar Popovski | Coded Random Access: Applying Codes on Graphs to Design Random Access
Protocols | 12 pages, 4 figures, IEEE Communications Magazine, Volume 53, Issue
6, June 2015 | null | 10.1109/MCOM.2015.7120031 | null | cs.NI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rise of machine-to-machine communications has rekindled the interest in
random access protocols as a support for a massive number of uncoordinatedly
transmitting devices. The legacy ALOHA approach is developed under a collision
model, where slots containing collided packets are considered as waste.
However, if th... | [
{
"created": "Fri, 16 May 2014 10:58:45 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Jul 2017 07:50:25 GMT",
"version": "v2"
}
] | 2017-07-04 | [
[
"Paolini",
"Enrico",
""
],
[
"Stefanovic",
"Cedomir",
""
],
[
"Liva",
"Gianluigi",
""
],
[
"Popovski",
"Petar",
""
]
] | The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model, where slots containing collided packets are considered as waste. However, if the ... |
2210.16643 | Roshan Sharma | Roshan Sharma and Bhiksha Raj | XNOR-FORMER: Learning Accurate Approximations in Long Speech
Transformers | Under review at ICASSP 2023 | null | null | null | cs.CL cs.AI cs.SD eess.AS | http://creativecommons.org/licenses/by-sa/4.0/ | Transformers are among the state of the art for many tasks in speech, vision,
and natural language processing, among others. Self-attentions, which are
crucial contributors to this performance have quadratic computational
complexity, which makes training on longer input sequences challenging. Prior
work has produced ... | [
{
"created": "Sat, 29 Oct 2022 16:21:30 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Dec 2022 20:40:58 GMT",
"version": "v2"
}
] | 2022-12-21 | [
[
"Sharma",
"Roshan",
""
],
[
"Raj",
"Bhiksha",
""
]
] | Transformers are among the state of the art for many tasks in speech, vision, and natural language processing, among others. Self-attentions, which are crucial contributors to this performance have quadratic computational complexity, which makes training on longer input sequences challenging. Prior work has produced st... |
2103.09062 | Md Amiruzzaman | Md Mashfiq Rizvee and Md Amiruzzaman and Md Rajibul Islam | Data Mining and Visualization to Understand Accident-prone Areas | 8 figures, 1 table | Proceedings of International Joint Conference on Advances in
Computational Intelligence 2020 | 10.1007/978-981-16-0586-4_12 | null | cs.CY cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this study, we present both data mining and information visualization
techniques to identify accident-prone areas, most accident-prone time, day, and
month. Also, we surveyed among volunteers to understand which visualization
techniques help non-expert users to understand the findings better. Findings of
this stud... | [
{
"created": "Thu, 11 Mar 2021 18:11:23 GMT",
"version": "v1"
}
] | 2021-03-22 | [
[
"Rizvee",
"Md Mashfiq",
""
],
[
"Amiruzzaman",
"Md",
""
],
[
"Islam",
"Md Rajibul",
""
]
] | In this study, we present both data mining and information visualization techniques to identify accident-prone areas, most accident-prone time, day, and month. Also, we surveyed among volunteers to understand which visualization techniques help non-expert users to understand the findings better. Findings of this study ... |
2306.01203 | Subhrajit Bhattacharya | Alp Sahin and Subhrajit Bhattacharya | Topo-Geometrically Distinct Path Computation using
Neighborhood-augmented Graph, and its Application to Path Planning for a
Tethered Robot in 3D | 29 pages, 20 figures | null | null | null | cs.RO cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many robotics applications benefit from being able to compute multiple
locally optimal paths in a given configuration space. Examples include path
planning for of tethered robots with cable-length constraints, systems
involving cables, multi-robot topological exploration & coverage, and,
congestion reduction for mobi... | [
{
"created": "Thu, 1 Jun 2023 23:33:53 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Jul 2023 21:55:15 GMT",
"version": "v2"
}
] | 2023-07-12 | [
[
"Sahin",
"Alp",
""
],
[
"Bhattacharya",
"Subhrajit",
""
]
] | Many robotics applications benefit from being able to compute multiple locally optimal paths in a given configuration space. Examples include path planning for of tethered robots with cable-length constraints, systems involving cables, multi-robot topological exploration & coverage, and, congestion reduction for mobile... |
2403.02525 | Kshitij Kulkarni | Tarun Chitra, Kshitij Kulkarni, Mallesh Pai, Theo Diamandis | An Analysis of Intent-Based Markets | 27 pages, 2 figures | null | null | null | cs.GT | http://creativecommons.org/licenses/by/4.0/ | Mechanisms for decentralized finance on blockchains suffer from various
problems, including suboptimal price execution for users, latency, and a worse
user experience compared to their centralized counterparts. Recently, off-chain
marketplaces, colloquially called `intent markets,' have been proposed as a
solution to... | [
{
"created": "Mon, 4 Mar 2024 22:30:49 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Mar 2024 08:37:43 GMT",
"version": "v2"
}
] | 2024-03-07 | [
[
"Chitra",
"Tarun",
""
],
[
"Kulkarni",
"Kshitij",
""
],
[
"Pai",
"Mallesh",
""
],
[
"Diamandis",
"Theo",
""
]
] | Mechanisms for decentralized finance on blockchains suffer from various problems, including suboptimal price execution for users, latency, and a worse user experience compared to their centralized counterparts. Recently, off-chain marketplaces, colloquially called `intent markets,' have been proposed as a solution to t... |
1708.08103 | Jorge Silva | Jorge F. Silva and Pablo Piantanida | Universal Weak Variable-Length Source Coding on Countable Infinite
Alphabets | This article has been accepted for publication by IEEE. Digital
Object Identifier 10.1109/TIT.2019.2941895. Link:
https://ieeexplore.ieee.org/document/8840879. The material in this paper was
partially published in ISIT2016 [1] and ISIT2017 [2], International Symposium
on Information Theory (ISIT) | null | 10.1109/TIT.2019.2941895 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motivated from the fact that universal source coding on countably infinite
alphabets is not feasible, this work introduces the notion of almost lossless
source coding. Analog to the weak variable-length source coding problem studied
by Han (IEEE TIT, 2000, 46, 1217-1226), almost lossless source coding aims at
relaxin... | [
{
"created": "Sun, 27 Aug 2017 16:25:52 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Sep 2021 17:05:03 GMT",
"version": "v2"
},
{
"created": "Fri, 26 Nov 2021 21:55:46 GMT",
"version": "v3"
}
] | 2021-11-30 | [
[
"Silva",
"Jorge F.",
""
],
[
"Piantanida",
"Pablo",
""
]
] | Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, this work introduces the notion of almost lossless source coding. Analog to the weak variable-length source coding problem studied by Han (IEEE TIT, 2000, 46, 1217-1226), almost lossless source coding aims at relaxing ... |
2211.00224 | Dingwen Tao | Baixi Sun, Xiaodong Yu, Chengming Zhang, Jiannan Tian, Sian Jin, Kamil
Iskra, Tao Zhou, Tekin Bicer, Pete Beckman, and Dingwen Tao | SOLAR: A Highly Optimized Data Loading Framework for Distributed
Training of CNN-based Scientific Surrogates | 14 pages, 15 figures, 5 tables, submitted to VLDB '23 | null | null | null | cs.DC cs.LG | http://creativecommons.org/licenses/by/4.0/ | CNN-based surrogates have become prevalent in scientific applications to
replace conventional time-consuming physical approaches. Although these
surrogates can yield satisfactory results with significantly lower computation
costs over small training datasets, our benchmarking results show that
data-loading overhead b... | [
{
"created": "Tue, 1 Nov 2022 02:25:55 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Nov 2022 01:55:47 GMT",
"version": "v2"
}
] | 2022-11-07 | [
[
"Sun",
"Baixi",
""
],
[
"Yu",
"Xiaodong",
""
],
[
"Zhang",
"Chengming",
""
],
[
"Tian",
"Jiannan",
""
],
[
"Jin",
"Sian",
""
],
[
"Iskra",
"Kamil",
""
],
[
"Zhou",
"Tao",
""
],
[
"Bicer",
"Tekin... | CNN-based surrogates have become prevalent in scientific applications to replace conventional time-consuming physical approaches. Although these surrogates can yield satisfactory results with significantly lower computation costs over small training datasets, our benchmarking results show that data-loading overhead bec... |
2402.00224 | Karl-Ludwig Besser | Irshad A. Meer, Karl-Ludwig Besser, Mustafa Ozger, Dominic Schupke, H.
Vincent Poor, Cicek Cavdar | Learning Based Dynamic Cluster Reconfiguration for UAV Mobility
Management with 3D Beamforming | 6 pages, 4 figures | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In modern cell-less wireless networks, mobility management is undergoing a
significant transformation, transitioning from single-link handover management
to a more adaptable multi-connectivity cluster reconfiguration approach,
including often conflicting objectives like energy-efficient power allocation
and satisfyin... | [
{
"created": "Wed, 31 Jan 2024 23:05:26 GMT",
"version": "v1"
}
] | 2024-02-02 | [
[
"Meer",
"Irshad A.",
""
],
[
"Besser",
"Karl-Ludwig",
""
],
[
"Ozger",
"Mustafa",
""
],
[
"Schupke",
"Dominic",
""
],
[
"Poor",
"H. Vincent",
""
],
[
"Cavdar",
"Cicek",
""
]
] | In modern cell-less wireless networks, mobility management is undergoing a significant transformation, transitioning from single-link handover management to a more adaptable multi-connectivity cluster reconfiguration approach, including often conflicting objectives like energy-efficient power allocation and satisfying ... |
2007.04666 | Timothy Callemein | Steven Puttemans, Timothy Callemein and Toon Goedem\'e | Building Robust Industrial Applicable Object Detection Models Using
Transfer Learning and Single Pass Deep Learning Architectures | null | null | 10.5220/0006562002090217 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The uprising trend of deep learning in computer vision and artificial
intelligence can simply not be ignored. On the most diverse tasks, from
recognition and detection to segmentation, deep learning is able to obtain
state-of-the-art results, reaching top notch performance. In this paper we
explore how deep convoluti... | [
{
"created": "Thu, 9 Jul 2020 09:50:45 GMT",
"version": "v1"
}
] | 2020-07-10 | [
[
"Puttemans",
"Steven",
""
],
[
"Callemein",
"Timothy",
""
],
[
"Goedemé",
"Toon",
""
]
] | The uprising trend of deep learning in computer vision and artificial intelligence can simply not be ignored. On the most diverse tasks, from recognition and detection to segmentation, deep learning is able to obtain state-of-the-art results, reaching top notch performance. In this paper we explore how deep convolution... |
2205.15322 | Lu Yin | Lu Yin, Vlado Menkovski, Meng Fang, Tianjin Huang, Yulong Pei, Mykola
Pechenizkiy, Decebal Constantin Mocanu, Shiwei Liu | Superposing Many Tickets into One: A Performance Booster for Sparse
Neural Network Training | 17 pages, 5 figures, accepted by the 38th Conference on Uncertainty
in Artificial Intelligence (UAI) | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent works on sparse neural network training (sparse training) have shown
that a compelling trade-off between performance and efficiency can be achieved
by training intrinsically sparse neural networks from scratch. Existing sparse
training methods usually strive to find the best sparse subnetwork possible in
one s... | [
{
"created": "Mon, 30 May 2022 16:01:32 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Jun 2022 11:03:54 GMT",
"version": "v2"
},
{
"created": "Thu, 18 Aug 2022 21:35:37 GMT",
"version": "v3"
}
] | 2022-08-22 | [
[
"Yin",
"Lu",
""
],
[
"Menkovski",
"Vlado",
""
],
[
"Fang",
"Meng",
""
],
[
"Huang",
"Tianjin",
""
],
[
"Pei",
"Yulong",
""
],
[
"Pechenizkiy",
"Mykola",
""
],
[
"Mocanu",
"Decebal Constantin",
""
],
[
... | Recent works on sparse neural network training (sparse training) have shown that a compelling trade-off between performance and efficiency can be achieved by training intrinsically sparse neural networks from scratch. Existing sparse training methods usually strive to find the best sparse subnetwork possible in one sin... |
1906.11507 | Cristian-Alexandru Staicu | Cristian-Alexandru Staicu, Daniel Schoepe, Musard Balliu, Michael
Pradel, Andrei Sabelfeld | An Empirical Study of Information Flows in Real-World JavaScript | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Information flow analysis prevents secret or untrusted data from flowing into
public or trusted sinks. Existing mechanisms cover a wide array of options,
ranging from lightweight taint analysis to heavyweight information flow control
that also considers implicit flows. Dynamic analysis, which is particularly
popular ... | [
{
"created": "Thu, 27 Jun 2019 08:53:59 GMT",
"version": "v1"
}
] | 2019-06-28 | [
[
"Staicu",
"Cristian-Alexandru",
""
],
[
"Schoepe",
"Daniel",
""
],
[
"Balliu",
"Musard",
""
],
[
"Pradel",
"Michael",
""
],
[
"Sabelfeld",
"Andrei",
""
]
] | Information flow analysis prevents secret or untrusted data from flowing into public or trusted sinks. Existing mechanisms cover a wide array of options, ranging from lightweight taint analysis to heavyweight information flow control that also considers implicit flows. Dynamic analysis, which is particularly popular fo... |
1306.4549 | Felix Krahmer | Felix Krahmer, Rayan Saab, \"Ozg\"ur Y{\i}lmaz | Sigma-Delta quantization of sub-Gaussian frame expansions and its
application to compressed sensing | 22 pages | null | null | null | cs.IT math.IT math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Suppose that the collection $\{e_i\}_{i=1}^m$ forms a frame for $\R^k$, where
each entry of the vector $e_i$ is a sub-Gaussian random variable. We consider
expansions in such a frame, which are then quantized using a Sigma-Delta
scheme. We show that an arbitrary signal in $\R^k$ can be recovered from its
quantized fr... | [
{
"created": "Wed, 19 Jun 2013 13:47:27 GMT",
"version": "v1"
}
] | 2013-06-20 | [
[
"Krahmer",
"Felix",
""
],
[
"Saab",
"Rayan",
""
],
[
"Yılmaz",
"Özgür",
""
]
] | Suppose that the collection $\{e_i\}_{i=1}^m$ forms a frame for $\R^k$, where each entry of the vector $e_i$ is a sub-Gaussian random variable. We consider expansions in such a frame, which are then quantized using a Sigma-Delta scheme. We show that an arbitrary signal in $\R^k$ can be recovered from its quantized fram... |
2202.02124 | Gabriel Tseng | Gabriel Tseng and Hannah Kerner and David Rolnick | TIML: Task-Informed Meta-Learning for Agriculture | 12 pages, 4 figures | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Labeled datasets for agriculture are extremely spatially imbalanced. When
developing algorithms for data-sparse regions, a natural approach is to use
transfer learning from data-rich regions. While standard transfer learning
approaches typically leverage only direct inputs and outputs, geospatial
imagery and agricult... | [
{
"created": "Fri, 4 Feb 2022 13:27:55 GMT",
"version": "v1"
}
] | 2022-02-07 | [
[
"Tseng",
"Gabriel",
""
],
[
"Kerner",
"Hannah",
""
],
[
"Rolnick",
"David",
""
]
] | Labeled datasets for agriculture are extremely spatially imbalanced. When developing algorithms for data-sparse regions, a natural approach is to use transfer learning from data-rich regions. While standard transfer learning approaches typically leverage only direct inputs and outputs, geospatial imagery and agricultur... |
2407.13766 | Tsung-Han Wu | Tsung-Han Wu, Giscard Biamby, Jerome Quenum, Ritwik Gupta, Joseph E.
Gonzalez, Trevor Darrell, David M. Chan | Visual Haystacks: Answering Harder Questions About Sets of Images | Project page: https://visual-haystacks.github.io | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advancements in Large Multimodal Models (LMMs) have made significant
progress in the field of single-image visual question answering. However, these
models face substantial challenges when tasked with queries that span extensive
collections of images, similar to real-world scenarios like searching through
larg... | [
{
"created": "Thu, 18 Jul 2024 17:59:30 GMT",
"version": "v1"
}
] | 2024-07-19 | [
[
"Wu",
"Tsung-Han",
""
],
[
"Biamby",
"Giscard",
""
],
[
"Quenum",
"Jerome",
""
],
[
"Gupta",
"Ritwik",
""
],
[
"Gonzalez",
"Joseph E.",
""
],
[
"Darrell",
"Trevor",
""
],
[
"Chan",
"David M.",
""
]
] | Recent advancements in Large Multimodal Models (LMMs) have made significant progress in the field of single-image visual question answering. However, these models face substantial challenges when tasked with queries that span extensive collections of images, similar to real-world scenarios like searching through large ... |
1305.6954 | Daniel Vera | Eugenio Hern\'andez and Daniel Vera | Greedy type algorithms for RIP matrices. A study of two selection rules | 28 pages, 3 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Some consequences of the Restricted Isometry Property (RIP) of matrices have
been applied to develop a greedy algorithm called "ROMP" (Regularized
Orthogonal Matching Pursuit) to recover sparse signals and to approximate
non-sparse ones. These consequences were subsequently applied to other greedy
and thresholding al... | [
{
"created": "Wed, 29 May 2013 21:15:48 GMT",
"version": "v1"
}
] | 2013-05-31 | [
[
"Hernández",
"Eugenio",
""
],
[
"Vera",
"Daniel",
""
]
] | Some consequences of the Restricted Isometry Property (RIP) of matrices have been applied to develop a greedy algorithm called "ROMP" (Regularized Orthogonal Matching Pursuit) to recover sparse signals and to approximate non-sparse ones. These consequences were subsequently applied to other greedy and thresholding algo... |
1910.05766 | Tugba Erpek | Nof Abuzainab, Tugba Erpek, Kemal Davaslioglu, Yalin E. Sagduyu, Yi
Shi, Sharon J. Mackey, Mitesh Patel, Frank Panettieri, Muhammad A. Qureshi,
Volkan Isler, Aylin Yener | QoS and Jamming-Aware Wireless Networking Using Deep Reinforcement
Learning | null | null | null | null | cs.NI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of quality of service (QoS) and jamming-aware communications is
considered in an adversarial wireless network subject to external eavesdropping
and jamming attacks. To ensure robust communication against jamming, an
interference-aware routing protocol is developed that allows nodes to avoid
communication ... | [
{
"created": "Sun, 13 Oct 2019 15:10:53 GMT",
"version": "v1"
}
] | 2019-10-15 | [
[
"Abuzainab",
"Nof",
""
],
[
"Erpek",
"Tugba",
""
],
[
"Davaslioglu",
"Kemal",
""
],
[
"Sagduyu",
"Yalin E.",
""
],
[
"Shi",
"Yi",
""
],
[
"Mackey",
"Sharon J.",
""
],
[
"Patel",
"Mitesh",
""
],
[
"P... | The problem of quality of service (QoS) and jamming-aware communications is considered in an adversarial wireless network subject to external eavesdropping and jamming attacks. To ensure robust communication against jamming, an interference-aware routing protocol is developed that allows nodes to avoid communication ho... |
1808.04559 | Tal Mizrahi | Alon Riesenberg, Yonnie Kirzon, Michael Bunin, Elad Galili, Gidi
Navon, Tal Mizrahi | Time-Multiplexed Parsing in Marking-based Network Telemetry | Accepted to ACM SYSTOR, 2019. This manuscript is a pre-published
extended version | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Network telemetry is a key capability for managing the health and efficiency
of a large-scale network. Alternate Marking Performance Measurement (AM-PM) is
a recently introduced approach that accurately measures the packet loss and
delay in a network using a small overhead of one or two bits per data packet.
This pap... | [
{
"created": "Tue, 14 Aug 2018 07:18:39 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Apr 2019 08:14:33 GMT",
"version": "v2"
}
] | 2019-04-24 | [
[
"Riesenberg",
"Alon",
""
],
[
"Kirzon",
"Yonnie",
""
],
[
"Bunin",
"Michael",
""
],
[
"Galili",
"Elad",
""
],
[
"Navon",
"Gidi",
""
],
[
"Mizrahi",
"Tal",
""
]
] | Network telemetry is a key capability for managing the health and efficiency of a large-scale network. Alternate Marking Performance Measurement (AM-PM) is a recently introduced approach that accurately measures the packet loss and delay in a network using a small overhead of one or two bits per data packet. This paper... |
2303.02687 | Diptapriyo Majumdar | Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman | Expansion Lemma -- Variations and Applications to Polynomial-Time
Preprocessing | Accepted to Algorithms - Special Issue "Surveys in Algorithm Analysis
and Complexity Theory" | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In parameterized complexity, it is well-known that a parameterized problem is
fixed-parameter tractable if and only if it has a kernel - an instance
equivalent to the input instance, whose size is just a function of the
parameter. The size of the kernel can be exponential or worse, resulting in a
quest for fixed-para... | [
{
"created": "Sun, 5 Mar 2023 15:03:15 GMT",
"version": "v1"
}
] | 2023-03-07 | [
[
"Jacob",
"Ashwin",
""
],
[
"Majumdar",
"Diptapriyo",
""
],
[
"Raman",
"Venkatesh",
""
]
] | In parameterized complexity, it is well-known that a parameterized problem is fixed-parameter tractable if and only if it has a kernel - an instance equivalent to the input instance, whose size is just a function of the parameter. The size of the kernel can be exponential or worse, resulting in a quest for fixed-parame... |
1703.05902 | Zhanwei Hou | Zhanwei Hou, He Chen, Yonghui Li, Zhu Han, Branka Vucetic | A Contract-based Incentive Mechanism for Energy Harvesting-based
Internet of Things | null | null | null | null | cs.GT cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | By enabling wireless devices to be charged wirelessly and remotely, radio
frequency energy harvesting (RFEH) has become a promising technology to power
the unattended Internet of Things (IoT) low-power devices. To enable this, in
future IoT networks, besides the conventional data access points (DAPs)
responsible for ... | [
{
"created": "Fri, 17 Mar 2017 06:03:31 GMT",
"version": "v1"
}
] | 2017-03-20 | [
[
"Hou",
"Zhanwei",
""
],
[
"Chen",
"He",
""
],
[
"Li",
"Yonghui",
""
],
[
"Han",
"Zhu",
""
],
[
"Vucetic",
"Branka",
""
]
] | By enabling wireless devices to be charged wirelessly and remotely, radio frequency energy harvesting (RFEH) has become a promising technology to power the unattended Internet of Things (IoT) low-power devices. To enable this, in future IoT networks, besides the conventional data access points (DAPs) responsible for co... |
2303.03829 | Mathilde Raynal | Mathilde Raynal and Dario Pasquini and Carmela Troncoso | Can Decentralized Learning be more robust than Federated Learning? | null | null | null | null | cs.LG cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Decentralized Learning (DL) is a peer--to--peer learning approach that allows
a group of users to jointly train a machine learning model. To ensure
correctness, DL should be robust, i.e., Byzantine users must not be able to
tamper with the result of the collaboration. In this paper, we introduce two
\textit{new} atta... | [
{
"created": "Tue, 7 Mar 2023 11:53:37 GMT",
"version": "v1"
}
] | 2023-03-08 | [
[
"Raynal",
"Mathilde",
""
],
[
"Pasquini",
"Dario",
""
],
[
"Troncoso",
"Carmela",
""
]
] | Decentralized Learning (DL) is a peer--to--peer learning approach that allows a group of users to jointly train a machine learning model. To ensure correctness, DL should be robust, i.e., Byzantine users must not be able to tamper with the result of the collaboration. In this paper, we introduce two \textit{new} attack... |
2009.08097 | Sumit Kumar Jha | Sumit Kumar Jha, Susmit Jha, Rickard Ewetz, Sunny Raj, Alvaro
Velasquez, Laura L. Pullum, Ananthram Swami | An Extension of Fano's Inequality for Characterizing Model
Susceptibility to Membership Inference Attacks | 9 pages, 3 figures | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks have been shown to be vulnerable to membership inference
attacks wherein the attacker aims to detect whether specific input data were
used to train the model. These attacks can potentially leak private or
proprietary data. We present a new extension of Fano's inequality and employ it
to theoretic... | [
{
"created": "Thu, 17 Sep 2020 06:37:15 GMT",
"version": "v1"
}
] | 2020-09-18 | [
[
"Jha",
"Sumit Kumar",
""
],
[
"Jha",
"Susmit",
""
],
[
"Ewetz",
"Rickard",
""
],
[
"Raj",
"Sunny",
""
],
[
"Velasquez",
"Alvaro",
""
],
[
"Pullum",
"Laura L.",
""
],
[
"Swami",
"Ananthram",
""
]
] | Deep neural networks have been shown to be vulnerable to membership inference attacks wherein the attacker aims to detect whether specific input data were used to train the model. These attacks can potentially leak private or proprietary data. We present a new extension of Fano's inequality and employ it to theoretical... |
2208.05615 | Ibrahim Yilmaz | Ibrahim Yilmaz and Mahmoud Abouyoussef | FIGO: Enhanced Fingerprint Identification Approach Using GAN and One
Shot Learning Techniques | null | null | 10.1109/ISDFS58141.2023.10131805 | null | cs.CV cs.AI | http://creativecommons.org/publicdomain/zero/1.0/ | Fingerprint evidence plays an important role in a criminal investigation for
the identification of individuals. Although various techniques have been
proposed for fingerprint classification and feature extraction, automated
fingerprint identification of fingerprints is still in its earliest stage. The
performance of ... | [
{
"created": "Thu, 11 Aug 2022 02:45:42 GMT",
"version": "v1"
},
{
"created": "Mon, 29 May 2023 03:21:23 GMT",
"version": "v2"
}
] | 2023-05-30 | [
[
"Yilmaz",
"Ibrahim",
""
],
[
"Abouyoussef",
"Mahmoud",
""
]
] | Fingerprint evidence plays an important role in a criminal investigation for the identification of individuals. Although various techniques have been proposed for fingerprint classification and feature extraction, automated fingerprint identification of fingerprints is still in its earliest stage. The performance of tr... |
2307.03898 | Tianlei Zhu | Tianlei Zhu, Junqi Chen, Renzhe Zhu, Gaurav Gupta | StyleGAN3: Generative Networks for Improving the Equivariance of
Translation and Rotation | But now we feel we haven't fully studied our work and have found some
new great results. So after careful consideration, we're going to rework this
manuscript and try to give a more accurate model | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | StyleGAN can use style to affect facial posture and identity features, and
noise to affect hair, wrinkles, skin color and other details. Among these, the
outcomes of the picture processing will vary slightly between different
versions of styleGAN. As a result, the comparison of performance differences
between styleGA... | [
{
"created": "Sat, 8 Jul 2023 04:34:09 GMT",
"version": "v1"
},
{
"created": "Sat, 26 Aug 2023 05:23:06 GMT",
"version": "v2"
},
{
"created": "Tue, 6 Feb 2024 02:23:16 GMT",
"version": "v3"
}
] | 2024-02-07 | [
[
"Zhu",
"Tianlei",
""
],
[
"Chen",
"Junqi",
""
],
[
"Zhu",
"Renzhe",
""
],
[
"Gupta",
"Gaurav",
""
]
] | StyleGAN can use style to affect facial posture and identity features, and noise to affect hair, wrinkles, skin color and other details. Among these, the outcomes of the picture processing will vary slightly between different versions of styleGAN. As a result, the comparison of performance differences between styleGAN2... |
1810.10437 | Weidi Xu | Xingyi Cheng, Weidi Xu, Taifeng Wang and Wei Chu | Variational Semi-supervised Aspect-term Sentiment Analysis via
Transformer | Accepted by CoNLL 2019 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Aspect-term sentiment analysis (ATSA) is a longstanding challenge in natural
language understanding. It requires fine-grained semantical reasoning about a
target entity appeared in the text. As manual annotation over the aspects is
laborious and time-consuming, the amount of labeled data is limited for
supervised lea... | [
{
"created": "Wed, 24 Oct 2018 15:07:19 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Mar 2019 03:53:49 GMT",
"version": "v2"
},
{
"created": "Thu, 5 Sep 2019 06:02:03 GMT",
"version": "v3"
}
] | 2019-09-06 | [
[
"Cheng",
"Xingyi",
""
],
[
"Xu",
"Weidi",
""
],
[
"Wang",
"Taifeng",
""
],
[
"Chu",
"Wei",
""
]
] | Aspect-term sentiment analysis (ATSA) is a longstanding challenge in natural language understanding. It requires fine-grained semantical reasoning about a target entity appeared in the text. As manual annotation over the aspects is laborious and time-consuming, the amount of labeled data is limited for supervised learn... |
2304.13013 | Mitchell Wortsman | Mitchell Wortsman, Tim Dettmers, Luke Zettlemoyer, Ari Morcos, Ali
Farhadi, Ludwig Schmidt | Stable and low-precision training for large-scale vision-language models | NeurIPS 2023 | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce new methods for 1) accelerating and 2) stabilizing training for
large language-vision models. 1) For acceleration, we introduce SwitchBack, a
linear layer for int8 quantized training which provides a speed-up of 13-25%
while matching the performance of bfloat16 training within 0.1 percentage
points for t... | [
{
"created": "Tue, 25 Apr 2023 17:38:18 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Oct 2023 00:11:15 GMT",
"version": "v2"
}
] | 2023-10-18 | [
[
"Wortsman",
"Mitchell",
""
],
[
"Dettmers",
"Tim",
""
],
[
"Zettlemoyer",
"Luke",
""
],
[
"Morcos",
"Ari",
""
],
[
"Farhadi",
"Ali",
""
],
[
"Schmidt",
"Ludwig",
""
]
] | We introduce new methods for 1) accelerating and 2) stabilizing training for large language-vision models. 1) For acceleration, we introduce SwitchBack, a linear layer for int8 quantized training which provides a speed-up of 13-25% while matching the performance of bfloat16 training within 0.1 percentage points for the... |
2005.08190 | Shunsuke Inenaga | Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai,
Masayuki Takeda | Towards Efficient Interactive Computation of Dynamic Time Warping
Distance | Accepted for SPIRE 2020 | null | null | null | cs.DS cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The dynamic time warping (DTW) is a widely-used method that allows us to
efficiently compare two time series that can vary in speed. Given two strings
$A$ and $B$ of respective lengths $m$ and $n$, there is a fundamental dynamic
programming algorithm that computes the DTW distance for $A$ and $B$ together
with an opt... | [
{
"created": "Sun, 17 May 2020 08:14:43 GMT",
"version": "v1"
},
{
"created": "Wed, 27 May 2020 03:15:34 GMT",
"version": "v2"
},
{
"created": "Wed, 29 Jul 2020 14:04:42 GMT",
"version": "v3"
}
] | 2020-07-30 | [
[
"Nishi",
"Akihiro",
""
],
[
"Nakashima",
"Yuto",
""
],
[
"Inenaga",
"Shunsuke",
""
],
[
"Bannai",
"Hideo",
""
],
[
"Takeda",
"Masayuki",
""
]
] | The dynamic time warping (DTW) is a widely-used method that allows us to efficiently compare two time series that can vary in speed. Given two strings $A$ and $B$ of respective lengths $m$ and $n$, there is a fundamental dynamic programming algorithm that computes the DTW distance for $A$ and $B$ together with an optim... |
2204.01386 | Yusuke Takimoto | Yusuke Takimoto, Hiroyuki Sato, Hikari Takehara, Keishiro Uragaki,
Takehiro Tawara, Xiao Liang, Kentaro Oku, Wataru Kishimoto, Bo Zheng | Dressi: A Hardware-Agnostic Differentiable Renderer with Reactive Shader
Packing and Soft Rasterization | 13 pages, 17 figures, EUROGRAPHICS 2022 | null | null | null | cs.GR cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Differentiable rendering (DR) enables various computer graphics and computer
vision applications through gradient-based optimization with derivatives of the
rendering equation. Most rasterization-based approaches are built on
general-purpose automatic differentiation (AD) libraries and DR-specific
modules handcrafted... | [
{
"created": "Mon, 4 Apr 2022 11:07:03 GMT",
"version": "v1"
}
] | 2022-04-05 | [
[
"Takimoto",
"Yusuke",
""
],
[
"Sato",
"Hiroyuki",
""
],
[
"Takehara",
"Hikari",
""
],
[
"Uragaki",
"Keishiro",
""
],
[
"Tawara",
"Takehiro",
""
],
[
"Liang",
"Xiao",
""
],
[
"Oku",
"Kentaro",
""
],
[
... | Differentiable rendering (DR) enables various computer graphics and computer vision applications through gradient-based optimization with derivatives of the rendering equation. Most rasterization-based approaches are built on general-purpose automatic differentiation (AD) libraries and DR-specific modules handcrafted u... |
2005.02315 | Chenglong Li | Zhengzheng Tu, Zhun Li, Chenglong Li, Yang Lang, Jin Tang | Multi-interactive Dual-decoder for RGB-thermal Salient Object Detection | Accepted by IEEE TIP | null | 10.1109/TIP.2021.3087412 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | RGB-thermal salient object detection (SOD) aims to segment the common
prominent regions of visible image and corresponding thermal infrared image
that we call it RGBT SOD. Existing methods don't fully explore and exploit the
potentials of complementarity of different modalities and multi-type cues of
image contents, ... | [
{
"created": "Tue, 5 May 2020 16:21:17 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Jan 2021 08:44:40 GMT",
"version": "v2"
},
{
"created": "Fri, 4 Jun 2021 12:56:34 GMT",
"version": "v3"
}
] | 2021-07-07 | [
[
"Tu",
"Zhengzheng",
""
],
[
"Li",
"Zhun",
""
],
[
"Li",
"Chenglong",
""
],
[
"Lang",
"Yang",
""
],
[
"Tang",
"Jin",
""
]
] | RGB-thermal salient object detection (SOD) aims to segment the common prominent regions of visible image and corresponding thermal infrared image that we call it RGBT SOD. Existing methods don't fully explore and exploit the potentials of complementarity of different modalities and multi-type cues of image contents, wh... |
1903.00830 | Vinayak Athavale | Vinayak Athavale, Aayush Naik, Rajas Vanjape, Manish Shrivastava | Predicting Algorithm Classes for Programming Word Problems | Work in progress | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the task of algorithm class prediction for programming word
problems. A programming word problem is a problem written in natural language,
which can be solved using an algorithm or a program. We define classes of
various programming word problems which correspond to the class of algorithms
required to so... | [
{
"created": "Sun, 3 Mar 2019 04:39:33 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Apr 2019 17:24:56 GMT",
"version": "v2"
}
] | 2019-04-05 | [
[
"Athavale",
"Vinayak",
""
],
[
"Naik",
"Aayush",
""
],
[
"Vanjape",
"Rajas",
""
],
[
"Shrivastava",
"Manish",
""
]
] | We introduce the task of algorithm class prediction for programming word problems. A programming word problem is a problem written in natural language, which can be solved using an algorithm or a program. We define classes of various programming word problems which correspond to the class of algorithms required to solv... |
2006.05754 | Mattia Antonino Di Gangi | Luisa Bentivogli and Beatrice Savoldi and Matteo Negri and Mattia
Antonino Di Gangi and Roldano Cattoni and Marco Turchi | Gender in Danger? Evaluating Speech Translation Technology on the
MuST-SHE Corpus | 9 pages of content, accepted at ACL 2020 | null | null | null | cs.CL cs.AI cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | Translating from languages without productive grammatical gender like English
into gender-marked languages is a well-known difficulty for machines. This
difficulty is also due to the fact that the training data on which models are
built typically reflect the asymmetries of natural languages, gender bias
included. Exc... | [
{
"created": "Wed, 10 Jun 2020 09:55:38 GMT",
"version": "v1"
}
] | 2020-06-11 | [
[
"Bentivogli",
"Luisa",
""
],
[
"Savoldi",
"Beatrice",
""
],
[
"Negri",
"Matteo",
""
],
[
"Di Gangi",
"Mattia Antonino",
""
],
[
"Cattoni",
"Roldano",
""
],
[
"Turchi",
"Marco",
""
]
] | Translating from languages without productive grammatical gender like English into gender-marked languages is a well-known difficulty for machines. This difficulty is also due to the fact that the training data on which models are built typically reflect the asymmetries of natural languages, gender bias included. Exclu... |
2004.13277 | Akira Matsui | Akira Matsui, Teruyoshi Kobayashi, Daisuke Moriwaki, Emilio Ferrara | Detecting multi-timescale consumption patterns from receipt data: A
non-negative tensor factorization approach | 16 pages, 10 figures | Journal of Computational Social Science (2020) | 10.1007/s42001-020-00078-5 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding consumer behavior is an important task, not only for developing
marketing strategies but also for the management of economic policies.
Detecting consumption patterns, however, is a high-dimensional problem in which
various factors that would affect consumers' behavior need to be considered,
such as cons... | [
{
"created": "Tue, 28 Apr 2020 04:07:03 GMT",
"version": "v1"
},
{
"created": "Sun, 2 Aug 2020 04:03:23 GMT",
"version": "v2"
}
] | 2020-08-25 | [
[
"Matsui",
"Akira",
""
],
[
"Kobayashi",
"Teruyoshi",
""
],
[
"Moriwaki",
"Daisuke",
""
],
[
"Ferrara",
"Emilio",
""
]
] | Understanding consumer behavior is an important task, not only for developing marketing strategies but also for the management of economic policies. Detecting consumption patterns, however, is a high-dimensional problem in which various factors that would affect consumers' behavior need to be considered, such as consum... |
2306.09735 | Daniel Reijsbergen | Dani\"el Reijsbergen, Aung Maw, Jingchi Zhang, Tien Tuan Anh Dinh,
Anwitaman Datta | PIEChain -- A Practical Blockchain Interoperability Framework | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | A plethora of different blockchain platforms have emerged in recent years,
but many of them operate in silos. As such, there is a need for reliable
cross-chain communication to enable blockchain interoperability. Blockchain
interoperability is challenging because transactions can typically not be
reverted - as such, ... | [
{
"created": "Fri, 16 Jun 2023 10:04:54 GMT",
"version": "v1"
}
] | 2023-06-19 | [
[
"Reijsbergen",
"Daniël",
""
],
[
"Maw",
"Aung",
""
],
[
"Zhang",
"Jingchi",
""
],
[
"Dinh",
"Tien Tuan Anh",
""
],
[
"Datta",
"Anwitaman",
""
]
] | A plethora of different blockchain platforms have emerged in recent years, but many of them operate in silos. As such, there is a need for reliable cross-chain communication to enable blockchain interoperability. Blockchain interoperability is challenging because transactions can typically not be reverted - as such, if... |
0912.4188 | Massimo Franceschet | Massimo Franceschet | The skewness of computer science | I applied the goodness-of-fit methodology proposed in: A. Clauset, C.
R. Shalizi, M. E. J. Newman. Power-law distributions in empirical data. SIAM
Review 51, 661-703 (2009) | null | null | null | cs.DL cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computer science is a relatively young discipline combining science,
engineering, and mathematics. The main flavors of computer science research
involve the theoretical development of conceptual models for the different
aspects of computing and the more applicative building of software artifacts
and assessment of the... | [
{
"created": "Mon, 21 Dec 2009 15:24:08 GMT",
"version": "v1"
},
{
"created": "Mon, 15 Feb 2010 12:59:59 GMT",
"version": "v2"
}
] | 2010-02-15 | [
[
"Franceschet",
"Massimo",
""
]
] | Computer science is a relatively young discipline combining science, engineering, and mathematics. The main flavors of computer science research involve the theoretical development of conceptual models for the different aspects of computing and the more applicative building of software artifacts and assessment of their... |
1410.7270 | Hisham Elshaer Mr. | Katerina Smiljkovikj, Hisham Elshaer, Petar Popovski, Federico
Boccardi, Mischa Dohler, Liljana Gavrilovska and Ralf Irmer | Capacity Analysis of Decoupled Downlink and Uplink Access in 5G
Heterogeneous Systems | 26 pages, 10 figures, submitted to IEEE Transactions on Wireless
Communications | null | null | null | cs.NI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Our traditional notion of a cell is changing dramatically given the
increasing degree of heterogeneity in 4G and emerging 5G systems. Rather than
belonging to a specific cell, a device would choose the most suitable
connection from the plethora of connections available. In such a setting, given
the transmission power... | [
{
"created": "Mon, 27 Oct 2014 15:16:45 GMT",
"version": "v1"
}
] | 2014-10-28 | [
[
"Smiljkovikj",
"Katerina",
""
],
[
"Elshaer",
"Hisham",
""
],
[
"Popovski",
"Petar",
""
],
[
"Boccardi",
"Federico",
""
],
[
"Dohler",
"Mischa",
""
],
[
"Gavrilovska",
"Liljana",
""
],
[
"Irmer",
"Ralf",
""... | Our traditional notion of a cell is changing dramatically given the increasing degree of heterogeneity in 4G and emerging 5G systems. Rather than belonging to a specific cell, a device would choose the most suitable connection from the plethora of connections available. In such a setting, given the transmission powers ... |
2209.14598 | Bla\v{z} \v{S}krlj | Bla\v{z} \v{S}krlj, Adi Schwartz, Jure Ferle\v{z}, Davorin Kopi\v{c}
and Naama Ziporin | Dynamic Surrogate Switching: Sample-Efficient Search for Factorization
Machine Configurations in Online Recommendations | https://dl.acm.org/doi/abs/10.1145/3523227.3547384 | null | 10.1145/3523227.3547384 | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Hyperparameter optimization is the process of identifying the appropriate
hyperparameter configuration of a given machine learning model with regard to a
given learning task. For smaller data sets, an exhaustive search is possible;
However, when the data size and model complexity increase, the number of
configuration... | [
{
"created": "Thu, 29 Sep 2022 07:29:38 GMT",
"version": "v1"
}
] | 2022-09-30 | [
[
"Škrlj",
"Blaž",
""
],
[
"Schwartz",
"Adi",
""
],
[
"Ferlež",
"Jure",
""
],
[
"Kopič",
"Davorin",
""
],
[
"Ziporin",
"Naama",
""
]
] | Hyperparameter optimization is the process of identifying the appropriate hyperparameter configuration of a given machine learning model with regard to a given learning task. For smaller data sets, an exhaustive search is possible; However, when the data size and model complexity increase, the number of configuration e... |
2101.00062 | Zixiang Zhao | Zixiang Zhao, Jiangshe Zhang, Shuang Xu, Kai Sun, Lu Huang, Junmin
Liu, Chunxia Zhang | FGF-GAN: A Lightweight Generative Adversarial Network for Pansharpening
via Fast Guided Filter | Accepted by ICME 2021 (Oral) | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pansharpening is a widely used image enhancement technique for remote
sensing. Its principle is to fuse the input high-resolution single-channel
panchromatic (PAN) image and low-resolution multi-spectral image and to obtain
a high-resolution multi-spectral (HRMS) image. The existing deep learning
pansharpening method... | [
{
"created": "Thu, 31 Dec 2020 20:27:17 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Nov 2021 13:50:35 GMT",
"version": "v2"
}
] | 2021-12-01 | [
[
"Zhao",
"Zixiang",
""
],
[
"Zhang",
"Jiangshe",
""
],
[
"Xu",
"Shuang",
""
],
[
"Sun",
"Kai",
""
],
[
"Huang",
"Lu",
""
],
[
"Liu",
"Junmin",
""
],
[
"Zhang",
"Chunxia",
""
]
] | Pansharpening is a widely used image enhancement technique for remote sensing. Its principle is to fuse the input high-resolution single-channel panchromatic (PAN) image and low-resolution multi-spectral image and to obtain a high-resolution multi-spectral (HRMS) image. The existing deep learning pansharpening method h... |
2306.08277 | Mridul Gupta | Mridul Gupta, Hariprasad Kodamana, Sayan Ranu | FRIGATE: Frugal Spatio-temporal Forecasting on Road Networks | null | Proceedings of the 29th ACM SIGKDD Conference on Knowledge
Discovery and Data Mining (KDD 23), 2023 | 10.1145/3580305.3599357 | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Modelling spatio-temporal processes on road networks is a task of growing
importance. While significant progress has been made on developing
spatio-temporal graph neural networks (Gnns), existing works are built upon
three assumptions that are not practical on real-world road networks. First,
they assume sensing on e... | [
{
"created": "Wed, 14 Jun 2023 06:28:26 GMT",
"version": "v1"
}
] | 2023-06-16 | [
[
"Gupta",
"Mridul",
""
],
[
"Kodamana",
"Hariprasad",
""
],
[
"Ranu",
"Sayan",
""
]
] | Modelling spatio-temporal processes on road networks is a task of growing importance. While significant progress has been made on developing spatio-temporal graph neural networks (Gnns), existing works are built upon three assumptions that are not practical on real-world road networks. First, they assume sensing on eve... |
2105.10893 | Stephen MacDonell | Sherlock A. Licorish and Stephen G. MacDonell | What can developers' messages tell us? A psycholinguistic analysis of
Jazz teams' attitudes and behavior patterns | Conference paper, 11 pages, 3 figures, 4 tables. arXiv admin note:
text overlap with arXiv:2102.06317 | Proceedings of the 22nd Australasian Software Engineering
Conference (ASWEC2013). Melbourne, Australia, IEEE Computer Society Press,
pp.107-116 | 10.1109/ASWEC.2013.22 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reports that communication and behavioral issues contribute to inadequately
performing software teams have fuelled a wealth of research aimed at
understanding the human processes employed during software development. The
increasing level of interest in human issues is particularly relevant for agile
and global softwa... | [
{
"created": "Sun, 23 May 2021 09:15:51 GMT",
"version": "v1"
}
] | 2021-05-25 | [
[
"Licorish",
"Sherlock A.",
""
],
[
"MacDonell",
"Stephen G.",
""
]
] | Reports that communication and behavioral issues contribute to inadequately performing software teams have fuelled a wealth of research aimed at understanding the human processes employed during software development. The increasing level of interest in human issues is particularly relevant for agile and global software... |
2111.02887 | Mo Alloulah | Mohammed Alloulah, Akash Deep Singh, Maximilian Arnold | Self-Supervised Radio-Visual Representation Learning for 6G Sensing | To appear in IEEE ICC '22 | null | null | null | cs.NI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In future 6G cellular networks, a joint communication and sensing protocol
will allow the network to perceive the environment, opening the door for many
new applications atop a unified communication-perception infrastructure.
However, interpreting the sparse radio representation of sensing scenes is
challenging, whic... | [
{
"created": "Mon, 1 Nov 2021 12:23:47 GMT",
"version": "v1"
},
{
"created": "Thu, 24 Feb 2022 00:19:15 GMT",
"version": "v2"
}
] | 2022-02-25 | [
[
"Alloulah",
"Mohammed",
""
],
[
"Singh",
"Akash Deep",
""
],
[
"Arnold",
"Maximilian",
""
]
] | In future 6G cellular networks, a joint communication and sensing protocol will allow the network to perceive the environment, opening the door for many new applications atop a unified communication-perception infrastructure. However, interpreting the sparse radio representation of sensing scenes is challenging, which ... |
1909.06510 | Jason Wilson | Jason R. Wilson, Seongsik Kim, Ulyana Kurylo, Joseph Cummings, Eshan
Tarneja | Developing Computational Models of Social Assistance to Guide Socially
Assistive Robots | 5 pages, AI-HRI, work in progress | null | null | AI-HRI/2019/23 | cs.HC cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While there are many examples in which robots provide social assistance, a
lack of theory on how the robots should decide how to assist impedes progress
in realizing these technologies. To address this deficiency, we propose a pair
of computational models to guide a robot as it provides social assistance. The
model o... | [
{
"created": "Sat, 14 Sep 2019 02:37:40 GMT",
"version": "v1"
}
] | 2019-09-17 | [
[
"Wilson",
"Jason R.",
""
],
[
"Kim",
"Seongsik",
""
],
[
"Kurylo",
"Ulyana",
""
],
[
"Cummings",
"Joseph",
""
],
[
"Tarneja",
"Eshan",
""
]
] | While there are many examples in which robots provide social assistance, a lack of theory on how the robots should decide how to assist impedes progress in realizing these technologies. To address this deficiency, we propose a pair of computational models to guide a robot as it provides social assistance. The model of ... |
1608.06133 | David Escorial Rico | David Escorial Rico, Mark Hann | A Combined Dependability and Security Approach for Third Party Software
in Space Systems | Editor: Gilles Tredan. 12th European Dependable Computing Conference
(EDCC 2016), September 5-9, 2016, Gothenburg, Sweden. Fast Abstracts
Proceedings- EDCC 2016 | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Software components for on-board architectures in the space domain are
increasingly reliant on Commercial Off-The-Shelf (COTS), Open Source (OSS) or
other third party software products. However, these software components often
have not been built with mission critical requirements in mind. Development
project teams i... | [
{
"created": "Mon, 22 Aug 2016 11:51:34 GMT",
"version": "v1"
}
] | 2016-08-23 | [
[
"Rico",
"David Escorial",
""
],
[
"Hann",
"Mark",
""
]
] | Software components for on-board architectures in the space domain are increasingly reliant on Commercial Off-The-Shelf (COTS), Open Source (OSS) or other third party software products. However, these software components often have not been built with mission critical requirements in mind. Development project teams inc... |
2001.06307 | Jim Pivarski | Jim Pivarski (1), Peter Elmer (1), David Lange (1) ((1) Princeton
University) | Awkward Arrays in Python, C++, and Numba | To be published in CHEP 2019 proceedings, EPJ Web of Conferences;
post-review update | null | 10.1051/epjconf/202024505023 | null | cs.MS hep-ex | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Awkward Array library has been an important tool for physics analysis in
Python since September 2018. However, some interface and implementation issues
have been raised in Awkward Array's first year that argue for a
reimplementation in C++ and Numba. We describe those issues, the new
architecture, and present som... | [
{
"created": "Wed, 15 Jan 2020 16:48:07 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Jul 2020 20:46:11 GMT",
"version": "v2"
}
] | 2021-02-03 | [
[
"Pivarski",
"Jim",
""
],
[
"Elmer",
"Peter",
""
],
[
"Lange",
"David",
""
]
] | The Awkward Array library has been an important tool for physics analysis in Python since September 2018. However, some interface and implementation issues have been raised in Awkward Array's first year that argue for a reimplementation in C++ and Numba. We describe those issues, the new architecture, and present some ... |
2408.07253 | Enhao Zhang | Enhao Zhang, Chaohua Li, Chuanxing Geng, and Songcan Chen | All-around Neural Collapse for Imbalanced Classification | null | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural Collapse (NC) presents an elegant geometric structure that enables
individual activations (features), class means and classifier (weights) vectors
to reach \textit{optimal} inter-class separability during the terminal phase of
training on a \textit{balanced} dataset. Once shifted to imbalanced
classification, ... | [
{
"created": "Wed, 14 Aug 2024 02:06:24 GMT",
"version": "v1"
}
] | 2024-08-15 | [
[
"Zhang",
"Enhao",
""
],
[
"Li",
"Chaohua",
""
],
[
"Geng",
"Chuanxing",
""
],
[
"Chen",
"Songcan",
""
]
] | Neural Collapse (NC) presents an elegant geometric structure that enables individual activations (features), class means and classifier (weights) vectors to reach \textit{optimal} inter-class separability during the terminal phase of training on a \textit{balanced} dataset. Once shifted to imbalanced classification, su... |
1605.03143 | Tom Everitt | Tom Everitt, Marcus Hutter | Avoiding Wireheading with Value Reinforcement Learning | Artificial General Intelligence (AGI) 2016 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | How can we design good goals for arbitrarily intelligent agents?
Reinforcement learning (RL) is a natural approach. Unfortunately, RL does not
work well for generally intelligent agents, as RL agents are incentivised to
shortcut the reward sensor for maximum reward -- the so-called wireheading
problem. In this paper ... | [
{
"created": "Tue, 10 May 2016 18:28:57 GMT",
"version": "v1"
}
] | 2016-05-11 | [
[
"Everitt",
"Tom",
""
],
[
"Hutter",
"Marcus",
""
]
] | How can we design good goals for arbitrarily intelligent agents? Reinforcement learning (RL) is a natural approach. Unfortunately, RL does not work well for generally intelligent agents, as RL agents are incentivised to shortcut the reward sensor for maximum reward -- the so-called wireheading problem. In this paper we... |
2304.13525 | Carlos Perez-del-Pulgar J. | Raul Castilla-Arquillo, Anthony Mandow, Carlos J. Perez-del-Pulgar,
Cesar Alvarez-Llamas, Jose M. Vadillo, and Javier Laserna | Thermal Vision for Soil Assessment in a Multipurpose Environmental
Chamber under Martian Conditions towards Robot Navigation | 10 pages, 13 figures | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Soil assessment is important for mobile robot planning and navigation on
natural and planetary environments. Terramechanic characteristics can be
inferred from the thermal behaviour of soils under the influence of sunlight
using remote sensors such as Long-Wave Infrared cameras. However, this
behaviour is greatly aff... | [
{
"created": "Wed, 26 Apr 2023 13:01:38 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Jul 2023 12:49:37 GMT",
"version": "v2"
}
] | 2023-07-17 | [
[
"Castilla-Arquillo",
"Raul",
""
],
[
"Mandow",
"Anthony",
""
],
[
"Perez-del-Pulgar",
"Carlos J.",
""
],
[
"Alvarez-Llamas",
"Cesar",
""
],
[
"Vadillo",
"Jose M.",
""
],
[
"Laserna",
"Javier",
""
]
] | Soil assessment is important for mobile robot planning and navigation on natural and planetary environments. Terramechanic characteristics can be inferred from the thermal behaviour of soils under the influence of sunlight using remote sensors such as Long-Wave Infrared cameras. However, this behaviour is greatly affec... |
2101.01693 | Rohan Sukumaran | Manuel Morales, Rachel Barbar, Darshan Gandhi, Sanskruti Landage,
Joseph Bae, Arpita Vats, Jil Kothari, Sheshank Shankar, Rohan Sukumaran, Himi
Mathur, Krutika Misra, Aishwarya Saxena, Parth Patwa, Sethuraman T. V.,
Maurizio Arseni, Shailesh Advani, Kasia Jakimowicz, Sunaina Anand, Priyanshi
Katiyar, Ashley Meh... | COVID-19 Tests Gone Rogue: Privacy, Efficacy, Mismanagement and
Misunderstandings | 22 pages, 2 figures | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | COVID-19 testing, the cornerstone for effective screening and identification
of COVID-19 cases, remains paramount as an intervention tool to curb the spread
of COVID-19 both at local and national levels. However, the speed at which the
pandemic struck and the response was rolled out, the widespread impact on
healthca... | [
{
"created": "Tue, 5 Jan 2021 18:37:26 GMT",
"version": "v1"
},
{
"created": "Sat, 6 Feb 2021 12:27:31 GMT",
"version": "v2"
},
{
"created": "Fri, 7 May 2021 14:25:18 GMT",
"version": "v3"
}
] | 2021-05-10 | [
[
"Morales",
"Manuel",
""
],
[
"Barbar",
"Rachel",
""
],
[
"Gandhi",
"Darshan",
""
],
[
"Landage",
"Sanskruti",
""
],
[
"Bae",
"Joseph",
""
],
[
"Vats",
"Arpita",
""
],
[
"Kothari",
"Jil",
""
],
[
"Sh... | COVID-19 testing, the cornerstone for effective screening and identification of COVID-19 cases, remains paramount as an intervention tool to curb the spread of COVID-19 both at local and national levels. However, the speed at which the pandemic struck and the response was rolled out, the widespread impact on healthcare... |
1809.02283 | Yuepeng Wang | Yuepeng Wang, Xinyu Wang, Isil Dillig | Relational Program Synthesis | null | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes relational program synthesis, a new problem that concerns
synthesizing one or more programs that collectively satisfy a relational
specification. As a dual of relational program verification, relational program
synthesis is an important problem that has many practical applications, such as
automat... | [
{
"created": "Fri, 7 Sep 2018 02:43:01 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Sep 2018 00:48:40 GMT",
"version": "v2"
}
] | 2018-09-12 | [
[
"Wang",
"Yuepeng",
""
],
[
"Wang",
"Xinyu",
""
],
[
"Dillig",
"Isil",
""
]
] | This paper proposes relational program synthesis, a new problem that concerns synthesizing one or more programs that collectively satisfy a relational specification. As a dual of relational program verification, relational program synthesis is an important problem that has many practical applications, such as automated... |
2405.13678 | Shuowen Zhang | Chan Xu and Shuowen Zhang | Integrated Sensing and Communication Exploiting Prior Information: How
Many Sensing Beams are Needed? | This is the longer version of a paper to appear in IEEE International
Symposium on Information Theory (ISIT), 2024 | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies an integrated sensing and communication (ISAC) system
where a multi-antenna base station (BS) aims to communicate with a
single-antenna user in the downlink and sense the unknown and random angle
parameter of a target via exploiting its prior distribution information. We
consider a general transmit... | [
{
"created": "Wed, 22 May 2024 14:21:09 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Xu",
"Chan",
""
],
[
"Zhang",
"Shuowen",
""
]
] | This paper studies an integrated sensing and communication (ISAC) system where a multi-antenna base station (BS) aims to communicate with a single-antenna user in the downlink and sense the unknown and random angle parameter of a target via exploiting its prior distribution information. We consider a general transmit b... |
2310.11608 | Julie Stephany Berrio Perez | Santiago Gerling Konrad, Julie Stephany Berrio, Mao Shan, Favio Masson
and Stewart Worrall | Classification of Safety Driver Attention During Autonomous Vehicle
Operation | null | null | null | null | cs.RO cs.CV cs.HC | http://creativecommons.org/licenses/by/4.0/ | Despite the continual advances in Advanced Driver Assistance Systems (ADAS)
and the development of high-level autonomous vehicles (AV), there is a general
consensus that for the short to medium term, there is a requirement for a human
supervisor to handle the edge cases that inevitably arise. Given this
requirement, ... | [
{
"created": "Tue, 17 Oct 2023 22:04:42 GMT",
"version": "v1"
}
] | 2023-10-19 | [
[
"Konrad",
"Santiago Gerling",
""
],
[
"Berrio",
"Julie Stephany",
""
],
[
"Shan",
"Mao",
""
],
[
"Masson",
"Favio",
""
],
[
"Worrall",
"Stewart",
""
]
] | Despite the continual advances in Advanced Driver Assistance Systems (ADAS) and the development of high-level autonomous vehicles (AV), there is a general consensus that for the short to medium term, there is a requirement for a human supervisor to handle the edge cases that inevitably arise. Given this requirement, it... |
2208.14309 | Lu\'is Felipe Ign\'acio Cunha | Fernanda Couto, Lu\'is Cunha, Diego Ferraz | Simpler and efficient characterizations of tree t-spanners for graphs
with few P4's and (k, l)-graphs | null | null | null | null | cs.DM math.CO | http://creativecommons.org/licenses/by/4.0/ | A tree $t$-spanner of a graph $G$ is a spanning tree $T$ in which the
distance between any two adjacent vertices of $G$ is at most $t$. The smallest
$t$ for which $G$ has a tree $t$-spanner is called tree stretch index. The
$t$-admissibility problem aims to decide whether the tree stretch index is at
most $t$. Regard... | [
{
"created": "Tue, 30 Aug 2022 14:48:29 GMT",
"version": "v1"
}
] | 2022-08-31 | [
[
"Couto",
"Fernanda",
""
],
[
"Cunha",
"Luís",
""
],
[
"Ferraz",
"Diego",
""
]
] | A tree $t$-spanner of a graph $G$ is a spanning tree $T$ in which the distance between any two adjacent vertices of $G$ is at most $t$. The smallest $t$ for which $G$ has a tree $t$-spanner is called tree stretch index. The $t$-admissibility problem aims to decide whether the tree stretch index is at most $t$. Regardin... |
2308.10077 | Asif Khan | Asif Khan, Amos Storkey | Contrastive Learning for Non-Local Graphs with Multi-Resolution
Structural Views | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Learning node-level representations of heterophilic graphs is crucial for
various applications, including fraudster detection and protein function
prediction. In such graphs, nodes share structural similarity identified by the
equivalence of their connectivity which is implicitly encoded in the form of
higher-order h... | [
{
"created": "Sat, 19 Aug 2023 17:42:02 GMT",
"version": "v1"
}
] | 2023-08-22 | [
[
"Khan",
"Asif",
""
],
[
"Storkey",
"Amos",
""
]
] | Learning node-level representations of heterophilic graphs is crucial for various applications, including fraudster detection and protein function prediction. In such graphs, nodes share structural similarity identified by the equivalence of their connectivity which is implicitly encoded in the form of higher-order hie... |
2108.06228 | Erzhuo Shao | Erzhuo Shao, Jie Feng, Yingheng Wang, Tong Xia and Yong Li | One-shot Transfer Learning for Population Mapping | Published in Proceedings of the 30th ACM International Conference on
Information and Knowledge Management (CIKM '21) | null | 10.1145/3459637.3482460 | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fine-grained population distribution data is of great importance for many
applications, e.g., urban planning, traffic scheduling, epidemic modeling, and
risk control. However, due to the limitations of data collection, including
infrastructure density, user privacy, and business security, such fine-grained
data is ha... | [
{
"created": "Fri, 13 Aug 2021 13:19:09 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Aug 2021 17:48:58 GMT",
"version": "v2"
}
] | 2021-08-18 | [
[
"Shao",
"Erzhuo",
""
],
[
"Feng",
"Jie",
""
],
[
"Wang",
"Yingheng",
""
],
[
"Xia",
"Tong",
""
],
[
"Li",
"Yong",
""
]
] | Fine-grained population distribution data is of great importance for many applications, e.g., urban planning, traffic scheduling, epidemic modeling, and risk control. However, due to the limitations of data collection, including infrastructure density, user privacy, and business security, such fine-grained data is hard... |
2402.10380 | Junhyun Lee | Junhyun Lee, Wooseong Yang, Jaewoo Kang | Subgraph-level Universal Prompt Tuning | null | null | null | null | cs.LG cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | In the evolving landscape of machine learning, the adaptation of pre-trained
models through prompt tuning has become increasingly prominent. This trend is
particularly observable in the graph domain, where diverse pre-training
strategies present unique challenges in developing effective prompt-based
tuning methods fo... | [
{
"created": "Fri, 16 Feb 2024 00:25:24 GMT",
"version": "v1"
}
] | 2024-02-19 | [
[
"Lee",
"Junhyun",
""
],
[
"Yang",
"Wooseong",
""
],
[
"Kang",
"Jaewoo",
""
]
] | In the evolving landscape of machine learning, the adaptation of pre-trained models through prompt tuning has become increasingly prominent. This trend is particularly observable in the graph domain, where diverse pre-training strategies present unique challenges in developing effective prompt-based tuning methods for ... |
2405.00182 | Nan Jia | Adam Catto, Nan Jia, Ansaf Salleb-Aouissi, Anita Raja | M-DEW: Extending Dynamic Ensemble Weighting to Handle Missing Values | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Missing value imputation is a crucial preprocessing step for many machine
learning problems. However, it is often considered as a separate subtask from
downstream applications such as classification, regression, or clustering, and
thus is not optimized together with them. We hypothesize that treating the
imputation m... | [
{
"created": "Tue, 30 Apr 2024 20:13:18 GMT",
"version": "v1"
}
] | 2024-05-02 | [
[
"Catto",
"Adam",
""
],
[
"Jia",
"Nan",
""
],
[
"Salleb-Aouissi",
"Ansaf",
""
],
[
"Raja",
"Anita",
""
]
] | Missing value imputation is a crucial preprocessing step for many machine learning problems. However, it is often considered as a separate subtask from downstream applications such as classification, regression, or clustering, and thus is not optimized together with them. We hypothesize that treating the imputation mod... |
2204.05027 | Mathieu Reymond | Mathieu Reymond, Conor F. Hayes, Lander Willem, Roxana R\u{a}dulescu,
Steven Abrams, Diederik M. Roijers, Enda Howley, Patrick Mannion, Niel Hens,
Ann Now\'e, Pieter Libin | Exploring the Pareto front of multi-objective COVID-19 mitigation
policies using reinforcement learning | null | null | null | null | cs.LG cs.AI q-bio.PE | http://creativecommons.org/licenses/by/4.0/ | Infectious disease outbreaks can have a disruptive impact on public health
and societal processes. As decision making in the context of epidemic
mitigation is hard, reinforcement learning provides a methodology to
automatically learn prevention strategies in combination with complex epidemic
models. Current research ... | [
{
"created": "Mon, 11 Apr 2022 11:55:06 GMT",
"version": "v1"
}
] | 2022-04-12 | [
[
"Reymond",
"Mathieu",
""
],
[
"Hayes",
"Conor F.",
""
],
[
"Willem",
"Lander",
""
],
[
"Rădulescu",
"Roxana",
""
],
[
"Abrams",
"Steven",
""
],
[
"Roijers",
"Diederik M.",
""
],
[
"Howley",
"Enda",
""
],
... | Infectious disease outbreaks can have a disruptive impact on public health and societal processes. As decision making in the context of epidemic mitigation is hard, reinforcement learning provides a methodology to automatically learn prevention strategies in combination with complex epidemic models. Current research fo... |
2101.01022 | Brigitte Jaumard Prof. | Brigitte Jaumard and Yan Wang | A Two Sub-problem Decomposition for the Optimal Design of Filterless
Optical Networks | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | Filterless optical transport networks relies on passive optical
interconnections between nodes, i.e., on splitters/couplers and amplifiers.
While different studies have investigated their design, none of them offer a
solution for an optimal design. We propose a one step solution scheme, which
combines network provisi... | [
{
"created": "Mon, 4 Jan 2021 15:13:59 GMT",
"version": "v1"
}
] | 2021-01-05 | [
[
"Jaumard",
"Brigitte",
""
],
[
"Wang",
"Yan",
""
]
] | Filterless optical transport networks relies on passive optical interconnections between nodes, i.e., on splitters/couplers and amplifiers. While different studies have investigated their design, none of them offer a solution for an optimal design. We propose a one step solution scheme, which combines network provision... |
1907.02423 | Ryan D. Cotterell | Ryan Cotterell and Hinrich Sch\"utze | Morphological Word Embeddings | Published at NAACL 2015 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Linguistic similarity is multi-faceted. For instance, two words may be
similar with respect to semantics, syntax, or morphology inter alia. Continuous
word-embeddings have been shown to capture most of these shades of similarity
to some degree. This work considers guiding word-embeddings with
morphologically annotate... | [
{
"created": "Thu, 4 Jul 2019 14:32:39 GMT",
"version": "v1"
}
] | 2019-07-05 | [
[
"Cotterell",
"Ryan",
""
],
[
"Schütze",
"Hinrich",
""
]
] | Linguistic similarity is multi-faceted. For instance, two words may be similar with respect to semantics, syntax, or morphology inter alia. Continuous word-embeddings have been shown to capture most of these shades of similarity to some degree. This work considers guiding word-embeddings with morphologically annotated ... |
1806.10182 | Tobias Glasmachers | Sahar Qaadan, Merlin Sch\"uler and Tobias Glasmachers | Dual SVM Training on a Budget | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a dual subspace ascent algorithm for support vector machine
training that respects a budget constraint limiting the number of support
vectors. Budget methods are effective for reducing the training time of kernel
SVM while retaining high accuracy. To date, budget training is available only
for primal (SGD-... | [
{
"created": "Tue, 26 Jun 2018 19:38:11 GMT",
"version": "v1"
}
] | 2018-06-28 | [
[
"Qaadan",
"Sahar",
""
],
[
"Schüler",
"Merlin",
""
],
[
"Glasmachers",
"Tobias",
""
]
] | We present a dual subspace ascent algorithm for support vector machine training that respects a budget constraint limiting the number of support vectors. Budget methods are effective for reducing the training time of kernel SVM while retaining high accuracy. To date, budget training is available only for primal (SGD-ba... |
2404.15160 | Jiabin Guo | Jiabin Guo | Vector Signal Reconstruction Sparse and Parametric Approach of direction
of arrival Using Single Vector Hydrophone | 22 pages. arXiv admin note: substantial text overlap with
arXiv:2404.13568 | null | null | null | cs.SD | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article discusses the application of single vector hydrophones in the
field of underwater acoustic signal processing for Direction Of Arrival (DOA)
estimation. Addressing the limitations of traditional DOA estimation methods in
multi-source environments and under noise interference, this study introduces a
Vecto... | [
{
"created": "Sun, 21 Apr 2024 08:23:14 GMT",
"version": "v1"
}
] | 2024-04-24 | [
[
"Guo",
"Jiabin",
""
]
] | This article discusses the application of single vector hydrophones in the field of underwater acoustic signal processing for Direction Of Arrival (DOA) estimation. Addressing the limitations of traditional DOA estimation methods in multi-source environments and under noise interference, this study introduces a Vector ... |
2406.03868 | Huizheng Wang | Jiahao Fang, Huizheng Wang, Qize Yang, Dehao Kong, Xu Dai, Jinyi Deng,
Yang Hu, Shouyi Yin | PALM: A Efficient Performance Simulator for Tiled Accelerators with
Large-scale Model Training | 11 pages | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning (DL) models are piquing high interest and scaling at an
unprecedented rate. To this end, a handful of tiled accelerators have been
proposed to support such large-scale training tasks. However, these
accelerators often incorporate numerous cores or tiles even extending to
wafer-scale, substantial on-chip... | [
{
"created": "Thu, 6 Jun 2024 08:55:01 GMT",
"version": "v1"
}
] | 2024-06-07 | [
[
"Fang",
"Jiahao",
""
],
[
"Wang",
"Huizheng",
""
],
[
"Yang",
"Qize",
""
],
[
"Kong",
"Dehao",
""
],
[
"Dai",
"Xu",
""
],
[
"Deng",
"Jinyi",
""
],
[
"Hu",
"Yang",
""
],
[
"Yin",
"Shouyi",
""... | Deep learning (DL) models are piquing high interest and scaling at an unprecedented rate. To this end, a handful of tiled accelerators have been proposed to support such large-scale training tasks. However, these accelerators often incorporate numerous cores or tiles even extending to wafer-scale, substantial on-chip b... |
2401.15239 | Peizhuo Lv | Peizhuo Lv, Hualong Ma, Kai Chen, Jiachen Zhou, Shengzhi Zhang,
Ruigang Liang, Shenchen Zhu, Pan Li, and Yingjun Zhang | MEA-Defender: A Robust Watermark against Model Extraction Attack | To Appear in IEEE Symposium on Security and Privacy 2024 (IEEE S&P
2024), MAY 20-23, 2024, SAN FRANCISCO, CA, USA | null | null | null | cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, numerous highly-valuable Deep Neural Networks (DNNs) have been
trained using deep learning algorithms. To protect the Intellectual Property
(IP) of the original owners over such DNN models, backdoor-based watermarks
have been extensively studied. However, most of such watermarks fail upon model
extraction a... | [
{
"created": "Fri, 26 Jan 2024 23:12:53 GMT",
"version": "v1"
}
] | 2024-01-30 | [
[
"Lv",
"Peizhuo",
""
],
[
"Ma",
"Hualong",
""
],
[
"Chen",
"Kai",
""
],
[
"Zhou",
"Jiachen",
""
],
[
"Zhang",
"Shengzhi",
""
],
[
"Liang",
"Ruigang",
""
],
[
"Zhu",
"Shenchen",
""
],
[
"Li",
"Pan... | Recently, numerous highly-valuable Deep Neural Networks (DNNs) have been trained using deep learning algorithms. To protect the Intellectual Property (IP) of the original owners over such DNN models, backdoor-based watermarks have been extensively studied. However, most of such watermarks fail upon model extraction att... |
1911.07964 | Kyle Helfrich | Kyle Helfrich and Qiang Ye | Eigenvalue Normalized Recurrent Neural Networks for Short Term Memory | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Several variants of recurrent neural networks (RNNs) with orthogonal or
unitary recurrent matrices have recently been developed to mitigate the
vanishing/exploding gradient problem and to model long-term dependencies of
sequences. However, with the eigenvalues of the recurrent matrix on the unit
circle, the recurrent... | [
{
"created": "Mon, 18 Nov 2019 21:28:02 GMT",
"version": "v1"
}
] | 2019-11-20 | [
[
"Helfrich",
"Kyle",
""
],
[
"Ye",
"Qiang",
""
]
] | Several variants of recurrent neural networks (RNNs) with orthogonal or unitary recurrent matrices have recently been developed to mitigate the vanishing/exploding gradient problem and to model long-term dependencies of sequences. However, with the eigenvalues of the recurrent matrix on the unit circle, the recurrent s... |
2306.03964 | Matthew Sinclair | Gaurang Upasani, Matthew D. Sinclair, Adrian Sampson, Parthasarathy
Ranganathan, David Patterson, Shaan Shah, Nidhi Parthasarathy, Rutwik Jain | Fifty Years of ISCA: A data-driven retrospective on key trends | 34 pages, 16 figures | null | null | null | cs.AR | http://creativecommons.org/publicdomain/zero/1.0/ | Computer Architecture, broadly, involves optimizing hardware and software for
current and future processing systems. Although there are several other top
venues to publish Computer Architecture research, including ASPLOS, HPCA, and
MICRO, ISCA (the International Symposium on Computer Architecture) is one of
the oldes... | [
{
"created": "Tue, 6 Jun 2023 19:00:56 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Jun 2023 23:57:30 GMT",
"version": "v2"
},
{
"created": "Thu, 15 Jun 2023 04:28:00 GMT",
"version": "v3"
},
{
"created": "Fri, 16 Jun 2023 02:58:39 GMT",
"version": "v4"
},
{
"cre... | 2023-11-21 | [
[
"Upasani",
"Gaurang",
""
],
[
"Sinclair",
"Matthew D.",
""
],
[
"Sampson",
"Adrian",
""
],
[
"Ranganathan",
"Parthasarathy",
""
],
[
"Patterson",
"David",
""
],
[
"Shah",
"Shaan",
""
],
[
"Parthasarathy",
"Nidh... | Computer Architecture, broadly, involves optimizing hardware and software for current and future processing systems. Although there are several other top venues to publish Computer Architecture research, including ASPLOS, HPCA, and MICRO, ISCA (the International Symposium on Computer Architecture) is one of the oldest,... |
2010.04495 | Seyed Iman Mirzadeh | Seyed Iman Mirzadeh, Mehrdad Farajtabar, Dilan Gorur, Razvan Pascanu,
Hassan Ghasemzadeh | Linear Mode Connectivity in Multitask and Continual Learning | null | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Continual (sequential) training and multitask (simultaneous) training are
often attempting to solve the same overall objective: to find a solution that
performs well on all considered tasks. The main difference is in the training
regimes, where continual learning can only have access to one task at a time,
which for ... | [
{
"created": "Fri, 9 Oct 2020 10:53:25 GMT",
"version": "v1"
}
] | 2020-10-12 | [
[
"Mirzadeh",
"Seyed Iman",
""
],
[
"Farajtabar",
"Mehrdad",
""
],
[
"Gorur",
"Dilan",
""
],
[
"Pascanu",
"Razvan",
""
],
[
"Ghasemzadeh",
"Hassan",
""
]
] | Continual (sequential) training and multitask (simultaneous) training are often attempting to solve the same overall objective: to find a solution that performs well on all considered tasks. The main difference is in the training regimes, where continual learning can only have access to one task at a time, which for ne... |
2204.08401 | Xuanyu Zhang | Xuanyu Zhang, Qing Yang and Dongliang Xu | TranS: Transition-based Knowledge Graph Embedding with Synthetic
Relation Representation | 6 pages, 2 figures | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Knowledge graph embedding (KGE) aims to learn continuous vectors of relations
and entities in knowledge graph. Recently, transition-based KGE methods have
achieved promising performance, where the single relation vector learns to
translate head entity to tail entity. However, this scoring pattern is not
suitable for ... | [
{
"created": "Mon, 18 Apr 2022 16:55:25 GMT",
"version": "v1"
},
{
"created": "Fri, 29 Apr 2022 02:38:44 GMT",
"version": "v2"
}
] | 2022-05-02 | [
[
"Zhang",
"Xuanyu",
""
],
[
"Yang",
"Qing",
""
],
[
"Xu",
"Dongliang",
""
]
] | Knowledge graph embedding (KGE) aims to learn continuous vectors of relations and entities in knowledge graph. Recently, transition-based KGE methods have achieved promising performance, where the single relation vector learns to translate head entity to tail entity. However, this scoring pattern is not suitable for co... |
cs/0408054 | Peter Keller-Marxer | Stephan Heuscher, Stephan Jaermann, Peter Keller-Marxer, Frank Moehle
(Swiss Federal Archives) | Providing Authentic Long-term Archival Access to Complex Relational Data | 18 pages with 4 figures (color). Submitted to: European Space Agency
Symposium "Ensuring Long-Term Preservation and Adding Value to Scientific and
Technical Data", 5 - 7 October 2004, Frascati, Italy | Proceedings PV-2004: Ensuring the Long-Term Preservation and
Adding Value to the Scientific and Technical Data, 5-7 October 2004,
ESA/ESRIN, Frascati, Italy, (ESA WPP-232), Noordwijk: European Space Agency,
2004, pp. 241\^A?"261. | null | ESA WPP-232, pp. 241 -261 | cs.DL cs.DB | null | We discuss long-term preservation of and access to relational databases. The
focus is on national archives and science data archives which have to ingest
and integrate data from a broad spectrum of vendor-specific relational database
management systems (RDBMS). Furthermore, we present our solution SIARD which
analyze... | [
{
"created": "Tue, 24 Aug 2004 07:01:29 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Heuscher",
"Stephan",
"",
"Swiss Federal Archives"
],
[
"Jaermann",
"Stephan",
"",
"Swiss Federal Archives"
],
[
"Keller-Marxer",
"Peter",
"",
"Swiss Federal Archives"
],
[
"Moehle",
"Frank",
"",
"Swiss Federal Archives"
]
] | We discuss long-term preservation of and access to relational databases. The focus is on national archives and science data archives which have to ingest and integrate data from a broad spectrum of vendor-specific relational database management systems (RDBMS). Furthermore, we present our solution SIARD which analyzes ... |
1710.07460 | Dario Paccagnan | Dario Paccagnan and Jason R. Marden | The Importance of System-Level Information in Multiagent Systems Design:
Cardinality and Covering Problems | 14 pages, double column, 7 figures | null | 10.1109/TAC.2018.2878397 | null | cs.GT cs.MA cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A fundamental challenge in multiagent systems is to design local control
algorithms to ensure a desirable collective behaviour. The information
available to the agents, gathered either through communication or sensing,
naturally restricts the achievable performance. Hence, it is fundamental to
identify what piece of ... | [
{
"created": "Fri, 20 Oct 2017 09:27:28 GMT",
"version": "v1"
},
{
"created": "Sun, 28 Oct 2018 16:02:26 GMT",
"version": "v2"
}
] | 2018-10-30 | [
[
"Paccagnan",
"Dario",
""
],
[
"Marden",
"Jason R.",
""
]
] | A fundamental challenge in multiagent systems is to design local control algorithms to ensure a desirable collective behaviour. The information available to the agents, gathered either through communication or sensing, naturally restricts the achievable performance. Hence, it is fundamental to identify what piece of in... |
2408.02127 | Fengjunjie Pan | Fengjunjie Pan, Jianjie Lin, Markus Rickert | Automatic Platform Configuration and Software Integration for
Software-Defined Vehicles | 7 pages, 6 figures, preprint | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | In the automotive industry, platform configuration and software integration
are mostly manual tasks performed during the development phase, requiring
consideration of various safety and non-safety requirements. This manual
process often leads to prolonged development cycles and provides limited
flexibility. This pape... | [
{
"created": "Sun, 4 Aug 2024 19:54:03 GMT",
"version": "v1"
}
] | 2024-08-06 | [
[
"Pan",
"Fengjunjie",
""
],
[
"Lin",
"Jianjie",
""
],
[
"Rickert",
"Markus",
""
]
] | In the automotive industry, platform configuration and software integration are mostly manual tasks performed during the development phase, requiring consideration of various safety and non-safety requirements. This manual process often leads to prolonged development cycles and provides limited flexibility. This paper ... |
2210.14814 | Mohaddeseh Bastan | Mohaddeseh Bastan, Mihai Surdeanu, and Niranjan Balasubramanian | BioNLI: Generating a Biomedical NLI Dataset Using Lexico-semantic
Constraints for Adversarial Examples | Accepted to Findings of EMNLP 2022, Data and evaluation suite
available at https://stonybrooknlp.github.io/BioNLI/ | null | null | null | cs.CL cs.IR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Natural language inference (NLI) is critical for complex decision-making in
biomedical domain. One key question, for example, is whether a given biomedical
mechanism is supported by experimental evidence. This can be seen as an NLI
problem but there are no directly usable datasets to address this. The main
challenge ... | [
{
"created": "Wed, 26 Oct 2022 16:02:49 GMT",
"version": "v1"
}
] | 2022-10-27 | [
[
"Bastan",
"Mohaddeseh",
""
],
[
"Surdeanu",
"Mihai",
""
],
[
"Balasubramanian",
"Niranjan",
""
]
] | Natural language inference (NLI) is critical for complex decision-making in biomedical domain. One key question, for example, is whether a given biomedical mechanism is supported by experimental evidence. This can be seen as an NLI problem but there are no directly usable datasets to address this. The main challenge is... |
2002.11927 | Abduallah Mohamed | Abduallah Mohamed, Kun Qian, Mohamed Elhoseiny, Christian Claudel | Social-STGCNN: A Social Spatio-Temporal Graph Convolutional Neural
Network for Human Trajectory Prediction | Accepted by CVPR 2020 | The IEEE/CVF Conference on Computer Vision and Pattern Recognition
(CVPR), 2020, pp. 14424-14432 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Better machine understanding of pedestrian behaviors enables faster progress
in modeling interactions between agents such as autonomous vehicles and humans.
Pedestrian trajectories are not only influenced by the pedestrian itself but
also by interaction with surrounding objects. Previous methods modeled these
interac... | [
{
"created": "Thu, 27 Feb 2020 05:40:23 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Feb 2020 03:02:48 GMT",
"version": "v2"
},
{
"created": "Tue, 24 Mar 2020 06:07:03 GMT",
"version": "v3"
}
] | 2020-06-19 | [
[
"Mohamed",
"Abduallah",
""
],
[
"Qian",
"Kun",
""
],
[
"Elhoseiny",
"Mohamed",
""
],
[
"Claudel",
"Christian",
""
]
] | Better machine understanding of pedestrian behaviors enables faster progress in modeling interactions between agents such as autonomous vehicles and humans. Pedestrian trajectories are not only influenced by the pedestrian itself but also by interaction with surrounding objects. Previous methods modeled these interacti... |
1408.0355 | Ning Cai | Ning Cai and M. Junaid Khan | Almost Decouplability of any Directed Weighted Network Topology | null | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a conception that any weighted directed network
topology is almost decouplable, which can help to transform the topology into a
similar form being composed of uncoupled vertices, and thus reduce the
complexity of analysis for networked dynamical systems. As an example of its
application, the con... | [
{
"created": "Sat, 2 Aug 2014 10:08:43 GMT",
"version": "v1"
}
] | 2014-08-05 | [
[
"Cai",
"Ning",
""
],
[
"Khan",
"M. Junaid",
""
]
] | This paper introduces a conception that any weighted directed network topology is almost decouplable, which can help to transform the topology into a similar form being composed of uncoupled vertices, and thus reduce the complexity of analysis for networked dynamical systems. As an example of its application, the conse... |
2001.10387 | Fernando Rosas | Fernando Rosas, Pedro Mediano, Borzoo Rassouli, and Adam Barrett | An operational information decomposition via synergistic disclosure | 14 pages, 8 figures | null | 10.1088/1751-8121/abb723 | null | cs.IT math.IT physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multivariate information decompositions hold promise to yield insight into
complex systems, and stand out for their ability to identify synergistic
phenomena. However, the adoption of these approaches has been hindered by there
being multiple possible decompositions, and no precise guidance for preferring
one over th... | [
{
"created": "Tue, 28 Jan 2020 14:52:40 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Mar 2020 21:52:55 GMT",
"version": "v2"
}
] | 2020-12-02 | [
[
"Rosas",
"Fernando",
""
],
[
"Mediano",
"Pedro",
""
],
[
"Rassouli",
"Borzoo",
""
],
[
"Barrett",
"Adam",
""
]
] | Multivariate information decompositions hold promise to yield insight into complex systems, and stand out for their ability to identify synergistic phenomena. However, the adoption of these approaches has been hindered by there being multiple possible decompositions, and no precise guidance for preferring one over the ... |
2202.10582 | Shangxi Wu | Shangxi Wu and Qiuyang He and Yi Zhang and Jitao Sang | Debiasing Backdoor Attack: A Benign Application of Backdoor Attack in
Eliminating Data Bias | null | null | null | null | cs.CR cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Backdoor attack is a new AI security risk that has emerged in recent years.
Drawing on the previous research of adversarial attack, we argue that the
backdoor attack has the potential to tap into the model learning process and
improve model performance. Based on Clean Accuracy Drop (CAD) in backdoor
attack, we found ... | [
{
"created": "Fri, 18 Feb 2022 05:00:08 GMT",
"version": "v1"
}
] | 2022-02-23 | [
[
"Wu",
"Shangxi",
""
],
[
"He",
"Qiuyang",
""
],
[
"Zhang",
"Yi",
""
],
[
"Sang",
"Jitao",
""
]
] | Backdoor attack is a new AI security risk that has emerged in recent years. Drawing on the previous research of adversarial attack, we argue that the backdoor attack has the potential to tap into the model learning process and improve model performance. Based on Clean Accuracy Drop (CAD) in backdoor attack, we found th... |
2103.15375 | Shashanka Venkataramanan | Shashanka Venkataramanan, Ewa Kijak, Laurent Amsaleg, Yannis Avrithis | AlignMixup: Improving Representations By Interpolating Aligned Features | Accepted to CVPR 2022 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Mixup is a powerful data augmentation method that interpolates between two or
more examples in the input or feature space and between the corresponding
target labels. Many recent mixup methods focus on cutting and pasting two or
more objects into one image, which is more about efficient processing than
interpolation.... | [
{
"created": "Mon, 29 Mar 2021 07:03:18 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Mar 2022 20:47:59 GMT",
"version": "v2"
}
] | 2022-03-29 | [
[
"Venkataramanan",
"Shashanka",
""
],
[
"Kijak",
"Ewa",
""
],
[
"Amsaleg",
"Laurent",
""
],
[
"Avrithis",
"Yannis",
""
]
] | Mixup is a powerful data augmentation method that interpolates between two or more examples in the input or feature space and between the corresponding target labels. Many recent mixup methods focus on cutting and pasting two or more objects into one image, which is more about efficient processing than interpolation. H... |
1109.1865 | Ashok Veeraraghavan | Rohit Pandharkar, Ashok Veeraraghavan, Ramesh Raskar | Progressive versus Random Projections for Compressive Capture of Images,
Lightfields and Higher Dimensional Visual Signals | Draft of working paper | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computational photography involves sophisticated capture methods. A new trend
is to capture projection of higher dimensional visual signals such as videos,
multi-spectral data and lightfields on lower dimensional sensors. Carefully
designed capture methods exploit the sparsity of the underlying signal in a
transforme... | [
{
"created": "Fri, 9 Sep 2011 00:33:10 GMT",
"version": "v1"
}
] | 2011-09-12 | [
[
"Pandharkar",
"Rohit",
""
],
[
"Veeraraghavan",
"Ashok",
""
],
[
"Raskar",
"Ramesh",
""
]
] | Computational photography involves sophisticated capture methods. A new trend is to capture projection of higher dimensional visual signals such as videos, multi-spectral data and lightfields on lower dimensional sensors. Carefully designed capture methods exploit the sparsity of the underlying signal in a transformed ... |
2308.01846 | Hao Fei | Hao Fei, Meishan Zhang, Min Zhang, Tat-Seng Chua | XNLP: An Interactive Demonstration System for Universal Structured NLP | ACL 2024 Demonstration Paper | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Structured Natural Language Processing (XNLP) is an important subset of NLP
that entails understanding the underlying semantic or syntactic structure of
texts, which serves as a foundational component for many downstream
applications. Despite certain recent efforts to explore universal solutions for
specific categori... | [
{
"created": "Thu, 3 Aug 2023 16:13:05 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Jun 2024 15:26:05 GMT",
"version": "v2"
}
] | 2024-06-24 | [
[
"Fei",
"Hao",
""
],
[
"Zhang",
"Meishan",
""
],
[
"Zhang",
"Min",
""
],
[
"Chua",
"Tat-Seng",
""
]
] | Structured Natural Language Processing (XNLP) is an important subset of NLP that entails understanding the underlying semantic or syntactic structure of texts, which serves as a foundational component for many downstream applications. Despite certain recent efforts to explore universal solutions for specific categories... |
cs/0407006 | Shuvendu Lahiri Mr. | Shuvendu K. Lahiri, Randal E. Bryant | Predicate Abstraction with Indexed Predicates | 27 pages, 4 figures, 1 table, short version appeared in International
Conference on Verification, Model Checking and Abstract Interpretation
(VMCAI'04), LNCS 2937, pages = 267--281 | null | null | null | cs.LO | null | Predicate abstraction provides a powerful tool for verifying properties of
infinite-state systems using a combination of a decision procedure for a subset
of first-order logic and symbolic methods originally developed for finite-state
model checking. We consider models containing first-order state variables,
where th... | [
{
"created": "Fri, 2 Jul 2004 06:17:13 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Lahiri",
"Shuvendu K.",
""
],
[
"Bryant",
"Randal E.",
""
]
] | Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems using a combination of a decision procedure for a subset of first-order logic and symbolic methods originally developed for finite-state model checking. We consider models containing first-order state variables, where the ... |
1806.09335 | Thorsten Sommer | Thorsten Sommer, Gergana Deppe, Valerie Stehling, Max Haberstroh,
Frank Hees | Request for Comments: Proposal of a Blockchain for the Automatic
Management and Acceptance of Student Achievements | null | null | 10.13140/RG.2.2.32493.49129 | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Staying abroad during their studies is increasingly popular for students.
However, there are various challenges for both students and universities. One
important question for students is whether or not achievements performed at
different universities can be taken into account for either enrolling at a
foreign univers... | [
{
"created": "Mon, 25 Jun 2018 09:07:41 GMT",
"version": "v1"
}
] | 2018-06-27 | [
[
"Sommer",
"Thorsten",
""
],
[
"Deppe",
"Gergana",
""
],
[
"Stehling",
"Valerie",
""
],
[
"Haberstroh",
"Max",
""
],
[
"Hees",
"Frank",
""
]
] | Staying abroad during their studies is increasingly popular for students. However, there are various challenges for both students and universities. One important question for students is whether or not achievements performed at different universities can be taken into account for either enrolling at a foreign universit... |
2005.00858 | Wolfgang Mulzer | Sergio Cabello, Wolfgang Mulzer | Minimum Cuts in Geometric Intersection Graphs | 11 pages, 4 figures; this version corrects a small bug in the proof
of Lemma 5. We thank Matej Marinko for pointing this out | Computational Geometry: Theory and Applications (CGTA), 94, 2021,
Article 101720 | 10.1016/j.comgeo.2020.101720 | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let $\mathcal{D}$ be a set of $n$ disks in the plane. The disk graph
$G_\mathcal{D}$ for $\mathcal{D}$ is the undirected graph with vertex set
$\mathcal{D}$ in which two disks are joined by an edge if and only if they
intersect. The directed transmission graph $G^{\rightarrow}_\mathcal{D}$ for
$\mathcal{D}$ is the di... | [
{
"created": "Sat, 2 May 2020 15:23:30 GMT",
"version": "v1"
},
{
"created": "Thu, 29 Oct 2020 14:12:17 GMT",
"version": "v2"
},
{
"created": "Fri, 26 May 2023 19:05:34 GMT",
"version": "v3"
}
] | 2023-05-30 | [
[
"Cabello",
"Sergio",
""
],
[
"Mulzer",
"Wolfgang",
""
]
] | Let $\mathcal{D}$ be a set of $n$ disks in the plane. The disk graph $G_\mathcal{D}$ for $\mathcal{D}$ is the undirected graph with vertex set $\mathcal{D}$ in which two disks are joined by an edge if and only if they intersect. The directed transmission graph $G^{\rightarrow}_\mathcal{D}$ for $\mathcal{D}$ is the dire... |
2107.03992 | Arjun Rao | Philipp Plank, Arjun Rao, Andreas Wild, Wolfgang Maass | A Long Short-Term Memory for AI Applications in Spike-based Neuromorphic
Hardware | Philipp Plank and Arjun Rao have contributed equally to this work as
first authors | null | null | null | cs.NE cs.ET cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spike-based neuromorphic hardware holds the promise to provide more energy
efficient implementations of Deep Neural Networks (DNNs) than standard hardware
such as GPUs. But this requires to understand how DNNs can be emulated in an
event-based sparse firing regime, since otherwise the energy-advantage gets
lost. In p... | [
{
"created": "Thu, 8 Jul 2021 17:37:02 GMT",
"version": "v1"
},
{
"created": "Sun, 7 Nov 2021 23:03:38 GMT",
"version": "v2"
}
] | 2021-11-09 | [
[
"Plank",
"Philipp",
""
],
[
"Rao",
"Arjun",
""
],
[
"Wild",
"Andreas",
""
],
[
"Maass",
"Wolfgang",
""
]
] | Spike-based neuromorphic hardware holds the promise to provide more energy efficient implementations of Deep Neural Networks (DNNs) than standard hardware such as GPUs. But this requires to understand how DNNs can be emulated in an event-based sparse firing regime, since otherwise the energy-advantage gets lost. In par... |
2402.17160 | Zhihao Gavin Tang | Tomer Ezra, Michal Feldman, Zhihao Gavin Tang | Choosing Behind the Veil: Tight Bounds for Identity-Blind Online
Algorithms | Abstract shortened for arXiv | null | null | null | cs.GT cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In Bayesian online settings, every element has a value that is drawn from a
known underlying distribution, which we refer to as the element's identity. The
elements arrive sequentially. Upon the arrival of an element, its value is
revealed, and the decision maker needs to decide, immediately and irrevocably,
whether ... | [
{
"created": "Tue, 27 Feb 2024 02:47:41 GMT",
"version": "v1"
}
] | 2024-02-28 | [
[
"Ezra",
"Tomer",
""
],
[
"Feldman",
"Michal",
""
],
[
"Tang",
"Zhihao Gavin",
""
]
] | In Bayesian online settings, every element has a value that is drawn from a known underlying distribution, which we refer to as the element's identity. The elements arrive sequentially. Upon the arrival of an element, its value is revealed, and the decision maker needs to decide, immediately and irrevocably, whether to... |
2010.02966 | Yann Bouteiller | Simon Ramstedt, Yann Bouteiller, Giovanni Beltrame, Christopher Pal,
Jonathan Binas | Reinforcement Learning with Random Delays | ICLR 2021 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Action and observation delays commonly occur in many Reinforcement Learning
applications, such as remote control scenarios. We study the anatomy of
randomly delayed environments, and show that partially resampling trajectory
fragments in hindsight allows for off-policy multi-step value estimation. We
apply this princ... | [
{
"created": "Tue, 6 Oct 2020 18:39:23 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Oct 2020 17:56:31 GMT",
"version": "v2"
},
{
"created": "Tue, 4 May 2021 20:27:33 GMT",
"version": "v3"
}
] | 2021-05-06 | [
[
"Ramstedt",
"Simon",
""
],
[
"Bouteiller",
"Yann",
""
],
[
"Beltrame",
"Giovanni",
""
],
[
"Pal",
"Christopher",
""
],
[
"Binas",
"Jonathan",
""
]
] | Action and observation delays commonly occur in many Reinforcement Learning applications, such as remote control scenarios. We study the anatomy of randomly delayed environments, and show that partially resampling trajectory fragments in hindsight allows for off-policy multi-step value estimation. We apply this princip... |
1910.05577 | Xudong Lin | Xudong Lin, Lin Ma, Wei Liu, Shih-Fu Chang | Context-Gated Convolution | ECCV 2020 camera ready version with appendix | null | null | null | cs.CV cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the basic building block of Convolutional Neural Networks (CNNs), the
convolutional layer is designed to extract local patterns and lacks the ability
to model global context in its nature. Many efforts have been recently devoted
to complementing CNNs with the global modeling ability, especially by a family
of work... | [
{
"created": "Sat, 12 Oct 2019 15:30:18 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Oct 2019 03:08:24 GMT",
"version": "v2"
},
{
"created": "Mon, 16 Mar 2020 19:19:28 GMT",
"version": "v3"
},
{
"created": "Fri, 17 Jul 2020 16:59:19 GMT",
"version": "v4"
}
] | 2020-07-20 | [
[
"Lin",
"Xudong",
""
],
[
"Ma",
"Lin",
""
],
[
"Liu",
"Wei",
""
],
[
"Chang",
"Shih-Fu",
""
]
] | As the basic building block of Convolutional Neural Networks (CNNs), the convolutional layer is designed to extract local patterns and lacks the ability to model global context in its nature. Many efforts have been recently devoted to complementing CNNs with the global modeling ability, especially by a family of works ... |
2109.00417 | St\'ephane Clinchant | Badr Youbi Idrissi, St\'ephane Clinchant | Masked Adversarial Generation for Neural Machine Translation | 5 pages | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Attacking Neural Machine Translation models is an inherently combinatorial
task on discrete sequences, solved with approximate heuristics. Most methods
use the gradient to attack the model on each sample independently. Instead of
mechanically applying the gradient, could we learn to produce meaningful
adversarial att... | [
{
"created": "Wed, 1 Sep 2021 14:56:37 GMT",
"version": "v1"
}
] | 2021-09-02 | [
[
"Idrissi",
"Badr Youbi",
""
],
[
"Clinchant",
"Stéphane",
""
]
] | Attacking Neural Machine Translation models is an inherently combinatorial task on discrete sequences, solved with approximate heuristics. Most methods use the gradient to attack the model on each sample independently. Instead of mechanically applying the gradient, could we learn to produce meaningful adversarial attac... |
1905.01778 | Jichang Zhao | Siqing Shan, Yingwei Jia and Jichang Zhao | Same Influenza, Different Responses: Social Media Can Sense a Regional
Spectrum of Symptoms | All the data in this study can be freely downloaded through
https://doi.org/10.6084/m9.figshare.7545203.v1 | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Influenza is an acute respiratory infection caused by a virus. It is highly
contagious and rapidly mutative. However, its epidemiological characteristics
are conventionally collected in terms of outpatient records. In fact, the
subjective bias of the doctor emphasizes exterior signs, and the necessity of
face-to-face... | [
{
"created": "Mon, 6 May 2019 01:06:27 GMT",
"version": "v1"
}
] | 2019-05-07 | [
[
"Shan",
"Siqing",
""
],
[
"Jia",
"Yingwei",
""
],
[
"Zhao",
"Jichang",
""
]
] | Influenza is an acute respiratory infection caused by a virus. It is highly contagious and rapidly mutative. However, its epidemiological characteristics are conventionally collected in terms of outpatient records. In fact, the subjective bias of the doctor emphasizes exterior signs, and the necessity of face-to-face i... |
1305.4076 | Fuqiang Chen | Fu-qiang Chen, Yan Wu, Guo-dong Zhao, Jun-ming Zhang, Ming Zhu, Jing
Bai | Contractive De-noising Auto-encoder | Figures edited | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Auto-encoder is a special kind of neural network based on reconstruction.
De-noising auto-encoder (DAE) is an improved auto-encoder which is robust to
the input by corrupting the original data first and then reconstructing the
original input by minimizing the reconstruction error function. And contractive
auto-encode... | [
{
"created": "Fri, 17 May 2013 13:42:49 GMT",
"version": "v1"
},
{
"created": "Thu, 23 May 2013 04:22:44 GMT",
"version": "v2"
},
{
"created": "Thu, 30 May 2013 00:01:45 GMT",
"version": "v3"
},
{
"created": "Mon, 10 Mar 2014 13:41:32 GMT",
"version": "v4"
},
{
"c... | 2014-04-24 | [
[
"Chen",
"Fu-qiang",
""
],
[
"Wu",
"Yan",
""
],
[
"Zhao",
"Guo-dong",
""
],
[
"Zhang",
"Jun-ming",
""
],
[
"Zhu",
"Ming",
""
],
[
"Bai",
"Jing",
""
]
] | Auto-encoder is a special kind of neural network based on reconstruction. De-noising auto-encoder (DAE) is an improved auto-encoder which is robust to the input by corrupting the original data first and then reconstructing the original input by minimizing the reconstruction error function. And contractive auto-encoder ... |
1809.07878 | Rohan Chitnis | Rohan Chitnis, Leslie Pack Kaelbling, Tom\'as Lozano-P\'erez | Learning Quickly to Plan Quickly Using Modular Meta-Learning | ICRA 2019 final version | null | null | null | cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-object manipulation problems in continuous state and action spaces can
be solved by planners that search over sampled values for the continuous
parameters of operators. The efficiency of these planners depends critically on
the effectiveness of the samplers used, but effective sampling in turn depends
on detail... | [
{
"created": "Thu, 20 Sep 2018 22:01:52 GMT",
"version": "v1"
},
{
"created": "Sat, 16 Feb 2019 03:12:51 GMT",
"version": "v2"
}
] | 2019-02-19 | [
[
"Chitnis",
"Rohan",
""
],
[
"Kaelbling",
"Leslie Pack",
""
],
[
"Lozano-Pérez",
"Tomás",
""
]
] | Multi-object manipulation problems in continuous state and action spaces can be solved by planners that search over sampled values for the continuous parameters of operators. The efficiency of these planners depends critically on the effectiveness of the samplers used, but effective sampling in turn depends on details ... |
1706.07582 | Nematollah Iri | Nematollah Iri, Oliver Kosut | Fundamental Limits of Universal Variable-to-Fixed Length Coding of
Parametric Sources | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Universal variable-to-fixed (V-F) length coding of $d$-dimensional
exponential family of distributions is considered. We propose an achievable
scheme consisting of a dictionary, used to parse the source output stream,
making use of the previously-introduced notion of quantized types. The
quantized type class of a seq... | [
{
"created": "Fri, 23 Jun 2017 06:48:35 GMT",
"version": "v1"
},
{
"created": "Mon, 31 Jul 2017 18:03:54 GMT",
"version": "v2"
}
] | 2017-08-02 | [
[
"Iri",
"Nematollah",
""
],
[
"Kosut",
"Oliver",
""
]
] | Universal variable-to-fixed (V-F) length coding of $d$-dimensional exponential family of distributions is considered. We propose an achievable scheme consisting of a dictionary, used to parse the source output stream, making use of the previously-introduced notion of quantized types. The quantized type class of a seque... |
1712.01084 | Ranko Sredojevic | Ranko Sredojevic, Shaoyi Cheng, Lazar Supic, Rawan Naous, Vladimir
Stojanovic | Structured Deep Neural Network Pruning via Matrix Pivoting | 16 pages, 3 figures, 2 tables, 1 listing | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Neural Networks (DNNs) are the key to the state-of-the-art machine
vision, sensor fusion and audio/video signal processing. Unfortunately, their
computation complexity and tight resource constraints on the Edge make them
hard to leverage on mobile, embedded and IoT devices. Due to great diversity of
Edge devices... | [
{
"created": "Fri, 1 Dec 2017 02:47:39 GMT",
"version": "v1"
}
] | 2017-12-05 | [
[
"Sredojevic",
"Ranko",
""
],
[
"Cheng",
"Shaoyi",
""
],
[
"Supic",
"Lazar",
""
],
[
"Naous",
"Rawan",
""
],
[
"Stojanovic",
"Vladimir",
""
]
] | Deep Neural Networks (DNNs) are the key to the state-of-the-art machine vision, sensor fusion and audio/video signal processing. Unfortunately, their computation complexity and tight resource constraints on the Edge make them hard to leverage on mobile, embedded and IoT devices. Due to great diversity of Edge devices, ... |
1609.08813 | Mao-Ching Chiu | Mao-Ching Chiu and Wei-De Wu | Reduced-Complexity SCL Decoding of Multi-CRC-Aided Polar Codes | 9 pages, 7 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cyclic redundancy check (CRC) aided polar codes are capable of achieving
better performance than low-density parity-check (LDPC) codes under the
successive cancelation list (SCL) decoding scheme. However, the SCL decoding
scheme suffers from very high space and time complexities. Especially, the high
space complexity... | [
{
"created": "Wed, 28 Sep 2016 08:33:18 GMT",
"version": "v1"
}
] | 2016-09-29 | [
[
"Chiu",
"Mao-Ching",
""
],
[
"Wu",
"Wei-De",
""
]
] | Cyclic redundancy check (CRC) aided polar codes are capable of achieving better performance than low-density parity-check (LDPC) codes under the successive cancelation list (SCL) decoding scheme. However, the SCL decoding scheme suffers from very high space and time complexities. Especially, the high space complexity i... |
2211.04921 | Armin Goudarzi | Armin Goudarzi | Global, and Local Optimization Beamforming for Broadband Sources | Submitted to JASA | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an alternative energy function for Global Optimization
(GO) beamforming, tailored to acoustic broadband sources. Given, that
properties such as the source location, multipole rotation, or flow conditions
are parameterized over the frequency, a CSM-fitting can be performed for all
frequencies at on... | [
{
"created": "Wed, 9 Nov 2022 14:45:56 GMT",
"version": "v1"
},
{
"created": "Wed, 4 Jan 2023 15:02:22 GMT",
"version": "v2"
},
{
"created": "Thu, 20 Apr 2023 12:34:40 GMT",
"version": "v3"
},
{
"created": "Wed, 25 Oct 2023 17:43:33 GMT",
"version": "v4"
}
] | 2023-10-26 | [
[
"Goudarzi",
"Armin",
""
]
] | This paper presents an alternative energy function for Global Optimization (GO) beamforming, tailored to acoustic broadband sources. Given, that properties such as the source location, multipole rotation, or flow conditions are parameterized over the frequency, a CSM-fitting can be performed for all frequencies at once... |
1610.08668 | Dario Izzo | Carlos S\'anchez-S\'anchez and Dario Izzo | Real-time optimal control via Deep Neural Networks: study on landing
problems | null | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent research on deep learning, a set of machine learning techniques able
to learn deep architectures, has shown how robotic perception and action
greatly benefits from these techniques. In terms of spacecraft navigation and
control system, this suggests that deep architectures may be considered now to
drive all or... | [
{
"created": "Thu, 27 Oct 2016 09:18:47 GMT",
"version": "v1"
}
] | 2016-10-28 | [
[
"Sánchez-Sánchez",
"Carlos",
""
],
[
"Izzo",
"Dario",
""
]
] | Recent research on deep learning, a set of machine learning techniques able to learn deep architectures, has shown how robotic perception and action greatly benefits from these techniques. In terms of spacecraft navigation and control system, this suggests that deep architectures may be considered now to drive all or p... |
2012.06261 | Yu Lu | Yu Lu, Mo Hao, and Richard MAcKenzie | Reconfigurable Intelligent Surface Based Hybrid Precoding for THz
Communications | 26 pages, 7 figures | null | null | null | cs.IT eess.SP math.IT | http://creativecommons.org/publicdomain/zero/1.0/ | Benefiting from the growth of the bandwidth, Terahertz (THz) communication
can support the new application with explosive requirements of the
ultra-high-speed rates for future 6G wireless systems. In order to compensate
for the path loss of high frequency, massive multiple-input multiple-output
(MIMO) can be utilized... | [
{
"created": "Fri, 11 Dec 2020 11:53:14 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Dec 2021 16:54:58 GMT",
"version": "v2"
}
] | 2021-12-16 | [
[
"Lu",
"Yu",
""
],
[
"Hao",
"Mo",
""
],
[
"MAcKenzie",
"Richard",
""
]
] | Benefiting from the growth of the bandwidth, Terahertz (THz) communication can support the new application with explosive requirements of the ultra-high-speed rates for future 6G wireless systems. In order to compensate for the path loss of high frequency, massive multiple-input multiple-output (MIMO) can be utilized f... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.