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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2102.11646 | Niv Nayman | Niv Nayman, Yonathan Aflalo, Asaf Noy, Lihi Zelnik-Manor | HardCoRe-NAS: Hard Constrained diffeRentiable Neural Architecture Search | Niv Nayman and Yonathan Aflalo contributed equally. An implementation
of HardCoRe-NAS is available at: https://github.com/Alibaba-MIIL/HardCoReNAS | null | null | null | cs.LG cs.AI cs.CV math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Realistic use of neural networks often requires adhering to multiple
constraints on latency, energy and memory among others. A popular approach to
find fitting networks is through constrained Neural Architecture Search (NAS),
however, previous methods enforce the constraint only softly. Therefore, the
resulting netwo... | [
{
"created": "Tue, 23 Feb 2021 11:56:30 GMT",
"version": "v1"
}
] | 2021-02-24 | [
[
"Nayman",
"Niv",
""
],
[
"Aflalo",
"Yonathan",
""
],
[
"Noy",
"Asaf",
""
],
[
"Zelnik-Manor",
"Lihi",
""
]
] | Realistic use of neural networks often requires adhering to multiple constraints on latency, energy and memory among others. A popular approach to find fitting networks is through constrained Neural Architecture Search (NAS), however, previous methods enforce the constraint only softly. Therefore, the resulting network... |
2310.03579 | Trang Nguyen | Trang Nguyen, Alexander Tong, Kanika Madan, Yoshua Bengio and Dianbo
Liu | Causal Inference in Gene Regulatory Networks with GFlowNet: Towards
Scalability in Large Systems | null | null | null | null | cs.AI q-bio.MN | http://creativecommons.org/licenses/by/4.0/ | Understanding causal relationships within Gene Regulatory Networks (GRNs) is
essential for unraveling the gene interactions in cellular processes. However,
causal discovery in GRNs is a challenging problem for multiple reasons
including the existence of cyclic feedback loops and uncertainty that yields
diverse possib... | [
{
"created": "Thu, 5 Oct 2023 14:59:19 GMT",
"version": "v1"
}
] | 2023-10-06 | [
[
"Nguyen",
"Trang",
""
],
[
"Tong",
"Alexander",
""
],
[
"Madan",
"Kanika",
""
],
[
"Bengio",
"Yoshua",
""
],
[
"Liu",
"Dianbo",
""
]
] | Understanding causal relationships within Gene Regulatory Networks (GRNs) is essential for unraveling the gene interactions in cellular processes. However, causal discovery in GRNs is a challenging problem for multiple reasons including the existence of cyclic feedback loops and uncertainty that yields diverse possible... |
2309.16133 | Kadir Yilmaz | Kadir Yilmaz and Jonas Schult and Alexey Nekrasov and Bastian Leibe | Mask4Former: Mask Transformer for 4D Panoptic Segmentation | Renamed from MASK4D to Mask4Former. ICRA 2024. Project page:
https://vision.rwth-aachen.de/Mask4Former | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Accurately perceiving and tracking instances over time is essential for the
decision-making processes of autonomous agents interacting safely in dynamic
environments. With this intention, we propose Mask4Former for the challenging
task of 4D panoptic segmentation of LiDAR point clouds. Mask4Former is the
first transf... | [
{
"created": "Thu, 28 Sep 2023 03:30:50 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Apr 2024 21:19:33 GMT",
"version": "v2"
}
] | 2024-04-12 | [
[
"Yilmaz",
"Kadir",
""
],
[
"Schult",
"Jonas",
""
],
[
"Nekrasov",
"Alexey",
""
],
[
"Leibe",
"Bastian",
""
]
] | Accurately perceiving and tracking instances over time is essential for the decision-making processes of autonomous agents interacting safely in dynamic environments. With this intention, we propose Mask4Former for the challenging task of 4D panoptic segmentation of LiDAR point clouds. Mask4Former is the first transfor... |
2203.07802 | Gabriele Santin | Gabriele Santin and Inna Skarbovsky and Fabiana Fournier and Bruno
Lepri | A Framework for Verifiable and Auditable Federated Anomaly Detection | null | null | 10.1109/ACCESS.2022.3196391 | null | cs.LG cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated Leaning is an emerging approach to manage cooperation between a
group of agents for the solution of Machine Learning tasks, with the goal of
improving each agent's performance without disclosing any data. In this paper
we present a novel algorithmic architecture that tackle this problem in the
particular ca... | [
{
"created": "Tue, 15 Mar 2022 11:34:02 GMT",
"version": "v1"
}
] | 2022-08-09 | [
[
"Santin",
"Gabriele",
""
],
[
"Skarbovsky",
"Inna",
""
],
[
"Fournier",
"Fabiana",
""
],
[
"Lepri",
"Bruno",
""
]
] | Federated Leaning is an emerging approach to manage cooperation between a group of agents for the solution of Machine Learning tasks, with the goal of improving each agent's performance without disclosing any data. In this paper we present a novel algorithmic architecture that tackle this problem in the particular case... |
1905.05365 | Zhaoxia Yin | Yujie Jia, Zhaoxia Yin, Xinpeng Zhang, Yonglong Luo | Reversible data hiding based on reducing invalid shifting of pixels in
histogram shifting | 11 pages, 11 figures, 1 table | Signal Processing, 2019, 163: 238-246 | 10.1016/j.sigpro.2019.05.020 | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, reversible data hiding (RDH), a new research hotspot in the
field of information security, has been paid more and more attention by
researchers. Most of the existing RDH schemes do not fully take it into account
that natural image's texture has influence on embedding distortion. The image
distortion ... | [
{
"created": "Tue, 14 May 2019 02:51:32 GMT",
"version": "v1"
}
] | 2021-10-19 | [
[
"Jia",
"Yujie",
""
],
[
"Yin",
"Zhaoxia",
""
],
[
"Zhang",
"Xinpeng",
""
],
[
"Luo",
"Yonglong",
""
]
] | In recent years, reversible data hiding (RDH), a new research hotspot in the field of information security, has been paid more and more attention by researchers. Most of the existing RDH schemes do not fully take it into account that natural image's texture has influence on embedding distortion. The image distortion ca... |
2307.07043 | Joe Loughry | Joe Loughry and David A. Umphress | Information Leakage from Optical Emanations | 26 pages, 11 figures | ACM transactions on Information and System Security 5 (2002)
262--289 | 10.1145/545186.545189 | null | cs.CR eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A previously unknown form of compromising emanations has been discovered. LED
status indicators on data communication equipment, under certain conditions,
are shown to carry a modulated optical signal that is significantly correlated
with information being processed by the device. Physical access is not
required; the... | [
{
"created": "Thu, 13 Jul 2023 20:00:34 GMT",
"version": "v1"
}
] | 2023-07-17 | [
[
"Loughry",
"Joe",
""
],
[
"Umphress",
"David A.",
""
]
] | A previously unknown form of compromising emanations has been discovered. LED status indicators on data communication equipment, under certain conditions, are shown to carry a modulated optical signal that is significantly correlated with information being processed by the device. Physical access is not required; the a... |
1104.4260 | Qiang Li | Qiang Li and Wing-Kin Ma | A Robust Artificial Noise Aided Transmit Design for Miso Secrecy | Accepted for publication in ICASSP 2011, May 2011 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers an artificial noise (AN) aided secrecy rate maximization
(SRM) problem for a multi-input single-output (MISO) channel overheard by
multiple single-antenna eavesdroppers. We assume that the transmitter has
perfect knowledge about the channel to the desired user but imperfect knowledge
about the ch... | [
{
"created": "Thu, 21 Apr 2011 13:33:03 GMT",
"version": "v1"
}
] | 2011-04-22 | [
[
"Li",
"Qiang",
""
],
[
"Ma",
"Wing-Kin",
""
]
] | This paper considers an artificial noise (AN) aided secrecy rate maximization (SRM) problem for a multi-input single-output (MISO) channel overheard by multiple single-antenna eavesdroppers. We assume that the transmitter has perfect knowledge about the channel to the desired user but imperfect knowledge about the chan... |
2112.09099 | Sriram Ganapathi Subramanian | Sriram Ganapathi Subramanian, Matthew E. Taylor, Mark Crowley, Pascal
Poupart | Decentralized Mean Field Games | This work is to appear in AAAI-22. Recent version has minor
formatting changes and some typos corrected | null | null | null | cs.MA | http://creativecommons.org/licenses/by/4.0/ | Multiagent reinforcement learning algorithms have not been widely adopted in
large scale environments with many agents as they often scale poorly with the
number of agents. Using mean field theory to aggregate agents has been proposed
as a solution to this problem. However, almost all previous methods in this
area ma... | [
{
"created": "Thu, 16 Dec 2021 18:30:48 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Jan 2022 05:58:55 GMT",
"version": "v2"
},
{
"created": "Thu, 20 Jan 2022 14:48:20 GMT",
"version": "v3"
},
{
"created": "Thu, 3 Mar 2022 15:39:30 GMT",
"version": "v4"
},
{
"cre... | 2022-04-14 | [
[
"Subramanian",
"Sriram Ganapathi",
""
],
[
"Taylor",
"Matthew E.",
""
],
[
"Crowley",
"Mark",
""
],
[
"Poupart",
"Pascal",
""
]
] | Multiagent reinforcement learning algorithms have not been widely adopted in large scale environments with many agents as they often scale poorly with the number of agents. Using mean field theory to aggregate agents has been proposed as a solution to this problem. However, almost all previous methods in this area make... |
1409.8352 | Chih-Chung Lin | Chi-Heng Lin and De-Nian Yang and Chih-Chung Lin and Wanjiun Liao | Multicast Group Management for Multi-View 3D Videos in Wireless Networks | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the emergence of 3D mobile devices available in the markets, mobile 3D
video services become increasingly important for video service providers, such
as Youtube and Netflix, while multi-view 3D videos are potential to bring out
varied innovative applications. However, enabling multi-view 3D video services
may ov... | [
{
"created": "Mon, 29 Sep 2014 23:38:31 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Oct 2014 07:31:08 GMT",
"version": "v2"
},
{
"created": "Fri, 24 Oct 2014 04:51:06 GMT",
"version": "v3"
},
{
"created": "Wed, 3 Dec 2014 03:34:03 GMT",
"version": "v4"
}
] | 2014-12-04 | [
[
"Lin",
"Chi-Heng",
""
],
[
"Yang",
"De-Nian",
""
],
[
"Lin",
"Chih-Chung",
""
],
[
"Liao",
"Wanjiun",
""
]
] | With the emergence of 3D mobile devices available in the markets, mobile 3D video services become increasingly important for video service providers, such as Youtube and Netflix, while multi-view 3D videos are potential to bring out varied innovative applications. However, enabling multi-view 3D video services may over... |
2303.05327 | Idan Eldar | Idan Eldar, Nofar Carmeli, and Benny Kimelfeld | Direct Access for Answers to Conjunctive Queries with Aggregation | null | null | null | null | cs.DB cs.DS | http://creativecommons.org/licenses/by/4.0/ | We study the fine-grained complexity of conjunctive queries with grouping and
aggregation. For some common aggregate functions (e.g., min, max, count, sum),
such a query can be phrased as an ordinary conjunctive query over a database
annotated with a suitable commutative semiring. Specifically, we investigate
the abi... | [
{
"created": "Thu, 9 Mar 2023 15:18:40 GMT",
"version": "v1"
}
] | 2023-03-10 | [
[
"Eldar",
"Idan",
""
],
[
"Carmeli",
"Nofar",
""
],
[
"Kimelfeld",
"Benny",
""
]
] | We study the fine-grained complexity of conjunctive queries with grouping and aggregation. For some common aggregate functions (e.g., min, max, count, sum), such a query can be phrased as an ordinary conjunctive query over a database annotated with a suitable commutative semiring. Specifically, we investigate the abili... |
2205.06857 | Brian Lavallee | Andrew Fraser, Brian Lavallee, Blair D. Sullivan | Parameterized Complexity of Gerrymandering | null | null | null | null | cs.DS cs.GT | http://creativecommons.org/licenses/by/4.0/ | In a representative democracy, the electoral process involves partitioning
geographical space into districts which each elect a single representative.
These representatives craft and vote on legislation, incentivizing political
parties to win as many districts as possible (ideally a plurality).
Gerrymandering is the ... | [
{
"created": "Fri, 13 May 2022 19:04:45 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Dec 2023 14:39:58 GMT",
"version": "v2"
}
] | 2023-12-08 | [
[
"Fraser",
"Andrew",
""
],
[
"Lavallee",
"Brian",
""
],
[
"Sullivan",
"Blair D.",
""
]
] | In a representative democracy, the electoral process involves partitioning geographical space into districts which each elect a single representative. These representatives craft and vote on legislation, incentivizing political parties to win as many districts as possible (ideally a plurality). Gerrymandering is the pr... |
1506.00684 | Viveck Cadambe | Zhiying Wang and Viveck R. Cadambe | Multi-Version Coding - An Information Theoretic Perspective of
Consistent Distributed Storage | 30 Pages. Extended version of conference publications in ISIT 2014
and Allerton 2014. Revision adds a section, Section VII, and corrects minor
typographical errors in the rest of the document | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In applications of distributed storage systems to distributed computing and
implementation of key- value stores, the following property, usually referred
to as consistency in computer science and engineering, is an important
requirement: as the data stored changes, the latest version of the data must be
accessible to... | [
{
"created": "Mon, 1 Jun 2015 21:39:52 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Oct 2015 18:46:58 GMT",
"version": "v2"
}
] | 2015-10-20 | [
[
"Wang",
"Zhiying",
""
],
[
"Cadambe",
"Viveck R.",
""
]
] | In applications of distributed storage systems to distributed computing and implementation of key- value stores, the following property, usually referred to as consistency in computer science and engineering, is an important requirement: as the data stored changes, the latest version of the data must be accessible to a... |
1903.11246 | Hyo-Sung Ahn | Hyo-Sung Ahn, Kevin L. Moore, Seong-Ho Kwon, Quoc Van Tran,
Byeong-Yeon Kim, and Kwang-Kyo Oh | Topological Controllability of Undirected Networks of
Diffusively-Coupled Agents | null | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents conditions for establishing topological controllability
in undirected networks of diffusively coupled agents. Specifically,
controllability is considered based on the signs of the edges (negative,
positive or zero). Our approach differs from well-known structural
controllability conditions for lin... | [
{
"created": "Wed, 27 Mar 2019 04:38:31 GMT",
"version": "v1"
}
] | 2019-03-28 | [
[
"Ahn",
"Hyo-Sung",
""
],
[
"Moore",
"Kevin L.",
""
],
[
"Kwon",
"Seong-Ho",
""
],
[
"Van Tran",
"Quoc",
""
],
[
"Kim",
"Byeong-Yeon",
""
],
[
"Oh",
"Kwang-Kyo",
""
]
] | This paper presents conditions for establishing topological controllability in undirected networks of diffusively coupled agents. Specifically, controllability is considered based on the signs of the edges (negative, positive or zero). Our approach differs from well-known structural controllability conditions for linea... |
2305.18624 | Mingchen Li | Mingchen Li, Yang Ye, Jeremy Yeung, Huixue Zhou, Huaiyuan Chu, Rui
Zhang | W-procer: Weighted Prototypical Contrastive Learning for Medical
Few-Shot Named Entity Recognition | Under Review | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Contrastive learning has become a popular solution for few-shot Name Entity
Recognization (NER). The conventional configuration strives to reduce the
distance between tokens with the same labels and increase the distance between
tokens with different labels. The effect of this setup may, however, in the
medical domai... | [
{
"created": "Mon, 29 May 2023 21:17:52 GMT",
"version": "v1"
},
{
"created": "Sat, 10 Jun 2023 01:06:19 GMT",
"version": "v2"
},
{
"created": "Fri, 30 Jun 2023 19:29:02 GMT",
"version": "v3"
},
{
"created": "Sun, 16 Jul 2023 13:50:35 GMT",
"version": "v4"
},
{
"c... | 2023-08-02 | [
[
"Li",
"Mingchen",
""
],
[
"Ye",
"Yang",
""
],
[
"Yeung",
"Jeremy",
""
],
[
"Zhou",
"Huixue",
""
],
[
"Chu",
"Huaiyuan",
""
],
[
"Zhang",
"Rui",
""
]
] | Contrastive learning has become a popular solution for few-shot Name Entity Recognization (NER). The conventional configuration strives to reduce the distance between tokens with the same labels and increase the distance between tokens with different labels. The effect of this setup may, however, in the medical domain,... |
2402.08742 | Yassine Himeur | Fodil Fadli, Yassine Himeur, Mariam Elnour and Abbes Amira | Unveiling Hidden Energy Anomalies: Harnessing Deep Learning to Optimize
Energy Management in Sports Facilities | 18 pages, 5 figures and 2 tables | null | null | null | cs.CY cs.LG | http://creativecommons.org/licenses/by/4.0/ | Anomaly detection in sport facilities has gained significant attention due to
its potential to promote energy saving and optimizing operational efficiency.
In this research article, we investigate the role of machine learning,
particularly deep learning, in anomaly detection for sport facilities. We
explore the chall... | [
{
"created": "Tue, 13 Feb 2024 19:27:06 GMT",
"version": "v1"
}
] | 2024-02-15 | [
[
"Fadli",
"Fodil",
""
],
[
"Himeur",
"Yassine",
""
],
[
"Elnour",
"Mariam",
""
],
[
"Amira",
"Abbes",
""
]
] | Anomaly detection in sport facilities has gained significant attention due to its potential to promote energy saving and optimizing operational efficiency. In this research article, we investigate the role of machine learning, particularly deep learning, in anomaly detection for sport facilities. We explore the challen... |
2406.18927 | Zhaokang Liao | Zhaokang Liao, Hao Feng, Shaokai Liu, Wengang Zhou, Houqiang Li | RoFIR: Robust Fisheye Image Rectification Framework Impervious to
Optical Center Deviation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fisheye images are categorized fisheye into central and deviated based on the
optical center position. Existing rectification methods are limited to central
fisheye images, while this paper proposes a novel method that extends to
deviated fisheye image rectification. The challenge lies in the variant global
distortio... | [
{
"created": "Thu, 27 Jun 2024 06:38:56 GMT",
"version": "v1"
}
] | 2024-06-28 | [
[
"Liao",
"Zhaokang",
""
],
[
"Feng",
"Hao",
""
],
[
"Liu",
"Shaokai",
""
],
[
"Zhou",
"Wengang",
""
],
[
"Li",
"Houqiang",
""
]
] | Fisheye images are categorized fisheye into central and deviated based on the optical center position. Existing rectification methods are limited to central fisheye images, while this paper proposes a novel method that extends to deviated fisheye image rectification. The challenge lies in the variant global distortion ... |
2006.07630 | Emilien Dupont | Emilien Dupont, Miguel Angel Bautista, Alex Colburn, Aditya Sankar,
Carlos Guestrin, Josh Susskind, Qi Shan | Equivariant Neural Rendering | Add link to code | null | null | null | cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a framework for learning neural scene representations directly
from images, without 3D supervision. Our key insight is that 3D structure can
be imposed by ensuring that the learned representation transforms like a real
3D scene. Specifically, we introduce a loss which enforces equivariance of the
scene rep... | [
{
"created": "Sat, 13 Jun 2020 12:25:07 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Dec 2020 11:28:31 GMT",
"version": "v2"
}
] | 2020-12-22 | [
[
"Dupont",
"Emilien",
""
],
[
"Bautista",
"Miguel Angel",
""
],
[
"Colburn",
"Alex",
""
],
[
"Sankar",
"Aditya",
""
],
[
"Guestrin",
"Carlos",
""
],
[
"Susskind",
"Josh",
""
],
[
"Shan",
"Qi",
""
]
] | We propose a framework for learning neural scene representations directly from images, without 3D supervision. Our key insight is that 3D structure can be imposed by ensuring that the learned representation transforms like a real 3D scene. Specifically, we introduce a loss which enforces equivariance of the scene repre... |
2101.10483 | EPTCS | Toby St Clere Smithe (University of Oxford) | Cyber Kittens, or Some First Steps Towards Categorical Cybernetics | In Proceedings ACT 2020, arXiv:2101.07888. Includes a summary of
arXiv:2006.01631 | EPTCS 333, 2021, pp. 108-124 | 10.4204/EPTCS.333.8 | null | cs.NE cs.GT math.CT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We define a categorical notion of cybernetic system as a dynamical
realisation of a generalized open game, along with a coherence condition. We
show that this notion captures a wide class of cybernetic systems in
computational neuroscience and statistical machine learning, exposes their
compositional structure, and g... | [
{
"created": "Tue, 26 Jan 2021 00:04:00 GMT",
"version": "v1"
}
] | 2021-01-27 | [
[
"Smithe",
"Toby St Clere",
"",
"University of Oxford"
]
] | We define a categorical notion of cybernetic system as a dynamical realisation of a generalized open game, along with a coherence condition. We show that this notion captures a wide class of cybernetic systems in computational neuroscience and statistical machine learning, exposes their compositional structure, and giv... |
2305.15272 | Jingfeng Yao | Jingfeng Yao, Xinggang Wang, Shusheng Yang, Baoyuan Wang | ViTMatte: Boosting Image Matting with Pretrained Plain Vision
Transformers | codes: https://github.com/hustvl/ViTMatte | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Recently, plain vision Transformers (ViTs) have shown impressive performance
on various computer vision tasks, thanks to their strong modeling capacity and
large-scale pretraining. However, they have not yet conquered the problem of
image matting. We hypothesize that image matting could also be boosted by ViTs
and pr... | [
{
"created": "Wed, 24 May 2023 15:59:35 GMT",
"version": "v1"
},
{
"created": "Wed, 31 May 2023 09:12:06 GMT",
"version": "v2"
}
] | 2023-06-01 | [
[
"Yao",
"Jingfeng",
""
],
[
"Wang",
"Xinggang",
""
],
[
"Yang",
"Shusheng",
""
],
[
"Wang",
"Baoyuan",
""
]
] | Recently, plain vision Transformers (ViTs) have shown impressive performance on various computer vision tasks, thanks to their strong modeling capacity and large-scale pretraining. However, they have not yet conquered the problem of image matting. We hypothesize that image matting could also be boosted by ViTs and pres... |
2311.14324 | Shengyin Sun | Shengyin Sun, Yuxiang Ren, Chen Ma, Xuecang Zhang | Large Language Models as Topological Structure Enhancers for
Text-Attributed Graphs | 10 pages | null | null | null | cs.AI cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The latest advancements in large language models (LLMs) have revolutionized
the field of natural language processing (NLP). Inspired by the success of LLMs
in NLP tasks, some recent work has begun investigating the potential of
applying LLMs in graph learning tasks. However, most of the existing work
focuses on utili... | [
{
"created": "Fri, 24 Nov 2023 07:53:48 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Jul 2024 13:34:14 GMT",
"version": "v2"
}
] | 2024-07-25 | [
[
"Sun",
"Shengyin",
""
],
[
"Ren",
"Yuxiang",
""
],
[
"Ma",
"Chen",
""
],
[
"Zhang",
"Xuecang",
""
]
] | The latest advancements in large language models (LLMs) have revolutionized the field of natural language processing (NLP). Inspired by the success of LLMs in NLP tasks, some recent work has begun investigating the potential of applying LLMs in graph learning tasks. However, most of the existing work focuses on utilizi... |
1209.2635 | Luis Sanabria-Russo | Luis Sanabria-Russo | TCP/IP communication between two USRP-E110 | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This short report intends to provide an overview of the procedure and
statistics of establishing a TCP/IP link between two USRP-E110. The testings
are performed using an example GNURadio code and the networking protocol stack
provided by the Linux operating system embedded in the USRP-E110.
| [
{
"created": "Wed, 12 Sep 2012 15:05:57 GMT",
"version": "v1"
}
] | 2012-09-13 | [
[
"Sanabria-Russo",
"Luis",
""
]
] | This short report intends to provide an overview of the procedure and statistics of establishing a TCP/IP link between two USRP-E110. The testings are performed using an example GNURadio code and the networking protocol stack provided by the Linux operating system embedded in the USRP-E110. |
2307.11788 | Jonas Stein | Jonas Stein, Ivo Christ, Nicolas Kraus, Maximilian Balthasar Mansky,
Robert M\"uller, Claudia Linnhoff-Popien | Applying QNLP to sentiment analysis in finance | null | QCE'23 Companion: Proceedings of the Companion IEEE International
Conference on Quantum Computing and Engineering, 2023, 20-25 | 10.1109/QCE57702.2023.10178 | null | cs.CL cs.AI quant-ph | http://creativecommons.org/licenses/by/4.0/ | As an application domain where the slightest qualitative improvements can
yield immense value, finance is a promising candidate for early quantum
advantage. Focusing on the rapidly advancing field of Quantum Natural Language
Processing (QNLP), we explore the practical applicability of the two central
approaches DisCo... | [
{
"created": "Thu, 20 Jul 2023 18:30:35 GMT",
"version": "v1"
},
{
"created": "Mon, 31 Jul 2023 05:50:30 GMT",
"version": "v2"
},
{
"created": "Mon, 11 Sep 2023 07:21:10 GMT",
"version": "v3"
}
] | 2023-09-19 | [
[
"Stein",
"Jonas",
""
],
[
"Christ",
"Ivo",
""
],
[
"Kraus",
"Nicolas",
""
],
[
"Mansky",
"Maximilian Balthasar",
""
],
[
"Müller",
"Robert",
""
],
[
"Linnhoff-Popien",
"Claudia",
""
]
] | As an application domain where the slightest qualitative improvements can yield immense value, finance is a promising candidate for early quantum advantage. Focusing on the rapidly advancing field of Quantum Natural Language Processing (QNLP), we explore the practical applicability of the two central approaches DisCoCa... |
1112.0467 | Erwin Riegler | Erwin Riegler, Gunvor Elisabeth Kirkelund, Carles Navarro Manch\'on,
Mihai-Alin Badiu, Bernard Henry Fleury | Merging Belief Propagation and the Mean Field Approximation: A Free
Energy Approach | null | null | null | null | cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a joint message passing approach that combines belief propagation
and the mean field approximation. Our analysis is based on the region-based
free energy approximation method proposed by Yedidia et al. We show that the
message passing fixed-point equations obtained with this combination correspond
to stati... | [
{
"created": "Fri, 2 Dec 2011 14:21:57 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Jan 2012 10:57:20 GMT",
"version": "v2"
},
{
"created": "Thu, 28 Jun 2012 11:50:49 GMT",
"version": "v3"
}
] | 2012-06-29 | [
[
"Riegler",
"Erwin",
""
],
[
"Kirkelund",
"Gunvor Elisabeth",
""
],
[
"Manchón",
"Carles Navarro",
""
],
[
"Badiu",
"Mihai-Alin",
""
],
[
"Fleury",
"Bernard Henry",
""
]
] | We present a joint message passing approach that combines belief propagation and the mean field approximation. Our analysis is based on the region-based free energy approximation method proposed by Yedidia et al. We show that the message passing fixed-point equations obtained with this combination correspond to station... |
2105.05003 | Lizhe Liu | Lizhe Liu, Xiaohao Chen, Siyu Zhu, Ping Tan | CondLaneNet: a Top-to-down Lane Detection Framework Based on Conditional
Convolution | null | Proceedings of the IEEE/CVF International Conference on Computer
Vision (ICCV), 2021, pp. 3773-3782 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern deep-learning-based lane detection methods are successful in most
scenarios but struggling for lane lines with complex topologies. In this work,
we propose CondLaneNet, a novel top-to-down lane detection framework that
detects the lane instances first and then dynamically predicts the line shape
for each insta... | [
{
"created": "Tue, 11 May 2021 13:10:34 GMT",
"version": "v1"
},
{
"created": "Thu, 10 Jun 2021 11:44:17 GMT",
"version": "v2"
},
{
"created": "Fri, 10 Feb 2023 08:38:34 GMT",
"version": "v3"
}
] | 2023-02-13 | [
[
"Liu",
"Lizhe",
""
],
[
"Chen",
"Xiaohao",
""
],
[
"Zhu",
"Siyu",
""
],
[
"Tan",
"Ping",
""
]
] | Modern deep-learning-based lane detection methods are successful in most scenarios but struggling for lane lines with complex topologies. In this work, we propose CondLaneNet, a novel top-to-down lane detection framework that detects the lane instances first and then dynamically predicts the line shape for each instanc... |
2406.13225 | Xiaoxiong Zhang | Xiaoxiong Zhang, Zhiwei Zeng, Xin Zhou, Dusit Niyato, Zhiqi Shen | Communication-Efficient Federated Knowledge Graph Embedding with
Entity-Wise Top-K Sparsification | null | null | null | null | cs.LG cs.AI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated Knowledge Graphs Embedding learning (FKGE) encounters challenges in
communication efficiency stemming from the considerable size of parameters and
extensive communication rounds. However, existing FKGE methods only focus on
reducing communication rounds by conducting multiple rounds of local training
in eac... | [
{
"created": "Wed, 19 Jun 2024 05:26:02 GMT",
"version": "v1"
}
] | 2024-06-21 | [
[
"Zhang",
"Xiaoxiong",
""
],
[
"Zeng",
"Zhiwei",
""
],
[
"Zhou",
"Xin",
""
],
[
"Niyato",
"Dusit",
""
],
[
"Shen",
"Zhiqi",
""
]
] | Federated Knowledge Graphs Embedding learning (FKGE) encounters challenges in communication efficiency stemming from the considerable size of parameters and extensive communication rounds. However, existing FKGE methods only focus on reducing communication rounds by conducting multiple rounds of local training in each ... |
1109.6638 | James Bergstra | James Bergstra, Aaron Courville, Yoshua Bengio | The Statistical Inefficiency of Sparse Coding for Images (or, One Gabor
to Rule them All) | 9 pages, 8 figures | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sparse coding is a proven principle for learning compact representations of
images. However, sparse coding by itself often leads to very redundant
dictionaries. With images, this often takes the form of similar edge detectors
which are replicated many times at various positions, scales and orientations.
An immediate ... | [
{
"created": "Thu, 29 Sep 2011 19:47:00 GMT",
"version": "v1"
},
{
"created": "Fri, 30 Sep 2011 15:27:25 GMT",
"version": "v2"
}
] | 2015-03-19 | [
[
"Bergstra",
"James",
""
],
[
"Courville",
"Aaron",
""
],
[
"Bengio",
"Yoshua",
""
]
] | Sparse coding is a proven principle for learning compact representations of images. However, sparse coding by itself often leads to very redundant dictionaries. With images, this often takes the form of similar edge detectors which are replicated many times at various positions, scales and orientations. An immediate co... |
cs/0612098 | Manik Lal Das | Manik Lal Das, Ashutosh Saxena, Deepak B. Phatak | Algorithms and Approaches of Proxy Signature: A Survey | 29 pages | null | null | null | cs.CR | null | Numerous research studies have been investigated on proxy signatures over the
last decade. This survey reviews the research progress on proxy signatures,
analyzes a few notable proposals, and provides an overall remark of these
proposals.
| [
{
"created": "Wed, 20 Dec 2006 06:09:59 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Das",
"Manik Lal",
""
],
[
"Saxena",
"Ashutosh",
""
],
[
"Phatak",
"Deepak B.",
""
]
] | Numerous research studies have been investigated on proxy signatures over the last decade. This survey reviews the research progress on proxy signatures, analyzes a few notable proposals, and provides an overall remark of these proposals. |
2312.00534 | Mikel Garcia | Jose Luis Apell\'aniz, Mikel Garc\'ia, Nerea Aranjuelo, Javier
Barandiar\'an, Marcos Nieto | LiDAR-based curb detection for ground truth annotation in automated
driving validation | Accepted in the 26th IEEE International Conference on Intelligent
Transportation Systems (ITSC 2023) | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Curb detection is essential for environmental awareness in Automated Driving
(AD), as it typically limits drivable and non-drivable areas. Annotated data
are necessary for developing and validating an AD function. However, the number
of public datasets with annotated point cloud curbs is scarce. This paper
presents a... | [
{
"created": "Fri, 1 Dec 2023 12:15:09 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Dec 2023 10:29:54 GMT",
"version": "v2"
}
] | 2023-12-12 | [
[
"Apellániz",
"Jose Luis",
""
],
[
"García",
"Mikel",
""
],
[
"Aranjuelo",
"Nerea",
""
],
[
"Barandiarán",
"Javier",
""
],
[
"Nieto",
"Marcos",
""
]
] | Curb detection is essential for environmental awareness in Automated Driving (AD), as it typically limits drivable and non-drivable areas. Annotated data are necessary for developing and validating an AD function. However, the number of public datasets with annotated point cloud curbs is scarce. This paper presents a m... |
2402.02548 | Ronen Tamari | Ronen Tamari | "What's my model inside of?": Exploring the role of environments for
grounded natural language understanding | PhD Thesis | null | null | null | cs.CL cs.AI cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In contrast to classical cognitive science which studied brains in isolation,
ecological approaches focused on the role of the body and environment in
shaping cognition. Similarly, in this thesis we adopt an ecological approach to
grounded natural language understanding (NLU) research. Grounded language
understanding... | [
{
"created": "Sun, 4 Feb 2024 15:52:46 GMT",
"version": "v1"
}
] | 2024-02-06 | [
[
"Tamari",
"Ronen",
""
]
] | In contrast to classical cognitive science which studied brains in isolation, ecological approaches focused on the role of the body and environment in shaping cognition. Similarly, in this thesis we adopt an ecological approach to grounded natural language understanding (NLU) research. Grounded language understanding s... |
2006.00899 | Wei Xu | Yaqiong Zhao, Wei Xu, Jindan Xu, Shi Jin, Kezhi Wang, and Mohamed-Slim
Alouini | Analog Versus Hybrid Precoding for Multiuser Massive MIMO with Quantized
CSI Feedback | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this letter, we study the performance of a downlink multiuser massive
multiple-input multiple-output (MIMO) system with sub-connected structure over
limited feedback channels. Tight rate approximations are theoretically analyzed
for the system with pure analog precoding and hybrid precoding. The effect of
quantize... | [
{
"created": "Mon, 1 Jun 2020 12:51:34 GMT",
"version": "v1"
}
] | 2020-06-03 | [
[
"Zhao",
"Yaqiong",
""
],
[
"Xu",
"Wei",
""
],
[
"Xu",
"Jindan",
""
],
[
"Jin",
"Shi",
""
],
[
"Wang",
"Kezhi",
""
],
[
"Alouini",
"Mohamed-Slim",
""
]
] | In this letter, we study the performance of a downlink multiuser massive multiple-input multiple-output (MIMO) system with sub-connected structure over limited feedback channels. Tight rate approximations are theoretically analyzed for the system with pure analog precoding and hybrid precoding. The effect of quantized ... |
1903.03462 | Panagiotis Meletis | Panagiotis Meletis and Gijs Dubbelman | On Boosting Semantic Street Scene Segmentation with Weak Supervision | Oral presentation IEEE IV 2019 | null | null | null | cs.CV | http://creativecommons.org/publicdomain/zero/1.0/ | Training convolutional networks for semantic segmentation requires per-pixel
ground truth labels, which are very time consuming and hence costly to obtain.
Therefore, in this work, we research and develop a hierarchical deep network
architecture and the corresponding loss for semantic segmentation that can be
trained... | [
{
"created": "Fri, 8 Mar 2019 14:16:11 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Jul 2019 14:07:16 GMT",
"version": "v2"
}
] | 2019-07-17 | [
[
"Meletis",
"Panagiotis",
""
],
[
"Dubbelman",
"Gijs",
""
]
] | Training convolutional networks for semantic segmentation requires per-pixel ground truth labels, which are very time consuming and hence costly to obtain. Therefore, in this work, we research and develop a hierarchical deep network architecture and the corresponding loss for semantic segmentation that can be trained f... |
2406.20031 | Mohamed Karim Belaid | Mohamed Karim Belaid, Maximilian Rabus and Eyke H\"ullermeier | Pairwise Difference Learning for Classification | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Pairwise difference learning (PDL) has recently been introduced as a new
meta-learning technique for regression. Instead of learning a mapping from
instances to outcomes in the standard way, the key idea is to learn a function
that takes two instances as input and predicts the difference between the
respective outcom... | [
{
"created": "Fri, 28 Jun 2024 16:20:22 GMT",
"version": "v1"
}
] | 2024-07-01 | [
[
"Belaid",
"Mohamed Karim",
""
],
[
"Rabus",
"Maximilian",
""
],
[
"Hüllermeier",
"Eyke",
""
]
] | Pairwise difference learning (PDL) has recently been introduced as a new meta-learning technique for regression. Instead of learning a mapping from instances to outcomes in the standard way, the key idea is to learn a function that takes two instances as input and predicts the difference between the respective outcomes... |
1905.10828 | Evan Drumwright | Evan Drumwright | An Unconditionally Stable First-Order Constraint Solver for Multibody
Systems | null | null | null | null | cs.NA cs.CE | http://creativecommons.org/publicdomain/zero/1.0/ | This article describes an absolutely stable, first-order constraint solverfor
multi-rigid body systems that calculates (predicts) constraint forces for
typical bilateral and unilateral constraints, contact constraints with
friction, and many other constraint types. Redundant constraints do not pose
numerical problems... | [
{
"created": "Sun, 26 May 2019 16:14:24 GMT",
"version": "v1"
}
] | 2019-05-28 | [
[
"Drumwright",
"Evan",
""
]
] | This article describes an absolutely stable, first-order constraint solverfor multi-rigid body systems that calculates (predicts) constraint forces for typical bilateral and unilateral constraints, contact constraints with friction, and many other constraint types. Redundant constraints do not pose numerical problems o... |
2403.04593 | Linyan Huang | Yunsong Zhou, Linyan Huang, Qingwen Bu, Jia Zeng, Tianyu Li, Hang Qiu,
Hongzi Zhu, Minyi Guo, Yu Qiao, Hongyang Li | Embodied Understanding of Driving Scenarios | 43 pages, 16 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Embodied scene understanding serves as the cornerstone for autonomous agents
to perceive, interpret, and respond to open driving scenarios. Such
understanding is typically founded upon Vision-Language Models (VLMs).
Nevertheless, existing VLMs are restricted to the 2D domain, devoid of spatial
awareness and long-hori... | [
{
"created": "Thu, 7 Mar 2024 15:39:18 GMT",
"version": "v1"
}
] | 2024-03-08 | [
[
"Zhou",
"Yunsong",
""
],
[
"Huang",
"Linyan",
""
],
[
"Bu",
"Qingwen",
""
],
[
"Zeng",
"Jia",
""
],
[
"Li",
"Tianyu",
""
],
[
"Qiu",
"Hang",
""
],
[
"Zhu",
"Hongzi",
""
],
[
"Guo",
"Minyi",
... | Embodied scene understanding serves as the cornerstone for autonomous agents to perceive, interpret, and respond to open driving scenarios. Such understanding is typically founded upon Vision-Language Models (VLMs). Nevertheless, existing VLMs are restricted to the 2D domain, devoid of spatial awareness and long-horizo... |
2010.14828 | Sebastian Lotter | Sebastian Lotter and Maximilian Sch\"afer and Johannes Zeitler and
Robert Schober | Receptor Saturation Modeling for Synaptic DMC | 6 pages, 1 table, 4 figures. Presented at the 2021 IEEE International
Conference on Communications (ICC) | null | 10.1109/ICC42927.2021.9500809 | null | cs.ET cs.IT math.IT q-bio.NC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Synaptic communication is a natural Molecular Communication (MC) system which
may serve as a blueprint for the design of synthetic MC systems. In particular,
it features highly specialized mechanisms to enable inter-symbol interference
(ISI)-free and energy efficient communication. The understanding of synaptic MC
is... | [
{
"created": "Wed, 28 Oct 2020 09:01:33 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Sep 2021 10:39:43 GMT",
"version": "v2"
}
] | 2021-10-01 | [
[
"Lotter",
"Sebastian",
""
],
[
"Schäfer",
"Maximilian",
""
],
[
"Zeitler",
"Johannes",
""
],
[
"Schober",
"Robert",
""
]
] | Synaptic communication is a natural Molecular Communication (MC) system which may serve as a blueprint for the design of synthetic MC systems. In particular, it features highly specialized mechanisms to enable inter-symbol interference (ISI)-free and energy efficient communication. The understanding of synaptic MC is f... |
2305.07882 | Alexei Grinbaum | Alexei Grinbaum and Laurynas Adomaitis | Dual Use Concerns of Generative AI and Large Language Models | null | Journal of Responsible Innovation 11(1), 2304381, 2024 | 10.1080/23299460.2024.2304381 | null | cs.CY cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We suggest the implementation of the Dual Use Research of Concern (DURC)
framework, originally designed for life sciences, to the domain of generative
AI, with a specific focus on Large Language Models (LLMs). With its
demonstrated advantages and drawbacks in biological research, we believe the
DURC criteria can be e... | [
{
"created": "Sat, 13 May 2023 10:08:57 GMT",
"version": "v1"
},
{
"created": "Sat, 23 Dec 2023 10:42:21 GMT",
"version": "v2"
}
] | 2024-01-31 | [
[
"Grinbaum",
"Alexei",
""
],
[
"Adomaitis",
"Laurynas",
""
]
] | We suggest the implementation of the Dual Use Research of Concern (DURC) framework, originally designed for life sciences, to the domain of generative AI, with a specific focus on Large Language Models (LLMs). With its demonstrated advantages and drawbacks in biological research, we believe the DURC criteria can be eff... |
2204.00873 | Li Liu | Jianrong Wang, Jinyu Liu, Longxuan Zhao, Shanyu Wang, Ruiguo Yu, Li
Liu | Acoustic-to-articulatory Inversion based on Speech Decomposition and
Auxiliary Feature | null | ICASSP 2022 | null | null | cs.SD cs.CV eess.AS | http://creativecommons.org/licenses/by/4.0/ | Acoustic-to-articulatory inversion (AAI) is to obtain the movement of
articulators from speech signals. Until now, achieving a speaker-independent
AAI remains a challenge given the limited data. Besides, most current works
only use audio speech as input, causing an inevitable performance bottleneck.
To solve these pr... | [
{
"created": "Sat, 2 Apr 2022 14:47:19 GMT",
"version": "v1"
}
] | 2022-04-05 | [
[
"Wang",
"Jianrong",
""
],
[
"Liu",
"Jinyu",
""
],
[
"Zhao",
"Longxuan",
""
],
[
"Wang",
"Shanyu",
""
],
[
"Yu",
"Ruiguo",
""
],
[
"Liu",
"Li",
""
]
] | Acoustic-to-articulatory inversion (AAI) is to obtain the movement of articulators from speech signals. Until now, achieving a speaker-independent AAI remains a challenge given the limited data. Besides, most current works only use audio speech as input, causing an inevitable performance bottleneck. To solve these prob... |
2307.01727 | Huan Li | Huan Li, Jingxuan Huang, Zesong Fei | Mutual Information Analysis for Factor Graph-based MIMO Iterative
Detections through Error Functions | 11 pages, 12 figures | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The factor graph (FG) based iterative detection is considered an effective
and practical method for multiple-input and multiple-out (MIMO), particularly
massive MIMO (m-MIMO) systems. However, the convergence analysis for the
FG-based iterative MIMO detection is insufficient, which is of great
significance to the per... | [
{
"created": "Tue, 4 Jul 2023 13:54:04 GMT",
"version": "v1"
}
] | 2023-07-06 | [
[
"Li",
"Huan",
""
],
[
"Huang",
"Jingxuan",
""
],
[
"Fei",
"Zesong",
""
]
] | The factor graph (FG) based iterative detection is considered an effective and practical method for multiple-input and multiple-out (MIMO), particularly massive MIMO (m-MIMO) systems. However, the convergence analysis for the FG-based iterative MIMO detection is insufficient, which is of great significance to the perfo... |
1701.05983 | Mohan Kumar S | Mohan Kumar S and Jagadeesha SN | A Minimum Reconfiguration Probability Routing Algorithm for RWA in
All-Optical Networks | arXiv admin note: text overlap with arXiv:1605.05872 | SIPIJ Vol 7, 2016, 39-51 | 10.5121/sipij.2016.7604 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a detailed study of Minimum Reconfiguration
Probability Routing (MRPR) algorithm, and its performance evaluation in
comparison with Adaptive unconstrained routing (AUR) and Least Loaded routing
(LLR) algorithms. We have minimized the effects of failures on link and router
failure in the netw... | [
{
"created": "Sat, 21 Jan 2017 05:26:12 GMT",
"version": "v1"
}
] | 2017-03-31 | [
[
"S",
"Mohan Kumar",
""
],
[
"SN",
"Jagadeesha",
""
]
] | In this paper, we present a detailed study of Minimum Reconfiguration Probability Routing (MRPR) algorithm, and its performance evaluation in comparison with Adaptive unconstrained routing (AUR) and Least Loaded routing (LLR) algorithms. We have minimized the effects of failures on link and router failure in the networ... |
1808.05942 | Mohamed Omran | Mohamed Omran, Christoph Lassner, Gerard Pons-Moll, Peter V. Gehler,
Bernt Schiele | Neural Body Fitting: Unifying Deep Learning and Model-Based Human Pose
and Shape Estimation | 3DV 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Direct prediction of 3D body pose and shape remains a challenge even for
highly parameterized deep learning models. Mapping from the 2D image space to
the prediction space is difficult: perspective ambiguities make the loss
function noisy and training data is scarce. In this paper, we propose a novel
approach (Neural... | [
{
"created": "Fri, 17 Aug 2018 17:56:10 GMT",
"version": "v1"
}
] | 2018-08-20 | [
[
"Omran",
"Mohamed",
""
],
[
"Lassner",
"Christoph",
""
],
[
"Pons-Moll",
"Gerard",
""
],
[
"Gehler",
"Peter V.",
""
],
[
"Schiele",
"Bernt",
""
]
] | Direct prediction of 3D body pose and shape remains a challenge even for highly parameterized deep learning models. Mapping from the 2D image space to the prediction space is difficult: perspective ambiguities make the loss function noisy and training data is scarce. In this paper, we propose a novel approach (Neural B... |
1303.2416 | Alexandra Keenan | Alexandra Keenan, Robert Schweller, Michael Sherman, Xingsi Zhong | Fast Arithmetic in Algorithmic Self-Assembly | null | null | null | null | cs.DS cs.CC cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we consider the time complexity of computing the sum and
product of two $n$-bit numbers within the tile self-assembly model. The
(abstract) tile assembly model is a mathematical model of self-assembly in
which system components are square tiles with different glue types assigned to
tile edges. Assembly ... | [
{
"created": "Mon, 11 Mar 2013 03:09:38 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Aug 2013 17:43:46 GMT",
"version": "v2"
}
] | 2013-08-06 | [
[
"Keenan",
"Alexandra",
""
],
[
"Schweller",
"Robert",
""
],
[
"Sherman",
"Michael",
""
],
[
"Zhong",
"Xingsi",
""
]
] | In this paper we consider the time complexity of computing the sum and product of two $n$-bit numbers within the tile self-assembly model. The (abstract) tile assembly model is a mathematical model of self-assembly in which system components are square tiles with different glue types assigned to tile edges. Assembly is... |
2201.09607 | Maurice Laveaux | Maurice Laveaux, Wieger Wesselink, Tim A.C. Willemse | On-The-Fly Solving for Symbolic Parity Games | 22 pages, technical report | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Parity games can be used to represent many different kinds of decision
problems. In practice, tools that use parity games often rely on a
specification in a higher-order logic from which the actual game can be
obtained by means of an exploration. For many of these decision problems we are
only interested in the solut... | [
{
"created": "Mon, 24 Jan 2022 11:24:10 GMT",
"version": "v1"
}
] | 2022-01-25 | [
[
"Laveaux",
"Maurice",
""
],
[
"Wesselink",
"Wieger",
""
],
[
"Willemse",
"Tim A. C.",
""
]
] | Parity games can be used to represent many different kinds of decision problems. In practice, tools that use parity games often rely on a specification in a higher-order logic from which the actual game can be obtained by means of an exploration. For many of these decision problems we are only interested in the solutio... |
2006.06185 | Joseph Chuang | Jo Chuang, Qian Dong | JIT-Masker: Efficient Online Distillation for Background Matting | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We design a real-time portrait matting pipeline for everyday use,
particularly for "virtual backgrounds" in video conferences. Existing
segmentation and matting methods prioritize accuracy and quality over
throughput and efficiency, and our pipeline enables trading off a controllable
amount of accuracy for better thr... | [
{
"created": "Thu, 11 Jun 2020 04:28:09 GMT",
"version": "v1"
}
] | 2020-06-12 | [
[
"Chuang",
"Jo",
""
],
[
"Dong",
"Qian",
""
]
] | We design a real-time portrait matting pipeline for everyday use, particularly for "virtual backgrounds" in video conferences. Existing segmentation and matting methods prioritize accuracy and quality over throughput and efficiency, and our pipeline enables trading off a controllable amount of accuracy for better throu... |
1711.00139 | Min Tang | Min Tang, Zichen Zhang, Dana Cobzas, Martin Jagersand, Jacob L.
Jaremko | Segmentation-by-Detection: A Cascade Network for Volumetric Medical
Image Segmentation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an attention mechanism for 3D medical image segmentation. The
method, named segmentation-by-detection, is a cascade of a detection module
followed by a segmentation module. The detection module enables a region of
interest to come to attention and produces a set of object region candidates
which are furthe... | [
{
"created": "Tue, 31 Oct 2017 23:04:28 GMT",
"version": "v1"
}
] | 2017-11-02 | [
[
"Tang",
"Min",
""
],
[
"Zhang",
"Zichen",
""
],
[
"Cobzas",
"Dana",
""
],
[
"Jagersand",
"Martin",
""
],
[
"Jaremko",
"Jacob L.",
""
]
] | We propose an attention mechanism for 3D medical image segmentation. The method, named segmentation-by-detection, is a cascade of a detection module followed by a segmentation module. The detection module enables a region of interest to come to attention and produces a set of object region candidates which are further ... |
2201.04354 | Akira Suzuki | Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul
Ouvrard, Akira Suzuki, Kunihiro Wasa | Reconfiguration of Spanning Trees with Degree Constraint or Diameter
Constraint | null | null | null | null | cs.DS cs.DM | http://creativecommons.org/licenses/by/4.0/ | We investigate the complexity of finding a transformation from a given
spanning tree in a graph to another given spanning tree in the same graph via a
sequence of edge flips. The exchange property of the matroid bases immediately
yields that such a transformation always exists if we have no constraints on
spanning tr... | [
{
"created": "Wed, 12 Jan 2022 08:03:26 GMT",
"version": "v1"
}
] | 2022-01-13 | [
[
"Bousquet",
"Nicolas",
""
],
[
"Ito",
"Takehiro",
""
],
[
"Kobayashi",
"Yusuke",
""
],
[
"Mizuta",
"Haruka",
""
],
[
"Ouvrard",
"Paul",
""
],
[
"Suzuki",
"Akira",
""
],
[
"Wasa",
"Kunihiro",
""
]
] | We investigate the complexity of finding a transformation from a given spanning tree in a graph to another given spanning tree in the same graph via a sequence of edge flips. The exchange property of the matroid bases immediately yields that such a transformation always exists if we have no constraints on spanning tree... |
2407.12395 | Sheng Miao | Sheng Miao, Jiaxin Huang, Dongfeng Bai, Weichao Qiu, Bingbing Liu,
Andreas Geiger, Yiyi Liao | Efficient Depth-Guided Urban View Synthesis | ECCV2024, Project page: https://xdimlab.github.io/EDUS/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in implicit scene representation enable high-fidelity street
view novel view synthesis. However, existing methods optimize a neural radiance
field for each scene, relying heavily on dense training images and extensive
computation resources. To mitigate this shortcoming, we introduce a new method
calle... | [
{
"created": "Wed, 17 Jul 2024 08:16:25 GMT",
"version": "v1"
}
] | 2024-07-18 | [
[
"Miao",
"Sheng",
""
],
[
"Huang",
"Jiaxin",
""
],
[
"Bai",
"Dongfeng",
""
],
[
"Qiu",
"Weichao",
""
],
[
"Liu",
"Bingbing",
""
],
[
"Geiger",
"Andreas",
""
],
[
"Liao",
"Yiyi",
""
]
] | Recent advances in implicit scene representation enable high-fidelity street view novel view synthesis. However, existing methods optimize a neural radiance field for each scene, relying heavily on dense training images and extensive computation resources. To mitigate this shortcoming, we introduce a new method called ... |
0903.5282 | Husheng Li | Husheng Li | Multi-agent Q-Learning of Channel Selection in Multi-user Cognitive
Radio Systems: A Two by Two Case | submitted to 2009 IEEE International Conference on Systems, Man, and
Cybernetics; the results of general n by m case will be published soon | null | 10.1109/ICSMC.2009.5346172 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Resource allocation is an important issue in cognitive radio systems. It can
be done by carrying out negotiation among secondary users. However, significant
overhead may be incurred by the negotiation since the negotiation needs to be
done frequently due to the rapid change of primary users' activity. In this
paper, ... | [
{
"created": "Mon, 30 Mar 2009 18:07:18 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Li",
"Husheng",
""
]
] | Resource allocation is an important issue in cognitive radio systems. It can be done by carrying out negotiation among secondary users. However, significant overhead may be incurred by the negotiation since the negotiation needs to be done frequently due to the rapid change of primary users' activity. In this paper, a ... |
1905.03711 | Angelos Katharopoulos | Angelos Katharopoulos and Fran\c{c}ois Fleuret | Processing Megapixel Images with Deep Attention-Sampling Models | Presented in ICML 2019. Code is available at
https://github.com/idiap/attention-sampling | Proceedings of the 36th International Conference on Machine
Learning, PMLR 97:3282-3291, 2019 | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing deep architectures cannot operate on very large signals such as
megapixel images due to computational and memory constraints. To tackle this
limitation, we propose a fully differentiable end-to-end trainable model that
samples and processes only a fraction of the full resolution input image. The
locations to... | [
{
"created": "Fri, 3 May 2019 16:27:46 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Jul 2019 15:20:50 GMT",
"version": "v2"
}
] | 2019-07-18 | [
[
"Katharopoulos",
"Angelos",
""
],
[
"Fleuret",
"François",
""
]
] | Existing deep architectures cannot operate on very large signals such as megapixel images due to computational and memory constraints. To tackle this limitation, we propose a fully differentiable end-to-end trainable model that samples and processes only a fraction of the full resolution input image. The locations to p... |
2404.03471 | Faiza Khattak Dr. | Farnaz Kohankhaki, Jacob-Junqi Tian, David Emerson, Laleh
Seyyed-Kalantari, Faiza Khan Khattak | The Impact of Unstated Norms in Bias Analysis of Language Models | null | null | null | null | cs.CL cs.CY cs.LG | http://creativecommons.org/licenses/by/4.0/ | Large language models (LLMs), trained on vast datasets, can carry biases that
manifest in various forms, from overt discrimination to implicit stereotypes.
One facet of bias is performance disparities in LLMs, often harming
underprivileged groups, such as racial minorities. A common approach to
quantifying bias is to... | [
{
"created": "Thu, 4 Apr 2024 14:24:06 GMT",
"version": "v1"
},
{
"created": "Sun, 7 Apr 2024 21:55:38 GMT",
"version": "v2"
}
] | 2024-04-09 | [
[
"Kohankhaki",
"Farnaz",
""
],
[
"Tian",
"Jacob-Junqi",
""
],
[
"Emerson",
"David",
""
],
[
"Seyyed-Kalantari",
"Laleh",
""
],
[
"Khattak",
"Faiza Khan",
""
]
] | Large language models (LLMs), trained on vast datasets, can carry biases that manifest in various forms, from overt discrimination to implicit stereotypes. One facet of bias is performance disparities in LLMs, often harming underprivileged groups, such as racial minorities. A common approach to quantifying bias is to u... |
1308.3336 | Piotr Sankowski | Jakub {\L}\k{a}cki and Jakub O\'cwieja and Marcin Pilipczuk and Piotr
Sankowski and Anna Zych | The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for
the Steiner Tree | Full version of the paper accepted to STOC'15 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we study the Steiner tree problem over a dynamic set of
terminals. We consider the model where we are given an $n$-vertex graph
$G=(V,E,w)$ with positive real edge weights, and our goal is to maintain a tree
which is a good approximation of the minimum Steiner tree spanning a terminal
set $S \subseteq V... | [
{
"created": "Thu, 15 Aug 2013 08:32:39 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Aug 2013 09:03:38 GMT",
"version": "v2"
},
{
"created": "Mon, 7 Apr 2014 08:34:25 GMT",
"version": "v3"
},
{
"created": "Wed, 17 Jun 2015 11:06:23 GMT",
"version": "v4"
},
{
"cr... | 2016-06-27 | [
[
"Łącki",
"Jakub",
""
],
[
"Oćwieja",
"Jakub",
""
],
[
"Pilipczuk",
"Marcin",
""
],
[
"Sankowski",
"Piotr",
""
],
[
"Zych",
"Anna",
""
]
] | In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an $n$-vertex graph $G=(V,E,w)$ with positive real edge weights, and our goal is to maintain a tree which is a good approximation of the minimum Steiner tree spanning a terminal set $S \subseteq V$,... |
1701.04180 | Nari Lee | Jon-Lark Kim, Nari Lee | A Projection Decoding of a Binary Extremal Self-Dual Code of Length $40$ | 23 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As far as we know, there is no decoding algorithm of any binary self-dual
$[40, 20, 8]$ code except for the syndrome decoding applied to the code
directly. This syndrome decoding for a binary self-dual $[40,20,8]$ code is not
efficient in the sense that it cannot be done by hand due to a large syndrome
table. The pur... | [
{
"created": "Mon, 16 Jan 2017 06:15:22 GMT",
"version": "v1"
}
] | 2017-01-17 | [
[
"Kim",
"Jon-Lark",
""
],
[
"Lee",
"Nari",
""
]
] | As far as we know, there is no decoding algorithm of any binary self-dual $[40, 20, 8]$ code except for the syndrome decoding applied to the code directly. This syndrome decoding for a binary self-dual $[40,20,8]$ code is not efficient in the sense that it cannot be done by hand due to a large syndrome table. The purpo... |
1210.2297 | Remy Haemmerle | R\'emy Haemmerl\'e | Diagrammatic confluence for Constraint Handling Rules | null | Theory and Practice of Logic Programming, 12(4-5): 737-753, 2012 | 10.1017/S1471068412000270 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Confluence is a fundamental property of Constraint Handling Rules (CHR)
since, as in other rewriting formalisms, it guarantees that the computations
are not dependent on rule application order, and also because it implies the
logical consistency of the program declarative view. In this paper we are
concerned with pro... | [
{
"created": "Mon, 8 Oct 2012 14:34:25 GMT",
"version": "v1"
},
{
"created": "Tue, 9 Oct 2012 12:43:36 GMT",
"version": "v2"
}
] | 2012-10-10 | [
[
"Haemmerlé",
"Rémy",
""
]
] | Confluence is a fundamental property of Constraint Handling Rules (CHR) since, as in other rewriting formalisms, it guarantees that the computations are not dependent on rule application order, and also because it implies the logical consistency of the program declarative view. In this paper we are concerned with provi... |
2012.12441 | Bilin Aksun-Guvenc | Oncu Ararat, Bilin Aksun-Guvenc | A Survey of Recent Developments in Collision Avoidance, Collision
Warning and Inter-Vehicle Communication Systems | 9 pages, 5 figures | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This paper presents the state-of-the-art on Collision Avoidance and Collision
Warning (CA,CW) systems. Traffic accidents result from driver errors or
situations that are unpredictable for the driver. CA,CW systems are developed
for reducing traffic accidents and saving peoples lives by warning drivers or
taking compe... | [
{
"created": "Wed, 23 Dec 2020 01:35:03 GMT",
"version": "v1"
}
] | 2020-12-24 | [
[
"Ararat",
"Oncu",
""
],
[
"Aksun-Guvenc",
"Bilin",
""
]
] | This paper presents the state-of-the-art on Collision Avoidance and Collision Warning (CA,CW) systems. Traffic accidents result from driver errors or situations that are unpredictable for the driver. CA,CW systems are developed for reducing traffic accidents and saving peoples lives by warning drivers or taking compens... |
1302.1567 | Solomon Eyal Shimony | Solomon Eyal Shimony, Carmel Domshlak, Eugene Santos Jr | Cost-Sharing in Bayesian Knowledge Bases | Appears in Proceedings of the Thirteenth Conference on Uncertainty in
Artificial Intelligence (UAI1997) | null | null | UAI-P-1997-PG-421-428 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bayesian knowledge bases (BKBs) are a generalization of Bayes networks and
weighted proof graphs (WAODAGs), that allow cycles in the causal graph.
Reasoning in BKBs requires finding the most probable inferences consistent with
the evidence. The cost-sharing heuristic for finding least-cost explanations in
WAODAGs was... | [
{
"created": "Wed, 6 Feb 2013 15:58:57 GMT",
"version": "v1"
}
] | 2013-02-08 | [
[
"Shimony",
"Solomon Eyal",
""
],
[
"Domshlak",
"Carmel",
""
],
[
"Santos",
"Eugene",
"Jr"
]
] | Bayesian knowledge bases (BKBs) are a generalization of Bayes networks and weighted proof graphs (WAODAGs), that allow cycles in the causal graph. Reasoning in BKBs requires finding the most probable inferences consistent with the evidence. The cost-sharing heuristic for finding least-cost explanations in WAODAGs was p... |
1902.00719 | Miguel Alonso Jr | Miguel Alonso Jr | Learning User Preferences via Reinforcement Learning with Spatial
Interface Valuing | Submitted to HCI International 2019 Parallel Session on Spatial
Interaction for Universal Access | null | null | null | cs.LG cs.AI cs.HC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Interactive Machine Learning is concerned with creating systems that operate
in environments alongside humans to achieve a task. A typical use is to extend
or amplify the capabilities of a human in cognitive or physical ways, requiring
the machine to adapt to the users' intentions and preferences. Often, this
takes t... | [
{
"created": "Sat, 2 Feb 2019 13:45:20 GMT",
"version": "v1"
}
] | 2019-02-05 | [
[
"Alonso",
"Miguel",
"Jr"
]
] | Interactive Machine Learning is concerned with creating systems that operate in environments alongside humans to achieve a task. A typical use is to extend or amplify the capabilities of a human in cognitive or physical ways, requiring the machine to adapt to the users' intentions and preferences. Often, this takes the... |
1112.1344 | Vikram Chandrasekhar | Lars Lindbom (Ericsson), Robert Love, Sandeep Krishnamurthy (Motorola
Mobility), Chunhai Yao (Nokia Siemens Networks), Nobuhiko Miki (NTT DOCOMO)
and Vikram Chandrasekhar (Texas Instruments) | Enhanced Inter-cell Interference Coordination for Heterogeneous Networks
in LTE-Advanced: A Survey | This is a working document describing the Enhanced Inter-cell
Interference Coordination (E-ICIC) introduced in LTE-Advanced | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Heterogeneous networks (het-nets) - comprising of conventional macrocell base
stations overlaid with femtocells, picocells and wireless relays - offer
cellular operators burgeoning traffic demands through cell-splitting gains
obtained by bringing users closer to their access points. However, the often
random and unpl... | [
{
"created": "Tue, 6 Dec 2011 16:47:22 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Dec 2011 16:45:36 GMT",
"version": "v2"
}
] | 2011-12-08 | [
[
"Lindbom",
"Lars",
"",
"Ericsson"
],
[
"Love",
"Robert",
"",
"Motorola\n Mobility"
],
[
"Krishnamurthy",
"Sandeep",
"",
"Motorola\n Mobility"
],
[
"Yao",
"Chunhai",
"",
"Nokia Siemens Networks"
],
[
"Miki",
"Nobuhiko",
"... | Heterogeneous networks (het-nets) - comprising of conventional macrocell base stations overlaid with femtocells, picocells and wireless relays - offer cellular operators burgeoning traffic demands through cell-splitting gains obtained by bringing users closer to their access points. However, the often random and unplan... |
2005.06316 | Masanobu Horie | Masanobu Horie, Naoki Morita, Toshiaki Hishinuma, Yu Ihara, Naoto
Mitsume | Isometric Transformation Invariant and Equivariant Graph Convolutional
Networks | Published as a conference paper at ICLR 2021 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graphs are one of the most important data structures for representing
pairwise relations between objects. Specifically, a graph embedded in a
Euclidean space is essential to solving real problems, such as physical
simulations. A crucial requirement for applying graphs in Euclidean spaces to
physical simulations is le... | [
{
"created": "Wed, 13 May 2020 13:44:44 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Oct 2020 05:22:12 GMT",
"version": "v2"
},
{
"created": "Mon, 21 Dec 2020 18:30:44 GMT",
"version": "v3"
},
{
"created": "Wed, 10 Mar 2021 12:41:51 GMT",
"version": "v4"
}
] | 2021-03-11 | [
[
"Horie",
"Masanobu",
""
],
[
"Morita",
"Naoki",
""
],
[
"Hishinuma",
"Toshiaki",
""
],
[
"Ihara",
"Yu",
""
],
[
"Mitsume",
"Naoto",
""
]
] | Graphs are one of the most important data structures for representing pairwise relations between objects. Specifically, a graph embedded in a Euclidean space is essential to solving real problems, such as physical simulations. A crucial requirement for applying graphs in Euclidean spaces to physical simulations is lear... |
1711.11114 | Zhiyuan Jiang | Zhiyuan Jiang and Sheng Zhou and Xueying Guo and Zhisheng Niu | Task Replication for Deadline-Constrained Vehicular Cloud Computing:
Optimal Policy, Performance Analysis and Implications on Road Traffic | accepted by Internet of Things Journal | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In vehicular cloud computing (VCC) systems, the computational resources of
moving vehicles are exploited and managed by infrastructures, e.g., roadside
units, to provide computational services. The offloading of computational tasks
and collection of results rely on successful transmissions between vehicles and
infras... | [
{
"created": "Wed, 29 Nov 2017 21:35:54 GMT",
"version": "v1"
}
] | 2017-12-01 | [
[
"Jiang",
"Zhiyuan",
""
],
[
"Zhou",
"Sheng",
""
],
[
"Guo",
"Xueying",
""
],
[
"Niu",
"Zhisheng",
""
]
] | In vehicular cloud computing (VCC) systems, the computational resources of moving vehicles are exploited and managed by infrastructures, e.g., roadside units, to provide computational services. The offloading of computational tasks and collection of results rely on successful transmissions between vehicles and infrastr... |
1612.07514 | Gaetan de Rassenfosse | Gaetan de Rassenfosse, Martin Kracker, Gianluca Tarasconi | Getting Started with PATSTAT Register | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper provides a technical introduction to the PATSTAT Register
database, which contains bibliographical, procedural and legal status data on
patent applications handled by the European Patent Office. It presents eight
MySQL queries that cover some of the most relevant aspects of the database for
research purpos... | [
{
"created": "Thu, 22 Dec 2016 10:05:45 GMT",
"version": "v1"
}
] | 2016-12-23 | [
[
"de Rassenfosse",
"Gaetan",
""
],
[
"Kracker",
"Martin",
""
],
[
"Tarasconi",
"Gianluca",
""
]
] | This paper provides a technical introduction to the PATSTAT Register database, which contains bibliographical, procedural and legal status data on patent applications handled by the European Patent Office. It presents eight MySQL queries that cover some of the most relevant aspects of the database for research purposes... |
2305.05308 | Chadnra Sekhar Sanaboina Dr | Chandra Sekhar Sanaboina, Pallamsetty Sanaboina | Impact of Mobility on Power Consumption in RPL | 15 Pages | null | null | null | cs.NI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The main theme of this paper is to implement the mobility model in Cooja
simulator and to investigate the impact of the mobility on the performance of
Routing Protocol over Low power Lossy networks (RPL) in the IoT environment. In
the real world, mobility occurs frequently. Therefore in this paper, a
frequently used ... | [
{
"created": "Tue, 9 May 2023 09:59:36 GMT",
"version": "v1"
}
] | 2023-05-10 | [
[
"Sanaboina",
"Chandra Sekhar",
""
],
[
"Sanaboina",
"Pallamsetty",
""
]
] | The main theme of this paper is to implement the mobility model in Cooja simulator and to investigate the impact of the mobility on the performance of Routing Protocol over Low power Lossy networks (RPL) in the IoT environment. In the real world, mobility occurs frequently. Therefore in this paper, a frequently used mo... |
2208.12904 | Xiaoge Zhang | Adam Thelen, Xiaoge Zhang, Olga Fink, Yan Lu, Sayan Ghosh, Byeng D.
Youn, Michael D. Todd, Sankaran Mahadevan, Chao Hu, Zhen Hu | A Comprehensive Review of Digital Twin -- Part 2: Roles of Uncertainty
Quantification and Optimization, a Battery Digital Twin, and Perspectives | null | null | null | null | cs.LG math.OC | http://creativecommons.org/licenses/by/4.0/ | As an emerging technology in the era of Industry 4.0, digital twin is gaining
unprecedented attention because of its promise to further optimize process
design, quality control, health monitoring, decision and policy making, and
more, by comprehensively modeling the physical world as a group of
interconnected digital... | [
{
"created": "Sat, 27 Aug 2022 01:36:15 GMT",
"version": "v1"
}
] | 2022-08-30 | [
[
"Thelen",
"Adam",
""
],
[
"Zhang",
"Xiaoge",
""
],
[
"Fink",
"Olga",
""
],
[
"Lu",
"Yan",
""
],
[
"Ghosh",
"Sayan",
""
],
[
"Youn",
"Byeng D.",
""
],
[
"Todd",
"Michael D.",
""
],
[
"Mahadevan",
... | As an emerging technology in the era of Industry 4.0, digital twin is gaining unprecedented attention because of its promise to further optimize process design, quality control, health monitoring, decision and policy making, and more, by comprehensively modeling the physical world as a group of interconnected digital m... |
1907.08686 | Zhipeng Li | Zhipeng Li, Jianwei Wu, Lin Sun, Tao Rong | Combinatorial Keyword Recommendations for Sponsored Search with Deep
Reinforcement Learning | 6 pages, adKDD 2019 | In Proceedings of 2019 AdKDD, Anchorage, Alaska, USA, August,
2019, 6 pages | null | null | cs.IR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In sponsored search, keyword recommendations help advertisers to achieve much
better performance within limited budget. Many works have been done to mine
numerous candidate keywords from search logs or landing pages. However, the
strategy to select from given candidates remains to be improved. The existing
relevance-... | [
{
"created": "Thu, 18 Jul 2019 13:29:04 GMT",
"version": "v1"
}
] | 2019-07-23 | [
[
"Li",
"Zhipeng",
""
],
[
"Wu",
"Jianwei",
""
],
[
"Sun",
"Lin",
""
],
[
"Rong",
"Tao",
""
]
] | In sponsored search, keyword recommendations help advertisers to achieve much better performance within limited budget. Many works have been done to mine numerous candidate keywords from search logs or landing pages. However, the strategy to select from given candidates remains to be improved. The existing relevance-ba... |
1005.4584 | Rdv Ijcsis | R. Sivaraman, R.M. Chandrasekaran | Effective Query Retrieval System In Mobile Business Environment | IEEE Publication format, International Journal of Computer Science
and Information Security, IJCSIS, Vol. 7 No. 3, March 2010, USA. ISSN 1947
5500, http://sites.google.com/site/ijcsis/ | null | null | null | cs.OH | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Web Based Query Management System (WBQMS) is a methodology to design and to
implement Mobile Business, in which a server is the gateway to connect
databases with clients which sends requests and receives responses in a
distributive manner. The gateway, which communicates with mobile phone via GSM
Modem, receives the ... | [
{
"created": "Thu, 6 May 2010 19:08:26 GMT",
"version": "v1"
}
] | 2010-05-26 | [
[
"Sivaraman",
"R.",
""
],
[
"Chandrasekaran",
"R. M.",
""
]
] | Web Based Query Management System (WBQMS) is a methodology to design and to implement Mobile Business, in which a server is the gateway to connect databases with clients which sends requests and receives responses in a distributive manner. The gateway, which communicates with mobile phone via GSM Modem, receives the co... |
2009.06978 | Xiang Gao | Xiang Gao, Yizhe Zhang, Michel Galley, Chris Brockett, Bill Dolan | Dialogue Response Ranking Training with Large-Scale Human Feedback Data | Accepted to appear at EMNLP 2020 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing open-domain dialog models are generally trained to minimize the
perplexity of target human responses. However, some human replies are more
engaging than others, spawning more followup interactions. Current
conversational models are increasingly capable of producing turns that are
context-relevant, but in ord... | [
{
"created": "Tue, 15 Sep 2020 10:50:05 GMT",
"version": "v1"
}
] | 2020-09-16 | [
[
"Gao",
"Xiang",
""
],
[
"Zhang",
"Yizhe",
""
],
[
"Galley",
"Michel",
""
],
[
"Brockett",
"Chris",
""
],
[
"Dolan",
"Bill",
""
]
] | Existing open-domain dialog models are generally trained to minimize the perplexity of target human responses. However, some human replies are more engaging than others, spawning more followup interactions. Current conversational models are increasingly capable of producing turns that are context-relevant, but in order... |
1807.03342 | Peng Tang | Peng Tang, Xinggang Wang, Song Bai, Wei Shen, Xiang Bai, Wenyu Liu,
Alan Yuille | PCL: Proposal Cluster Learning for Weakly Supervised Object Detection | Accepted by TPAMI. Codes are available at
https://github.com/ppengtang/oicr/tree/pcl | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Weakly Supervised Object Detection (WSOD), using only image-level annotations
to train object detectors, is of growing importance in object recognition. In
this paper, we propose a novel deep network for WSOD. Unlike previous networks
that transfer the object detection problem to an image classification problem
using... | [
{
"created": "Mon, 9 Jul 2018 18:59:29 GMT",
"version": "v1"
},
{
"created": "Sat, 13 Oct 2018 18:28:09 GMT",
"version": "v2"
}
] | 2018-10-16 | [
[
"Tang",
"Peng",
""
],
[
"Wang",
"Xinggang",
""
],
[
"Bai",
"Song",
""
],
[
"Shen",
"Wei",
""
],
[
"Bai",
"Xiang",
""
],
[
"Liu",
"Wenyu",
""
],
[
"Yuille",
"Alan",
""
]
] | Weakly Supervised Object Detection (WSOD), using only image-level annotations to train object detectors, is of growing importance in object recognition. In this paper, we propose a novel deep network for WSOD. Unlike previous networks that transfer the object detection problem to an image classification problem using M... |
1605.04063 | Ziling Heng | Ziling Heng and Qin Yue | A construction of $q$-ary linear codes with two weights | 19 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Linear codes with a few weights are very important in coding theory and have
attracted a lot of attention. In this paper, we present a construction of
$q$-ary linear codes from trace and norm functions over finite fields. The
weight distributions of the linear codes are determined in some cases based on
Gauss sums. I... | [
{
"created": "Fri, 13 May 2016 06:41:42 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Jul 2017 02:11:50 GMT",
"version": "v2"
}
] | 2017-07-25 | [
[
"Heng",
"Ziling",
""
],
[
"Yue",
"Qin",
""
]
] | Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight distributions of the linear codes are determined in some cases based on Gauss sums. It ... |
2306.00804 | Tianyi Xu | Tianyi Xu, Zhanheng Yang, Kaixun Huang, Pengcheng Guo, Ao Zhang, Biao
Li, Changru Chen, Chao Li, Lei Xie | Adaptive Contextual Biasing for Transducer Based Streaming Speech
Recognition | null | null | null | null | cs.SD cs.CL eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | By incorporating additional contextual information, deep biasing methods have
emerged as a promising solution for speech recognition of personalized words.
However, for real-world voice assistants, always biasing on such personalized
words with high prediction scores can significantly degrade the performance of
recog... | [
{
"created": "Thu, 1 Jun 2023 15:33:30 GMT",
"version": "v1"
},
{
"created": "Sat, 15 Jul 2023 09:35:05 GMT",
"version": "v2"
},
{
"created": "Tue, 15 Aug 2023 04:36:14 GMT",
"version": "v3"
}
] | 2023-08-16 | [
[
"Xu",
"Tianyi",
""
],
[
"Yang",
"Zhanheng",
""
],
[
"Huang",
"Kaixun",
""
],
[
"Guo",
"Pengcheng",
""
],
[
"Zhang",
"Ao",
""
],
[
"Li",
"Biao",
""
],
[
"Chen",
"Changru",
""
],
[
"Li",
"Chao",
... | By incorporating additional contextual information, deep biasing methods have emerged as a promising solution for speech recognition of personalized words. However, for real-world voice assistants, always biasing on such personalized words with high prediction scores can significantly degrade the performance of recogni... |
2202.03243 | Markus Nemitz | Tyler C. Looney, Nathan M. Savard, Gus T. Teran, Archie G. Milligan,
Ryley I. Wheelock, Michael Scalise, Daniel P. Perno, Gregory C. Lewin, Carlo
Pinciroli, Cagdas D. Onal, and Markus P. Nemitz | Air-Releasable Soft Robots for Explosive Ordnance Disposal | Accepted manuscript: IEEE Soft Robotics Conference, Edinburgh, 2022 | null | null | null | cs.RO cs.SY eess.SY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The demining of landmines using drones is challenging; air-releasable
payloads are typically non-intelligent (e.g., water balloons or explosives) and
deploying them at even low altitudes (~6 meter) is inherently inaccurate due to
complex deployment trajectories and constrained visual awareness by the drone
pilot. Sof... | [
{
"created": "Mon, 7 Feb 2022 14:47:31 GMT",
"version": "v1"
}
] | 2022-02-08 | [
[
"Looney",
"Tyler C.",
""
],
[
"Savard",
"Nathan M.",
""
],
[
"Teran",
"Gus T.",
""
],
[
"Milligan",
"Archie G.",
""
],
[
"Wheelock",
"Ryley I.",
""
],
[
"Scalise",
"Michael",
""
],
[
"Perno",
"Daniel P.",
"... | The demining of landmines using drones is challenging; air-releasable payloads are typically non-intelligent (e.g., water balloons or explosives) and deploying them at even low altitudes (~6 meter) is inherently inaccurate due to complex deployment trajectories and constrained visual awareness by the drone pilot. Soft ... |
1810.11280 | Elias D\"ohne | Elias D\"ohne | Virtual Network Embedding via Decomposable LP Formulations: Orientations
of Small Extraction Width and Beyond | This work is a minor revision of the author's M.Sc. thesis in
Computer Science at Technische Universit\"at Berlin | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Virtual Network Embedding Problem (VNEP) considers the efficient
allocation of resources distributed in a substrate network to a set of request
networks. Many existing works discuss either heuristics or exact algorithms,
resulting in a choice between quick runtimes and quality guarantees for the
solutions. Recent... | [
{
"created": "Fri, 26 Oct 2018 11:51:50 GMT",
"version": "v1"
}
] | 2018-10-29 | [
[
"Döhne",
"Elias",
""
]
] | The Virtual Network Embedding Problem (VNEP) considers the efficient allocation of resources distributed in a substrate network to a set of request networks. Many existing works discuss either heuristics or exact algorithms, resulting in a choice between quick runtimes and quality guarantees for the solutions. Recently... |
1007.2119 | Symeon Chatzinotas Dr | Symeon Chatzinotas, Bjorn Ottersten | Free Probability based Capacity Calculation of Multiantenna Gaussian
Fading Channels with Cochannel Interference | 16 pages, 4 figures, 1 table | null | 10.1016/j.phycom.2011.03.004 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | During the last decade, it has been well understood that communication over
multiple antennas can increase linearly the multiplexing capacity gain and
provide large spectral efficiency improvements. However, the majority of
studies in this area were carried out ignoring cochannel interference. Only a
small number of ... | [
{
"created": "Tue, 13 Jul 2010 14:48:13 GMT",
"version": "v1"
},
{
"created": "Fri, 18 Mar 2011 15:49:23 GMT",
"version": "v2"
}
] | 2011-05-31 | [
[
"Chatzinotas",
"Symeon",
""
],
[
"Ottersten",
"Bjorn",
""
]
] | During the last decade, it has been well understood that communication over multiple antennas can increase linearly the multiplexing capacity gain and provide large spectral efficiency improvements. However, the majority of studies in this area were carried out ignoring cochannel interference. Only a small number of in... |
2311.05874 | Wasim Huleihel | Vered Paslev and Wasim Huleihel | Testing Dependency of Unlabeled Databases | 39 pages | null | null | null | cs.LG cs.IT math.IT math.ST stat.TH | http://creativecommons.org/licenses/by/4.0/ | In this paper, we investigate the problem of deciding whether two random
databases $\mathsf{X}\in\mathcal{X}^{n\times d}$ and
$\mathsf{Y}\in\mathcal{Y}^{n\times d}$ are statistically dependent or not. This
is formulated as a hypothesis testing problem, where under the null hypothesis,
these two databases are statisti... | [
{
"created": "Fri, 10 Nov 2023 05:17:03 GMT",
"version": "v1"
}
] | 2023-11-13 | [
[
"Paslev",
"Vered",
""
],
[
"Huleihel",
"Wasim",
""
]
] | In this paper, we investigate the problem of deciding whether two random databases $\mathsf{X}\in\mathcal{X}^{n\times d}$ and $\mathsf{Y}\in\mathcal{Y}^{n\times d}$ are statistically dependent or not. This is formulated as a hypothesis testing problem, where under the null hypothesis, these two databases are statistica... |
2307.08286 | Zhanpeng Zhou | Zhanpeng Zhou, Yongyi Yang, Xiaojiang Yang, Junchi Yan, Wei Hu | Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature
Connectivity | 25 pages, 23 figures | Thirty-seventh Conference on Neural Information Processing Systems
(NeurIPS 2023) | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work has revealed many intriguing empirical phenomena in neural
network training, despite the poorly understood and highly complex loss
landscapes and training dynamics. One of these phenomena, Linear Mode
Connectivity (LMC), has gained considerable attention due to the intriguing
observation that different so... | [
{
"created": "Mon, 17 Jul 2023 07:16:28 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Nov 2023 08:25:48 GMT",
"version": "v2"
}
] | 2023-11-14 | [
[
"Zhou",
"Zhanpeng",
""
],
[
"Yang",
"Yongyi",
""
],
[
"Yang",
"Xiaojiang",
""
],
[
"Yan",
"Junchi",
""
],
[
"Hu",
"Wei",
""
]
] | Recent work has revealed many intriguing empirical phenomena in neural network training, despite the poorly understood and highly complex loss landscapes and training dynamics. One of these phenomena, Linear Mode Connectivity (LMC), has gained considerable attention due to the intriguing observation that different solu... |
2011.07916 | Jingjing Gong | Jingjing Gong, Hang Yan, Yining Zheng, Xipeng Qiu and Xuanjing Huang | Text Information Aggregation with Centrality Attention | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A lot of natural language processing problems need to encode the text
sequence as a fix-length vector, which usually involves aggregation process of
combining the representations of all the words, such as pooling or
self-attention. However, these widely used aggregation approaches did not take
higher-order relationsh... | [
{
"created": "Mon, 16 Nov 2020 13:08:48 GMT",
"version": "v1"
}
] | 2020-11-17 | [
[
"Gong",
"Jingjing",
""
],
[
"Yan",
"Hang",
""
],
[
"Zheng",
"Yining",
""
],
[
"Qiu",
"Xipeng",
""
],
[
"Huang",
"Xuanjing",
""
]
] | A lot of natural language processing problems need to encode the text sequence as a fix-length vector, which usually involves aggregation process of combining the representations of all the words, such as pooling or self-attention. However, these widely used aggregation approaches did not take higher-order relationship... |
2012.14053 | Yang Lyu Dr | Yang Lyu, Thien-Minh Nguyen, Liu Liu, Muqing Cao, Shenghai Yuan, Thien
Hoang Nguyen and Lihua Xie | SPINS: Structure Priors aided Inertial Navigation System | 31 pages, 14 figures | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Although Simultaneous Localization and Mapping (SLAM) has been an active
research topic for decades, current state-of-the-art methods still suffer from
instability or inaccuracy due to feature insufficiency or its inherent
estimation drift, in many civilian environments. To resolve these issues, we
propose a navigati... | [
{
"created": "Mon, 28 Dec 2020 01:48:10 GMT",
"version": "v1"
},
{
"created": "Wed, 27 Jul 2022 01:14:08 GMT",
"version": "v2"
}
] | 2022-07-28 | [
[
"Lyu",
"Yang",
""
],
[
"Nguyen",
"Thien-Minh",
""
],
[
"Liu",
"Liu",
""
],
[
"Cao",
"Muqing",
""
],
[
"Yuan",
"Shenghai",
""
],
[
"Nguyen",
"Thien Hoang",
""
],
[
"Xie",
"Lihua",
""
]
] | Although Simultaneous Localization and Mapping (SLAM) has been an active research topic for decades, current state-of-the-art methods still suffer from instability or inaccuracy due to feature insufficiency or its inherent estimation drift, in many civilian environments. To resolve these issues, we propose a navigation... |
2301.04875 | Zheng Qi | Zheng Qi, AprilPyone MaungMaung, Hitoshi Kiya | Color-NeuraCrypt: Privacy-Preserving Color-Image Classification Using
Extended Random Neural Networks | null | null | null | null | cs.CR cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, with the development of cloud computing platforms,
privacy-preserving methods for deep learning have become an urgent problem.
NeuraCrypt is a private random neural network for privacy-preserving that
allows data owners to encrypt the medical data before the data uploading, and
data owners can train ... | [
{
"created": "Thu, 12 Jan 2023 08:47:33 GMT",
"version": "v1"
}
] | 2023-01-13 | [
[
"Qi",
"Zheng",
""
],
[
"MaungMaung",
"AprilPyone",
""
],
[
"Kiya",
"Hitoshi",
""
]
] | In recent years, with the development of cloud computing platforms, privacy-preserving methods for deep learning have become an urgent problem. NeuraCrypt is a private random neural network for privacy-preserving that allows data owners to encrypt the medical data before the data uploading, and data owners can train an... |
2302.09775 | Mehrdad Ranjbar Khadivi | Mehrdad Ranjbar-Khadivi, Shahin Akbarpour, Mohammad-Reza
Feizi-Derakhshi, Babak Anari | Persian topic detection based on Human Word association and graph
embedding | null | null | null | null | cs.CL cs.AI cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a framework to detect topics in social media based
on Human Word Association. Identifying topics discussed in these media has
become a critical and significant challenge. Most of the work done in this area
is in English, but much has been done in the Persian language, especially
microblogs w... | [
{
"created": "Mon, 20 Feb 2023 05:46:47 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Jul 2023 10:19:50 GMT",
"version": "v2"
}
] | 2023-07-19 | [
[
"Ranjbar-Khadivi",
"Mehrdad",
""
],
[
"Akbarpour",
"Shahin",
""
],
[
"Feizi-Derakhshi",
"Mohammad-Reza",
""
],
[
"Anari",
"Babak",
""
]
] | In this paper, we propose a framework to detect topics in social media based on Human Word Association. Identifying topics discussed in these media has become a critical and significant challenge. Most of the work done in this area is in English, but much has been done in the Persian language, especially microblogs wri... |
2009.05429 | Steven Morad | Steven D. Morad, Roberto Mecca, Rudra P.K. Poudel, Stephan Liwicki,
and Roberto Cipolla | Embodied Visual Navigation with Automatic Curriculum Learning in Real
Environments | null | null | 10.1109/LRA.2020.3048662 | null | cs.RO cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present NavACL, a method of automatic curriculum learning tailored to the
navigation task. NavACL is simple to train and efficiently selects relevant
tasks using geometric features. In our experiments, deep reinforcement learning
agents trained using NavACL significantly outperform state-of-the-art agents
trained ... | [
{
"created": "Fri, 11 Sep 2020 13:28:26 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Jan 2021 18:29:42 GMT",
"version": "v2"
}
] | 2021-01-07 | [
[
"Morad",
"Steven D.",
""
],
[
"Mecca",
"Roberto",
""
],
[
"Poudel",
"Rudra P. K.",
""
],
[
"Liwicki",
"Stephan",
""
],
[
"Cipolla",
"Roberto",
""
]
] | We present NavACL, a method of automatic curriculum learning tailored to the navigation task. NavACL is simple to train and efficiently selects relevant tasks using geometric features. In our experiments, deep reinforcement learning agents trained using NavACL significantly outperform state-of-the-art agents trained wi... |
2403.05579 | Uwe Peters | Uwe Peters, Mary Carman | Cultural Bias in Explainable AI Research: A Systematic Analysis | null | null | null | null | cs.HC cs.AI cs.CY | http://creativecommons.org/licenses/by/4.0/ | For synergistic interactions between humans and artificial intelligence (AI)
systems, AI outputs often need to be explainable to people. Explainable AI
(XAI) systems are commonly tested in human user studies. However, whether XAI
researchers consider potential cultural differences in human explanatory needs
remains u... | [
{
"created": "Wed, 28 Feb 2024 19:30:32 GMT",
"version": "v1"
}
] | 2024-03-12 | [
[
"Peters",
"Uwe",
""
],
[
"Carman",
"Mary",
""
]
] | For synergistic interactions between humans and artificial intelligence (AI) systems, AI outputs often need to be explainable to people. Explainable AI (XAI) systems are commonly tested in human user studies. However, whether XAI researchers consider potential cultural differences in human explanatory needs remains une... |
1312.1529 | Kees Middelburg | J. A. Bergstra, C. A. Middelburg | Instruction sequences expressing multiplication algorithms | 14 pages, the preliminaries of this paper and arXiv:1308.0219 are the
same; 16 pages, results sharpened and presentation improved; 22 pages,
combined with arXiv:1312.1812; 22 pages, typos corrected and explanation
added | Scientific Annals of Computer Science 28(1):39--66, 2018 | 10.7561/SACS.2018.1.39 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For each function on bit strings, its restriction to bit strings of any given
length can be computed by a finite instruction sequence that contains only
instructions to set and get the content of Boolean registers, forward jump
instructions, and a termination instruction. We describe instruction sequences
of this kin... | [
{
"created": "Thu, 5 Dec 2013 12:53:56 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Nov 2017 14:14:49 GMT",
"version": "v2"
},
{
"created": "Wed, 29 Nov 2017 14:13:04 GMT",
"version": "v3"
},
{
"created": "Sun, 1 Jul 2018 10:08:12 GMT",
"version": "v4"
}
] | 2018-09-28 | [
[
"Bergstra",
"J. A.",
""
],
[
"Middelburg",
"C. A.",
""
]
] | For each function on bit strings, its restriction to bit strings of any given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We describe instruction sequences of this kind ... |
2005.00781 | Debashisha Mishra | Debashisha Mishra and Enrico Natalizio | A Survey on Cellular-connected UAVs: Design Challenges, Enabling 5G/B5G
Innovations, and Experimental Advancements | 30 pages, 18 figures, 9 tables, 102 references, journal submission | null | null | null | cs.NI eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As an emerging field of aerial robotics, Unmanned Aerial Vehicles (UAVs) have
gained significant research interest within the wireless networking research
community. As soon as national legislations allow UAVs to fly autonomously, we
will see swarms of UAV populating the sky of our smart cities to accomplish
differen... | [
{
"created": "Sat, 2 May 2020 10:35:33 GMT",
"version": "v1"
}
] | 2020-05-05 | [
[
"Mishra",
"Debashisha",
""
],
[
"Natalizio",
"Enrico",
""
]
] | As an emerging field of aerial robotics, Unmanned Aerial Vehicles (UAVs) have gained significant research interest within the wireless networking research community. As soon as national legislations allow UAVs to fly autonomously, we will see swarms of UAV populating the sky of our smart cities to accomplish different ... |
2404.11416 | Xiao Wu | Zihan Cao, Xiao Wu, Liang-Jian Deng | Neural Shr\"odinger Bridge Matching for Pansharpening | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Recent diffusion probabilistic models (DPM) in the field of pansharpening
have been gradually gaining attention and have achieved state-of-the-art (SOTA)
performance. In this paper, we identify shortcomings in directly applying DPMs
to the task of pansharpening as an inverse problem: 1) initiating sampling
directly f... | [
{
"created": "Wed, 17 Apr 2024 14:17:05 GMT",
"version": "v1"
}
] | 2024-04-18 | [
[
"Cao",
"Zihan",
""
],
[
"Wu",
"Xiao",
""
],
[
"Deng",
"Liang-Jian",
""
]
] | Recent diffusion probabilistic models (DPM) in the field of pansharpening have been gradually gaining attention and have achieved state-of-the-art (SOTA) performance. In this paper, we identify shortcomings in directly applying DPMs to the task of pansharpening as an inverse problem: 1) initiating sampling directly fro... |
2010.05858 | Mark Fonaryov | Mark Fonaryov and Michael Lindenbaum | On the Minimal Recognizable Image Patch | Submitted to ICPR2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In contrast to human vision, common recognition algorithms often fail on
partially occluded images. We propose characterizing, empirically, the
algorithmic limits by finding a minimal recognizable patch (MRP) that is by
itself sufficient to recognize the image. A specialized deep network allows us
to find the most in... | [
{
"created": "Mon, 12 Oct 2020 17:06:16 GMT",
"version": "v1"
}
] | 2020-10-13 | [
[
"Fonaryov",
"Mark",
""
],
[
"Lindenbaum",
"Michael",
""
]
] | In contrast to human vision, common recognition algorithms often fail on partially occluded images. We propose characterizing, empirically, the algorithmic limits by finding a minimal recognizable patch (MRP) that is by itself sufficient to recognize the image. A specialized deep network allows us to find the most info... |
2203.02883 | Zhiyi Huang | Zhiyi Huang and Xinkai Shu and Shuyi Yan | The Power of Multiple Choices in Online Stochastic Matching | STOC 2022 | null | null | null | cs.DS cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the power of multiple choices in online stochastic matching. Despite
a long line of research, existing algorithms still only consider two choices of
offline neighbors for each online vertex because of the technical challenge in
analyzing multiple choices. This paper introduces two approaches for designing
an... | [
{
"created": "Sun, 6 Mar 2022 06:00:03 GMT",
"version": "v1"
}
] | 2022-03-08 | [
[
"Huang",
"Zhiyi",
""
],
[
"Shu",
"Xinkai",
""
],
[
"Yan",
"Shuyi",
""
]
] | We study the power of multiple choices in online stochastic matching. Despite a long line of research, existing algorithms still only consider two choices of offline neighbors for each online vertex because of the technical challenge in analyzing multiple choices. This paper introduces two approaches for designing and ... |
2210.09802 | Xiaoyu Fan | Xiaoyu Fan, Kun Chen, Guosai Wang, Mingchun Zhuang, Yi Li and Wei Xu | NFGen: Automatic Non-linear Function Evaluation Code Generator for
General-purpose MPC Platforms | 20 pages, full version of CCS22 paper | CCS '22, Proceedings of the 2022 ACM SIGSAC Conference on Computer
and Communications Security, November 7--11, 2022, Los Angeles, CA, USA | 10.1145/3548606.3560565 | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Due to the absence of a library for non-linear function evaluation, so-called
general-purpose secure multi-party computation (MPC) are not as ''general'' as
MPC programmers expect. Prior arts either naively reuse plaintext methods,
resulting in suboptimal performance and even incorrect results, or handcraft ad
hoc ap... | [
{
"created": "Tue, 18 Oct 2022 12:25:22 GMT",
"version": "v1"
}
] | 2022-10-19 | [
[
"Fan",
"Xiaoyu",
""
],
[
"Chen",
"Kun",
""
],
[
"Wang",
"Guosai",
""
],
[
"Zhuang",
"Mingchun",
""
],
[
"Li",
"Yi",
""
],
[
"Xu",
"Wei",
""
]
] | Due to the absence of a library for non-linear function evaluation, so-called general-purpose secure multi-party computation (MPC) are not as ''general'' as MPC programmers expect. Prior arts either naively reuse plaintext methods, resulting in suboptimal performance and even incorrect results, or handcraft ad hoc appr... |
1702.00353 | Damien Woods | Pierre-\'Etienne Meunier and Damien Woods | The non-cooperative tile assembly model is not intrinsically universal
or capable of bounded Turing machine simulation | Extended version of STOC 2017 paper | null | null | null | cs.CC cs.CG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The field of algorithmic self-assembly is concerned with the computational
and expressive power of nanoscale self-assembling molecular systems. In the
well-studied cooperative, or temperature 2, abstract tile assembly model it is
known that there is a tile set to simulate any Turing machine and an
intrinsically unive... | [
{
"created": "Wed, 1 Feb 2017 16:55:41 GMT",
"version": "v1"
},
{
"created": "Tue, 30 May 2017 17:13:57 GMT",
"version": "v2"
}
] | 2017-05-31 | [
[
"Meunier",
"Pierre-Étienne",
""
],
[
"Woods",
"Damien",
""
]
] | The field of algorithmic self-assembly is concerned with the computational and expressive power of nanoscale self-assembling molecular systems. In the well-studied cooperative, or temperature 2, abstract tile assembly model it is known that there is a tile set to simulate any Turing machine and an intrinsically univers... |
1805.04599 | Joshua Daymude | Sarah Cannon and Joshua J. Daymude and Cem Gokmen and Dana Randall and
Andr\'ea W. Richa | A Local Stochastic Algorithm for Separation in Heterogeneous
Self-Organizing Particle Systems | null | null | null | null | cs.DC cs.DS cs.ET math-ph math.MP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present and rigorously analyze the behavior of a distributed, stochastic
algorithm for separation and integration in self-organizing particle systems,
an abstraction of programmable matter. Such systems are composed of individual
computational particles with limited memory, strictly local communication
abilities, ... | [
{
"created": "Fri, 11 May 2018 21:46:59 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Jun 2019 04:41:19 GMT",
"version": "v2"
}
] | 2019-06-06 | [
[
"Cannon",
"Sarah",
""
],
[
"Daymude",
"Joshua J.",
""
],
[
"Gokmen",
"Cem",
""
],
[
"Randall",
"Dana",
""
],
[
"Richa",
"Andréa W.",
""
]
] | We present and rigorously analyze the behavior of a distributed, stochastic algorithm for separation and integration in self-organizing particle systems, an abstraction of programmable matter. Such systems are composed of individual computational particles with limited memory, strictly local communication abilities, an... |
2110.14573 | Chao Cao | Chao Cao, Hongbiao Zhu, Fan Yang, Yukun Xia, Howie Choset, Jean Oh, Ji
Zhang | Autonomous Exploration Development Environment and the Planning
Algorithms | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Autonomous Exploration Development Environment is an open-source repository
released to facilitate the development of high-level planning algorithms and
integration of complete autonomous navigation systems. The repository contains
representative simulation environment models, fundamental navigation modules,
e.g., lo... | [
{
"created": "Wed, 27 Oct 2021 16:42:54 GMT",
"version": "v1"
}
] | 2021-10-28 | [
[
"Cao",
"Chao",
""
],
[
"Zhu",
"Hongbiao",
""
],
[
"Yang",
"Fan",
""
],
[
"Xia",
"Yukun",
""
],
[
"Choset",
"Howie",
""
],
[
"Oh",
"Jean",
""
],
[
"Zhang",
"Ji",
""
]
] | Autonomous Exploration Development Environment is an open-source repository released to facilitate the development of high-level planning algorithms and integration of complete autonomous navigation systems. The repository contains representative simulation environment models, fundamental navigation modules, e.g., loca... |
1408.5980 | EPTCS | Ornela Dardha (School of Computing Science, University of Glasgow) | Recursive Session Types Revisited | In Proceedings BEAT 2014, arXiv:1408.5564 | EPTCS 162, 2014, pp. 27-34 | 10.4204/EPTCS.162.4 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Session types model structured communication-based programming. In
particular, binary session types for the pi-calculus describe communication
between exactly two participants in a distributed scenario. Adding sessions to
the pi-calculus means augmenting it with type and term constructs. In a
previous paper, we tried... | [
{
"created": "Tue, 26 Aug 2014 02:15:51 GMT",
"version": "v1"
}
] | 2014-08-27 | [
[
"Dardha",
"Ornela",
"",
"School of Computing Science, University of Glasgow"
]
] | Session types model structured communication-based programming. In particular, binary session types for the pi-calculus describe communication between exactly two participants in a distributed scenario. Adding sessions to the pi-calculus means augmenting it with type and term constructs. In a previous paper, we tried t... |
2408.00741 | Jovan Stojkovic | Jovan Stojkovic and Chaojie Zhang and \'I\~nigo Goiri and Josep
Torrellas and Esha Choukse | DynamoLLM: Designing LLM Inference Clusters for Performance and Energy
Efficiency | null | null | null | null | cs.AI cs.AR cs.DC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The rapid evolution and widespread adoption of generative large language
models (LLMs) have made them a pivotal workload in various applications. Today,
LLM inference clusters receive a large number of queries with strict Service
Level Objectives (SLOs). To achieve the desired performance, these models
execute on pow... | [
{
"created": "Thu, 1 Aug 2024 17:40:45 GMT",
"version": "v1"
}
] | 2024-08-02 | [
[
"Stojkovic",
"Jovan",
""
],
[
"Zhang",
"Chaojie",
""
],
[
"Goiri",
"Íñigo",
""
],
[
"Torrellas",
"Josep",
""
],
[
"Choukse",
"Esha",
""
]
] | The rapid evolution and widespread adoption of generative large language models (LLMs) have made them a pivotal workload in various applications. Today, LLM inference clusters receive a large number of queries with strict Service Level Objectives (SLOs). To achieve the desired performance, these models execute on power... |
2408.06731 | Angus Williams | Angus R. Williams, Liam Burke-Moore, Ryan Sze-Yin Chan, Florence E.
Enock, Federico Nanni, Tvesha Sippy, Yi-Ling Chung, Evelina Gabasova, Kobi
Hackenburg, Jonathan Bright | Large language models can consistently generate high-quality content for
election disinformation operations | null | null | null | null | cs.CY cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Advances in large language models have raised concerns about their potential
use in generating compelling election disinformation at scale. This study
presents a two-part investigation into the capabilities of LLMs to automate
stages of an election disinformation operation. First, we introduce DisElect, a
novel evalu... | [
{
"created": "Tue, 13 Aug 2024 08:45:34 GMT",
"version": "v1"
}
] | 2024-08-14 | [
[
"Williams",
"Angus R.",
""
],
[
"Burke-Moore",
"Liam",
""
],
[
"Chan",
"Ryan Sze-Yin",
""
],
[
"Enock",
"Florence E.",
""
],
[
"Nanni",
"Federico",
""
],
[
"Sippy",
"Tvesha",
""
],
[
"Chung",
"Yi-Ling",
""
... | Advances in large language models have raised concerns about their potential use in generating compelling election disinformation at scale. This study presents a two-part investigation into the capabilities of LLMs to automate stages of an election disinformation operation. First, we introduce DisElect, a novel evaluat... |
2002.03016 | Aaron Kandel | Aaron Kandel, Scott J. Moura | Safe Wasserstein Constrained Deep Q-Learning | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a distributionally robust Q-Learning algorithm (DrQ)
which leverages Wasserstein ambiguity sets to provide idealistic probabilistic
out-of-sample safety guarantees during online learning. First, we follow past
work by separating the constraint functions from the principal objective to
create a hie... | [
{
"created": "Fri, 7 Feb 2020 21:23:46 GMT",
"version": "v1"
},
{
"created": "Sun, 14 Jun 2020 20:08:04 GMT",
"version": "v2"
},
{
"created": "Wed, 13 Oct 2021 22:23:09 GMT",
"version": "v3"
},
{
"created": "Mon, 25 Oct 2021 20:13:22 GMT",
"version": "v4"
}
] | 2021-10-27 | [
[
"Kandel",
"Aaron",
""
],
[
"Moura",
"Scott J.",
""
]
] | This paper presents a distributionally robust Q-Learning algorithm (DrQ) which leverages Wasserstein ambiguity sets to provide idealistic probabilistic out-of-sample safety guarantees during online learning. First, we follow past work by separating the constraint functions from the principal objective to create a hiera... |
1209.2693 | Daniil Ryabko | Ronald Ortner, Daniil Ryabko, Peter Auer, R\'emi Munos | Regret Bounds for Restless Markov Bandits | In proceedings of The 23rd International Conference on Algorithmic
Learning Theory (ALT 2012) | Proceedings of ALT, Lyon, France, LNCS 7568, pp.214-228, 2012 | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the restless Markov bandit problem, in which the state of each
arm evolves according to a Markov process independently of the learner's
actions. We suggest an algorithm that after $T$ steps achieves
$\tilde{O}(\sqrt{T})$ regret with respect to the best policy that knows the
distributions of all arms. No a... | [
{
"created": "Wed, 12 Sep 2012 19:14:21 GMT",
"version": "v1"
}
] | 2012-10-23 | [
[
"Ortner",
"Ronald",
""
],
[
"Ryabko",
"Daniil",
""
],
[
"Auer",
"Peter",
""
],
[
"Munos",
"Rémi",
""
]
] | We consider the restless Markov bandit problem, in which the state of each arm evolves according to a Markov process independently of the learner's actions. We suggest an algorithm that after $T$ steps achieves $\tilde{O}(\sqrt{T})$ regret with respect to the best policy that knows the distributions of all arms. No ass... |
2402.07061 | Hung P. Hoang | Sophia Heimann, Hung P. Hoang, Stefan Hougardy | The $k$-Opt algorithm for the Traveling Salesman Problem has exponential
running time for $k \ge 5$ | Appeared in ICALP 2024 | null | null | null | cs.DS cs.DM math.CO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The $k$-Opt algorithm is a local search algorithm for the Traveling Salesman
Problem. Starting with an initial tour, it iteratively replaces at most $k$
edges in the tour with the same number of edges to obtain a better tour.
Krentel (FOCS 1989) showed that the Traveling Salesman Problem with the $k$-Opt
neighborhood... | [
{
"created": "Sat, 10 Feb 2024 22:35:40 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Jun 2024 15:37:49 GMT",
"version": "v2"
}
] | 2024-06-14 | [
[
"Heimann",
"Sophia",
""
],
[
"Hoang",
"Hung P.",
""
],
[
"Hougardy",
"Stefan",
""
]
] | The $k$-Opt algorithm is a local search algorithm for the Traveling Salesman Problem. Starting with an initial tour, it iteratively replaces at most $k$ edges in the tour with the same number of edges to obtain a better tour. Krentel (FOCS 1989) showed that the Traveling Salesman Problem with the $k$-Opt neighborhood i... |
2205.12703 | Marc Zeitoun | Thomas Place and Marc Zeitoun | All about unambiguous polynomial closure | null | TheoretiCS, Volume 2 (January 10, 2024) theoretics:9932 | 10.46298/theoretics.23.11 | null | cs.FL | http://creativecommons.org/licenses/by/4.0/ | We study a standard operator on classes of languages: unambiguous polynomial
closure. We prove that for every class C of regular languages satisfying mild
properties, the membership problem for its unambiguous polynomial closure
UPol(C) reduces to the same problem for C. We also show that unambiguous
polynomial closu... | [
{
"created": "Wed, 25 May 2022 11:59:46 GMT",
"version": "v1"
},
{
"created": "Sun, 14 Aug 2022 15:34:00 GMT",
"version": "v2"
},
{
"created": "Thu, 21 Dec 2023 16:06:56 GMT",
"version": "v3"
},
{
"created": "Fri, 22 Dec 2023 17:30:16 GMT",
"version": "v4"
}
] | 2024-02-14 | [
[
"Place",
"Thomas",
""
],
[
"Zeitoun",
"Marc",
""
]
] | We study a standard operator on classes of languages: unambiguous polynomial closure. We prove that for every class C of regular languages satisfying mild properties, the membership problem for its unambiguous polynomial closure UPol(C) reduces to the same problem for C. We also show that unambiguous polynomial closure... |
1311.2820 | Vasilis Syrgkanis | Nikhil R. Devanur, Jamie Morgenstern, Vasilis Syrgkanis | Draft Auctions | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce draft auctions, which is a sequential auction format where at
each iteration players bid for the right to buy items at a fixed price. We show
that draft auctions offer an exponential improvement in social welfare at
equilibrium over sequential item auctions where predetermined items are
auctioned at each... | [
{
"created": "Tue, 12 Nov 2013 15:59:15 GMT",
"version": "v1"
}
] | 2013-11-13 | [
[
"Devanur",
"Nikhil R.",
""
],
[
"Morgenstern",
"Jamie",
""
],
[
"Syrgkanis",
"Vasilis",
""
]
] | We introduce draft auctions, which is a sequential auction format where at each iteration players bid for the right to buy items at a fixed price. We show that draft auctions offer an exponential improvement in social welfare at equilibrium over sequential item auctions where predetermined items are auctioned at each t... |
2406.15244 | Rui Pan | Yuxing Liu, Rui Pan, Tong Zhang | Large Batch Analysis for Adagrad Under Anisotropic Smoothness | null | null | null | null | cs.LG math.OC | http://creativecommons.org/licenses/by/4.0/ | Adaptive gradient algorithms have been widely adopted in training large-scale
deep neural networks, especially large foundation models. Despite their huge
success in practice, their theoretical advantages over stochastic gradient
descent (SGD) have not been fully understood, especially in the large
batch-size setting... | [
{
"created": "Fri, 21 Jun 2024 15:29:31 GMT",
"version": "v1"
}
] | 2024-06-24 | [
[
"Liu",
"Yuxing",
""
],
[
"Pan",
"Rui",
""
],
[
"Zhang",
"Tong",
""
]
] | Adaptive gradient algorithms have been widely adopted in training large-scale deep neural networks, especially large foundation models. Despite their huge success in practice, their theoretical advantages over stochastic gradient descent (SGD) have not been fully understood, especially in the large batch-size setting c... |
2109.03481 | Shusheng Xu | Shusheng Xu, Xingxing Zhang, Yi Wu and Furu Wei | Sequence Level Contrastive Learning for Text Summarization | 2 figures, 12 tables | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Contrastive learning models have achieved great success in unsupervised
visual representation learning, which maximize the similarities between feature
representations of different views of the same image, while minimize the
similarities between feature representations of views of different images. In
text summarizat... | [
{
"created": "Wed, 8 Sep 2021 08:00:36 GMT",
"version": "v1"
},
{
"created": "Fri, 24 Sep 2021 13:21:16 GMT",
"version": "v2"
},
{
"created": "Sun, 9 Jan 2022 06:04:10 GMT",
"version": "v3"
},
{
"created": "Wed, 12 Jan 2022 03:29:07 GMT",
"version": "v4"
}
] | 2022-01-13 | [
[
"Xu",
"Shusheng",
""
],
[
"Zhang",
"Xingxing",
""
],
[
"Wu",
"Yi",
""
],
[
"Wei",
"Furu",
""
]
] | Contrastive learning models have achieved great success in unsupervised visual representation learning, which maximize the similarities between feature representations of different views of the same image, while minimize the similarities between feature representations of views of different images. In text summarizatio... |
2404.14571 | Ke Li | Ke Li | A Survey of Decomposition-Based Evolutionary Multi-Objective
Optimization: Part I-Past and Future | 40 pages, 8 figures. arXiv admin note: substantial text overlap with
arXiv:2108.09588 | null | null | COLALab Report #2024006 | cs.NE | http://creativecommons.org/licenses/by/4.0/ | Decomposition has been the mainstream approach in classic mathematical
programming for multi-objective optimization and multi-criterion
decision-making. However, it was not properly studied in the context of
evolutionary multi-objective optimization (EMO) until the development of
multi-objective evolutionary algorith... | [
{
"created": "Mon, 22 Apr 2024 20:34:46 GMT",
"version": "v1"
}
] | 2024-04-24 | [
[
"Li",
"Ke",
""
]
] | Decomposition has been the mainstream approach in classic mathematical programming for multi-objective optimization and multi-criterion decision-making. However, it was not properly studied in the context of evolutionary multi-objective optimization (EMO) until the development of multi-objective evolutionary algorithm ... |
cs/0702139 | Alexander Kholosha | Tor Helleseth and Alexander Kholosha and Geir Jarle Ness | Characterization of $m$-Sequences of Lengths $2^{2k}-1$ and $2^k-1$ with
Three-Valued Crosscorrelation | 23 pages | null | null | null | cs.CR cs.DM | null | Considered is the distribution of the crosscorrelation between $m$-sequences
of length $2^m-1$, where $m=2k$, and $m$-sequences of shorter length $2^k-1$.
New pairs of $m$-sequences with three-valued crosscorrelation are found and the
complete correlation distribution is determined. Finally, we conjecture that
there ... | [
{
"created": "Fri, 23 Feb 2007 16:01:38 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Helleseth",
"Tor",
""
],
[
"Kholosha",
"Alexander",
""
],
[
"Ness",
"Geir Jarle",
""
]
] | Considered is the distribution of the crosscorrelation between $m$-sequences of length $2^m-1$, where $m=2k$, and $m$-sequences of shorter length $2^k-1$. New pairs of $m$-sequences with three-valued crosscorrelation are found and the complete correlation distribution is determined. Finally, we conjecture that there ar... |
1912.09657 | Ran Averbuch | Ran Tamir (Averbuch), Neri Merhav, Nir Weinberger, Albert Guillen i
Fabregas | Large Deviations Behavior of the Logarithmic Error Probability of Random
Codes | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work studies the deviations of the error exponent of the constant
composition code ensemble around its expectation, known as the error exponent
of the typical random code (TRC). In particular, it is shown that the
probability of randomly drawing a codebook whose error exponent is smaller than
the TRC exponent is... | [
{
"created": "Fri, 20 Dec 2019 06:39:55 GMT",
"version": "v1"
}
] | 2019-12-23 | [
[
"Tamir",
"Ran",
"",
"Averbuch"
],
[
"Merhav",
"Neri",
""
],
[
"Weinberger",
"Nir",
""
],
[
"Fabregas",
"Albert Guillen i",
""
]
] | This work studies the deviations of the error exponent of the constant composition code ensemble around its expectation, known as the error exponent of the typical random code (TRC). In particular, it is shown that the probability of randomly drawing a codebook whose error exponent is smaller than the TRC exponent is e... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.