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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2107.01799 | Isaac Sledge | Isaac J. Sledge and Jose C. Principe | An Information-Theoretic Approach for Automatically Determining the
Number of States when Aggregating Markov Chains | Submitted to IEEE ICASSP. arXiv admin note: substantial text overlap
with arXiv:1903.09266 | null | 10.1109/ICASSP.2019.8682473 | null | cs.IT cs.LG math.IT | http://creativecommons.org/licenses/by/4.0/ | A fundamental problem when aggregating Markov chains is the specification of
the number of state groups. Too few state groups may fail to sufficiently
capture the pertinent dynamics of the original, high-order Markov chain. Too
many state groups may lead to a non-parsimonious, reduced-order Markov chain
whose complex... | [
{
"created": "Mon, 5 Jul 2021 05:36:04 GMT",
"version": "v1"
}
] | 2021-07-06 | [
[
"Sledge",
"Isaac J.",
""
],
[
"Principe",
"Jose C.",
""
]
] | A fundamental problem when aggregating Markov chains is the specification of the number of state groups. Too few state groups may fail to sufficiently capture the pertinent dynamics of the original, high-order Markov chain. Too many state groups may lead to a non-parsimonious, reduced-order Markov chain whose complexit... |
2102.01884 | Bekir Sait Ciftler | Bekir Sait Ciftler, Abdulmalik Alwarafy, Mohamed Abdallah, Mounir
Hamdi | DQN-Based Multi-User Power Allocation for Hybrid RF/VLC Networks | 6 pages, 4 figures, accepted to IEEE ICC 2021 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a Deep Q-Network (DQN) based multi-agent multi-user power
allocation algorithm is proposed for hybrid networks composed of radio
frequency (RF) and visible light communication (VLC) access points (APs). The
users are capable of multihoming, which can bridge RF and VLC links for
accommodating their band... | [
{
"created": "Wed, 3 Feb 2021 05:42:49 GMT",
"version": "v1"
}
] | 2021-02-04 | [
[
"Ciftler",
"Bekir Sait",
""
],
[
"Alwarafy",
"Abdulmalik",
""
],
[
"Abdallah",
"Mohamed",
""
],
[
"Hamdi",
"Mounir",
""
]
] | In this paper, a Deep Q-Network (DQN) based multi-agent multi-user power allocation algorithm is proposed for hybrid networks composed of radio frequency (RF) and visible light communication (VLC) access points (APs). The users are capable of multihoming, which can bridge RF and VLC links for accommodating their bandwi... |
1904.07331 | Niki Gitinabard | Adithya Sheshadri, Niki Gitinabard, Collin F. Lynch, Tiffany Barnes,
and Sarah Heckman | Predicting Student Performance Based on Online Study Habits: A Study of
Blended Courses | Published in the International Conference on Educational Data Mining
(EDM 2018) | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Online tools provide unique access to research students' study habits and
problem-solving behavior. In MOOCs, this online data can be used to inform
instructors and to provide automatic guidance to students. However, these
techniques may not apply in blended courses with face to face and online
components. We report ... | [
{
"created": "Mon, 15 Apr 2019 21:18:13 GMT",
"version": "v1"
}
] | 2019-04-17 | [
[
"Sheshadri",
"Adithya",
""
],
[
"Gitinabard",
"Niki",
""
],
[
"Lynch",
"Collin F.",
""
],
[
"Barnes",
"Tiffany",
""
],
[
"Heckman",
"Sarah",
""
]
] | Online tools provide unique access to research students' study habits and problem-solving behavior. In MOOCs, this online data can be used to inform instructors and to provide automatic guidance to students. However, these techniques may not apply in blended courses with face to face and online components. We report on... |
2107.06552 | Young Eun Kim | Young Eun Kim and Seong-Whan Lee | Domain Generalization with Pseudo-Domain Label for Face Anti-Spoofing | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Face anti-spoofing (FAS) plays an important role in protecting face
recognition systems from face representation attacks. Many recent studies in
FAS have approached this problem with domain generalization technique. Domain
generalization aims to increase generalization performance to better detect
various types of at... | [
{
"created": "Wed, 14 Jul 2021 08:35:07 GMT",
"version": "v1"
}
] | 2021-07-15 | [
[
"Kim",
"Young Eun",
""
],
[
"Lee",
"Seong-Whan",
""
]
] | Face anti-spoofing (FAS) plays an important role in protecting face recognition systems from face representation attacks. Many recent studies in FAS have approached this problem with domain generalization technique. Domain generalization aims to increase generalization performance to better detect various types of atta... |
2004.13297 | Jian Ren | Menglei Chai, Jian Ren, Sergey Tulyakov | Neural Hair Rendering | ECCV 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a generic neural-based hair rendering pipeline that
can synthesize photo-realistic images from virtual 3D hair models. Unlike
existing supervised translation methods that require model-level similarity to
preserve consistent structure representation for both real images and fake
renderings, ... | [
{
"created": "Tue, 28 Apr 2020 04:36:49 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Jul 2020 19:29:30 GMT",
"version": "v2"
}
] | 2020-07-23 | [
[
"Chai",
"Menglei",
""
],
[
"Ren",
"Jian",
""
],
[
"Tulyakov",
"Sergey",
""
]
] | In this paper, we propose a generic neural-based hair rendering pipeline that can synthesize photo-realistic images from virtual 3D hair models. Unlike existing supervised translation methods that require model-level similarity to preserve consistent structure representation for both real images and fake renderings, ou... |
1811.12640 | Sudeshna Roy | Sudeshna Roy, Meghana Madhyastha, Sheril Lawrence, Vaibhav Rajan | Inferring Concept Prerequisite Relations from Online Educational
Resources | Accepted at the AAAI Conference on Innovative Applications of
Artificial Intelligence (IAAI-19) | null | null | null | cs.CL cs.AI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Internet has rich and rapidly increasing sources of high quality
educational content. Inferring prerequisite relations between educational
concepts is required for modern large-scale online educational technology
applications such as personalized recommendations and automatic curriculum
creation. We present PRERE... | [
{
"created": "Fri, 30 Nov 2018 06:55:20 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Jan 2019 00:39:00 GMT",
"version": "v2"
}
] | 2019-01-24 | [
[
"Roy",
"Sudeshna",
""
],
[
"Madhyastha",
"Meghana",
""
],
[
"Lawrence",
"Sheril",
""
],
[
"Rajan",
"Vaibhav",
""
]
] | The Internet has rich and rapidly increasing sources of high quality educational content. Inferring prerequisite relations between educational concepts is required for modern large-scale online educational technology applications such as personalized recommendations and automatic curriculum creation. We present PREREQ,... |
1910.14634 | Reinhard Heckel | Reinhard Heckel and Mahdi Soltanolkotabi | Denoising and Regularization via Exploiting the Structural Bias of
Convolutional Generators | final ICRL version; simplifications in the proof | International Conference on Learning Representations (ICLR) 2020 | null | null | cs.LG cs.CV cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolutional Neural Networks (CNNs) have emerged as highly successful tools
for image generation, recovery, and restoration. A major contributing factor to
this success is that convolutional networks impose strong prior assumptions
about natural images. A surprising experiment that highlights this
architectural bias... | [
{
"created": "Thu, 31 Oct 2019 17:22:00 GMT",
"version": "v1"
},
{
"created": "Sun, 23 Feb 2020 01:49:25 GMT",
"version": "v2"
}
] | 2020-02-25 | [
[
"Heckel",
"Reinhard",
""
],
[
"Soltanolkotabi",
"Mahdi",
""
]
] | Convolutional Neural Networks (CNNs) have emerged as highly successful tools for image generation, recovery, and restoration. A major contributing factor to this success is that convolutional networks impose strong prior assumptions about natural images. A surprising experiment that highlights this architectural bias t... |
2307.03638 | Jianyuan Ni | Jianyuan Ni, Hao Tang, Anne H.H. Ngu, Gaowen Liu, Yan Yan | Physical-aware Cross-modal Adversarial Network for Wearable Sensor-based
Human Action Recognition | We will be making some significant changes to the paper, including
the title and methodology. We therefore wish to withdraw the paper for now | null | null | null | cs.MM cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Wearable sensor-based Human Action Recognition (HAR) has made significant
strides in recent times. However, the accuracy performance of wearable
sensor-based HAR is currently still lagging behind that of visual
modalities-based systems, such as RGB video and depth data. Although diverse
input modalities can provide c... | [
{
"created": "Fri, 7 Jul 2023 14:57:34 GMT",
"version": "v1"
},
{
"created": "Sun, 19 May 2024 20:39:25 GMT",
"version": "v2"
}
] | 2024-05-21 | [
[
"Ni",
"Jianyuan",
""
],
[
"Tang",
"Hao",
""
],
[
"Ngu",
"Anne H. H.",
""
],
[
"Liu",
"Gaowen",
""
],
[
"Yan",
"Yan",
""
]
] | Wearable sensor-based Human Action Recognition (HAR) has made significant strides in recent times. However, the accuracy performance of wearable sensor-based HAR is currently still lagging behind that of visual modalities-based systems, such as RGB video and depth data. Although diverse input modalities can provide com... |
1908.02802 | Roozbeh Yousefzadeh | Roozbeh Yousefzadeh, Dianne P O'Leary | Investigating Decision Boundaries of Trained Neural Networks | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning models have been the subject of study from various
perspectives, for example, their training process, interpretation,
generalization error, robustness to adversarial attacks, etc. A trained model
is defined by its decision boundaries, and therefore, many of the studies about
deep learning models specula... | [
{
"created": "Wed, 7 Aug 2019 19:09:22 GMT",
"version": "v1"
}
] | 2019-08-09 | [
[
"Yousefzadeh",
"Roozbeh",
""
],
[
"O'Leary",
"Dianne P",
""
]
] | Deep learning models have been the subject of study from various perspectives, for example, their training process, interpretation, generalization error, robustness to adversarial attacks, etc. A trained model is defined by its decision boundaries, and therefore, many of the studies about deep learning models speculate... |
2111.08211 | Yan Kang | Yuezhou Wu, Yan Kang, Jiahuan Luo, Yuanqin He, Qiang Yang | FedCG: Leverage Conditional GAN for Protecting Privacy and Maintaining
Competitive Performance in Federated Learning | null | Proceedings of the Thirty-First International Joint Conference on
Artificial Intelligence, 2022 | 10.24963/ijcai.2022/324 | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Federated learning (FL) aims to protect data privacy by enabling clients to
build machine learning models collaboratively without sharing their private
data. Recent works demonstrate that information exchanged during FL is subject
to gradient-based privacy attacks, and consequently, a variety of
privacy-preserving me... | [
{
"created": "Tue, 16 Nov 2021 03:20:37 GMT",
"version": "v1"
},
{
"created": "Wed, 16 Feb 2022 03:16:52 GMT",
"version": "v2"
},
{
"created": "Sun, 7 Jul 2024 03:57:12 GMT",
"version": "v3"
}
] | 2024-07-09 | [
[
"Wu",
"Yuezhou",
""
],
[
"Kang",
"Yan",
""
],
[
"Luo",
"Jiahuan",
""
],
[
"He",
"Yuanqin",
""
],
[
"Yang",
"Qiang",
""
]
] | Federated learning (FL) aims to protect data privacy by enabling clients to build machine learning models collaboratively without sharing their private data. Recent works demonstrate that information exchanged during FL is subject to gradient-based privacy attacks, and consequently, a variety of privacy-preserving meth... |
1208.0079 | Abhay Jha | Abhay Jha, Dan Suciu | Probabilistic Databases with MarkoViews | VLDB2012 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 11, pp.
1160-1171 (2012) | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most of the work on query evaluation in probabilistic databases has focused
on the simple tuple-independent data model, where tuples are independent random
events. Several efficient query evaluation techniques exists in this setting,
such as safe plans, algorithms based on OBDDs, tree-decomposition and a variety
of a... | [
{
"created": "Wed, 1 Aug 2012 03:47:10 GMT",
"version": "v1"
}
] | 2012-08-02 | [
[
"Jha",
"Abhay",
""
],
[
"Suciu",
"Dan",
""
]
] | Most of the work on query evaluation in probabilistic databases has focused on the simple tuple-independent data model, where tuples are independent random events. Several efficient query evaluation techniques exists in this setting, such as safe plans, algorithms based on OBDDs, tree-decomposition and a variety of app... |
1902.09093 | Bishan Yang | Igor Labutov, Bishan Yang, Anusha Prakash, Amos Azaria | Multi-Relational Question Answering from Narratives: Machine Reading and
Reasoning in Simulated Worlds | published at ACL 2018 | ACL 2018 | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Question Answering (QA), as a research field, has primarily focused on either
knowledge bases (KBs) or free text as a source of knowledge. These two sources
have historically shaped the kinds of questions that are asked over these
sources, and the methods developed to answer them. In this work, we look
towards a prac... | [
{
"created": "Mon, 25 Feb 2019 05:04:26 GMT",
"version": "v1"
}
] | 2019-02-26 | [
[
"Labutov",
"Igor",
""
],
[
"Yang",
"Bishan",
""
],
[
"Prakash",
"Anusha",
""
],
[
"Azaria",
"Amos",
""
]
] | Question Answering (QA), as a research field, has primarily focused on either knowledge bases (KBs) or free text as a source of knowledge. These two sources have historically shaped the kinds of questions that are asked over these sources, and the methods developed to answer them. In this work, we look towards a practi... |
1710.02555 | Melissa Greeff | Melissa Greeff and Angela P. Schoellig | Model Predictive Path-Following for Constrained Differentially Flat
Systems | 8 pages, submitted to ICRA 2018 | null | null | null | cs.RO cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For many tasks, predictive path-following control can significantly improve
the performance and robustness of autonomous robots over traditional trajectory
tracking control. It does this by prioritizing closeness to the path over timed
progress along the path and by looking ahead to account for changes in the
path. W... | [
{
"created": "Fri, 6 Oct 2017 18:56:13 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Nov 2017 15:24:08 GMT",
"version": "v2"
}
] | 2017-11-03 | [
[
"Greeff",
"Melissa",
""
],
[
"Schoellig",
"Angela P.",
""
]
] | For many tasks, predictive path-following control can significantly improve the performance and robustness of autonomous robots over traditional trajectory tracking control. It does this by prioritizing closeness to the path over timed progress along the path and by looking ahead to account for changes in the path. We ... |
2008.09511 | Peter Lindner | Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke | Tuple-Independent Representations of Infinite Probabilistic Databases | null | null | null | null | cs.DB cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Probabilistic databases (PDBs) are probability spaces over database
instances. They provide a framework for handling uncertainty in databases, as
occurs due to data integration, noisy data, data from unreliable sources or
randomized processes. Most of the existing theory literature investigated
finite, tuple-independ... | [
{
"created": "Fri, 21 Aug 2020 14:39:47 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Apr 2022 07:17:45 GMT",
"version": "v2"
}
] | 2022-04-20 | [
[
"Carmeli",
"Nofar",
""
],
[
"Grohe",
"Martin",
""
],
[
"Lindner",
"Peter",
""
],
[
"Standke",
"Christoph",
""
]
] | Probabilistic databases (PDBs) are probability spaces over database instances. They provide a framework for handling uncertainty in databases, as occurs due to data integration, noisy data, data from unreliable sources or randomized processes. Most of the existing theory literature investigated finite, tuple-independen... |
2302.08174 | Rafael Mohr | Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din | A Direttissimo Algorithm for Equidimensional Decomposition | Some minor revisions, corrects a mistake in the proof of lemma 2.2 | null | null | null | cs.SC math.AC | http://creativecommons.org/licenses/by/4.0/ | We describe a recursive algorithm that decomposes an algebraic set into
locally closed equidimensional sets, i.e. sets which each have irreducible
components of the same dimension. At the core of this algorithm, we combine
ideas from the theory of triangular sets, a.k.a. regular chains, with Gr\"obner
bases to encode... | [
{
"created": "Thu, 16 Feb 2023 09:42:55 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Jun 2023 08:45:15 GMT",
"version": "v2"
}
] | 2023-06-12 | [
[
"Eder",
"Christian",
""
],
[
"Lairez",
"Pierre",
""
],
[
"Mohr",
"Rafael",
""
],
[
"Din",
"Mohab Safey El",
""
]
] | We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the theory of triangular sets, a.k.a. regular chains, with Gr\"obner bases to encode a... |
2406.12479 | Haifeng Li | Linrui Xu, Ling Zhao, Wang Guo, Qiujun Li, Kewang Long, Kaiqi Zou,
Yuhan Wang, Haifeng Li | RS-GPT4V: A Unified Multimodal Instruction-Following Dataset for Remote
Sensing Image Understanding | 14 pages, 6 figures, 4 tables | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The remote sensing image intelligence understanding model is undergoing a new
profound paradigm shift which has been promoted by multi-modal large language
model (MLLM), i.e. from the paradigm learning a domain model (LaDM) shifts to
paradigm learning a pre-trained general foundation model followed by an
adaptive dom... | [
{
"created": "Tue, 18 Jun 2024 10:34:28 GMT",
"version": "v1"
}
] | 2024-06-19 | [
[
"Xu",
"Linrui",
""
],
[
"Zhao",
"Ling",
""
],
[
"Guo",
"Wang",
""
],
[
"Li",
"Qiujun",
""
],
[
"Long",
"Kewang",
""
],
[
"Zou",
"Kaiqi",
""
],
[
"Wang",
"Yuhan",
""
],
[
"Li",
"Haifeng",
""
... | The remote sensing image intelligence understanding model is undergoing a new profound paradigm shift which has been promoted by multi-modal large language model (MLLM), i.e. from the paradigm learning a domain model (LaDM) shifts to paradigm learning a pre-trained general foundation model followed by an adaptive domai... |
1309.0869 | EPTCS | Thao Dang (CNRS-VERIMAG), Tommaso Dreossi (VERIMAG, University of
Udine) | Falsifying Oscillation Properties of Parametric Biological Models | In Proceedings HSB 2013, arXiv:1308.5724 | EPTCS 125, 2013, pp. 53-67 | 10.4204/EPTCS.125.4 | null | cs.LO cs.CE cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an approach to falsification of oscillation properties of
parametric biological models, based on the recently developed techniques for
testing continuous and hybrid systems. In this approach, an oscillation
property can be specified using a hybrid automaton, which is then used to guide
the exploration in t... | [
{
"created": "Tue, 3 Sep 2013 23:41:23 GMT",
"version": "v1"
}
] | 2013-09-05 | [
[
"Dang",
"Thao",
"",
"CNRS-VERIMAG"
],
[
"Dreossi",
"Tommaso",
"",
"VERIMAG, University of\n Udine"
]
] | We propose an approach to falsification of oscillation properties of parametric biological models, based on the recently developed techniques for testing continuous and hybrid systems. In this approach, an oscillation property can be specified using a hybrid automaton, which is then used to guide the exploration in the... |
2210.03026 | Germ\'an Vidal | Germ\'an Vidal | Computing Race Variants in Message-Passing Concurrent Programming with
Selective Receives | Published as: Vidal, G. (2022). Computing Race Variants in
Message-Passing Concurrent Programming with Selective Receives. In: Mousavi,
M.R., Philippou, A. (eds) FORTE 2022. Lecture Notes in Computer Science, vol
13273. Springer, Cham. The final authenticated publication is available
online at https://doi.org/1... | null | 10.1007/978-3-031-08679-3_12 | null | cs.PL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Message-passing concurrency is a popular computation model that underlies
several programming languages like, e.g., Erlang, Akka, and (to some extent) Go
and Rust. In particular, we consider a message-passing concurrent language with
dynamic process spawning and selective receives, i.e., where messages can only
be co... | [
{
"created": "Thu, 6 Oct 2022 16:19:15 GMT",
"version": "v1"
}
] | 2022-10-07 | [
[
"Vidal",
"Germán",
""
]
] | Message-passing concurrency is a popular computation model that underlies several programming languages like, e.g., Erlang, Akka, and (to some extent) Go and Rust. In particular, we consider a message-passing concurrent language with dynamic process spawning and selective receives, i.e., where messages can only be cons... |
1206.0233 | Arne Leitert | Arne Leitert | 3-Colourability of Dually Chordal Graphs in Linear Time | null | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A graph G is dually chordal if there is a spanning tree T of G such that any
maximal clique of G induces a subtree in T. This paper investigates the
Colourability problem on dually chordal graphs. It will show that it is
NP-complete in case of four colours and solvable in linear time with a simple
algorithm in case o... | [
{
"created": "Fri, 1 Jun 2012 16:00:59 GMT",
"version": "v1"
},
{
"created": "Sun, 5 Aug 2012 15:23:07 GMT",
"version": "v2"
},
{
"created": "Tue, 13 Nov 2012 15:26:12 GMT",
"version": "v3"
}
] | 2012-11-14 | [
[
"Leitert",
"Arne",
""
]
] | A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T. This paper investigates the Colourability problem on dually chordal graphs. It will show that it is NP-complete in case of four colours and solvable in linear time with a simple algorithm in case of ... |
1404.0818 | Marcin Pilipczuk | Daniel Lokshtanov and Marcin Pilipczuk and Micha{\l} Pilipczuk and
Saket Saurabh | Fixed-parameter tractable canonization and isomorphism test for graphs
of bounded treewidth | Full version of a paper presented at FOCS 2014 | null | null | null | cs.DS cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give a fixed-parameter tractable algorithm that, given a parameter $k$ and
two graphs $G_1,G_2$, either concludes that one of these graphs has treewidth
at least $k$, or determines whether $G_1$ and $G_2$ are isomorphic. The running
time of the algorithm on an $n$-vertex graph is $2^{O(k^5\log k)}\cdot n^5$,
and t... | [
{
"created": "Thu, 3 Apr 2014 09:49:54 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Dec 2014 11:32:25 GMT",
"version": "v2"
}
] | 2014-12-11 | [
[
"Lokshtanov",
"Daniel",
""
],
[
"Pilipczuk",
"Marcin",
""
],
[
"Pilipczuk",
"Michał",
""
],
[
"Saurabh",
"Saket",
""
]
] | We give a fixed-parameter tractable algorithm that, given a parameter $k$ and two graphs $G_1,G_2$, either concludes that one of these graphs has treewidth at least $k$, or determines whether $G_1$ and $G_2$ are isomorphic. The running time of the algorithm on an $n$-vertex graph is $2^{O(k^5\log k)}\cdot n^5$, and thi... |
2212.02014 | Heng Guo | Heng Guo, Jianfeng Zhang, Ke Yan, Le Lu, Minfeng Xu | Med-Query: Steerable Parsing of 9-DoF Medical Anatomies with Query
Embedding | updated version | null | null | null | cs.CV | http://creativecommons.org/licenses/by-sa/4.0/ | Automatic parsing of human anatomies at instance-level from 3D computed
tomography (CT) scans is a prerequisite step for many clinical applications.
The presence of pathologies, broken structures or limited field-of-view (FOV)
all can make anatomy parsing algorithms vulnerable. In this work, we explore
how to exploit... | [
{
"created": "Mon, 5 Dec 2022 04:04:21 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Oct 2023 10:03:24 GMT",
"version": "v2"
}
] | 2023-10-11 | [
[
"Guo",
"Heng",
""
],
[
"Zhang",
"Jianfeng",
""
],
[
"Yan",
"Ke",
""
],
[
"Lu",
"Le",
""
],
[
"Xu",
"Minfeng",
""
]
] | Automatic parsing of human anatomies at instance-level from 3D computed tomography (CT) scans is a prerequisite step for many clinical applications. The presence of pathologies, broken structures or limited field-of-view (FOV) all can make anatomy parsing algorithms vulnerable. In this work, we explore how to exploit a... |
2303.04901 | Laura Zheng | Laura Zheng, Julio Poveda, James Mullen, Shreelekha Revankar, Ming C.
Lin | Towards Driving Policies with Personality: Modeling Behavior and Style
in Risky Scenarios via Data Collection in Virtual Reality | null | null | null | null | cs.RO cs.HC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Autonomous driving research currently faces data sparsity in representation
of risky scenarios. Such data is both difficult to obtain ethically in the real
world, and unreliable to obtain via simulation. Recent advances in virtual
reality (VR) driving simulators lower barriers to tackling this problem in
simulation. ... | [
{
"created": "Wed, 8 Mar 2023 21:38:24 GMT",
"version": "v1"
}
] | 2023-03-10 | [
[
"Zheng",
"Laura",
""
],
[
"Poveda",
"Julio",
""
],
[
"Mullen",
"James",
""
],
[
"Revankar",
"Shreelekha",
""
],
[
"Lin",
"Ming C.",
""
]
] | Autonomous driving research currently faces data sparsity in representation of risky scenarios. Such data is both difficult to obtain ethically in the real world, and unreliable to obtain via simulation. Recent advances in virtual reality (VR) driving simulators lower barriers to tackling this problem in simulation. We... |
1801.01451 | Andrew Kiruluta | Andrew Kiruluta | Reducing Deep Network Complexity with Fourier Transform Methods | mistake in tensorflow code with test data leakage into training set
leading to model over fitting | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel way that uses shallow densely connected neuron network
architectures to achieve superior performance to convolution based neural
networks (CNNs) approaches with the added benefits of lower computation burden
requiring dramatically less training examples to achieve high prediction
accuracy ($>98\%$)... | [
{
"created": "Fri, 15 Dec 2017 20:30:09 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Jun 2018 12:09:37 GMT",
"version": "v2"
}
] | 2018-06-08 | [
[
"Kiruluta",
"Andrew",
""
]
] | We propose a novel way that uses shallow densely connected neuron network architectures to achieve superior performance to convolution based neural networks (CNNs) approaches with the added benefits of lower computation burden requiring dramatically less training examples to achieve high prediction accuracy ($>98\%$). ... |
2302.01301 | Raffaele Galliera | Raffaele Galliera, Alessandro Morelli, Roberto Fronteddu, Niranjan
Suri | MARLIN: Soft Actor-Critic based Reinforcement Learning for Congestion
Control in Real Networks | 10 pages, 5 figures, AAAI 2023 workshop "Reinforcement Learning Ready
for Production", accepted at NOMS 2023 - IEEE/IFIP Network Operations and
Management Symposium | null | 10.1109/NOMS56928.2023.10154210 | null | cs.LG cs.AI cs.NI | http://creativecommons.org/licenses/by/4.0/ | Fast and efficient transport protocols are the foundation of an increasingly
distributed world. The burden of continuously delivering improved communication
performance to support next-generation applications and services, combined with
the increasing heterogeneity of systems and network technologies, has promoted
th... | [
{
"created": "Thu, 2 Feb 2023 18:27:20 GMT",
"version": "v1"
}
] | 2023-06-27 | [
[
"Galliera",
"Raffaele",
""
],
[
"Morelli",
"Alessandro",
""
],
[
"Fronteddu",
"Roberto",
""
],
[
"Suri",
"Niranjan",
""
]
] | Fast and efficient transport protocols are the foundation of an increasingly distributed world. The burden of continuously delivering improved communication performance to support next-generation applications and services, combined with the increasing heterogeneity of systems and network technologies, has promoted the ... |
2006.14859 | Bruno Lecouat | Bruno Lecouat, Jean Ponce, Julien Mairal | A Flexible Framework for Designing Trainable Priors with Adaptive
Smoothing and Game Encoding | NeurIPS 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a general framework for designing and training neural network
layers whose forward passes can be interpreted as solving non-smooth convex
optimization problems, and whose architectures are derived from an optimization
algorithm. We focus on convex games, solved by local agents represented by the
nodes of... | [
{
"created": "Fri, 26 Jun 2020 08:34:54 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Nov 2020 10:00:10 GMT",
"version": "v2"
}
] | 2020-11-10 | [
[
"Lecouat",
"Bruno",
""
],
[
"Ponce",
"Jean",
""
],
[
"Mairal",
"Julien",
""
]
] | We introduce a general framework for designing and training neural network layers whose forward passes can be interpreted as solving non-smooth convex optimization problems, and whose architectures are derived from an optimization algorithm. We focus on convex games, solved by local agents represented by the nodes of a... |
1903.06800 | Alessandro Betti | Lorenzo Gigoni, Alessandro Betti, Emanuele Crisostomi, Alessandro
Franco, Mauro Tucci, Fabrizio Bizzarri, Debora Mucci | Day-Ahead Hourly Forecasting of Power Generation from Photovoltaic
Plants | Preprint of IEEE Transactions of Sustainable Energy, Vol. 9, Issue 2,
pp. 831 - 842 (2018) | IEEE Transactions of Sustainable Energy, Vol. 9, Issue 2, pp. 831
- 842 (2018) | 10.1109/TSTE.2017.2762435 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The ability to accurately forecast power generation from renewable sources is
nowadays recognised as a fundamental skill to improve the operation of power
systems. Despite the general interest of the power community in this topic, it
is not always simple to compare different forecasting methodologies, and infer
the i... | [
{
"created": "Tue, 26 Feb 2019 11:29:18 GMT",
"version": "v1"
}
] | 2019-03-19 | [
[
"Gigoni",
"Lorenzo",
""
],
[
"Betti",
"Alessandro",
""
],
[
"Crisostomi",
"Emanuele",
""
],
[
"Franco",
"Alessandro",
""
],
[
"Tucci",
"Mauro",
""
],
[
"Bizzarri",
"Fabrizio",
""
],
[
"Mucci",
"Debora",
""
... | The ability to accurately forecast power generation from renewable sources is nowadays recognised as a fundamental skill to improve the operation of power systems. Despite the general interest of the power community in this topic, it is not always simple to compare different forecasting methodologies, and infer the imp... |
1806.06397 | Karim Armanious | Karim Armanious, Chenming Jiang, Marc Fischer, Thomas K\"ustner,
Konstantin Nikolaou, Sergios Gatidis, Bin Yang | MedGAN: Medical Image Translation using GANs | 16 pages, 8 figures | null | 10.1016/j.compmedimag.2019.101684 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image-to-image translation is considered a new frontier in the field of
medical image analysis, with numerous potential applications. However, a large
portion of recent approaches offers individualized solutions based on
specialized task-specific architectures or require refinement through
non-end-to-end training. In... | [
{
"created": "Sun, 17 Jun 2018 15:45:10 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Apr 2019 14:34:21 GMT",
"version": "v2"
}
] | 2019-11-26 | [
[
"Armanious",
"Karim",
""
],
[
"Jiang",
"Chenming",
""
],
[
"Fischer",
"Marc",
""
],
[
"Küstner",
"Thomas",
""
],
[
"Nikolaou",
"Konstantin",
""
],
[
"Gatidis",
"Sergios",
""
],
[
"Yang",
"Bin",
""
]
] | Image-to-image translation is considered a new frontier in the field of medical image analysis, with numerous potential applications. However, a large portion of recent approaches offers individualized solutions based on specialized task-specific architectures or require refinement through non-end-to-end training. In t... |
1811.00472 | Weidi Xie | Erika Lu, Weidi Xie and Andrew Zisserman | Class-Agnostic Counting | Asian Conference on Computer Vision (ACCV), 2018 | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Nearly all existing counting methods are designed for a specific object
class. Our work, however, aims to create a counting model able to count any
class of object. To achieve this goal, we formulate counting as a matching
problem, enabling us to exploit the image self-similarity property that
naturally exists in obj... | [
{
"created": "Thu, 1 Nov 2018 16:11:42 GMT",
"version": "v1"
}
] | 2018-11-02 | [
[
"Lu",
"Erika",
""
],
[
"Xie",
"Weidi",
""
],
[
"Zisserman",
"Andrew",
""
]
] | Nearly all existing counting methods are designed for a specific object class. Our work, however, aims to create a counting model able to count any class of object. To achieve this goal, we formulate counting as a matching problem, enabling us to exploit the image self-similarity property that naturally exists in objec... |
1810.02490 | Mostafa Zaman Chowdhury | Mostafa Zaman Chowdhury and Yeong Min Jang | CAC and Traffic Modeling for Integrated Macrocell/Femtocell Networks | International Conference on Ubiquitous and Future Networks (ICUFN),
July 2012, Thailand | null | 10.1109/ICUFN.2012.6261709 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dense femtocells and the integration of these femtocells with the macrocell
are the ultimate goal of the femtocellular network deployment. Integrated
macrocell/femtocell networks surely able to provide high data rate for the
indoor users as well as able to offload huge traffic from the macrocellular
networks to femto... | [
{
"created": "Fri, 5 Oct 2018 01:57:36 GMT",
"version": "v1"
}
] | 2018-10-08 | [
[
"Chowdhury",
"Mostafa Zaman",
""
],
[
"Jang",
"Yeong Min",
""
]
] | Dense femtocells and the integration of these femtocells with the macrocell are the ultimate goal of the femtocellular network deployment. Integrated macrocell/femtocell networks surely able to provide high data rate for the indoor users as well as able to offload huge traffic from the macrocellular networks to femtoce... |
2103.04904 | Laszlo Csirmaz | Laszlo Csirmaz, Franti\v{s}ek Mat\'u\v{s} and Carles Padr\'o | Bipartite secret sharing and staircases | To appear in Discrete Mathematics | null | null | null | cs.CR cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bipartite secret sharing schemes have a bipartite access structure in which
the set of participants is divided into two parts and all participants in the
same part play an equivalent role. Such a bipartite scheme can be described by
a \emph{staircase}: the collection of its minimal points. The complexity of a
scheme ... | [
{
"created": "Mon, 8 Mar 2021 17:09:43 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Oct 2023 14:19:21 GMT",
"version": "v2"
}
] | 2023-10-06 | [
[
"Csirmaz",
"Laszlo",
""
],
[
"Matúš",
"František",
""
],
[
"Padró",
"Carles",
""
]
] | Bipartite secret sharing schemes have a bipartite access structure in which the set of participants is divided into two parts and all participants in the same part play an equivalent role. Such a bipartite scheme can be described by a \emph{staircase}: the collection of its minimal points. The complexity of a scheme is... |
2103.02649 | Xiaoyang Wang | Xiaoyang Wang, Jonathan D Thomas, Robert J Piechocki, Shipra Kapoor,
Raul Santos-Rodriguez, Arjun Parekh | Self-play Learning Strategies for Resource Assignment in Open-RAN
Networks | null | null | null | null | cs.NI cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Open Radio Access Network (ORAN) is being developed with an aim to
democratise access and lower the cost of future mobile data networks,
supporting network services with various QoS requirements, such as massive IoT
and URLLC. In ORAN, network functionality is dis-aggregated into remote units
(RUs), distributed units... | [
{
"created": "Wed, 3 Mar 2021 19:31:29 GMT",
"version": "v1"
}
] | 2021-03-05 | [
[
"Wang",
"Xiaoyang",
""
],
[
"Thomas",
"Jonathan D",
""
],
[
"Piechocki",
"Robert J",
""
],
[
"Kapoor",
"Shipra",
""
],
[
"Santos-Rodriguez",
"Raul",
""
],
[
"Parekh",
"Arjun",
""
]
] | Open Radio Access Network (ORAN) is being developed with an aim to democratise access and lower the cost of future mobile data networks, supporting network services with various QoS requirements, such as massive IoT and URLLC. In ORAN, network functionality is dis-aggregated into remote units (RUs), distributed units (... |
2305.10459 | Hadjer Benmeziane | Hadjer Benmeziane, Corey Lammie, Irem Boybat, Malte Rasch, Manuel Le
Gallo, Hsinyu Tsai, Ramachandran Muralidhar, Smail Niar, Ouarnoughi Hamza,
Vijay Narayanan, Abu Sebastian and Kaoutar El Maghraoui | AnalogNAS: A Neural Network Design Framework for Accurate Inference with
Analog In-Memory Computing | Accepted to IEEE Edge | null | null | null | cs.AR cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | The advancement of Deep Learning (DL) is driven by efficient Deep Neural
Network (DNN) design and new hardware accelerators. Current DNN design is
primarily tailored for general-purpose use and deployment on commercially
viable platforms. Inference at the edge requires low latency, compact and
power-efficient models,... | [
{
"created": "Wed, 17 May 2023 07:39:14 GMT",
"version": "v1"
}
] | 2023-05-19 | [
[
"Benmeziane",
"Hadjer",
""
],
[
"Lammie",
"Corey",
""
],
[
"Boybat",
"Irem",
""
],
[
"Rasch",
"Malte",
""
],
[
"Gallo",
"Manuel Le",
""
],
[
"Tsai",
"Hsinyu",
""
],
[
"Muralidhar",
"Ramachandran",
""
],
... | The advancement of Deep Learning (DL) is driven by efficient Deep Neural Network (DNN) design and new hardware accelerators. Current DNN design is primarily tailored for general-purpose use and deployment on commercially viable platforms. Inference at the edge requires low latency, compact and power-efficient models, a... |
2404.05502 | Roman Kazakov | Roman Kazakov, Kseniia Petukhova, Ekaterina Kochmar | PetKaz at SemEval-2024 Task 3: Advancing Emotion Classification with an
LLM for Emotion-Cause Pair Extraction in Conversations | 8 pages, 7 figures, 2 tables, to be published in the Proceedings of
the 18th International Workshop on Semantic Evaluation (SemEval-2024), for
associated code, see https://github.com/sachertort/petkaz-semeval-ecac | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | In this paper, we present our submission to the SemEval-2023 Task~3 "The
Competition of Multimodal Emotion Cause Analysis in Conversations", focusing on
extracting emotion-cause pairs from dialogs. Specifically, our approach relies
on combining fine-tuned GPT-3.5 for emotion classification and a BiLSTM-based
neural n... | [
{
"created": "Mon, 8 Apr 2024 13:25:03 GMT",
"version": "v1"
}
] | 2024-04-09 | [
[
"Kazakov",
"Roman",
""
],
[
"Petukhova",
"Kseniia",
""
],
[
"Kochmar",
"Ekaterina",
""
]
] | In this paper, we present our submission to the SemEval-2023 Task~3 "The Competition of Multimodal Emotion Cause Analysis in Conversations", focusing on extracting emotion-cause pairs from dialogs. Specifically, our approach relies on combining fine-tuned GPT-3.5 for emotion classification and a BiLSTM-based neural net... |
2306.07042 | Enric Boix-Adser\`a | Enric Boix-Adsera, Etai Littwin, Emmanuel Abbe, Samy Bengio, Joshua
Susskind | Transformers learn through gradual rank increase | 39 pages, to appear in NeurIPS 2023 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We identify incremental learning dynamics in transformers, where the
difference between trained and initial weights progressively increases in rank.
We rigorously prove this occurs under the simplifying assumptions of diagonal
weight matrices and small initialization. Our experiments support the theory
and also show ... | [
{
"created": "Mon, 12 Jun 2023 11:41:42 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Dec 2023 00:23:45 GMT",
"version": "v2"
}
] | 2023-12-12 | [
[
"Boix-Adsera",
"Enric",
""
],
[
"Littwin",
"Etai",
""
],
[
"Abbe",
"Emmanuel",
""
],
[
"Bengio",
"Samy",
""
],
[
"Susskind",
"Joshua",
""
]
] | We identify incremental learning dynamics in transformers, where the difference between trained and initial weights progressively increases in rank. We rigorously prove this occurs under the simplifying assumptions of diagonal weight matrices and small initialization. Our experiments support the theory and also show th... |
2203.12328 | Ananthanarayanan Chockalingam | Sandesh Rao Mattu and A. Chockalingam | Learning based Channel Estimation and Phase Noise Compensation in
Doubly-Selective Channels | Comm. Lett. Copyright IEEE. Personal use of this material is
permitted. Permission from IEEE must be obtained for all other uses, in any
current or future media, including reprinting/republishing this material for
advertising or promotional purposes, creating new collective works, for
resale or redistribution t... | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this letter, we propose a learning based channel estimation scheme for
orthogonal frequency division multiplexing (OFDM) systems in the presence of
phase noise in doubly-selective fading channels. Two-dimensional (2D)
convolutional neural networks (CNNs) are employed for effective training and
tracking of channel ... | [
{
"created": "Wed, 23 Mar 2022 11:13:27 GMT",
"version": "v1"
}
] | 2022-03-24 | [
[
"Mattu",
"Sandesh Rao",
""
],
[
"Chockalingam",
"A.",
""
]
] | In this letter, we propose a learning based channel estimation scheme for orthogonal frequency division multiplexing (OFDM) systems in the presence of phase noise in doubly-selective fading channels. Two-dimensional (2D) convolutional neural networks (CNNs) are employed for effective training and tracking of channel va... |
2205.14122 | Alexandra Fedorova | Alexandra Fedorova, Keith Smith, Keith Bostic, Alexander Gorrod, Sue
LoVerso, Michael Cahill | Writes Hurt: Lessons in Cache Design for Optane NVRAM | null | null | null | null | cs.AR cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Intel OptaneTM DC Persistent Memory resides on the memory bus and approaches
DRAM in access latency. One avenue for its adoption is to employ it in place of
persistent storage; another is to use it as a cheaper and denser extension of
DRAM. In pursuit of the latter goal, we present the design of a volatile Optane
NVR... | [
{
"created": "Tue, 24 May 2022 22:16:11 GMT",
"version": "v1"
}
] | 2022-05-30 | [
[
"Fedorova",
"Alexandra",
""
],
[
"Smith",
"Keith",
""
],
[
"Bostic",
"Keith",
""
],
[
"Gorrod",
"Alexander",
""
],
[
"LoVerso",
"Sue",
""
],
[
"Cahill",
"Michael",
""
]
] | Intel OptaneTM DC Persistent Memory resides on the memory bus and approaches DRAM in access latency. One avenue for its adoption is to employ it in place of persistent storage; another is to use it as a cheaper and denser extension of DRAM. In pursuit of the latter goal, we present the design of a volatile Optane NVRAM... |
2303.13367 | Brady Lund | Brady Lund, Ting Wang, Nishith Reddy Mannuru, Bing Nie, Somipam
Shimray, and Ziang Wang | ChatGPT and a New Academic Reality: Artificial Intelligence-Written
Research Papers and the Ethics of the Large Language Models in Scholarly
Publishing | null | Journal of the Association for Information Science and Technology
(2023) | 10.1002/asi.24750 | null | cs.CL cs.CY | http://creativecommons.org/licenses/by/4.0/ | This paper discusses OpenAIs ChatGPT, a generative pre-trained transformer,
which uses natural language processing to fulfill text-based user requests
(i.e., a chatbot). The history and principles behind ChatGPT and similar models
are discussed. This technology is then discussed in relation to its potential
impact on... | [
{
"created": "Tue, 21 Mar 2023 14:35:07 GMT",
"version": "v1"
},
{
"created": "Fri, 31 Mar 2023 17:56:28 GMT",
"version": "v2"
}
] | 2023-04-03 | [
[
"Lund",
"Brady",
""
],
[
"Wang",
"Ting",
""
],
[
"Mannuru",
"Nishith Reddy",
""
],
[
"Nie",
"Bing",
""
],
[
"Shimray",
"Somipam",
""
],
[
"Wang",
"Ziang",
""
]
] | This paper discusses OpenAIs ChatGPT, a generative pre-trained transformer, which uses natural language processing to fulfill text-based user requests (i.e., a chatbot). The history and principles behind ChatGPT and similar models are discussed. This technology is then discussed in relation to its potential impact on a... |
2310.20587 | Ruizhe Shi | Ruizhe Shi, Yuyao Liu, Yanjie Ze, Simon S. Du, Huazhe Xu | Unleashing the Power of Pre-trained Language Models for Offline
Reinforcement Learning | 24 pages, 16 tables | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Offline reinforcement learning (RL) aims to find a near-optimal policy using
pre-collected datasets. In real-world scenarios, data collection could be
costly and risky; therefore, offline RL becomes particularly challenging when
the in-domain data is limited. Given recent advances in Large Language Models
(LLMs) and ... | [
{
"created": "Tue, 31 Oct 2023 16:24:17 GMT",
"version": "v1"
},
{
"created": "Sat, 4 Nov 2023 08:11:10 GMT",
"version": "v2"
},
{
"created": "Tue, 7 Nov 2023 03:26:51 GMT",
"version": "v3"
},
{
"created": "Mon, 27 Nov 2023 07:38:06 GMT",
"version": "v4"
}
] | 2023-11-28 | [
[
"Shi",
"Ruizhe",
""
],
[
"Liu",
"Yuyao",
""
],
[
"Ze",
"Yanjie",
""
],
[
"Du",
"Simon S.",
""
],
[
"Xu",
"Huazhe",
""
]
] | Offline reinforcement learning (RL) aims to find a near-optimal policy using pre-collected datasets. In real-world scenarios, data collection could be costly and risky; therefore, offline RL becomes particularly challenging when the in-domain data is limited. Given recent advances in Large Language Models (LLMs) and th... |
2111.09888 | Apoorv Khandelwal | Apoorv Khandelwal, Luca Weihs, Roozbeh Mottaghi, Aniruddha Kembhavi | Simple but Effective: CLIP Embeddings for Embodied AI | Published in CVPR 2022 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Contrastive language image pretraining (CLIP) encoders have been shown to be
beneficial for a range of visual tasks from classification and detection to
captioning and image manipulation. We investigate the effectiveness of CLIP
visual backbones for Embodied AI tasks. We build incredibly simple baselines,
named EmbCL... | [
{
"created": "Thu, 18 Nov 2021 18:59:59 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Apr 2022 02:12:26 GMT",
"version": "v2"
}
] | 2022-04-18 | [
[
"Khandelwal",
"Apoorv",
""
],
[
"Weihs",
"Luca",
""
],
[
"Mottaghi",
"Roozbeh",
""
],
[
"Kembhavi",
"Aniruddha",
""
]
] | Contrastive language image pretraining (CLIP) encoders have been shown to be beneficial for a range of visual tasks from classification and detection to captioning and image manipulation. We investigate the effectiveness of CLIP visual backbones for Embodied AI tasks. We build incredibly simple baselines, named EmbCLIP... |
1611.01195 | Shusil Dangi | Shusil Dangi, Nathan Cahill, Cristian A. Linte | Integrating Atlas and Graph Cut Methods for LV Segmentation from Cardiac
Cine MRI | Statistical Atlases and Computational Modelling of Heart workshop
2016 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Magnetic Resonance Imaging (MRI) has evolved as a clinical standard-of-care
imaging modality for cardiac morphology, function assessment, and guidance of
cardiac interventions. All these applications rely on accurate extraction of
the myocardial tissue and blood pool from the imaging data. Here we propose a
framework... | [
{
"created": "Thu, 3 Nov 2016 21:12:55 GMT",
"version": "v1"
}
] | 2016-11-07 | [
[
"Dangi",
"Shusil",
""
],
[
"Cahill",
"Nathan",
""
],
[
"Linte",
"Cristian A.",
""
]
] | Magnetic Resonance Imaging (MRI) has evolved as a clinical standard-of-care imaging modality for cardiac morphology, function assessment, and guidance of cardiac interventions. All these applications rely on accurate extraction of the myocardial tissue and blood pool from the imaging data. Here we propose a framework f... |
2311.07634 | Wenshuai Xu | Wenshuai Xu, Zhenghui Hu, Yu Lu, Jinzhou Meng, Qingjie Liu, Yunhong
Wang | ActiveDC: Distribution Calibration for Active Finetuning | CVPR 2024 Accept | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The pretraining-finetuning paradigm has gained popularity in various computer
vision tasks. In this paradigm, the emergence of active finetuning arises due
to the abundance of large-scale data and costly annotation requirements. Active
finetuning involves selecting a subset of data from an unlabeled pool for
annotati... | [
{
"created": "Mon, 13 Nov 2023 14:35:18 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Nov 2023 09:32:05 GMT",
"version": "v2"
},
{
"created": "Tue, 27 Feb 2024 07:52:16 GMT",
"version": "v3"
}
] | 2024-02-28 | [
[
"Xu",
"Wenshuai",
""
],
[
"Hu",
"Zhenghui",
""
],
[
"Lu",
"Yu",
""
],
[
"Meng",
"Jinzhou",
""
],
[
"Liu",
"Qingjie",
""
],
[
"Wang",
"Yunhong",
""
]
] | The pretraining-finetuning paradigm has gained popularity in various computer vision tasks. In this paradigm, the emergence of active finetuning arises due to the abundance of large-scale data and costly annotation requirements. Active finetuning involves selecting a subset of data from an unlabeled pool for annotation... |
0803.2812 | Mikhail Konnik | Mikhail V. Konnik | Using Spatially Varying Pixels Exposures and Bayer-covered Photosensors
for High Dynamic Range Imaging | Typos corrected | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The method of a linear high dynamic range imaging using solid-state
photosensors with Bayer colour filters array is provided in this paper. Using
information from neighbour pixels, it is possible to reconstruct linear images
with wide dynamic range from the oversaturated images. Bayer colour filters
array is consider... | [
{
"created": "Wed, 19 Mar 2008 14:55:15 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Mar 2008 07:04:39 GMT",
"version": "v2"
}
] | 2008-03-24 | [
[
"Konnik",
"Mikhail V.",
""
]
] | The method of a linear high dynamic range imaging using solid-state photosensors with Bayer colour filters array is provided in this paper. Using information from neighbour pixels, it is possible to reconstruct linear images with wide dynamic range from the oversaturated images. Bayer colour filters array is considered... |
2306.14209 | Fabio Merizzi | Fabio Merizzi, Perrine Saillard, Oceane Acquier, Elena Morotti, Elena
Loli Piccolomini, Luca Calatroni and Rosa Maria Dess\`i | Deep image prior inpainting of ancient frescoes in the Mediterranean
Alpine arc | 26 pages | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The unprecedented success of image reconstruction approaches based on deep
neural networks has revolutionised both the processing and the analysis
paradigms in several applied disciplines. In the field of digital humanities,
the task of digital reconstruction of ancient frescoes is particularly
challenging due to the... | [
{
"created": "Sun, 25 Jun 2023 11:19:47 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Dec 2023 15:30:01 GMT",
"version": "v2"
}
] | 2023-12-14 | [
[
"Merizzi",
"Fabio",
""
],
[
"Saillard",
"Perrine",
""
],
[
"Acquier",
"Oceane",
""
],
[
"Morotti",
"Elena",
""
],
[
"Piccolomini",
"Elena Loli",
""
],
[
"Calatroni",
"Luca",
""
],
[
"Dessì",
"Rosa Maria",
"... | The unprecedented success of image reconstruction approaches based on deep neural networks has revolutionised both the processing and the analysis paradigms in several applied disciplines. In the field of digital humanities, the task of digital reconstruction of ancient frescoes is particularly challenging due to the s... |
cs/0610151 | Anant Sahai | Anant Sahai | Anytime coding on the infinite bandwidth AWGN channel: A sequential
semi-orthogonal optimal code | 12 pages, 6 figures, submitted to IT Transactions | null | null | null | cs.IT math.IT | null | It is well known that orthogonal coding can be used to approach the Shannon
capacity of the power-constrained AWGN channel without a bandwidth constraint.
This correspondence describes a semi-orthogonal variation of pulse position
modulation that is sequential in nature -- bits can be ``streamed across''
without havi... | [
{
"created": "Thu, 26 Oct 2006 10:01:38 GMT",
"version": "v1"
}
] | 2007-07-13 | [
[
"Sahai",
"Anant",
""
]
] | It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position modulation that is sequential in nature -- bits can be ``streamed across'' without having... |
2103.09265 | Harshitha Machiraju | Harshitha Machiraju, Oh-Hyeon Choung, Pascal Frossard, Michael. H
Herzog | Bio-inspired Robustness: A Review | null | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Deep convolutional neural networks (DCNNs) have revolutionized computer
vision and are often advocated as good models of the human visual system.
However, there are currently many shortcomings of DCNNs, which preclude them as
a model of human vision. For example, in the case of adversarial attacks, where
adding small... | [
{
"created": "Tue, 16 Mar 2021 18:20:29 GMT",
"version": "v1"
}
] | 2021-03-18 | [
[
"Machiraju",
"Harshitha",
""
],
[
"Choung",
"Oh-Hyeon",
""
],
[
"Frossard",
"Pascal",
""
],
[
"Herzog",
"Michael. H",
""
]
] | Deep convolutional neural networks (DCNNs) have revolutionized computer vision and are often advocated as good models of the human visual system. However, there are currently many shortcomings of DCNNs, which preclude them as a model of human vision. For example, in the case of adversarial attacks, where adding small a... |
2304.13693 | Thalia Santos De Santana | Thalia S. Santana, Taciana N. Kudo, Renato F. Bulc\~ao-Neto | Requirements Engineering, Software Testing and Education: A Systematic
Mapping | 20 pages, in Portuguese language | null | null | null | cs.SE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The activities of requirements engineering and software testing are
intrinsically related to each other, as these two areas are linked when seeking
to specify and also ensure the expectations of a software product, with quality
and on time. This systematic mapping study aims to verify how requirements and
testing are... | [
{
"created": "Wed, 26 Apr 2023 17:18:34 GMT",
"version": "v1"
}
] | 2023-04-27 | [
[
"Santana",
"Thalia S.",
""
],
[
"Kudo",
"Taciana N.",
""
],
[
"Bulcão-Neto",
"Renato F.",
""
]
] | The activities of requirements engineering and software testing are intrinsically related to each other, as these two areas are linked when seeking to specify and also ensure the expectations of a software product, with quality and on time. This systematic mapping study aims to verify how requirements and testing are b... |
2003.01149 | Piotr Franciszek Orzechowski | Piotr Franciszek Orzechowski, Christoph Burger and Martin Lauer | Decision-Making for Automated Vehicles Using a Hierarchical
Behavior-Based Arbitration Scheme | null | null | 10.1109/IV47402.2020.9304723 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Behavior planning and decision-making are some of the biggest challenges for
highly automated systems. A fully automated vehicle (AV) is confronted with
numerous tactical and strategical choices. Most state-of-the-art AV platforms
implement tactical and strategical behavior generation using finite state
machines. How... | [
{
"created": "Mon, 2 Mar 2020 19:21:18 GMT",
"version": "v1"
},
{
"created": "Mon, 11 May 2020 18:57:05 GMT",
"version": "v2"
},
{
"created": "Tue, 1 Sep 2020 11:11:32 GMT",
"version": "v3"
},
{
"created": "Fri, 5 Feb 2021 11:15:42 GMT",
"version": "v4"
}
] | 2021-02-08 | [
[
"Orzechowski",
"Piotr Franciszek",
""
],
[
"Burger",
"Christoph",
""
],
[
"Lauer",
"Martin",
""
]
] | Behavior planning and decision-making are some of the biggest challenges for highly automated systems. A fully automated vehicle (AV) is confronted with numerous tactical and strategical choices. Most state-of-the-art AV platforms implement tactical and strategical behavior generation using finite state machines. Howev... |
2306.11767 | Marvin Schieseck | Marvin Schieseck, Philip Topalis, Alexander Fay | A Graphical Modeling Language for Artificial Intelligence Applications
in Automation Systems | null | null | null | null | cs.AI cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Artificial Intelligence (AI) applications in automation systems are usually
distributed systems whose development and integration involve several experts.
Each expert uses its own domain-specific modeling language and tools to model
the system elements. An interdisciplinary graphical modeling language that
enables th... | [
{
"created": "Tue, 20 Jun 2023 12:06:41 GMT",
"version": "v1"
}
] | 2023-06-22 | [
[
"Schieseck",
"Marvin",
""
],
[
"Topalis",
"Philip",
""
],
[
"Fay",
"Alexander",
""
]
] | Artificial Intelligence (AI) applications in automation systems are usually distributed systems whose development and integration involve several experts. Each expert uses its own domain-specific modeling language and tools to model the system elements. An interdisciplinary graphical modeling language that enables the ... |
2211.02283 | Jincheng Dai | Zixuan Xiao, Shengshi Yao, Jincheng Dai, Sixian Wang, Kai Niu, Ping
Zhang | Wireless Deep Speech Semantic Transmission | null | null | null | null | cs.SD cs.IT eess.AS math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a new class of high-efficiency semantic coded
transmission methods for end-to-end speech transmission over wireless channels.
We name the whole system as deep speech semantic transmission (DSST).
Specifically, we introduce a nonlinear transform to map the speech source to
semantic latent spa... | [
{
"created": "Fri, 4 Nov 2022 06:49:42 GMT",
"version": "v1"
}
] | 2022-11-07 | [
[
"Xiao",
"Zixuan",
""
],
[
"Yao",
"Shengshi",
""
],
[
"Dai",
"Jincheng",
""
],
[
"Wang",
"Sixian",
""
],
[
"Niu",
"Kai",
""
],
[
"Zhang",
"Ping",
""
]
] | In this paper, we propose a new class of high-efficiency semantic coded transmission methods for end-to-end speech transmission over wireless channels. We name the whole system as deep speech semantic transmission (DSST). Specifically, we introduce a nonlinear transform to map the speech source to semantic latent space... |
1609.00686 | Makoto Naruse | Makoto Naruse, Martin Berthel, Aur\'elien Drezet, Serge Huant,
Hirokazu Hori, Song-Ju Kim | Single photon in hierarchical architecture for physical reinforcement
learning: Photon intelligence | null | null | null | null | cs.LG physics.optics quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding and using natural processes for intelligent functionalities,
referred to as natural intelligence, has recently attracted interest from a
variety of fields, including post-silicon computing for artificial intelligence
and decision making in the behavioural sciences. In a past study, we
successfully used ... | [
{
"created": "Thu, 1 Sep 2016 09:32:29 GMT",
"version": "v1"
}
] | 2016-09-05 | [
[
"Naruse",
"Makoto",
""
],
[
"Berthel",
"Martin",
""
],
[
"Drezet",
"Aurélien",
""
],
[
"Huant",
"Serge",
""
],
[
"Hori",
"Hirokazu",
""
],
[
"Kim",
"Song-Ju",
""
]
] | Understanding and using natural processes for intelligent functionalities, referred to as natural intelligence, has recently attracted interest from a variety of fields, including post-silicon computing for artificial intelligence and decision making in the behavioural sciences. In a past study, we successfully used th... |
2107.02467 | Hui Liu | J. Wang, X. Liu, S. Shen, L. Deng, H. Liu* | DeepDDS: deep graph neural network with attention mechanism to predict
synergistic drug combinations | null | null | null | null | cs.LG q-bio.QM | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Drug combination therapy has become a increasingly promising method in the
treatment of cancer. However, the number of possible drug combinations is so
huge that it is hard to screen synergistic drug combinations through wet-lab
experiments. Therefore, computational screening has become an important way to
prioritize... | [
{
"created": "Tue, 6 Jul 2021 08:25:43 GMT",
"version": "v1"
}
] | 2021-07-07 | [
[
"Wang",
"J.",
""
],
[
"Liu",
"X.",
""
],
[
"Shen",
"S.",
""
],
[
"Deng",
"L.",
""
],
[
"Liu*",
"H.",
""
]
] | Drug combination therapy has become a increasingly promising method in the treatment of cancer. However, the number of possible drug combinations is so huge that it is hard to screen synergistic drug combinations through wet-lab experiments. Therefore, computational screening has become an important way to prioritize d... |
1603.06756 | Wayes Tushar | Wayes Tushar, Chau Yuen, Bo Chai, Shisheng Huang, Kristin L. Wood, See
Gim Kerk and Zaiyue Yang | Smart Grid Testbed for Demand Focused Energy Management in End User
Environments | 2016 | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Successful deployment of smart grids necessitates experimental validities of
their state-of-the-art designs in two-way communications, real-time demand
response and monitoring of consumers' energy usage behavior. The objective is
to observe consumers' energy usage pattern and exploit this information to
assist the gr... | [
{
"created": "Tue, 22 Mar 2016 12:26:48 GMT",
"version": "v1"
}
] | 2016-03-23 | [
[
"Tushar",
"Wayes",
""
],
[
"Yuen",
"Chau",
""
],
[
"Chai",
"Bo",
""
],
[
"Huang",
"Shisheng",
""
],
[
"Wood",
"Kristin L.",
""
],
[
"Kerk",
"See Gim",
""
],
[
"Yang",
"Zaiyue",
""
]
] | Successful deployment of smart grids necessitates experimental validities of their state-of-the-art designs in two-way communications, real-time demand response and monitoring of consumers' energy usage behavior. The objective is to observe consumers' energy usage pattern and exploit this information to assist the grid... |
1506.00572 | Scott A. Hale | Han-Teng Liao, King-wa Fu, Scott A. Hale | How much is said in a microblog? A multilingual inquiry based on Weibo
and Twitter | 9 pages, 4 figures WebSci 2015 | null | 10.1145/2786451.2786486 | null | cs.SI cs.CL cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a multilingual study on, per single post of microblog
text, (a) how much can be said, (b) how much is written in terms of characters
and bytes, and (c) how much is said in terms of information content in posts by
different organizations in different languages. Focusing on three different
languages... | [
{
"created": "Mon, 1 Jun 2015 17:06:00 GMT",
"version": "v1"
},
{
"created": "Sat, 13 Jun 2015 14:37:25 GMT",
"version": "v2"
}
] | 2015-06-16 | [
[
"Liao",
"Han-Teng",
""
],
[
"Fu",
"King-wa",
""
],
[
"Hale",
"Scott A.",
""
]
] | This paper presents a multilingual study on, per single post of microblog text, (a) how much can be said, (b) how much is written in terms of characters and bytes, and (c) how much is said in terms of information content in posts by different organizations in different languages. Focusing on three different languages (... |
2306.07282 | Karsten Roth | Karsten Roth, Jae Myung Kim, A. Sophia Koepke, Oriol Vinyals, Cordelia
Schmid, Zeynep Akata | Waffling around for Performance: Visual Classification with Random Words
and Broad Concepts | Accepted to ICCV 2023. Main paper with 9 pages | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The visual classification performance of vision-language models such as CLIP
has been shown to benefit from additional semantic knowledge from large
language models (LLMs) such as GPT-3. In particular, averaging over
LLM-generated class descriptors, e.g. "waffle, which has a round shape", can
notably improve generali... | [
{
"created": "Mon, 12 Jun 2023 17:59:48 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Aug 2023 02:27:32 GMT",
"version": "v2"
}
] | 2023-08-21 | [
[
"Roth",
"Karsten",
""
],
[
"Kim",
"Jae Myung",
""
],
[
"Koepke",
"A. Sophia",
""
],
[
"Vinyals",
"Oriol",
""
],
[
"Schmid",
"Cordelia",
""
],
[
"Akata",
"Zeynep",
""
]
] | The visual classification performance of vision-language models such as CLIP has been shown to benefit from additional semantic knowledge from large language models (LLMs) such as GPT-3. In particular, averaging over LLM-generated class descriptors, e.g. "waffle, which has a round shape", can notably improve generaliza... |
2203.07463 | Ramin Raziperchikolaei | Ramin Raziperchikolaei and Young-joo Chung | Simultaneous Learning of the Inputs and Parameters in Neural
Collaborative Filtering | null | null | null | null | cs.IR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Neural network-based collaborative filtering systems focus on designing
network architectures to learn better representations while fixing the input to
the user/item interaction vectors and/or ID. In this paper, we first show that
the non-zero elements of the inputs are learnable parameters that determine the
weights... | [
{
"created": "Mon, 14 Mar 2022 19:47:38 GMT",
"version": "v1"
}
] | 2022-03-16 | [
[
"Raziperchikolaei",
"Ramin",
""
],
[
"Chung",
"Young-joo",
""
]
] | Neural network-based collaborative filtering systems focus on designing network architectures to learn better representations while fixing the input to the user/item interaction vectors and/or ID. In this paper, we first show that the non-zero elements of the inputs are learnable parameters that determine the weights i... |
1911.09548 | Martin Schwalsberger | Martin Neum\"uller, Martin Schwalsberger | A parallel space-time multigrid method for the eddy-current equation | null | null | null | null | cs.CE cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We expand the applicabilities and capabilities of an already existing
space-time parallel method based on a block Jacobi smoother. First we formulate
a more detailed criterion for spatial coarsening, which enables the method to
deal with unstructured meshes and varying material parameters. Further we
investigate the ... | [
{
"created": "Thu, 21 Nov 2019 15:43:40 GMT",
"version": "v1"
}
] | 2019-11-22 | [
[
"Neumüller",
"Martin",
""
],
[
"Schwalsberger",
"Martin",
""
]
] | We expand the applicabilities and capabilities of an already existing space-time parallel method based on a block Jacobi smoother. First we formulate a more detailed criterion for spatial coarsening, which enables the method to deal with unstructured meshes and varying material parameters. Further we investigate the ap... |
2208.13137 | Priyabarta Karmakar PhD | Priyabrata Karmakar, Manzur Murshed, Manoranjan Paul, David Taubman | Efficient Motion Modelling with Variable-sized blocks from Hierarchical
Cuboidal Partitioning | null | null | null | null | cs.CV cs.MM | http://creativecommons.org/licenses/by/4.0/ | Motion modelling with block-based architecture has been widely used in video
coding where a frame is divided into fixed-sized blocks that are motion
compensated independently. This often leads to coding inefficiency as
fixed-sized blocks hardly align with the object boundaries. Although
hierarchical block-partitionin... | [
{
"created": "Sun, 28 Aug 2022 04:13:58 GMT",
"version": "v1"
}
] | 2022-08-30 | [
[
"Karmakar",
"Priyabrata",
""
],
[
"Murshed",
"Manzur",
""
],
[
"Paul",
"Manoranjan",
""
],
[
"Taubman",
"David",
""
]
] | Motion modelling with block-based architecture has been widely used in video coding where a frame is divided into fixed-sized blocks that are motion compensated independently. This often leads to coding inefficiency as fixed-sized blocks hardly align with the object boundaries. Although hierarchical block-partitioning ... |
1007.0918 | Jonathan Heusser | Jonathan Heusser and Pasquale Malacaria | Quantifying Information Leak Vulnerabilities | submitted, under review | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Leakage of confidential information represents a serious security risk.
Despite a number of novel, theoretical advances, it has been unclear if and how
quantitative approaches to measuring leakage of confidential information could
be applied to substantial, real-world programs. This is mostly due to the high
complexi... | [
{
"created": "Tue, 6 Jul 2010 15:12:12 GMT",
"version": "v1"
}
] | 2010-07-07 | [
[
"Heusser",
"Jonathan",
""
],
[
"Malacaria",
"Pasquale",
""
]
] | Leakage of confidential information represents a serious security risk. Despite a number of novel, theoretical advances, it has been unclear if and how quantitative approaches to measuring leakage of confidential information could be applied to substantial, real-world programs. This is mostly due to the high complexity... |
1910.05798 | Jefferson Silva | Jefferson O. Silva, Igor Wiese, Daniel M. German, Christoph Treude,
Marco A. Gerosa, Igor Steinmacher | Google Summer of Code: Student Motivations and Contributions | 30 pages | Journal of Systems and Software (JSS), V. 162, April 2020, 110487 | 10.1016/j.jss.2019.110487 | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Several open source software (OSS) projects expect to foster newcomers'
onboarding and to receive contributions by participating in engagement
programs, like Summers of Code. However, there is little empirical evidence
showing why students join such programs. In this paper, we study the
well-established Google Summer... | [
{
"created": "Sun, 13 Oct 2019 18:07:24 GMT",
"version": "v1"
}
] | 2024-01-24 | [
[
"Silva",
"Jefferson O.",
""
],
[
"Wiese",
"Igor",
""
],
[
"German",
"Daniel M.",
""
],
[
"Treude",
"Christoph",
""
],
[
"Gerosa",
"Marco A.",
""
],
[
"Steinmacher",
"Igor",
""
]
] | Several open source software (OSS) projects expect to foster newcomers' onboarding and to receive contributions by participating in engagement programs, like Summers of Code. However, there is little empirical evidence showing why students join such programs. In this paper, we study the well-established Google Summer o... |
2210.10040 | Nikil Selvam | Nikil Roashan Selvam, Sunipa Dev, Daniel Khashabi, Tushar Khot,
Kai-Wei Chang | The Tail Wagging the Dog: Dataset Construction Biases of Social Bias
Benchmarks | ACL 2023 | null | null | null | cs.CL cs.CY cs.LG cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | How reliably can we trust the scores obtained from social bias benchmarks as
faithful indicators of problematic social biases in a given language model? In
this work, we study this question by contrasting social biases with non-social
biases stemming from choices made during dataset construction that might not
even b... | [
{
"created": "Tue, 18 Oct 2022 17:58:39 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Jun 2023 18:35:13 GMT",
"version": "v2"
}
] | 2023-06-21 | [
[
"Selvam",
"Nikil Roashan",
""
],
[
"Dev",
"Sunipa",
""
],
[
"Khashabi",
"Daniel",
""
],
[
"Khot",
"Tushar",
""
],
[
"Chang",
"Kai-Wei",
""
]
] | How reliably can we trust the scores obtained from social bias benchmarks as faithful indicators of problematic social biases in a given language model? In this work, we study this question by contrasting social biases with non-social biases stemming from choices made during dataset construction that might not even be ... |
2110.10246 | Nicole Forsgren | Nicole Forsgren, Bas Alberts, Kevin Backhouse, Grey Baker, Greg
Cecarelli, Derek Jedamski, Scot Kelly, Clair Sullivan | 2020 State of the Octoverse: Securing the World's Software | published by GitHub | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Open source is the connective tissue for much of the information economy. You
would be hard-pressed to find a scenario where your data does not pass through
at least one open source component. Many of the services and technology we all
rely on, from banking to healthcare, also rely on open source software. The
artifa... | [
{
"created": "Tue, 19 Oct 2021 20:32:32 GMT",
"version": "v1"
}
] | 2021-10-22 | [
[
"Forsgren",
"Nicole",
""
],
[
"Alberts",
"Bas",
""
],
[
"Backhouse",
"Kevin",
""
],
[
"Baker",
"Grey",
""
],
[
"Cecarelli",
"Greg",
""
],
[
"Jedamski",
"Derek",
""
],
[
"Kelly",
"Scot",
""
],
[
"Sul... | Open source is the connective tissue for much of the information economy. You would be hard-pressed to find a scenario where your data does not pass through at least one open source component. Many of the services and technology we all rely on, from banking to healthcare, also rely on open source software. The artifact... |
2107.12562 | Shifeng Pan | Shifeng Pan and Lei He | Cross-speaker Style Transfer with Prosody Bottleneck in Neural Speech
Synthesis | in Proceedings of INTERSPEECH 2021 | null | null | null | cs.SD cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cross-speaker style transfer is crucial to the applications of multi-style
and expressive speech synthesis at scale. It does not require the target
speakers to be experts in expressing all styles and to collect corresponding
recordings for model training. However, the performances of existing style
transfer methods a... | [
{
"created": "Tue, 27 Jul 2021 02:43:57 GMT",
"version": "v1"
}
] | 2021-07-28 | [
[
"Pan",
"Shifeng",
""
],
[
"He",
"Lei",
""
]
] | Cross-speaker style transfer is crucial to the applications of multi-style and expressive speech synthesis at scale. It does not require the target speakers to be experts in expressing all styles and to collect corresponding recordings for model training. However, the performances of existing style transfer methods are... |
1204.2989 | Vijay Ganesh | Vijay Ganesh | STP/HAMPI and Computer Security | null | null | null | null | cs.CR cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the past several years I have written two SMT solvers called STP and HAMPI
that have found widespread use in computer security research by leading groups
in academia, industry and the government. In this brief note I summarize the
features of STP/HAMPI that make them particularly suited for computer security
resea... | [
{
"created": "Thu, 12 Apr 2012 16:46:21 GMT",
"version": "v1"
}
] | 2012-04-16 | [
[
"Ganesh",
"Vijay",
""
]
] | In the past several years I have written two SMT solvers called STP and HAMPI that have found widespread use in computer security research by leading groups in academia, industry and the government. In this brief note I summarize the features of STP/HAMPI that make them particularly suited for computer security researc... |
2303.03583 | Siqi Fan | Siqi Fan, Zhe Wang, Xiaoliang Huo, Yan Wang, Jingjing Liu | Calibration-free BEV Representation for Infrastructure Perception | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Effective BEV object detection on infrastructure can greatly improve traffic
scenes understanding and vehicle-toinfrastructure (V2I) cooperative perception.
However, cameras installed on infrastructure have various postures, and
previous BEV detection methods rely on accurate calibration, which is difficult
for pract... | [
{
"created": "Tue, 7 Mar 2023 01:31:06 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Apr 2023 02:45:05 GMT",
"version": "v2"
}
] | 2023-04-17 | [
[
"Fan",
"Siqi",
""
],
[
"Wang",
"Zhe",
""
],
[
"Huo",
"Xiaoliang",
""
],
[
"Wang",
"Yan",
""
],
[
"Liu",
"Jingjing",
""
]
] | Effective BEV object detection on infrastructure can greatly improve traffic scenes understanding and vehicle-toinfrastructure (V2I) cooperative perception. However, cameras installed on infrastructure have various postures, and previous BEV detection methods rely on accurate calibration, which is difficult for practic... |
cs/0205080 | Matus Marko | M. Marko, M.A. Porter, A. Probst, C. Gershenson, A. Das | Transforming the World Wide Web into a Complexity-Based Semantic Network | 6 pages, a manuscript for the ICCS 2002 | null | null | null | cs.NI cs.IR | null | The aim of this paper is to introduce the idea of the Semantic Web to the
Complexity community and set a basic ground for a project resulting in creation
of Internet-based semantic network of Complexity-related information providers.
Implementation of the Semantic Web technology would be of mutual benefit to
both the... | [
{
"created": "Fri, 31 May 2002 18:44:36 GMT",
"version": "v1"
},
{
"created": "Sat, 1 Jun 2002 08:03:07 GMT",
"version": "v2"
}
] | 2007-05-23 | [
[
"Marko",
"M.",
""
],
[
"Porter",
"M. A.",
""
],
[
"Probst",
"A.",
""
],
[
"Gershenson",
"C.",
""
],
[
"Das",
"A.",
""
]
] | The aim of this paper is to introduce the idea of the Semantic Web to the Complexity community and set a basic ground for a project resulting in creation of Internet-based semantic network of Complexity-related information providers. Implementation of the Semantic Web technology would be of mutual benefit to both the p... |
1711.03396 | Chihao Zhang | Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang | Counting hypergraph colorings in the local lemma regime | v3: Constants Changed. Accepted to SICOMP | null | null | null | cs.DS cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give a fully polynomial-time approximation scheme (FPTAS) to count the
number of $q$-colorings for $k$-uniform hypergraphs with maximum degree
$\Delta$ if $k\ge 28$ and $q >357\Delta^{\frac{14}{k-14}}$ . We also obtain a
polynomial-time almost uniform sampler if $q>931\Delta^{\frac{16}{k-16/3}}$.
These are the fir... | [
{
"created": "Thu, 9 Nov 2017 14:49:59 GMT",
"version": "v1"
},
{
"created": "Sun, 12 Nov 2017 08:52:45 GMT",
"version": "v2"
},
{
"created": "Fri, 31 May 2019 13:48:14 GMT",
"version": "v3"
}
] | 2019-06-03 | [
[
"Guo",
"Heng",
""
],
[
"Liao",
"Chao",
""
],
[
"Lu",
"Pinyan",
""
],
[
"Zhang",
"Chihao",
""
]
] | We give a fully polynomial-time approximation scheme (FPTAS) to count the number of $q$-colorings for $k$-uniform hypergraphs with maximum degree $\Delta$ if $k\ge 28$ and $q >357\Delta^{\frac{14}{k-14}}$ . We also obtain a polynomial-time almost uniform sampler if $q>931\Delta^{\frac{16}{k-16/3}}$. These are the first... |
2308.06197 | Angus Maiden MAAI(Prof) | Angus Maiden (1), Bahareh Nakisa (1) ((1) Deakin University) | Complex Facial Expression Recognition Using Deep Knowledge Distillation
of Basic Features | 13 pages, 9 figures, 6 tables, 3 algorithms. Code available at
https://github.com/AngusMaiden/complex-FER | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Complex emotion recognition is a cognitive task that has so far eluded the
same excellent performance of other tasks that are at or above the level of
human cognition. Emotion recognition through facial expressions is particularly
difficult due to the complexity of emotions expressed by the human face. For a
machine ... | [
{
"created": "Fri, 11 Aug 2023 15:42:48 GMT",
"version": "v1"
},
{
"created": "Sun, 5 Nov 2023 23:34:25 GMT",
"version": "v2"
}
] | 2023-11-07 | [
[
"Maiden",
"Angus",
"",
"Deakin University"
],
[
"Nakisa",
"Bahareh",
"",
"Deakin University"
]
] | Complex emotion recognition is a cognitive task that has so far eluded the same excellent performance of other tasks that are at or above the level of human cognition. Emotion recognition through facial expressions is particularly difficult due to the complexity of emotions expressed by the human face. For a machine to... |
2402.01156 | Yongkun Liu | Yongkun Liu, Jiachi Chen, Tingting Bi, John Grundy, Yanlin Wang,
Jianxing Yu, Ting Chen, Yutian Tang, Zibin Zheng | An Empirical Study on Low Code Programming using Traditional vs Large
Language Model Support | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Low-code programming (LCP) refers to programming using models at higher
levels of abstraction, resulting in less manual and more efficient programming,
and reduced learning effort for amateur developers. Many LCP tools have rapidly
evolved and have benefited from the concepts of visual programming languages
(VPLs) an... | [
{
"created": "Fri, 2 Feb 2024 05:52:32 GMT",
"version": "v1"
},
{
"created": "Thu, 6 Jun 2024 12:07:38 GMT",
"version": "v2"
}
] | 2024-06-07 | [
[
"Liu",
"Yongkun",
""
],
[
"Chen",
"Jiachi",
""
],
[
"Bi",
"Tingting",
""
],
[
"Grundy",
"John",
""
],
[
"Wang",
"Yanlin",
""
],
[
"Yu",
"Jianxing",
""
],
[
"Chen",
"Ting",
""
],
[
"Tang",
"Yutia... | Low-code programming (LCP) refers to programming using models at higher levels of abstraction, resulting in less manual and more efficient programming, and reduced learning effort for amateur developers. Many LCP tools have rapidly evolved and have benefited from the concepts of visual programming languages (VPLs) and ... |
2406.14155 | Dominik Stammbach | Dominik Stammbach and Philine Widmer and Eunjung Cho and Caglar
Gulcehre and Elliott Ash | Aligning Large Language Models with Diverse Political Viewpoints | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Large language models such as ChatGPT often exhibit striking political
biases. If users query them about political information, they might take a
normative stance and reinforce such biases. To overcome this, we align LLMs
with diverse political viewpoints from 100,000 comments written by candidates
running for nation... | [
{
"created": "Thu, 20 Jun 2024 09:53:23 GMT",
"version": "v1"
}
] | 2024-06-21 | [
[
"Stammbach",
"Dominik",
""
],
[
"Widmer",
"Philine",
""
],
[
"Cho",
"Eunjung",
""
],
[
"Gulcehre",
"Caglar",
""
],
[
"Ash",
"Elliott",
""
]
] | Large language models such as ChatGPT often exhibit striking political biases. If users query them about political information, they might take a normative stance and reinforce such biases. To overcome this, we align LLMs with diverse political viewpoints from 100,000 comments written by candidates running for national... |
2101.07768 | Ehsan Zabardast | Ehsan Zabardast, Julian Frattini, Javier Gonzalez-Huerta, Daniel
Mendez, Tony Gorschek, Krzysztof Wnuk | Assets in Software Engineering: What are they after all? | Manuscript submitted to the Journal of Systems and Software | null | 10.1016/j.jss.2022.111485 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | During the development and maintenance of software-intensive products or
services, we depend on various artefacts. Some of those artefacts, we deem
central to the feasibility of a project and the product's final quality.
Typically, these central artefacts are referred to as assets. However, despite
their central role... | [
{
"created": "Tue, 19 Jan 2021 18:31:33 GMT",
"version": "v1"
},
{
"created": "Sun, 24 Oct 2021 13:19:22 GMT",
"version": "v2"
},
{
"created": "Wed, 23 Feb 2022 14:32:15 GMT",
"version": "v3"
},
{
"created": "Wed, 11 May 2022 21:31:28 GMT",
"version": "v4"
},
{
"c... | 2022-08-29 | [
[
"Zabardast",
"Ehsan",
""
],
[
"Frattini",
"Julian",
""
],
[
"Gonzalez-Huerta",
"Javier",
""
],
[
"Mendez",
"Daniel",
""
],
[
"Gorschek",
"Tony",
""
],
[
"Wnuk",
"Krzysztof",
""
]
] | During the development and maintenance of software-intensive products or services, we depend on various artefacts. Some of those artefacts, we deem central to the feasibility of a project and the product's final quality. Typically, these central artefacts are referred to as assets. However, despite their central role i... |
2108.02290 | Max Willsey | Yihong Zhang, Yisu Remy Wang, Max Willsey, Zachary Tatlock | Relational E-Matching | POPL 2022 | null | null | null | cs.DB cs.PL | http://creativecommons.org/licenses/by/4.0/ | We present a new approach to e-matching based on relational join; in
particular, we apply recent database query execution techniques to guarantee
worst-case optimal run time. Compared to the conventional backtracking approach
that always searches the e-graph "top down", our new relational e-matching
approach can bett... | [
{
"created": "Wed, 4 Aug 2021 21:23:28 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Jan 2022 21:21:44 GMT",
"version": "v2"
}
] | 2022-01-07 | [
[
"Zhang",
"Yihong",
""
],
[
"Wang",
"Yisu Remy",
""
],
[
"Willsey",
"Max",
""
],
[
"Tatlock",
"Zachary",
""
]
] | We present a new approach to e-matching based on relational join; in particular, we apply recent database query execution techniques to guarantee worst-case optimal run time. Compared to the conventional backtracking approach that always searches the e-graph "top down", our new relational e-matching approach can better... |
1907.09247 | Jorge Fandinno | Jorge Fandinno | Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting | Paper presented at the 35th International Conference on Logic
Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
16 pages | Theory and Practice of Logic Programming 19 (2019) 671-687 | 10.1017/S1471068419000127 | null | cs.LO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a recent line of research, two familiar concepts from logic programming
semantics (unfounded sets and splitting) were extrapolated to the case of
epistemic logic programs. The property of epistemic splitting provides a
natural and modular way to understand programs without epistemic cycles but,
surprisingly, was o... | [
{
"created": "Mon, 22 Jul 2019 11:48:15 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Feb 2020 15:33:26 GMT",
"version": "v2"
}
] | 2020-02-21 | [
[
"Fandinno",
"Jorge",
""
]
] | In a recent line of research, two familiar concepts from logic programming semantics (unfounded sets and splitting) were extrapolated to the case of epistemic logic programs. The property of epistemic splitting provides a natural and modular way to understand programs without epistemic cycles but, surprisingly, was onl... |
1902.05260 | Peng Wang | Peng Wang, Hong Xu, Xin Jin, Tao Wang | Flash: Efficient Dynamic Routing for Offchain Networks | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Offchain networks emerge as a promising solution to address the scalability
challenge of blockchain. Participants directly make payments through a network
of payment channels without the overhead of committing onchain transactions.
Routing is critical to the performance of offchain networks. Existing solutions
use ei... | [
{
"created": "Thu, 14 Feb 2019 08:36:57 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Jun 2019 03:01:10 GMT",
"version": "v2"
}
] | 2019-06-12 | [
[
"Wang",
"Peng",
""
],
[
"Xu",
"Hong",
""
],
[
"Jin",
"Xin",
""
],
[
"Wang",
"Tao",
""
]
] | Offchain networks emerge as a promising solution to address the scalability challenge of blockchain. Participants directly make payments through a network of payment channels without the overhead of committing onchain transactions. Routing is critical to the performance of offchain networks. Existing solutions use eith... |
1811.05932 | Xi Liu | Xi Liu, Ping-Chun Hsieh, Nick Duffield, Rui Chen, Muhe Xie, Xidao Wen | Streaming Network Embedding through Local Actions | null | null | null | null | cs.LG cs.SI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, considerable research attention has been paid to network embedding,
a popular approach to construct feature vectors of vertices. Due to the curse
of dimensionality and sparsity in graphical datasets, this approach has become
indispensable for machine learning tasks over large networks. The majority of
exist... | [
{
"created": "Wed, 14 Nov 2018 18:02:29 GMT",
"version": "v1"
}
] | 2018-11-15 | [
[
"Liu",
"Xi",
""
],
[
"Hsieh",
"Ping-Chun",
""
],
[
"Duffield",
"Nick",
""
],
[
"Chen",
"Rui",
""
],
[
"Xie",
"Muhe",
""
],
[
"Wen",
"Xidao",
""
]
] | Recently, considerable research attention has been paid to network embedding, a popular approach to construct feature vectors of vertices. Due to the curse of dimensionality and sparsity in graphical datasets, this approach has become indispensable for machine learning tasks over large networks. The majority of existin... |
2304.07954 | Jihao Huang | Jihao Huang, Jun Zeng, Xuemin Chi, Koushil Sreenath, Zhitao Liu and
Hongye Su | Velocity Obstacle for Polytopic Collision Avoidance for Distributed
Multi-robot Systems | Accepted to IEEE Robotics and Automation Letters (RA-L) 2023, with
open source repository released | null | null | null | cs.RO cs.SY eess.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Obstacle avoidance for multi-robot navigation with polytopic shapes is
challenging. Existing works simplify the system dynamics or consider it as a
convex or non-convex optimization problem with positive distance constraints
between robots, which limits real-time performance and scalability.
Additionally, generating ... | [
{
"created": "Mon, 17 Apr 2023 02:42:48 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Jun 2024 04:40:33 GMT",
"version": "v2"
}
] | 2024-06-11 | [
[
"Huang",
"Jihao",
""
],
[
"Zeng",
"Jun",
""
],
[
"Chi",
"Xuemin",
""
],
[
"Sreenath",
"Koushil",
""
],
[
"Liu",
"Zhitao",
""
],
[
"Su",
"Hongye",
""
]
] | Obstacle avoidance for multi-robot navigation with polytopic shapes is challenging. Existing works simplify the system dynamics or consider it as a convex or non-convex optimization problem with positive distance constraints between robots, which limits real-time performance and scalability. Additionally, generating co... |
1907.13432 | Dong Liu | Dong Liu, Minh Th\`anh Vu, Saikat Chatterjee, Lars K. Rasmussen | Neural Network based Explicit Mixture Models and
Expectation-maximization based Learning | IJCNN 2020 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose two neural network based mixture models in this article. The
proposed mixture models are explicit in nature. The explicit models have
analytical forms with the advantages of computing likelihood and efficiency of
generating samples. Computation of likelihood is an important aspect of our
models. Expectatio... | [
{
"created": "Wed, 31 Jul 2019 11:57:17 GMT",
"version": "v1"
},
{
"created": "Sun, 24 May 2020 19:57:55 GMT",
"version": "v2"
}
] | 2020-05-26 | [
[
"Liu",
"Dong",
""
],
[
"Vu",
"Minh Thành",
""
],
[
"Chatterjee",
"Saikat",
""
],
[
"Rasmussen",
"Lars K.",
""
]
] | We propose two neural network based mixture models in this article. The proposed mixture models are explicit in nature. The explicit models have analytical forms with the advantages of computing likelihood and efficiency of generating samples. Computation of likelihood is an important aspect of our models. Expectation-... |
2009.10233 | Boyuan Feng | Boyuan Feng, Yuke Wang, Xu Li, and Yufei Ding | Scalable Adversarial Attack on Graph Neural Networks with Alternating
Direction Method of Multipliers | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph neural networks (GNNs) have achieved high performance in analyzing
graph-structured data and have been widely deployed in safety-critical areas,
such as finance and autonomous driving. However, only a few works have explored
GNNs' robustness to adversarial attacks, and their designs are usually limited
by the s... | [
{
"created": "Tue, 22 Sep 2020 00:33:36 GMT",
"version": "v1"
}
] | 2020-09-23 | [
[
"Feng",
"Boyuan",
""
],
[
"Wang",
"Yuke",
""
],
[
"Li",
"Xu",
""
],
[
"Ding",
"Yufei",
""
]
] | Graph neural networks (GNNs) have achieved high performance in analyzing graph-structured data and have been widely deployed in safety-critical areas, such as finance and autonomous driving. However, only a few works have explored GNNs' robustness to adversarial attacks, and their designs are usually limited by the sca... |
2407.17483 | Sherri WeitlHarms | Sherri Harms | Tackling CS education in K-12: Implementing a Google CS4HS Grant Program
in a Rural Underserved Area | Presented at and published in the proceedings of MICS 2017:
https://www.micsymposium.org/mics_2017_proceedings/docs/MICS_2017_paper_44.pdf;
8 pages, 2 figures | Harms, S. K. (2017). Tackling CS education in K-12: Implementing a
Google CS4HS Grant Program. La Crosse, WI: 2017 Midwest Instructional
Computing Symposium Proceedings | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Providing computer science (CS) offerings in the K-12 education system is
often limited by the lack of experienced teachers, especially in small or rural
underserved school districts. By helping teachers in underserved areas develop
CS curriculum and helping them become certified to teach CS courses, more young
peopl... | [
{
"created": "Tue, 2 Jul 2024 18:36:06 GMT",
"version": "v1"
}
] | 2024-07-26 | [
[
"Harms",
"Sherri",
""
]
] | Providing computer science (CS) offerings in the K-12 education system is often limited by the lack of experienced teachers, especially in small or rural underserved school districts. By helping teachers in underserved areas develop CS curriculum and helping them become certified to teach CS courses, more young people ... |
2101.11946 | Stefan Heidekr\"uger | Stefan Heidekr\"uger, Paul Sutterer, Nils Kohring, Maximilian Fichtl,
and Martin Bichler | Equilibrium Learning in Combinatorial Auctions: Computing Approximate
Bayesian Nash Equilibria via Pseudogradient Dynamics | This version includes the supplementary material with additional
proofs | null | null | null | cs.GT cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Applications of combinatorial auctions (CA) as market mechanisms are
prevalent in practice, yet their Bayesian Nash equilibria (BNE) remain poorly
understood. Analytical solutions are known only for a few cases where the
problem can be reformulated as a tractable partial differential equation (PDE).
In the general ca... | [
{
"created": "Thu, 28 Jan 2021 11:53:32 GMT",
"version": "v1"
},
{
"created": "Sat, 6 Feb 2021 11:47:52 GMT",
"version": "v2"
}
] | 2021-02-09 | [
[
"Heidekrüger",
"Stefan",
""
],
[
"Sutterer",
"Paul",
""
],
[
"Kohring",
"Nils",
""
],
[
"Fichtl",
"Maximilian",
""
],
[
"Bichler",
"Martin",
""
]
] | Applications of combinatorial auctions (CA) as market mechanisms are prevalent in practice, yet their Bayesian Nash equilibria (BNE) remain poorly understood. Analytical solutions are known only for a few cases where the problem can be reformulated as a tractable partial differential equation (PDE). In the general case... |
2205.11020 | Rohitash Chandra | Rohitash Chandra, Mukul Ranjan | Artificial intelligence for topic modelling in Hindu philosophy: mapping
themes between the Upanishads and the Bhagavad Gita | null | null | 10.1371/journal.pone.0273476 | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | A distinct feature of Hindu religious and philosophical text is that they
come from a library of texts rather than single source. The Upanishads is known
as one of the oldest philosophical texts in the world that forms the foundation
of Hindu philosophy. The Bhagavad Gita is core text of Hindu philosophy and is
known... | [
{
"created": "Mon, 23 May 2022 03:39:00 GMT",
"version": "v1"
}
] | 2022-10-12 | [
[
"Chandra",
"Rohitash",
""
],
[
"Ranjan",
"Mukul",
""
]
] | A distinct feature of Hindu religious and philosophical text is that they come from a library of texts rather than single source. The Upanishads is known as one of the oldest philosophical texts in the world that forms the foundation of Hindu philosophy. The Bhagavad Gita is core text of Hindu philosophy and is known a... |
1711.02447 | Kaushik Sarker | Md. Maruf Hassan, Kaushik Sarker, Saikat Biswas, Md. Hasan Sharif | Detection of Wordpress Content Injection Vulnerability | null | null | 10.5121/ijci.2017.6501 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The popularity of content management software (CMS) is growing vastly to the
web developers and the business people because of its capacity for easy
accessibility, manageability and usability of the distributed website contents.
As per the statistics of Built with, 32% of the web applications are developed
with WordP... | [
{
"created": "Tue, 7 Nov 2017 13:01:18 GMT",
"version": "v1"
}
] | 2017-11-08 | [
[
"Hassan",
"Md. Maruf",
""
],
[
"Sarker",
"Kaushik",
""
],
[
"Biswas",
"Saikat",
""
],
[
"Sharif",
"Md. Hasan",
""
]
] | The popularity of content management software (CMS) is growing vastly to the web developers and the business people because of its capacity for easy accessibility, manageability and usability of the distributed website contents. As per the statistics of Built with, 32% of the web applications are developed with WordPre... |
1709.00700 | Sebastian Bre{\ss} | Sebastian Bre{\ss} and Bastian K\"ocher and Henning Funke and Tilmann
Rabl and Volker Markl | Generating Custom Code for Efficient Query Execution on Heterogeneous
Processors | 22 pages | null | null | null | cs.DB cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Processor manufacturers build increasingly specialized processors to mitigate
the effects of the power wall to deliver improved performance. Currently,
database engines are manually optimized for each processor: A costly and error
prone process.
In this paper, we propose concepts to enable the database engine to pe... | [
{
"created": "Sun, 3 Sep 2017 11:16:31 GMT",
"version": "v1"
}
] | 2017-09-05 | [
[
"Breß",
"Sebastian",
""
],
[
"Köcher",
"Bastian",
""
],
[
"Funke",
"Henning",
""
],
[
"Rabl",
"Tilmann",
""
],
[
"Markl",
"Volker",
""
]
] | Processor manufacturers build increasingly specialized processors to mitigate the effects of the power wall to deliver improved performance. Currently, database engines are manually optimized for each processor: A costly and error prone process. In this paper, we propose concepts to enable the database engine to perfor... |
1604.08552 | Sameh Sorour | Rabe Arshad, Hesham ElSawy, Sameh Sorour, Tareq Y. Al-Naffouri,
Mohamed-Slim Alouini | Handover Management in Dense Cellular Networks: A Stochastic Geometry
Approach | 7 pages, 7 figures, ICC 2016 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cellular operators are continuously densifying their networks to cope with
the ever-increasing capacity demand. Furthermore, an extreme densification
phase for cellular networks is foreseen to fulfill the ambitious fifth
generation (5G) performance requirements. Network densification improves
spectrum utilization and... | [
{
"created": "Thu, 28 Apr 2016 18:44:12 GMT",
"version": "v1"
}
] | 2016-04-29 | [
[
"Arshad",
"Rabe",
""
],
[
"ElSawy",
"Hesham",
""
],
[
"Sorour",
"Sameh",
""
],
[
"Al-Naffouri",
"Tareq Y.",
""
],
[
"Alouini",
"Mohamed-Slim",
""
]
] | Cellular operators are continuously densifying their networks to cope with the ever-increasing capacity demand. Furthermore, an extreme densification phase for cellular networks is foreseen to fulfill the ambitious fifth generation (5G) performance requirements. Network densification improves spectrum utilization and n... |
1903.08314 | Shigeru Furuichi Dr. | Shigeru Furuichi and Nicu\c{s}or Minculete | Inequalities related to some types of entropies and divergences | 21 pages | null | 10.1016/j.physa.2019.121907 | null | cs.IT math.CA math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The aim of this paper is to discuss new results concerning some kinds of
parametric extended entropies and divergences. As a result of our studies for
mathematical properties on entropy and divergence, we give new bounds for the
Tsallis quasilinear entropy and divergence by applying the Hermite-Hadamard
inequality. W... | [
{
"created": "Wed, 20 Mar 2019 02:03:40 GMT",
"version": "v1"
},
{
"created": "Sat, 13 Jul 2019 02:38:55 GMT",
"version": "v2"
}
] | 2019-07-24 | [
[
"Furuichi",
"Shigeru",
""
],
[
"Minculete",
"Nicuşor",
""
]
] | The aim of this paper is to discuss new results concerning some kinds of parametric extended entropies and divergences. As a result of our studies for mathematical properties on entropy and divergence, we give new bounds for the Tsallis quasilinear entropy and divergence by applying the Hermite-Hadamard inequality. We ... |
2012.01227 | Taehyeong Kim | Taehyeong Kim, Injune Hwang, Hyundo Lee, Hyunseo Kim, Won-Seok Choi,
Joseph J. Lim, Byoung-Tak Zhang | Message Passing Adaptive Resonance Theory for Online Active
Semi-supervised Learning | Accepted to ICML 2021 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Active learning is widely used to reduce labeling effort and training time by
repeatedly querying only the most beneficial samples from unlabeled data. In
real-world problems where data cannot be stored indefinitely due to limited
storage or privacy issues, the query selection and the model update should be
performed... | [
{
"created": "Wed, 2 Dec 2020 14:14:42 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Feb 2021 10:04:51 GMT",
"version": "v2"
},
{
"created": "Sat, 10 Jul 2021 05:58:30 GMT",
"version": "v3"
}
] | 2021-07-13 | [
[
"Kim",
"Taehyeong",
""
],
[
"Hwang",
"Injune",
""
],
[
"Lee",
"Hyundo",
""
],
[
"Kim",
"Hyunseo",
""
],
[
"Choi",
"Won-Seok",
""
],
[
"Lim",
"Joseph J.",
""
],
[
"Zhang",
"Byoung-Tak",
""
]
] | Active learning is widely used to reduce labeling effort and training time by repeatedly querying only the most beneficial samples from unlabeled data. In real-world problems where data cannot be stored indefinitely due to limited storage or privacy issues, the query selection and the model update should be performed a... |
cs/0103008 | Ke Xu | Shilong Ma, Yuefei Sui, Ke Xu | The Limits of Horn Logic Programs | 11 pages, added new results. Welcome any comments to
kexu@nlsde.buaa.edu.cn | In P. J. Stuckey (Ed.): Proc. of 18th ICLP (short paper), LNCS
2401, p. 467, Denmark, 2002. | null | null | cs.LO cs.PL | null | Given a sequence $\{\Pi_n\}$ of Horn logic programs, the limit $\Pi$ of
$\{\Pi_n\}$ is the set of the clauses such that every clause in $\Pi$ belongs
to almost every $\Pi_n$ and every clause in infinitely many $\Pi_n$'s belongs
to $\Pi$ also. The limit program $\Pi$ is still Horn but may be infinite. In
this paper, w... | [
{
"created": "Thu, 8 Mar 2001 07:42:48 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Mar 2001 03:36:48 GMT",
"version": "v2"
},
{
"created": "Thu, 7 Feb 2002 09:25:45 GMT",
"version": "v3"
}
] | 2007-05-23 | [
[
"Ma",
"Shilong",
""
],
[
"Sui",
"Yuefei",
""
],
[
"Xu",
"Ke",
""
]
] | Given a sequence $\{\Pi_n\}$ of Horn logic programs, the limit $\Pi$ of $\{\Pi_n\}$ is the set of the clauses such that every clause in $\Pi$ belongs to almost every $\Pi_n$ and every clause in infinitely many $\Pi_n$'s belongs to $\Pi$ also. The limit program $\Pi$ is still Horn but may be infinite. In this paper, we ... |
2109.00632 | Sriram Baireddy | Changye Yang, Sriram Baireddy, Enyu Cai, Melba Crawford, Edward J.
Delp | Field-Based Plot Extraction Using UAV RGB Images | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unmanned Aerial Vehicles (UAVs) have become popular for use in plant
phenotyping of field based crops, such as maize and sorghum, due to their
ability to acquire high resolution data over field trials. Field experiments,
which may comprise thousands of plants, are planted according to experimental
designs to evaluate... | [
{
"created": "Wed, 1 Sep 2021 22:04:59 GMT",
"version": "v1"
}
] | 2021-09-03 | [
[
"Yang",
"Changye",
""
],
[
"Baireddy",
"Sriram",
""
],
[
"Cai",
"Enyu",
""
],
[
"Crawford",
"Melba",
""
],
[
"Delp",
"Edward J.",
""
]
] | Unmanned Aerial Vehicles (UAVs) have become popular for use in plant phenotyping of field based crops, such as maize and sorghum, due to their ability to acquire high resolution data over field trials. Field experiments, which may comprise thousands of plants, are planted according to experimental designs to evaluate v... |
2309.16632 | Andrei Graur | Andrei Graur, Haotian Jiang, Aaron Sidford | Sparse Submodular Function Minimization | Accepted to FOCS 2023 | null | null | null | cs.DS math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we study the problem of minimizing a submodular function $f :
2^V \rightarrow \mathbb{R}$ that is guaranteed to have a $k$-sparse minimizer.
We give a deterministic algorithm that computes an additive
$\epsilon$-approximate minimizer of such $f$ in $\widetilde{O}(\mathsf{poly}(k)
\log(|f|/\epsilon))$ pa... | [
{
"created": "Thu, 28 Sep 2023 17:38:13 GMT",
"version": "v1"
},
{
"created": "Sat, 6 Jul 2024 11:06:01 GMT",
"version": "v2"
}
] | 2024-07-09 | [
[
"Graur",
"Andrei",
""
],
[
"Jiang",
"Haotian",
""
],
[
"Sidford",
"Aaron",
""
]
] | In this paper we study the problem of minimizing a submodular function $f : 2^V \rightarrow \mathbb{R}$ that is guaranteed to have a $k$-sparse minimizer. We give a deterministic algorithm that computes an additive $\epsilon$-approximate minimizer of such $f$ in $\widetilde{O}(\mathsf{poly}(k) \log(|f|/\epsilon))$ para... |
2407.12254 | Ching Chang | Ting-Yun Ou, Ching Chang, Wen-Chih Peng | COKE: Causal Discovery with Chronological Order and Expert Knowledge in
High Proportion of Missing Manufacturing Data | This paper has been accepted by the ACM International Conference on
Information and Knowledge Management (CIKM) 2024 | null | null | null | cs.LG stat.ME | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding causal relationships between machines is crucial for fault
diagnosis and optimization in manufacturing processes. Real-world datasets
frequently exhibit up to 90% missing data and high dimensionality from hundreds
of sensors. These datasets also include domain-specific expert knowledge and
chronological... | [
{
"created": "Wed, 17 Jul 2024 01:51:27 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Aug 2024 01:21:57 GMT",
"version": "v2"
}
] | 2024-08-02 | [
[
"Ou",
"Ting-Yun",
""
],
[
"Chang",
"Ching",
""
],
[
"Peng",
"Wen-Chih",
""
]
] | Understanding causal relationships between machines is crucial for fault diagnosis and optimization in manufacturing processes. Real-world datasets frequently exhibit up to 90% missing data and high dimensionality from hundreds of sensors. These datasets also include domain-specific expert knowledge and chronological o... |
1311.1163 | Zuoqiang Shi | Thomas Y. Hou, Zuoqiang Shi | Sparse Time-Frequency decomposition by dictionary learning | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a time-frequency analysis method to obtain
instantaneous frequencies and the corresponding decomposition by solving an
optimization problem. In this optimization problem, the basis to decompose the
signal is not known. Instead, it is adapted to the signal and is determined as
part of the opt... | [
{
"created": "Thu, 5 Sep 2013 12:55:41 GMT",
"version": "v1"
},
{
"created": "Sat, 11 Oct 2014 08:47:30 GMT",
"version": "v2"
}
] | 2014-10-14 | [
[
"Hou",
"Thomas Y.",
""
],
[
"Shi",
"Zuoqiang",
""
]
] | In this paper, we propose a time-frequency analysis method to obtain instantaneous frequencies and the corresponding decomposition by solving an optimization problem. In this optimization problem, the basis to decompose the signal is not known. Instead, it is adapted to the signal and is determined as part of the optim... |
1711.09728 | Nazmus Saquib | Md. Naimul Hoque, Rawshan E Fatima, Manash Kumar Mandal, Nazmus Saquib | Evaluating gender portrayal in Bangladeshi TV | Presented at NIPS 2017 Workshop on Machine Learning for the
Developing World. Corresponding author: Nazmus Saquib | null | null | null | cs.CY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computer Vision and machine learning methods were previously used to reveal
screen presence of genders in TV and movies. In this work, using head pose,
gender detection, and skin color estimation techniques, we demonstrate that the
gender disparity in TV in a South Asian country such as Bangladesh exhibits
unique cha... | [
{
"created": "Tue, 14 Nov 2017 17:54:13 GMT",
"version": "v1"
}
] | 2017-11-29 | [
[
"Hoque",
"Md. Naimul",
""
],
[
"Fatima",
"Rawshan E",
""
],
[
"Mandal",
"Manash Kumar",
""
],
[
"Saquib",
"Nazmus",
""
]
] | Computer Vision and machine learning methods were previously used to reveal screen presence of genders in TV and movies. In this work, using head pose, gender detection, and skin color estimation techniques, we demonstrate that the gender disparity in TV in a South Asian country such as Bangladesh exhibits unique chara... |
2207.07629 | Zhiruo Zhou | Zhiruo Zhou, Hongyu Fu, Suya You, C.-C. Jay Kuo | GUSOT: Green and Unsupervised Single Object Tracking for Long Video
Sequences | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Supervised and unsupervised deep trackers that rely on deep learning
technologies are popular in recent years. Yet, they demand high computational
complexity and a high memory cost. A green unsupervised single-object tracker,
called GUSOT, that aims at object tracking for long videos under a
resource-constrained envi... | [
{
"created": "Fri, 15 Jul 2022 17:42:49 GMT",
"version": "v1"
}
] | 2022-07-18 | [
[
"Zhou",
"Zhiruo",
""
],
[
"Fu",
"Hongyu",
""
],
[
"You",
"Suya",
""
],
[
"Kuo",
"C. -C. Jay",
""
]
] | Supervised and unsupervised deep trackers that rely on deep learning technologies are popular in recent years. Yet, they demand high computational complexity and a high memory cost. A green unsupervised single-object tracker, called GUSOT, that aims at object tracking for long videos under a resource-constrained enviro... |
2404.14739 | Utkarsh Gupta | Utkarsh Gupta, Emmanouil Nikolakakis, Moritz Zaiss, Razvan Marinescu | BMapEst: Estimation of Brain Tissue Probability Maps using a
Differentiable MRI Simulator | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reconstructing digital brain phantoms in the form of voxel-based,
multi-channeled tissue probability maps for individual subjects is essential
for capturing brain anatomical variability, understanding neurological
diseases, as well as for testing image processing methods. We demonstrate the
first framework that estim... | [
{
"created": "Tue, 23 Apr 2024 04:45:23 GMT",
"version": "v1"
},
{
"created": "Sun, 30 Jun 2024 04:00:09 GMT",
"version": "v2"
}
] | 2024-07-02 | [
[
"Gupta",
"Utkarsh",
""
],
[
"Nikolakakis",
"Emmanouil",
""
],
[
"Zaiss",
"Moritz",
""
],
[
"Marinescu",
"Razvan",
""
]
] | Reconstructing digital brain phantoms in the form of voxel-based, multi-channeled tissue probability maps for individual subjects is essential for capturing brain anatomical variability, understanding neurological diseases, as well as for testing image processing methods. We demonstrate the first framework that estimat... |
2011.10659 | Mathilde Fekom | Mathilde Fekom and Argyris Kalogeratos | Efficient stream-based Max-Min diversification with minimal failure rate | null | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | The stream-based Max-Min diversification problem concerns the task of
selecting a limited number of diverse instances from a data stream. The nature
of the problem demands immediate and irrevocable decisions. The set-wise
diversity to be maximized is the minimum distance among any pair of the
selected instances. Stan... | [
{
"created": "Tue, 17 Nov 2020 14:20:16 GMT",
"version": "v1"
}
] | 2020-11-24 | [
[
"Fekom",
"Mathilde",
""
],
[
"Kalogeratos",
"Argyris",
""
]
] | The stream-based Max-Min diversification problem concerns the task of selecting a limited number of diverse instances from a data stream. The nature of the problem demands immediate and irrevocable decisions. The set-wise diversity to be maximized is the minimum distance among any pair of the selected instances. Standa... |
2209.10477 | Yan Liu | Yan Liu, Maria Laricheva, Chiyu Zhang, Patrick Boutet, Guanyu Chen,
Terence Tracey, Giuseppe Carenini, Richard Young | Transition to Adulthood for Young People with Intellectual or
Developmental Disabilities: Emotion Detection and Topic Modeling | Conference proceedings of 2022 SBP-BRiMS | In: Thomson, R., Dancy, C., Pyke, A. (eds) SBP-BRiMS 2022. Lecture
Notes in Computer Science, vol 13558. Springer, Cham (2022) | 10.1007/978-3-031-17114-7_21 | null | cs.CL stat.AP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transition to Adulthood is an essential life stage for many families. The
prior research has shown that young people with intellectual or development
disabil-ities (IDD) have more challenges than their peers. This study is to
explore how to use natural language processing (NLP) methods, especially
unsupervised machin... | [
{
"created": "Wed, 21 Sep 2022 16:23:45 GMT",
"version": "v1"
}
] | 2022-09-22 | [
[
"Liu",
"Yan",
""
],
[
"Laricheva",
"Maria",
""
],
[
"Zhang",
"Chiyu",
""
],
[
"Boutet",
"Patrick",
""
],
[
"Chen",
"Guanyu",
""
],
[
"Tracey",
"Terence",
""
],
[
"Carenini",
"Giuseppe",
""
],
[
"You... | Transition to Adulthood is an essential life stage for many families. The prior research has shown that young people with intellectual or development disabil-ities (IDD) have more challenges than their peers. This study is to explore how to use natural language processing (NLP) methods, especially unsupervised machine ... |
2303.05740 | Furan Xie | Bing Liu, Furan Xie and Li Chai | A Novel Bilateral Energy Trading Mechanism for Electricity Markets with
Numerous Prosumers | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the rapid development of distributed energy resources, increasing number
of residential and commercial users have been switched from pure electricity
consumers to prosumers that can both consume and produce energy. To properly
manage these emerging prosumers, a peer-to-peer electricity market has been
explored a... | [
{
"created": "Fri, 10 Mar 2023 06:49:53 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Sep 2023 12:39:52 GMT",
"version": "v2"
},
{
"created": "Thu, 14 Sep 2023 03:36:37 GMT",
"version": "v3"
}
] | 2023-09-15 | [
[
"Liu",
"Bing",
""
],
[
"Xie",
"Furan",
""
],
[
"Chai",
"Li",
""
]
] | With the rapid development of distributed energy resources, increasing number of residential and commercial users have been switched from pure electricity consumers to prosumers that can both consume and produce energy. To properly manage these emerging prosumers, a peer-to-peer electricity market has been explored and... |
2002.03586 | Thomas Sturm | Hamid Rahkooy and Thomas Sturm | First-Order Tests for Toricity | null | Proc. CASC 2020, LNCS 12291, pp.510-527, Springer 2020 | 10.1007/978-3-030-60026-6_30 | null | cs.SC q-bio.MN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motivated by problems arising with the symbolic analysis of steady state
ideals in Chemical Reaction Network Theory, we consider the problem of testing
whether the points in a complex or real variety with non-zero coordinates form
a coset of a multiplicative group. That property corresponds to Shifted
Toricity, a rec... | [
{
"created": "Mon, 10 Feb 2020 07:56:07 GMT",
"version": "v1"
}
] | 2020-10-22 | [
[
"Rahkooy",
"Hamid",
""
],
[
"Sturm",
"Thomas",
""
]
] | Motivated by problems arising with the symbolic analysis of steady state ideals in Chemical Reaction Network Theory, we consider the problem of testing whether the points in a complex or real variety with non-zero coordinates form a coset of a multiplicative group. That property corresponds to Shifted Toricity, a recen... |
2006.01780 | Rahat Yeasin Emon | Rahat Yeasin Emon | A Novel Nudity Detection Algorithm for Web and Mobile Application
Development | 5 pages | null | null | null | cs.CV cs.MM | http://creativecommons.org/licenses/by/4.0/ | In our current web and mobile application development runtime nude image
content detection is very important. This paper presents a runtime nudity
detection method for web and mobile application development. We use two
parameters to detect the nude content of an image. One is the number of skin
pixels another is face... | [
{
"created": "Tue, 2 Jun 2020 17:00:47 GMT",
"version": "v1"
},
{
"created": "Sun, 28 Jun 2020 15:29:09 GMT",
"version": "v2"
}
] | 2020-06-30 | [
[
"Emon",
"Rahat Yeasin",
""
]
] | In our current web and mobile application development runtime nude image content detection is very important. This paper presents a runtime nudity detection method for web and mobile application development. We use two parameters to detect the nude content of an image. One is the number of skin pixels another is face r... |
2008.08675 | Anders Johan Andreassen | Anders Andreassen, Ethan Dyer | Asymptotics of Wide Convolutional Neural Networks | 23 pages, 12 figures | null | null | null | cs.LG hep-th stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Wide neural networks have proven to be a rich class of architectures for both
theory and practice. Motivated by the observation that finite width
convolutional networks appear to outperform infinite width networks, we study
scaling laws for wide CNNs and networks with skip connections. Following the
approach of (Dyer... | [
{
"created": "Wed, 19 Aug 2020 21:22:19 GMT",
"version": "v1"
}
] | 2020-08-21 | [
[
"Andreassen",
"Anders",
""
],
[
"Dyer",
"Ethan",
""
]
] | Wide neural networks have proven to be a rich class of architectures for both theory and practice. Motivated by the observation that finite width convolutional networks appear to outperform infinite width networks, we study scaling laws for wide CNNs and networks with skip connections. Following the approach of (Dyer &... |
1702.03186 | Matthieu Guillot | Matthieu Guillot and Gautier Stauffer | The Stochastic Shortest Path Problem : A polyhedral combinatorics
perspective | null | null | null | null | cs.DM math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we give a new framework for the stochastic shortest path
problem in finite state and action spaces. Our framework generalizes both the
frameworks proposed by Bertsekas and Tsitsikli and by Bertsekas and Yu. We
prove that the problem is well-defined and (weakly) polynomial when (i) there
is a way to rea... | [
{
"created": "Fri, 10 Feb 2017 14:36:32 GMT",
"version": "v1"
}
] | 2017-02-13 | [
[
"Guillot",
"Matthieu",
""
],
[
"Stauffer",
"Gautier",
""
]
] | In this paper, we give a new framework for the stochastic shortest path problem in finite state and action spaces. Our framework generalizes both the frameworks proposed by Bertsekas and Tsitsikli and by Bertsekas and Yu. We prove that the problem is well-defined and (weakly) polynomial when (i) there is a way to reach... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.