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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1404.3840 | Chaochao Lu | Chaochao Lu, Xiaoou Tang | Surpassing Human-Level Face Verification Performance on LFW with
GaussianFace | Appearing in Proceedings of the 29th AAAI Conference on Artificial
Intelligence (AAAI-15), Oral Presentation | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Face verification remains a challenging problem in very complex conditions
with large variations such as pose, illumination, expression, and occlusions.
This problem is exacerbated when we rely unrealistically on a single training
data source, which is often insufficient to cover the intrinsically complex
face variat... | [
{
"created": "Tue, 15 Apr 2014 07:51:23 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Jun 2014 14:37:38 GMT",
"version": "v2"
},
{
"created": "Sat, 20 Dec 2014 03:37:36 GMT",
"version": "v3"
}
] | 2014-12-23 | [
[
"Lu",
"Chaochao",
""
],
[
"Tang",
"Xiaoou",
""
]
] | Face verification remains a challenging problem in very complex conditions with large variations such as pose, illumination, expression, and occlusions. This problem is exacerbated when we rely unrealistically on a single training data source, which is often insufficient to cover the intrinsically complex face variatio... |
2401.00910 | Saravanabalagi Ramachandran | Saravanabalagi Ramachandran and Nathaniel Cibik and Ganesh Sistu and
John McDonald | WoodScape Motion Segmentation for Autonomous Driving -- CVPR 2023 OmniCV
Workshop Challenge | CVPR 2023 OmniCV Workshop Challenge | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Motion segmentation is a complex yet indispensable task in autonomous
driving. The challenges introduced by the ego-motion of the cameras, radial
distortion in fisheye lenses, and the need for temporal consistency make the
task more complicated, rendering traditional and standard Convolutional Neural
Network (CNN) ap... | [
{
"created": "Sun, 31 Dec 2023 23:53:50 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Jan 2024 16:28:58 GMT",
"version": "v2"
}
] | 2024-01-17 | [
[
"Ramachandran",
"Saravanabalagi",
""
],
[
"Cibik",
"Nathaniel",
""
],
[
"Sistu",
"Ganesh",
""
],
[
"McDonald",
"John",
""
]
] | Motion segmentation is a complex yet indispensable task in autonomous driving. The challenges introduced by the ego-motion of the cameras, radial distortion in fisheye lenses, and the need for temporal consistency make the task more complicated, rendering traditional and standard Convolutional Neural Network (CNN) appr... |
2406.09804 | Arne Symons | Steven Colleman, Arne Symons, Victor J.B. Jung, Marian Verhelst | Optimizing Layer-Fused Scheduling of Transformer Networks on
Multi-accelerator Platforms | Accepted to ISQED2024 | null | null | null | cs.AR | http://creativecommons.org/licenses/by/4.0/ | The impact of transformer networks is booming, yet, they come with
significant computational complexity. It is therefore essential to understand
how to optimally map and execute these networks on modern neural processor
hardware. So far, literature on transformer scheduling optimization has been
focusing on deploymen... | [
{
"created": "Fri, 14 Jun 2024 07:56:37 GMT",
"version": "v1"
}
] | 2024-06-17 | [
[
"Colleman",
"Steven",
""
],
[
"Symons",
"Arne",
""
],
[
"Jung",
"Victor J. B.",
""
],
[
"Verhelst",
"Marian",
""
]
] | The impact of transformer networks is booming, yet, they come with significant computational complexity. It is therefore essential to understand how to optimally map and execute these networks on modern neural processor hardware. So far, literature on transformer scheduling optimization has been focusing on deployment ... |
2004.00055 | Simon DeDeo | Scott Viteri and Simon DeDeo | Epistemic Phase Transitions in Mathematical Proofs | 22 pages, 5 figures. Matches published version. Supplementary
information available at
https://www.sciencedirect.com/science/article/pii/S0010027722001081 | Cognition, 225, 105120 (2022) | 10.1016/j.cognition.2022.105120 | null | cs.SC cs.AI math.HO physics.soc-ph q-bio.NC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mathematical proofs are both paradigms of certainty and some of the most
explicitly-justified arguments that we have in the cultural record. Their very
explicitness, however, leads to a paradox, because the probability of error
grows exponentially as the argument expands. When a mathematician encounters a
proof, how ... | [
{
"created": "Tue, 31 Mar 2020 18:39:56 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Apr 2022 15:25:22 GMT",
"version": "v2"
}
] | 2022-04-13 | [
[
"Viteri",
"Scott",
""
],
[
"DeDeo",
"Simon",
""
]
] | Mathematical proofs are both paradigms of certainty and some of the most explicitly-justified arguments that we have in the cultural record. Their very explicitness, however, leads to a paradox, because the probability of error grows exponentially as the argument expands. When a mathematician encounters a proof, how do... |
2404.04068 | Filip Seitl | Filip Seitl, Tom\'a\v{s} Kov\'a\v{r}\'ik, Soheyla Mirshahi, Jan
Kry\v{s}t\r{u}fek, Rastislav Dujava, Mat\'u\v{s} Ondrei\v{c}ka, Herbert
Ullrich, Petr Gronat | Assessing the quality of information extraction | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Advances in large language models have notably enhanced the efficiency of
information extraction from unstructured and semi-structured data sources. As
these technologies become integral to various applications, establishing an
objective measure for the quality of information extraction becomes imperative.
However, t... | [
{
"created": "Fri, 5 Apr 2024 12:51:48 GMT",
"version": "v1"
},
{
"created": "Wed, 22 May 2024 09:04:52 GMT",
"version": "v2"
}
] | 2024-05-24 | [
[
"Seitl",
"Filip",
""
],
[
"Kovářík",
"Tomáš",
""
],
[
"Mirshahi",
"Soheyla",
""
],
[
"Kryštůfek",
"Jan",
""
],
[
"Dujava",
"Rastislav",
""
],
[
"Ondreička",
"Matúš",
""
],
[
"Ullrich",
"Herbert",
""
],
... | Advances in large language models have notably enhanced the efficiency of information extraction from unstructured and semi-structured data sources. As these technologies become integral to various applications, establishing an objective measure for the quality of information extraction becomes imperative. However, the... |
1910.01713 | Vadim Arzamasov | Vadim Arzamasov and Klemens B\"ohm | REDS: Rule Extraction for Discovering Scenarios | null | null | 10.1145/3448016.3457301 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scenario discovery is the process of finding areas of interest, known as
scenarios, in data spaces resulting from simulations. For instance, one might
search for conditions, i.e., inputs of the simulation model, where the system
is unstable. Subgroup discovery methods are commonly used for scenario
discovery. They fi... | [
{
"created": "Thu, 3 Oct 2019 20:40:18 GMT",
"version": "v1"
},
{
"created": "Thu, 5 May 2022 11:13:58 GMT",
"version": "v2"
}
] | 2022-05-06 | [
[
"Arzamasov",
"Vadim",
""
],
[
"Böhm",
"Klemens",
""
]
] | Scenario discovery is the process of finding areas of interest, known as scenarios, in data spaces resulting from simulations. For instance, one might search for conditions, i.e., inputs of the simulation model, where the system is unstable. Subgroup discovery methods are commonly used for scenario discovery. They find... |
2206.07082 | Yunwen Lei | Yunwen Lei | Stability and Generalization of Stochastic Optimization with Nonconvex
and Nonsmooth Problems | To appear in COLT 2023 | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Stochastic optimization has found wide applications in minimizing objective
functions in machine learning, which motivates a lot of theoretical studies to
understand its practical success. Most of existing studies focus on the
convergence of optimization errors, while the generalization analysis of
stochastic optimiz... | [
{
"created": "Tue, 14 Jun 2022 18:14:30 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Jun 2023 09:07:46 GMT",
"version": "v2"
},
{
"created": "Tue, 18 Jul 2023 02:00:40 GMT",
"version": "v3"
}
] | 2023-07-19 | [
[
"Lei",
"Yunwen",
""
]
] | Stochastic optimization has found wide applications in minimizing objective functions in machine learning, which motivates a lot of theoretical studies to understand its practical success. Most of existing studies focus on the convergence of optimization errors, while the generalization analysis of stochastic optimizat... |
1711.00520 | Yuxuan Wang | Yuxuan Wang, RJ Skerry-Ryan, Ying Xiao, Daisy Stanton, Joel Shor, Eric
Battenberg, Rob Clark, Rif A. Saurous | Uncovering Latent Style Factors for Expressive Speech Synthesis | Submitted to NIPS ML4Audio workshop and ICASSP | null | null | null | cs.CL cs.SD | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Prosodic modeling is a core problem in speech synthesis. The key challenge is
producing desirable prosody from textual input containing only phonetic
information. In this preliminary study, we introduce the concept of "style
tokens" in Tacotron, a recently proposed end-to-end neural speech synthesis
model. Using styl... | [
{
"created": "Wed, 1 Nov 2017 19:40:00 GMT",
"version": "v1"
}
] | 2017-11-03 | [
[
"Wang",
"Yuxuan",
""
],
[
"Skerry-Ryan",
"RJ",
""
],
[
"Xiao",
"Ying",
""
],
[
"Stanton",
"Daisy",
""
],
[
"Shor",
"Joel",
""
],
[
"Battenberg",
"Eric",
""
],
[
"Clark",
"Rob",
""
],
[
"Saurous",
... | Prosodic modeling is a core problem in speech synthesis. The key challenge is producing desirable prosody from textual input containing only phonetic information. In this preliminary study, we introduce the concept of "style tokens" in Tacotron, a recently proposed end-to-end neural speech synthesis model. Using style ... |
1504.01949 | Fran\c{c}ois Dross | Fran\c{c}ois Dross, Mickael Montassier and Alexandre Pinlou | A lower bound on the order of the largest induced forest in planar
graphs with high girth | 12 pages, 6 figures. arXiv admin note: text overlap with
arXiv:1409.1348 | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give here new upper bounds on the size of a smallest feedback vertex set
in planar graphs with high girth. In particular, we prove that a planar graph
with girth $g$ and size $m$ has a feedback vertex set of size at most
$\frac{4m}{3g}$, improving the trivial bound of $\frac{2m}{g}$. We also prove
that every $2$-c... | [
{
"created": "Wed, 8 Apr 2015 13:16:17 GMT",
"version": "v1"
}
] | 2015-04-09 | [
[
"Dross",
"François",
""
],
[
"Montassier",
"Mickael",
""
],
[
"Pinlou",
"Alexandre",
""
]
] | We give here new upper bounds on the size of a smallest feedback vertex set in planar graphs with high girth. In particular, we prove that a planar graph with girth $g$ and size $m$ has a feedback vertex set of size at most $\frac{4m}{3g}$, improving the trivial bound of $\frac{2m}{g}$. We also prove that every $2$-con... |
2002.00837 | Enyan Dai | Enyan Dai, Yiwei Sun, Suhang Wang | Ginger Cannot Cure Cancer: Battling Fake Health News with a
Comprehensive Data Repository | null | null | null | null | cs.SI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nowadays, Internet is a primary source of attaining health information.
Massive fake health news which is spreading over the Internet, has become a
severe threat to public health. Numerous studies and research works have been
done in fake news detection domain, however, few of them are designed to cope
with the chall... | [
{
"created": "Mon, 27 Jan 2020 17:27:58 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Mar 2020 06:08:08 GMT",
"version": "v2"
}
] | 2020-03-31 | [
[
"Dai",
"Enyan",
""
],
[
"Sun",
"Yiwei",
""
],
[
"Wang",
"Suhang",
""
]
] | Nowadays, Internet is a primary source of attaining health information. Massive fake health news which is spreading over the Internet, has become a severe threat to public health. Numerous studies and research works have been done in fake news detection domain, however, few of them are designed to cope with the challen... |
1805.07256 | Petr Svarny | Petr \v{S}varn\'y and Mat\v{e}j Hoffmann | Safety of human-robot interaction through tactile sensors and
peripersonal space representations | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Human-robot collaboration including close physical human-robot interaction
(pHRI) is a current trend in industry and also science. The safety guidelines
prescribe two modes of safety: (i) power and force limitation and (ii) speed
and separation monitoring. We examine the potential of robots equipped with
artificial s... | [
{
"created": "Fri, 18 May 2018 14:55:08 GMT",
"version": "v1"
}
] | 2018-05-21 | [
[
"Švarný",
"Petr",
""
],
[
"Hoffmann",
"Matěj",
""
]
] | Human-robot collaboration including close physical human-robot interaction (pHRI) is a current trend in industry and also science. The safety guidelines prescribe two modes of safety: (i) power and force limitation and (ii) speed and separation monitoring. We examine the potential of robots equipped with artificial sen... |
cs/0701166 | Jim Gray | Jim Gray, Catharine van Ingen | Empirical Measurements of Disk Failure Rates and Error Rates | null | null | null | MSR-TR-2005-166 | cs.DB cs.AR | null | The SATA advertised bit error rate of one error in 10 terabytes is
frightening. We moved 2 PB through low-cost hardware and saw five disk read
error events, several controller failures, and many system reboots caused by
security patches. We conclude that SATA uncorrectable read errors are not yet a
dominant system-fa... | [
{
"created": "Fri, 26 Jan 2007 00:29:02 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Gray",
"Jim",
""
],
[
"van Ingen",
"Catharine",
""
]
] | The SATA advertised bit error rate of one error in 10 terabytes is frightening. We moved 2 PB through low-cost hardware and saw five disk read error events, several controller failures, and many system reboots caused by security patches. We conclude that SATA uncorrectable read errors are not yet a dominant system-faul... |
1604.01200 | Zhong-Yuan Zhang | Zhong-Yuan Zhang and Yujie Gai and Yu-Fei Wang and Hui-Min Cheng and
Xin Liu | On Equivalence of Likelihood Maximization of Stochastic Block Model and
Constrained Nonnegative Matrix Factorization | null | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Community structures detection in complex network is important for
understanding not only the topological structures of the network, but also the
functions of it. Stochastic block model and nonnegative matrix factorization
are two widely used methods for community detection, which are proposed from
different perspect... | [
{
"created": "Tue, 5 Apr 2016 09:47:34 GMT",
"version": "v1"
},
{
"created": "Tue, 26 Apr 2016 14:51:32 GMT",
"version": "v2"
},
{
"created": "Thu, 8 Dec 2016 14:40:41 GMT",
"version": "v3"
},
{
"created": "Wed, 19 Apr 2017 08:17:29 GMT",
"version": "v4"
},
{
"cre... | 2017-07-11 | [
[
"Zhang",
"Zhong-Yuan",
""
],
[
"Gai",
"Yujie",
""
],
[
"Wang",
"Yu-Fei",
""
],
[
"Cheng",
"Hui-Min",
""
],
[
"Liu",
"Xin",
""
]
] | Community structures detection in complex network is important for understanding not only the topological structures of the network, but also the functions of it. Stochastic block model and nonnegative matrix factorization are two widely used methods for community detection, which are proposed from different perspectiv... |
1908.09961 | Kien Do | Kien Do and Truyen Tran | Theory and Evaluation Metrics for Learning Disentangled Representations | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We make two theoretical contributions to disentanglement learning by (a)
defining precise semantics of disentangled representations, and (b)
establishing robust metrics for evaluation. First, we characterize the concept
"disentangled representations" used in supervised and unsupervised methods
along three dimensions-... | [
{
"created": "Mon, 26 Aug 2019 23:55:11 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Feb 2020 21:08:15 GMT",
"version": "v2"
},
{
"created": "Thu, 18 Mar 2021 22:59:04 GMT",
"version": "v3"
}
] | 2021-03-22 | [
[
"Do",
"Kien",
""
],
[
"Tran",
"Truyen",
""
]
] | We make two theoretical contributions to disentanglement learning by (a) defining precise semantics of disentangled representations, and (b) establishing robust metrics for evaluation. First, we characterize the concept "disentangled representations" used in supervised and unsupervised methods along three dimensions-in... |
2210.12776 | Boel Nelson | Boel Nelson, Elena Pagnin, Aslan Askarov | Metadata Privacy Beyond Tunneling for Instant Messaging | To appear at the 9th IEEE European Symposium on Security and Privacy | null | null | null | cs.CR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Transport layer data leaks metadata unintentionally -- such as who
communicates with whom. While tools for strong transport layer privacy exist,
they have adoption obstacles, including performance overheads incompatible with
mobile devices. We posit that by changing the objective of metadata privacy for
$\textit{all ... | [
{
"created": "Sun, 23 Oct 2022 16:32:35 GMT",
"version": "v1"
},
{
"created": "Thu, 25 May 2023 14:50:47 GMT",
"version": "v2"
},
{
"created": "Wed, 6 Mar 2024 15:29:00 GMT",
"version": "v3"
}
] | 2024-03-07 | [
[
"Nelson",
"Boel",
""
],
[
"Pagnin",
"Elena",
""
],
[
"Askarov",
"Aslan",
""
]
] | Transport layer data leaks metadata unintentionally -- such as who communicates with whom. While tools for strong transport layer privacy exist, they have adoption obstacles, including performance overheads incompatible with mobile devices. We posit that by changing the objective of metadata privacy for $\textit{all tr... |
1908.01887 | Yusuke Urakami | Yusuke Urakami, Alec Hodgkinson, Casey Carlin, Randall Leu, Luca
Rigazio, Pieter Abbeel | DoorGym: A Scalable Door Opening Environment And Baseline Agent | Accepted to NeurIPS2019 Deep Reinforcement Learning Workshop. Full
version | null | null | null | cs.RO cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In order to practically implement the door opening task, a policy ought to be
robust to a wide distribution of door types and environment settings.
Reinforcement Learning (RL) with Domain Randomization (DR) is a promising
technique to enforce policy generalization, however, there are only a few
accessible training en... | [
{
"created": "Mon, 5 Aug 2019 22:20:32 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Aug 2019 17:21:36 GMT",
"version": "v2"
},
{
"created": "Wed, 13 May 2020 07:56:55 GMT",
"version": "v3"
},
{
"created": "Tue, 24 May 2022 07:15:00 GMT",
"version": "v4"
}
] | 2022-05-25 | [
[
"Urakami",
"Yusuke",
""
],
[
"Hodgkinson",
"Alec",
""
],
[
"Carlin",
"Casey",
""
],
[
"Leu",
"Randall",
""
],
[
"Rigazio",
"Luca",
""
],
[
"Abbeel",
"Pieter",
""
]
] | In order to practically implement the door opening task, a policy ought to be robust to a wide distribution of door types and environment settings. Reinforcement Learning (RL) with Domain Randomization (DR) is a promising technique to enforce policy generalization, however, there are only a few accessible training envi... |
2002.11833 | Jean Harb | Jean Harb, Tom Schaul, Doina Precup and Pierre-Luc Bacon | Policy Evaluation Networks | 12 pages, 11 figures | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many reinforcement learning algorithms use value functions to guide the
search for better policies. These methods estimate the value of a single policy
while generalizing across many states. The core idea of this paper is to flip
this convention and estimate the value of many policies, for a single set of
states. Thi... | [
{
"created": "Wed, 26 Feb 2020 23:00:27 GMT",
"version": "v1"
}
] | 2020-02-28 | [
[
"Harb",
"Jean",
""
],
[
"Schaul",
"Tom",
""
],
[
"Precup",
"Doina",
""
],
[
"Bacon",
"Pierre-Luc",
""
]
] | Many reinforcement learning algorithms use value functions to guide the search for better policies. These methods estimate the value of a single policy while generalizing across many states. The core idea of this paper is to flip this convention and estimate the value of many policies, for a single set of states. This ... |
2304.08993 | Rui Li | Rui Li, Dong Gong, Wei Yin, Hao Chen, Yu Zhu, Kaixuan Wang, Xiaozhi
Chen, Jinqiu Sun, Yanning Zhang | Learning to Fuse Monocular and Multi-view Cues for Multi-frame Depth
Estimation in Dynamic Scenes | Accepted by CVPR 2023. Code and models are available at:
https://github.com/ruili3/dynamic-multiframe-depth | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-frame depth estimation generally achieves high accuracy relying on the
multi-view geometric consistency. When applied in dynamic scenes, e.g.,
autonomous driving, this consistency is usually violated in the dynamic areas,
leading to corrupted estimations. Many multi-frame methods handle dynamic areas
by identif... | [
{
"created": "Tue, 18 Apr 2023 13:55:24 GMT",
"version": "v1"
}
] | 2023-04-19 | [
[
"Li",
"Rui",
""
],
[
"Gong",
"Dong",
""
],
[
"Yin",
"Wei",
""
],
[
"Chen",
"Hao",
""
],
[
"Zhu",
"Yu",
""
],
[
"Wang",
"Kaixuan",
""
],
[
"Chen",
"Xiaozhi",
""
],
[
"Sun",
"Jinqiu",
""
],
... | Multi-frame depth estimation generally achieves high accuracy relying on the multi-view geometric consistency. When applied in dynamic scenes, e.g., autonomous driving, this consistency is usually violated in the dynamic areas, leading to corrupted estimations. Many multi-frame methods handle dynamic areas by identifyi... |
0708.3019 | Ananthanarayanan Chockalingam | D. Sreedhar, A. Chockalingam, B. Sundar Rajan | Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent
Cooperative Networks | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a
co-located multiple antenna setting need not be SSD in a distributed
cooperative communication setting. A relay network with N relays and a single
source-destination pair is called a partially-coherent relay channel (PCRC) if
the destination h... | [
{
"created": "Wed, 22 Aug 2007 13:58:36 GMT",
"version": "v1"
},
{
"created": "Sat, 29 Nov 2008 04:34:11 GMT",
"version": "v2"
}
] | 2008-11-29 | [
[
"Sreedhar",
"D.",
""
],
[
"Chockalingam",
"A.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] | Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has... |
2102.12621 | Ba Dung Le Dr | Ba Dung Le and Tanveer Zia | Discrete Distribution Estimation with Local Differential Privacy: A
Comparative Analysis | Accepted for publication to SPT-IoT 2021: The Fifth Workshop on
Security, Privacy and Trust in the Internet of Things | null | null | null | cs.CR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Local differential privacy is a promising privacy-preserving model for
statistical aggregation of user data that prevents user privacy leakage from
the data aggregator. This paper focuses on the problem of estimating the
distribution of discrete user values with Local differential privacy. We review
and present a com... | [
{
"created": "Thu, 25 Feb 2021 01:32:06 GMT",
"version": "v1"
}
] | 2021-02-26 | [
[
"Le",
"Ba Dung",
""
],
[
"Zia",
"Tanveer",
""
]
] | Local differential privacy is a promising privacy-preserving model for statistical aggregation of user data that prevents user privacy leakage from the data aggregator. This paper focuses on the problem of estimating the distribution of discrete user values with Local differential privacy. We review and present a compa... |
2005.06420 | James Henderson | James Henderson | The Unstoppable Rise of Computational Linguistics in Deep Learning | 13 pages. Accepted for publication at ACL 2020, in the theme track | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we trace the history of neural networks applied to natural
language understanding tasks, and identify key contributions which the nature
of language has made to the development of neural network architectures. We
focus on the importance of variable binding and its instantiation in
attention-based model... | [
{
"created": "Wed, 13 May 2020 16:51:02 GMT",
"version": "v1"
},
{
"created": "Sun, 17 May 2020 10:07:40 GMT",
"version": "v2"
},
{
"created": "Thu, 11 Jun 2020 07:58:28 GMT",
"version": "v3"
}
] | 2020-06-12 | [
[
"Henderson",
"James",
""
]
] | In this paper, we trace the history of neural networks applied to natural language understanding tasks, and identify key contributions which the nature of language has made to the development of neural network architectures. We focus on the importance of variable binding and its instantiation in attention-based models,... |
2303.05847 | Xuanhua Yang | Xuanhua Yang, Jianxin Zhao, Shaoguo Liu, Liang Wang and Bo Zheng | Gradient Coordination for Quantifying and Maximizing Knowledge
Transference in Multi-Task Learning | 5 pages, 3 figures | null | null | null | cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-task learning (MTL) has been widely applied in online advertising and
recommender systems. To address the negative transfer issue, recent studies
have proposed optimization methods that thoroughly focus on the gradient
alignment of directions or magnitudes. However, since prior study has proven
that both genera... | [
{
"created": "Fri, 10 Mar 2023 10:42:21 GMT",
"version": "v1"
}
] | 2023-03-13 | [
[
"Yang",
"Xuanhua",
""
],
[
"Zhao",
"Jianxin",
""
],
[
"Liu",
"Shaoguo",
""
],
[
"Wang",
"Liang",
""
],
[
"Zheng",
"Bo",
""
]
] | Multi-task learning (MTL) has been widely applied in online advertising and recommender systems. To address the negative transfer issue, recent studies have proposed optimization methods that thoroughly focus on the gradient alignment of directions or magnitudes. However, since prior study has proven that both general ... |
1806.09852 | EPTCS | Kasper Dokter (CWI), Farhad Arbab (CWI) | Treo: Textual Syntax for Reo Connectors | In Proceedings MeTRiD 2018, arXiv:1806.09330 | EPTCS 272, 2018, pp. 121-135 | 10.4204/EPTCS.272.10 | null | cs.PL cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reo is an interaction-centric model of concurrency for compositional
specification of communication and coordination protocols. Formal verification
tools exist to ensure correctness and compliance of protocols specified in Reo,
which can readily be (re)used in different applications, or composed into more
complex pro... | [
{
"created": "Tue, 26 Jun 2018 08:55:13 GMT",
"version": "v1"
}
] | 2018-06-27 | [
[
"Dokter",
"Kasper",
"",
"CWI"
],
[
"Arbab",
"Farhad",
"",
"CWI"
]
] | Reo is an interaction-centric model of concurrency for compositional specification of communication and coordination protocols. Formal verification tools exist to ensure correctness and compliance of protocols specified in Reo, which can readily be (re)used in different applications, or composed into more complex proto... |
1703.05539 | Sven Hug | Sven E. Hug, Martin P. Braendle | The coverage of Microsoft Academic: Analyzing the publication output of
a university | null | null | 10.1007/s11192-017-2535-3 | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This is the first detailed study on the coverage of Microsoft Academic (MA).
Based on the complete and verified publication list of a university, the
coverage of MA was assessed and compared with two benchmark databases, Scopus
and Web of Science (WoS), on the level of individual publications. Citation
counts were an... | [
{
"created": "Thu, 16 Mar 2017 09:56:33 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Apr 2017 23:29:36 GMT",
"version": "v2"
},
{
"created": "Thu, 11 May 2017 13:06:37 GMT",
"version": "v3"
},
{
"created": "Mon, 25 Sep 2017 17:42:22 GMT",
"version": "v4"
}
] | 2019-08-06 | [
[
"Hug",
"Sven E.",
""
],
[
"Braendle",
"Martin P.",
""
]
] | This is the first detailed study on the coverage of Microsoft Academic (MA). Based on the complete and verified publication list of a university, the coverage of MA was assessed and compared with two benchmark databases, Scopus and Web of Science (WoS), on the level of individual publications. Citation counts were anal... |
1911.03897 | Yaoyiran Li | Yaoyiran Li, Jing Jiang | Two-Headed Monster And Crossed Co-Attention Networks | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper presents some preliminary investigations of a new co-attention
mechanism in neural transduction models. We propose a paradigm, termed
Two-Headed Monster (THM), which consists of two symmetric encoder modules and
one decoder module connected with co-attention. As a specific and concrete
implementation of TH... | [
{
"created": "Sun, 10 Nov 2019 10:55:12 GMT",
"version": "v1"
}
] | 2019-11-12 | [
[
"Li",
"Yaoyiran",
""
],
[
"Jiang",
"Jing",
""
]
] | This paper presents some preliminary investigations of a new co-attention mechanism in neural transduction models. We propose a paradigm, termed Two-Headed Monster (THM), which consists of two symmetric encoder modules and one decoder module connected with co-attention. As a specific and concrete implementation of THM,... |
2309.12650 | Yixin Chen | Yixin Chen, Ourui Fu, Wenrui Shao, Zhaoheng Xie | FP-PET: Large Model, Multiple Loss And Focused Practice | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This study presents FP-PET, a comprehensive approach to medical image
segmentation with a focus on CT and PET images. Utilizing a dataset from the
AutoPet2023 Challenge, the research employs a variety of machine learning
models, including STUNet-large, SwinUNETR, and VNet, to achieve
state-of-the-art segmentation per... | [
{
"created": "Fri, 22 Sep 2023 06:44:28 GMT",
"version": "v1"
}
] | 2023-09-25 | [
[
"Chen",
"Yixin",
""
],
[
"Fu",
"Ourui",
""
],
[
"Shao",
"Wenrui",
""
],
[
"Xie",
"Zhaoheng",
""
]
] | This study presents FP-PET, a comprehensive approach to medical image segmentation with a focus on CT and PET images. Utilizing a dataset from the AutoPet2023 Challenge, the research employs a variety of machine learning models, including STUNet-large, SwinUNETR, and VNet, to achieve state-of-the-art segmentation perfo... |
1810.12646 | Uwe Reichel | Uwe D. Reichel and Katalin M\'ady and Jennifer Cole | Prosodic entrainment in dialog acts | This manuscript is under revision. Please contact the authors for
information about updates | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We examined prosodic entrainment in spoken dialogs separately for several
dialog acts in cooperative and competitive games. Entrainment was measured for
intonation features derived from a superpositional intonation stylization as
well as for rhythm features. The found differences can be related to the
cooperative or ... | [
{
"created": "Tue, 30 Oct 2018 10:53:42 GMT",
"version": "v1"
}
] | 2018-10-31 | [
[
"Reichel",
"Uwe D.",
""
],
[
"Mády",
"Katalin",
""
],
[
"Cole",
"Jennifer",
""
]
] | We examined prosodic entrainment in spoken dialogs separately for several dialog acts in cooperative and competitive games. Entrainment was measured for intonation features derived from a superpositional intonation stylization as well as for rhythm features. The found differences can be related to the cooperative or co... |
1210.5908 | Carlos Gershenson | Keith D. Farnsworth, John Nelson and Carlos Gershenson | Living is information processing: from molecules to global systems | 28 pages, 2 figures | Acta Biotheoretica, 61(2):203-222. 2013 | 10.1007/s10441-013-9179-3 | null | cs.IT math.IT physics.bio-ph q-bio.OT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We extend the concept that life is an informational phenomenon, at every
level of organisation, from molecules to the global ecological system.
According to this thesis: (a) living is information processing, in which memory
is maintained by both molecular states and ecological states as well as the
more obvious nucle... | [
{
"created": "Mon, 22 Oct 2012 14:42:31 GMT",
"version": "v1"
},
{
"created": "Fri, 1 Mar 2013 16:10:43 GMT",
"version": "v2"
}
] | 2014-02-17 | [
[
"Farnsworth",
"Keith D.",
""
],
[
"Nelson",
"John",
""
],
[
"Gershenson",
"Carlos",
""
]
] | We extend the concept that life is an informational phenomenon, at every level of organisation, from molecules to the global ecological system. According to this thesis: (a) living is information processing, in which memory is maintained by both molecular states and ecological states as well as the more obvious nucleic... |
1906.01127 | Zequn Wang | Narendra Patwardhan and Zequn Wang | Proximal Reliability Optimization for Reinforcement Learning | 12 pages, 6 figures | null | null | null | cs.LG cs.SY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the numerous advances, reinforcement learning remains away from
widespread acceptance for autonomous controller design as compared to classical
methods due to lack of ability to effectively tackle the reality gap. The
reliance on absolute or deterministic reward as a metric for optimization
process renders re... | [
{
"created": "Mon, 3 Jun 2019 23:43:16 GMT",
"version": "v1"
}
] | 2019-06-05 | [
[
"Patwardhan",
"Narendra",
""
],
[
"Wang",
"Zequn",
""
]
] | Despite the numerous advances, reinforcement learning remains away from widespread acceptance for autonomous controller design as compared to classical methods due to lack of ability to effectively tackle the reality gap. The reliance on absolute or deterministic reward as a metric for optimization process renders rein... |
2103.08783 | Devlin Gualtieri Ph.D. | Devlin Gualtieri | One-Time Pads from the Digits of Pi | 12 page PDF file (5 page article with 7 pages of computer source
code). Comments are welcome | null | null | null | cs.OH | http://creativecommons.org/licenses/by-sa/4.0/ | I present a method for generating one-time pads from the digits of pi.
Computer code is given to generate such pads from passphrases in a method
having an extremely low probability (<10^-53) of a successful discovery of the
one-time pads by a brute-force attack. The advantages and disadvantages of this
method are dis... | [
{
"created": "Tue, 16 Mar 2021 00:34:44 GMT",
"version": "v1"
}
] | 2021-03-17 | [
[
"Gualtieri",
"Devlin",
""
]
] | I present a method for generating one-time pads from the digits of pi. Computer code is given to generate such pads from passphrases in a method having an extremely low probability (<10^-53) of a successful discovery of the one-time pads by a brute-force attack. The advantages and disadvantages of this method are discu... |
2107.14590 | Yiyang Li | GuoLiang Li and Yiyang Li | Residual Tree Aggregation of Layers for Neural Machine Translation | null | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Although attention-based Neural Machine Translation has achieved remarkable
progress in recent layers, it still suffers from issue of making insufficient
use of the output of each layer. In transformer, it only uses the top layer of
encoder and decoder in the subsequent process, which makes it impossible to
take adva... | [
{
"created": "Mon, 19 Jul 2021 09:32:10 GMT",
"version": "v1"
}
] | 2021-08-02 | [
[
"Li",
"GuoLiang",
""
],
[
"Li",
"Yiyang",
""
]
] | Although attention-based Neural Machine Translation has achieved remarkable progress in recent layers, it still suffers from issue of making insufficient use of the output of each layer. In transformer, it only uses the top layer of encoder and decoder in the subsequent process, which makes it impossible to take advant... |
2408.01129 | Haohao Qu | Haohao Qu, Liangbo Ning, Rui An, Wenqi Fan, Tyler Derr, Xin Xu, Qing
Li | A Survey of Mamba | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning, as a vital technique, has sparked a notable revolution in
artificial intelligence. As the most representative architecture, Transformers
have empowered numerous advanced models, especially the large language models
that comprise billions of parameters, becoming a cornerstone in deep learning.
Despite t... | [
{
"created": "Fri, 2 Aug 2024 09:18:41 GMT",
"version": "v1"
}
] | 2024-08-05 | [
[
"Qu",
"Haohao",
""
],
[
"Ning",
"Liangbo",
""
],
[
"An",
"Rui",
""
],
[
"Fan",
"Wenqi",
""
],
[
"Derr",
"Tyler",
""
],
[
"Xu",
"Xin",
""
],
[
"Li",
"Qing",
""
]
] | Deep learning, as a vital technique, has sparked a notable revolution in artificial intelligence. As the most representative architecture, Transformers have empowered numerous advanced models, especially the large language models that comprise billions of parameters, becoming a cornerstone in deep learning. Despite the... |
1910.09134 | Jiaying Lu | Jiaying Lu, Xin Ye, Yi Ren, Yezhou Yang | Good, Better, Best: Textual Distractors Generation for Multiple-Choice
Visual Question Answering via Reinforcement Learning | null | CVPR'2022 Workshop on Open-Domain Retrieval Under a Multi-Modal
Setting | null | null | cs.CV cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multiple-choice VQA has drawn increasing attention from researchers and
end-users recently. As the demand for automatically constructing large-scale
multiple-choice VQA data grows, we introduce a novel task called textual
Distractors Generation for VQA (DG-VQA) focusing on generating challenging yet
meaningful distra... | [
{
"created": "Mon, 21 Oct 2019 03:32:17 GMT",
"version": "v1"
},
{
"created": "Sat, 27 Mar 2021 21:01:47 GMT",
"version": "v2"
},
{
"created": "Mon, 18 Apr 2022 19:44:03 GMT",
"version": "v3"
}
] | 2022-04-20 | [
[
"Lu",
"Jiaying",
""
],
[
"Ye",
"Xin",
""
],
[
"Ren",
"Yi",
""
],
[
"Yang",
"Yezhou",
""
]
] | Multiple-choice VQA has drawn increasing attention from researchers and end-users recently. As the demand for automatically constructing large-scale multiple-choice VQA data grows, we introduce a novel task called textual Distractors Generation for VQA (DG-VQA) focusing on generating challenging yet meaningful distract... |
1911.11881 | Yifei Fan | Chao Tang, Yifei Fan, Anthony Yezzi | An Adaptive View of Adversarial Robustness from Test-time Smoothing
Defense | NeurIPS-2019 Workshop on Safety and Robustness in Decision Making | null | null | null | cs.LG cs.CR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The safety and robustness of learning-based decision-making systems are under
threats from adversarial examples, as imperceptible perturbations can mislead
neural networks to completely different outputs. In this paper, we present an
adaptive view of the issue via evaluating various test-time smoothing defense
agains... | [
{
"created": "Tue, 26 Nov 2019 23:45:25 GMT",
"version": "v1"
}
] | 2019-11-28 | [
[
"Tang",
"Chao",
""
],
[
"Fan",
"Yifei",
""
],
[
"Yezzi",
"Anthony",
""
]
] | The safety and robustness of learning-based decision-making systems are under threats from adversarial examples, as imperceptible perturbations can mislead neural networks to completely different outputs. In this paper, we present an adaptive view of the issue via evaluating various test-time smoothing defense against ... |
2303.14464 | Ana Ozaki | Emilia Przybysz and Bimal Bhattarai and Cosimo Persia and Ana Ozaki
and Ole-Christoffer Granmo and Jivitesh Sharma | Verifying Properties of Tsetlin Machines | 12 pages, accepted at ISTM (https://istm.no/) | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Tsetlin Machines (TsMs) are a promising and interpretable machine learning
method which can be applied for various classification tasks. We present an
exact encoding of TsMs into propositional logic and formally verify properties
of TsMs using a SAT solver. In particular, we introduce in this work a notion
of similar... | [
{
"created": "Sat, 25 Mar 2023 13:17:21 GMT",
"version": "v1"
},
{
"created": "Sun, 2 Jul 2023 13:47:37 GMT",
"version": "v2"
}
] | 2023-07-04 | [
[
"Przybysz",
"Emilia",
""
],
[
"Bhattarai",
"Bimal",
""
],
[
"Persia",
"Cosimo",
""
],
[
"Ozaki",
"Ana",
""
],
[
"Granmo",
"Ole-Christoffer",
""
],
[
"Sharma",
"Jivitesh",
""
]
] | Tsetlin Machines (TsMs) are a promising and interpretable machine learning method which can be applied for various classification tasks. We present an exact encoding of TsMs into propositional logic and formally verify properties of TsMs using a SAT solver. In particular, we introduce in this work a notion of similarit... |
0903.4796 | Martin Vatshelle | B.-M. Bui-Xuan and J. A. Telle and M. Vatshelle (Department of
Informatics, University of Bergen, Norway) | Fast FPT algorithms for vertex subset and vertex partitioning problems
using neighborhood unions | The new version has runtimes expressed by number of equivalence
classes, but no other changes | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the graph parameter boolean-width, related to the number of
different unions of neighborhoods across a cut of a graph. Boolean-width is
similar to rank-width, which is related to the number of $GF[2]$-sums (1+1=0)
of neighborhoods instead of the boolean-sums (1+1=1) used for boolean-width. We
give algori... | [
{
"created": "Fri, 27 Mar 2009 13:34:08 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Apr 2009 07:24:30 GMT",
"version": "v2"
},
{
"created": "Wed, 9 Mar 2011 15:17:52 GMT",
"version": "v3"
}
] | 2011-03-10 | [
[
"Bui-Xuan",
"B. -M.",
"",
"Department of\n Informatics, University of Bergen, Norway"
],
[
"Telle",
"J. A.",
"",
"Department of\n Informatics, University of Bergen, Norway"
],
[
"Vatshelle",
"M.",
"",
"Department of\n Informatics, University of Bergen, No... | We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Boolean-width is similar to rank-width, which is related to the number of $GF[2]$-sums (1+1=0) of neighborhoods instead of the boolean-sums (1+1=1) used for boolean-width. We give algorith... |
2309.13636 | Ikechukwu Onyenwe | Nwafor Emmanuel O, Ngozi Maryrose Umeh, Ikechukwu Ekene Onyenwe | Development of an intelligent system for the detection of corona virus
using artificial neural network | 13 pages, 8 Figures | International Journal of Real-Time Application and Computing
Systems (IJORTACS) Volume 1, Issue XI, November 2022, pp. 294-306 | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | This paper presents the development of an intelligent system for the
detection of coronavirus using artificial neural network. This was done after
series of literature review which indicated that high fever accounts for 87.9%
of the COVID-19 symptoms. 683 temperature data of COVID-19 patients at >= 38C^o
were collect... | [
{
"created": "Sun, 24 Sep 2023 13:30:50 GMT",
"version": "v1"
}
] | 2023-09-26 | [
[
"O",
"Nwafor Emmanuel",
""
],
[
"Umeh",
"Ngozi Maryrose",
""
],
[
"Onyenwe",
"Ikechukwu Ekene",
""
]
] | This paper presents the development of an intelligent system for the detection of coronavirus using artificial neural network. This was done after series of literature review which indicated that high fever accounts for 87.9% of the COVID-19 symptoms. 683 temperature data of COVID-19 patients at >= 38C^o were collected... |
1905.04779 | Paolo Frasca | Francesco Acciani, Paolo Frasca, Geert Heijenk, Anton Stoorvogel | Stochastic String Stability of Vehicle Platoons via Cooperative Adaptive
Cruise Control with Lossy Communication | 10 pages, 7 figures; submitted to journal | null | null | null | cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper is about obtaining stable vehicle platooning by using Cooperative
Adaptive Cruise Control when the communication is unreliable and suffers from
message losses. We model communication losses as independent random events and
we propose an original design for the cooperative controller, which mitigates
the ef... | [
{
"created": "Sun, 12 May 2019 19:54:15 GMT",
"version": "v1"
}
] | 2019-05-14 | [
[
"Acciani",
"Francesco",
""
],
[
"Frasca",
"Paolo",
""
],
[
"Heijenk",
"Geert",
""
],
[
"Stoorvogel",
"Anton",
""
]
] | This paper is about obtaining stable vehicle platooning by using Cooperative Adaptive Cruise Control when the communication is unreliable and suffers from message losses. We model communication losses as independent random events and we propose an original design for the cooperative controller, which mitigates the effe... |
1702.08349 | P{\aa}l Sunds{\o}y | P\r{a}l Sunds{\o}y | Big Data for Social Sciences: Measuring patterns of human behavior
through large-scale mobile phone data | 166 pages, PHD thesis | null | null | null | cs.CY cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Through seven publications this dissertation shows how anonymized mobile
phone data can contribute to the social good and provide insights into human
behaviour on a large scale. The size of the datasets analysed ranges from 500
million to 300 billion phone records, covering millions of people. The key
contributions a... | [
{
"created": "Mon, 27 Feb 2017 16:09:48 GMT",
"version": "v1"
}
] | 2017-02-28 | [
[
"Sundsøy",
"Pål",
""
]
] | Through seven publications this dissertation shows how anonymized mobile phone data can contribute to the social good and provide insights into human behaviour on a large scale. The size of the datasets analysed ranges from 500 million to 300 billion phone records, covering millions of people. The key contributions are... |
2306.04356 | Lingfeng Yang | Lingfeng Yang, Yueze Wang, Xiang Li, Xinlong Wang, Jian Yang | Fine-Grained Visual Prompting | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Vision-Language Models (VLMs), such as CLIP, have demonstrated impressive
zero-shot transfer capabilities in image-level visual perception. However,
these models have shown limited performance in instance-level tasks that demand
precise localization and recognition. Previous works have suggested that
incorporating vi... | [
{
"created": "Wed, 7 Jun 2023 11:39:56 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Dec 2023 06:36:53 GMT",
"version": "v2"
}
] | 2023-12-13 | [
[
"Yang",
"Lingfeng",
""
],
[
"Wang",
"Yueze",
""
],
[
"Li",
"Xiang",
""
],
[
"Wang",
"Xinlong",
""
],
[
"Yang",
"Jian",
""
]
] | Vision-Language Models (VLMs), such as CLIP, have demonstrated impressive zero-shot transfer capabilities in image-level visual perception. However, these models have shown limited performance in instance-level tasks that demand precise localization and recognition. Previous works have suggested that incorporating visu... |
2202.08446 | Kaiyuan Yang | Dai Li, Akhil Pakala, Kaiyuan Yang | MeNTT: A Compact and Efficient Processing-in-Memory Number Theoretic
Transform (NTT) Accelerator | This paper has been accepted to IEEE Transactions on Very Large Scale
Integration (TVLSI) | null | null | null | cs.CR cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Lattice-based cryptography (LBC) exploiting Learning with Errors (LWE)
problems is a promising candidate for post-quantum cryptography. Number
theoretic transform (NTT) is the latency- and energy- dominant process in the
computation of LWE problems. This paper presents a compact and efficient
in-MEmory NTT accelerato... | [
{
"created": "Thu, 17 Feb 2022 04:36:10 GMT",
"version": "v1"
}
] | 2022-02-18 | [
[
"Li",
"Dai",
""
],
[
"Pakala",
"Akhil",
""
],
[
"Yang",
"Kaiyuan",
""
]
] | Lattice-based cryptography (LBC) exploiting Learning with Errors (LWE) problems is a promising candidate for post-quantum cryptography. Number theoretic transform (NTT) is the latency- and energy- dominant process in the computation of LWE problems. This paper presents a compact and efficient in-MEmory NTT accelerator,... |
1303.0462 | M.M.A. Hashem | Moslema Jahan, M. M. A. Hashem and Gazi Abdullah Shahriar | Distributed Evolutionary Computation: A New Technique for Solving Large
Number of Equations | null | International Journal of Parallel and Distributed Systems (IJPDS),
Vol. 2, No.6, pp.31-49,(2011) | 10.5121/ijdps.2011.2604 | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Evolutionary computation techniques have mostly been used to solve various
optimization and learning problems successfully. Evolutionary algorithm is more
effective to gain optimal solution(s) to solve complex problems than
traditional methods. In case of problems with large set of parameters,
evolutionary computatio... | [
{
"created": "Sun, 3 Mar 2013 05:38:41 GMT",
"version": "v1"
}
] | 2013-03-05 | [
[
"Jahan",
"Moslema",
""
],
[
"Hashem",
"M. M. A.",
""
],
[
"Shahriar",
"Gazi Abdullah",
""
]
] | Evolutionary computation techniques have mostly been used to solve various optimization and learning problems successfully. Evolutionary algorithm is more effective to gain optimal solution(s) to solve complex problems than traditional methods. In case of problems with large set of parameters, evolutionary computation ... |
1910.02065 | Oana-Maria Camburu | Oana-Maria Camburu, Eleonora Giunchiglia, Jakob Foerster, Thomas
Lukasiewicz, Phil Blunsom | Can I Trust the Explainer? Verifying Post-hoc Explanatory Methods | null | NeurIPS 2019 Workshop on Safety and Robustness in Decision Making,
Vancouver, Canada | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For AI systems to garner widespread public acceptance, we must develop
methods capable of explaining the decisions of black-box models such as neural
networks. In this work, we identify two issues of current explanatory methods.
First, we show that two prevalent perspectives on explanations ---
feature-additivity and... | [
{
"created": "Fri, 4 Oct 2019 17:44:36 GMT",
"version": "v1"
},
{
"created": "Wed, 9 Oct 2019 14:58:47 GMT",
"version": "v2"
},
{
"created": "Thu, 5 Dec 2019 13:41:46 GMT",
"version": "v3"
}
] | 2019-12-06 | [
[
"Camburu",
"Oana-Maria",
""
],
[
"Giunchiglia",
"Eleonora",
""
],
[
"Foerster",
"Jakob",
""
],
[
"Lukasiewicz",
"Thomas",
""
],
[
"Blunsom",
"Phil",
""
]
] | For AI systems to garner widespread public acceptance, we must develop methods capable of explaining the decisions of black-box models such as neural networks. In this work, we identify two issues of current explanatory methods. First, we show that two prevalent perspectives on explanations --- feature-additivity and f... |
2301.10901 | Tao Jiang | Tao Jiang, Samuel Tan, Stephen Vavasis | Re-embedding data to strengthen recovery guarantees of clustering | null | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a clustering method that involves chaining four known techniques
into a pipeline yielding an algorithm with stronger recovery guarantees than
any of the four components separately. Given $n$ points in $\mathbb R^d$, the
first component of our pipeline, which we call leapfrog distances, is
reminiscent of de... | [
{
"created": "Thu, 26 Jan 2023 02:15:11 GMT",
"version": "v1"
}
] | 2023-01-27 | [
[
"Jiang",
"Tao",
""
],
[
"Tan",
"Samuel",
""
],
[
"Vavasis",
"Stephen",
""
]
] | We propose a clustering method that involves chaining four known techniques into a pipeline yielding an algorithm with stronger recovery guarantees than any of the four components separately. Given $n$ points in $\mathbb R^d$, the first component of our pipeline, which we call leapfrog distances, is reminiscent of dens... |
0808.0234 | S Birenjith | K. Sreeram, S. Birenjith, P. Vijay Kumar | DMT of Multi-hop Cooperative Networks - Part I: Basic Results | This submission is Part-I of a two-part paper, which is a detailed
version of the previous submission arXiv:0802.1888 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this two-part paper, the DMT of cooperative multi-hop networks is
examined. The focus is on single-source single-sink (ss-ss) multi-hop relay
networks having slow-fading links and relays that potentially possess multiple
antennas. The present paper examines the two end-points of the DMT of
full-duplex networks. In... | [
{
"created": "Sat, 2 Aug 2008 07:29:50 GMT",
"version": "v1"
}
] | 2008-08-05 | [
[
"Sreeram",
"K.",
""
],
[
"Birenjith",
"S.",
""
],
[
"Kumar",
"P. Vijay",
""
]
] | In this two-part paper, the DMT of cooperative multi-hop networks is examined. The focus is on single-source single-sink (ss-ss) multi-hop relay networks having slow-fading links and relays that potentially possess multiple antennas. The present paper examines the two end-points of the DMT of full-duplex networks. In p... |
2210.06779 | Weichen Yu | Weichen Yu, Hongyuan Yu, Yan Huang, Liang Wang | Generalized Inter-class Loss for Gait Recognition | to be published in ACMMM 2022 | null | 10.1145/3503161.3548311 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Gait recognition is a unique biometric technique that can be performed at a
long distance non-cooperatively and has broad applications in public safety and
intelligent traffic systems. Previous gait works focus more on minimizing the
intra-class variance while ignoring the significance in constraining
inter-class var... | [
{
"created": "Thu, 13 Oct 2022 06:44:53 GMT",
"version": "v1"
}
] | 2022-10-14 | [
[
"Yu",
"Weichen",
""
],
[
"Yu",
"Hongyuan",
""
],
[
"Huang",
"Yan",
""
],
[
"Wang",
"Liang",
""
]
] | Gait recognition is a unique biometric technique that can be performed at a long distance non-cooperatively and has broad applications in public safety and intelligent traffic systems. Previous gait works focus more on minimizing the intra-class variance while ignoring the significance in constraining inter-class varia... |
2110.09991 | Kaiyu Zheng | Kaiyu Zheng, Rohan Chitnis, Yoonchang Sung, George Konidaris, Stefanie
Tellex | Towards Optimal Correlational Object Search | 10 pages, 5 figures, 4 tables. IEEE Conference on Robotics and
Automation (ICRA) 2022; minor fix in appendix & references | null | null | null | cs.RO cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | In realistic applications of object search, robots will need to locate target
objects in complex environments while coping with unreliable sensors,
especially for small or hard-to-detect objects. In such settings, correlational
information can be valuable for planning efficiently. Previous approaches that
consider co... | [
{
"created": "Tue, 19 Oct 2021 14:03:43 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Mar 2022 05:42:32 GMT",
"version": "v2"
},
{
"created": "Fri, 1 Apr 2022 14:23:38 GMT",
"version": "v3"
}
] | 2022-04-04 | [
[
"Zheng",
"Kaiyu",
""
],
[
"Chitnis",
"Rohan",
""
],
[
"Sung",
"Yoonchang",
""
],
[
"Konidaris",
"George",
""
],
[
"Tellex",
"Stefanie",
""
]
] | In realistic applications of object search, robots will need to locate target objects in complex environments while coping with unreliable sensors, especially for small or hard-to-detect objects. In such settings, correlational information can be valuable for planning efficiently. Previous approaches that consider corr... |
1203.3485 | Matthew J. Johnson | Matthew J. Johnson, Alan Willsky | The Hierarchical Dirichlet Process Hidden Semi-Markov Model | Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty
in Artificial Intelligence (UAI2010) | null | null | UAI-P-2010-PG-252-259 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is much interest in the Hierarchical Dirichlet Process Hidden Markov
Model (HDP-HMM) as a natural Bayesian nonparametric extension of the
traditional HMM. However, in many settings the HDP-HMM's strict Markovian
constraints are undesirable, particularly if we wish to learn or encode
non-geometric state duration... | [
{
"created": "Thu, 15 Mar 2012 11:17:56 GMT",
"version": "v1"
}
] | 2012-03-19 | [
[
"Johnson",
"Matthew J.",
""
],
[
"Willsky",
"Alan",
""
]
] | There is much interest in the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) as a natural Bayesian nonparametric extension of the traditional HMM. However, in many settings the HDP-HMM's strict Markovian constraints are undesirable, particularly if we wish to learn or encode non-geometric state durations.... |
2002.02707 | Gabriel John Dusing | Audris Mockus, Diomidis Spinellis, Zoe Kotti, Gabriel John Dusing | A Complete Set of Related Git Repositories Identified via Community
Detection Approaches Based on Shared Commits | 5 pages | null | 10.1145/3379597.3387499 | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In order to understand the state and evolution of the entirety of open source
software we need to get a handle on the set of distinct software projects. Most
of open source projects presently utilize Git, which is a distributed version
control system allowing easy creation of clones and resulting in numerous
reposito... | [
{
"created": "Fri, 7 Feb 2020 10:47:30 GMT",
"version": "v1"
},
{
"created": "Sun, 15 Mar 2020 23:50:46 GMT",
"version": "v2"
},
{
"created": "Thu, 26 Mar 2020 16:03:34 GMT",
"version": "v3"
},
{
"created": "Mon, 6 Apr 2020 17:11:49 GMT",
"version": "v4"
}
] | 2020-04-07 | [
[
"Mockus",
"Audris",
""
],
[
"Spinellis",
"Diomidis",
""
],
[
"Kotti",
"Zoe",
""
],
[
"Dusing",
"Gabriel John",
""
]
] | In order to understand the state and evolution of the entirety of open source software we need to get a handle on the set of distinct software projects. Most of open source projects presently utilize Git, which is a distributed version control system allowing easy creation of clones and resulting in numerous repositori... |
1503.07940 | Ananda Theertha Suresh | Alon Orlitsky and Ananda Theertha Suresh | Competitive Distribution Estimation | 15 pages | null | null | null | cs.IT cs.DS cs.LG math.IT math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Estimating an unknown distribution from its samples is a fundamental problem
in statistics. The common, min-max, formulation of this goal considers the
performance of the best estimator over all distributions in a class. It shows
that with $n$ samples, distributions over $k$ symbols can be learned to a KL
divergence ... | [
{
"created": "Fri, 27 Mar 2015 01:41:48 GMT",
"version": "v1"
}
] | 2015-03-30 | [
[
"Orlitsky",
"Alon",
""
],
[
"Suresh",
"Ananda Theertha",
""
]
] | Estimating an unknown distribution from its samples is a fundamental problem in statistics. The common, min-max, formulation of this goal considers the performance of the best estimator over all distributions in a class. It shows that with $n$ samples, distributions over $k$ symbols can be learned to a KL divergence th... |
1612.05778 | Ning Xie | Changbo Chen, Svyatoslav Covanov, Farnam Mansouri, Marc Moreno Maza,
Ning Xie and Yuzhen Xie | Parallel Integer Polynomial Multiplication | null | null | null | null | cs.SC cs.MS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new algorithm for multiplying dense polynomials with integer
coefficients in a parallel fashion, targeting multi-core processor
architectures. Complexity estimates and experimental comparisons demonstrate
the advantages of this new approach.
| [
{
"created": "Sat, 17 Dec 2016 14:54:52 GMT",
"version": "v1"
}
] | 2016-12-20 | [
[
"Chen",
"Changbo",
""
],
[
"Covanov",
"Svyatoslav",
""
],
[
"Mansouri",
"Farnam",
""
],
[
"Maza",
"Marc Moreno",
""
],
[
"Xie",
"Ning",
""
],
[
"Xie",
"Yuzhen",
""
]
] | We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and experimental comparisons demonstrate the advantages of this new approach. |
1709.01424 | Maedeh Aghaei | Maedeh Aghaei, Mariella Dimiccoli, Cristian Canton Ferrer, Petia
Radeva | Towards social pattern characterization in egocentric photo-streams | 42 pages, 14 figures. Submitted to Elsevier, Computer Vision and
Image Understanding (Under Review) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Following the increasingly popular trend of social interaction analysis in
egocentric vision, this manuscript presents a comprehensive study for automatic
social pattern characterization of a wearable photo-camera user, by relying on
the visual analysis of egocentric photo-streams. The proposed framework
consists of ... | [
{
"created": "Tue, 5 Sep 2017 14:50:00 GMT",
"version": "v1"
},
{
"created": "Wed, 27 Sep 2017 16:02:18 GMT",
"version": "v2"
},
{
"created": "Tue, 9 Jan 2018 11:14:53 GMT",
"version": "v3"
}
] | 2018-01-10 | [
[
"Aghaei",
"Maedeh",
""
],
[
"Dimiccoli",
"Mariella",
""
],
[
"Ferrer",
"Cristian Canton",
""
],
[
"Radeva",
"Petia",
""
]
] | Following the increasingly popular trend of social interaction analysis in egocentric vision, this manuscript presents a comprehensive study for automatic social pattern characterization of a wearable photo-camera user, by relying on the visual analysis of egocentric photo-streams. The proposed framework consists of th... |
1802.10217 | Rachit Dubey | Rachit Dubey, Pulkit Agrawal, Deepak Pathak, Thomas L. Griffiths, and
Alexei A. Efros | Investigating Human Priors for Playing Video Games | ICML 2018 | ICML 2018 | null | null | cs.AI cs.LG | http://creativecommons.org/publicdomain/zero/1.0/ | What makes humans so good at solving seemingly complex video games? Unlike
computers, humans bring in a great deal of prior knowledge about the world,
enabling efficient decision making. This paper investigates the role of human
priors for solving video games. Given a sample game, we conduct a series of
ablation stud... | [
{
"created": "Wed, 28 Feb 2018 00:26:44 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Jun 2018 20:32:21 GMT",
"version": "v2"
},
{
"created": "Wed, 25 Jul 2018 02:33:41 GMT",
"version": "v3"
}
] | 2018-07-26 | [
[
"Dubey",
"Rachit",
""
],
[
"Agrawal",
"Pulkit",
""
],
[
"Pathak",
"Deepak",
""
],
[
"Griffiths",
"Thomas L.",
""
],
[
"Efros",
"Alexei A.",
""
]
] | What makes humans so good at solving seemingly complex video games? Unlike computers, humans bring in a great deal of prior knowledge about the world, enabling efficient decision making. This paper investigates the role of human priors for solving video games. Given a sample game, we conduct a series of ablation studie... |
1909.13332 | Natalia Tomashenko | Natalia Tomashenko, Antoine Caubriere, Yannick Esteve, Antoine
Laurent, Emmanuel Morin | Recent Advances in End-to-End Spoken Language Understanding | null | Statistical Language and Speech Processing. SLSP 2019 | 10.1007/978-3-030-31372-2_4 | null | cs.CL eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work investigates spoken language understanding (SLU) systems in the
scenario when the semantic information is extracted directly from the speech
signal by means of a single end-to-end neural network model. Two SLU tasks are
considered: named entity recognition (NER) and semantic slot filling (SF). For
these tas... | [
{
"created": "Sun, 29 Sep 2019 18:01:00 GMT",
"version": "v1"
}
] | 2019-10-29 | [
[
"Tomashenko",
"Natalia",
""
],
[
"Caubriere",
"Antoine",
""
],
[
"Esteve",
"Yannick",
""
],
[
"Laurent",
"Antoine",
""
],
[
"Morin",
"Emmanuel",
""
]
] | This work investigates spoken language understanding (SLU) systems in the scenario when the semantic information is extracted directly from the speech signal by means of a single end-to-end neural network model. Two SLU tasks are considered: named entity recognition (NER) and semantic slot filling (SF). For these tasks... |
1905.01102 | Spyros Gidaris | Spyros Gidaris, Nikos Komodakis | Generating Classification Weights with GNN Denoising Autoencoders for
Few-Shot Learning | Oral presentation at CVPR 2019. The code and models of our paper will
be published on: https://github.com/gidariss/wDAE_GNN_FewShot | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given an initial recognition model already trained on a set of base classes,
the goal of this work is to develop a meta-model for few-shot learning. The
meta-model, given as input some novel classes with few training examples per
class, must properly adapt the existing recognition model into a new model that
can corr... | [
{
"created": "Fri, 3 May 2019 10:11:54 GMT",
"version": "v1"
}
] | 2019-05-06 | [
[
"Gidaris",
"Spyros",
""
],
[
"Komodakis",
"Nikos",
""
]
] | Given an initial recognition model already trained on a set of base classes, the goal of this work is to develop a meta-model for few-shot learning. The meta-model, given as input some novel classes with few training examples per class, must properly adapt the existing recognition model into a new model that can correc... |
2309.14634 | Yong-Hao Hu | Yong-Hao Hu, Kenichiro Ito, Ayumi Igarashi | Synchronizing Full-Body Avatar Transforms with WebRTC DataChannel on
Educational Metaverse | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Full-body avatars are suggested to be beneficial for communication in virtual
environments, and consistency between users' voices and gestures is considered
essential to ensure communication quality. This paper propose extending the
functionality of a web-based VR platform to support the use of full-body
avatars and ... | [
{
"created": "Tue, 26 Sep 2023 03:28:09 GMT",
"version": "v1"
}
] | 2023-09-27 | [
[
"Hu",
"Yong-Hao",
""
],
[
"Ito",
"Kenichiro",
""
],
[
"Igarashi",
"Ayumi",
""
]
] | Full-body avatars are suggested to be beneficial for communication in virtual environments, and consistency between users' voices and gestures is considered essential to ensure communication quality. This paper propose extending the functionality of a web-based VR platform to support the use of full-body avatars and de... |
2004.12699 | Lucas Carvalho Cordeiro | Mikhail R. Gadelha, Lucas C. Cordeiro and Denis A. Nicole | An Efficient Floating-Point Bit-Blasting API for Verifying C Programs | 20 pages | null | null | null | cs.LO cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe a new SMT bit-blasting API for floating-points and evaluate it
using different out-of-the-shelf SMT solvers during the verification of several
C programs. The new floating-point API is part of the SMT backend in ESBMC, a
state-of-the-art bounded model checker for C and C++. For the evaluation, we
compared... | [
{
"created": "Mon, 27 Apr 2020 10:40:04 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Apr 2020 09:13:04 GMT",
"version": "v2"
}
] | 2020-04-30 | [
[
"Gadelha",
"Mikhail R.",
""
],
[
"Cordeiro",
"Lucas C.",
""
],
[
"Nicole",
"Denis A.",
""
]
] | We describe a new SMT bit-blasting API for floating-points and evaluate it using different out-of-the-shelf SMT solvers during the verification of several C programs. The new floating-point API is part of the SMT backend in ESBMC, a state-of-the-art bounded model checker for C and C++. For the evaluation, we compared o... |
1803.06563 | Spyridon Samothrakis | Spyridon Samothrakis | Viewpoint: Artificial Intelligence and Labour | null | null | null | null | cs.CY cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The welfare of modern societies has been intrinsically linked to wage labour.
With some exceptions, the modern human has to sell her labour-power to be able
reproduce biologically and socially. Thus, a lingering fear of technological
unemployment features predominately as a theme among Artificial Intelligence
researc... | [
{
"created": "Sat, 17 Mar 2018 20:08:49 GMT",
"version": "v1"
}
] | 2018-03-20 | [
[
"Samothrakis",
"Spyridon",
""
]
] | The welfare of modern societies has been intrinsically linked to wage labour. With some exceptions, the modern human has to sell her labour-power to be able reproduce biologically and socially. Thus, a lingering fear of technological unemployment features predominately as a theme among Artificial Intelligence researche... |
2104.01276 | Stephen MacDonell | Amjed Tahir, Sherlock A. Licorish and Stephen G. MacDonell | Feature Evolution and Reuse -- An Exploratory Study of Eclipse | Conference paper, 6 pages, 5 figures, 2 tables | Proceedings of the 24th Asia-Pacific Software Engineering
Conference (APSEC2017). Nanjing, China, IEEE, pp.582-587 | 10.1109/APSEC.2017.69 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the purported ways to increase productivity and reduce development
time is to reuse existing features and modules. If reuse is adopted, logically
then, it will have a direct impact on a system's evolution. However, the
evidence in the literature is not clear on the extent to which reuse is
practiced in real-wo... | [
{
"created": "Fri, 2 Apr 2021 23:50:53 GMT",
"version": "v1"
}
] | 2021-04-06 | [
[
"Tahir",
"Amjed",
""
],
[
"Licorish",
"Sherlock A.",
""
],
[
"MacDonell",
"Stephen G.",
""
]
] | One of the purported ways to increase productivity and reduce development time is to reuse existing features and modules. If reuse is adopted, logically then, it will have a direct impact on a system's evolution. However, the evidence in the literature is not clear on the extent to which reuse is practiced in real-worl... |
1504.00953 | Constantinos Psomas | Constantinos Psomas, Ioannis Krikidis | Outage Analysis of Full-Duplex Architectures in Cellular Networks | to appear in Proc. IEEE VTC 2015 Spring, Glasgow | null | 10.1109/VTCSpring.2015.7145989 | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The implementation of full-duplex (FD) radio in wireless communications is a
potential approach for achieving higher spectral efficiency. A possible
application is its employment in the next generation of cellular networks.
However, the performance of large-scale FD multiuser networks is an area mostly
unexplored. Mo... | [
{
"created": "Fri, 3 Apr 2015 22:32:36 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Psomas",
"Constantinos",
""
],
[
"Krikidis",
"Ioannis",
""
]
] | The implementation of full-duplex (FD) radio in wireless communications is a potential approach for achieving higher spectral efficiency. A possible application is its employment in the next generation of cellular networks. However, the performance of large-scale FD multiuser networks is an area mostly unexplored. Most... |
2206.03997 | Benjamin Lion | Benjamin Lion, Farhad Arbab, Carolyn Talcott | A Rewriting Framework for Interacting Cyber-Physical Agents | null | null | null | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | The analysis of cyber-physical systems (CPS) is challenging due to the large
state space and the continuous changes occurring in their constituent parts.
Design practices favor modularity to help reducing this complexity. In a
previous work, we proposed a discrete semantic model for CPS that captures both
cyber and p... | [
{
"created": "Wed, 8 Jun 2022 16:21:03 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Aug 2022 07:23:30 GMT",
"version": "v2"
}
] | 2022-08-03 | [
[
"Lion",
"Benjamin",
""
],
[
"Arbab",
"Farhad",
""
],
[
"Talcott",
"Carolyn",
""
]
] | The analysis of cyber-physical systems (CPS) is challenging due to the large state space and the continuous changes occurring in their constituent parts. Design practices favor modularity to help reducing this complexity. In a previous work, we proposed a discrete semantic model for CPS that captures both cyber and phy... |
2312.08697 | Guoqing Chao | Guoqing Chao, Yi Jiang, Dianhui Chu | Incomplete Contrastive Multi-View Clustering with High-Confidence
Guiding | 11pages, and it has been accepted by AAAI 2024 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Incomplete multi-view clustering becomes an important research problem, since
multi-view data with missing values are ubiquitous in real-world applications.
Although great efforts have been made for incomplete multi-view clustering,
there are still some challenges: 1) most existing methods didn't make full use
of mul... | [
{
"created": "Thu, 14 Dec 2023 07:28:41 GMT",
"version": "v1"
}
] | 2023-12-15 | [
[
"Chao",
"Guoqing",
""
],
[
"Jiang",
"Yi",
""
],
[
"Chu",
"Dianhui",
""
]
] | Incomplete multi-view clustering becomes an important research problem, since multi-view data with missing values are ubiquitous in real-world applications. Although great efforts have been made for incomplete multi-view clustering, there are still some challenges: 1) most existing methods didn't make full use of multi... |
2202.08907 | Holden Lee | Frederic Koehler and Holden Lee and Andrej Risteski | Sampling Approximately Low-Rank Ising Models: MCMC meets Variational
Methods | 43 pages | null | null | null | cs.DS cs.LG math.PR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider Ising models on the hypercube with a general interaction matrix
$J$, and give a polynomial time sampling algorithm when all but $O(1)$
eigenvalues of $J$ lie in an interval of length one, a situation which occurs
in many models of interest. This was previously known for the Glauber dynamics
when *all* eig... | [
{
"created": "Thu, 17 Feb 2022 21:43:50 GMT",
"version": "v1"
}
] | 2022-02-21 | [
[
"Koehler",
"Frederic",
""
],
[
"Lee",
"Holden",
""
],
[
"Risteski",
"Andrej",
""
]
] | We consider Ising models on the hypercube with a general interaction matrix $J$, and give a polynomial time sampling algorithm when all but $O(1)$ eigenvalues of $J$ lie in an interval of length one, a situation which occurs in many models of interest. This was previously known for the Glauber dynamics when *all* eigen... |
2201.12393 | Matej Lieskovsk\'y | Matej Lieskovsk\'y (Computer Science Institute of Charles University,
Faculty of Mathematics and Physics, Prague, Czechia. Partially supported by
GA \v{C}R project 19-27871X.) | Better Algorithms for Online Bin Stretching via Computer Search | null | null | null | null | cs.DS | http://creativecommons.org/licenses/by-sa/4.0/ | We present an algorithm for computing upper bounds for the Online Bin
Stretching Problem with a small number of bins and the resulting upper bounds
for 4, 5 and 6 bins. This both demonstrates the possibility of using computer
search for upper bounds on a fundamentally real-valued online problem and
improves upon the ... | [
{
"created": "Fri, 28 Jan 2022 19:50:34 GMT",
"version": "v1"
}
] | 2022-02-01 | [
[
"Lieskovský",
"Matej",
"",
"Computer Science Institute of Charles University,\n Faculty of Mathematics and Physics, Prague, Czechia. Partially supported by\n GA ČR project 19-27871X."
]
] | We present an algorithm for computing upper bounds for the Online Bin Stretching Problem with a small number of bins and the resulting upper bounds for 4, 5 and 6 bins. This both demonstrates the possibility of using computer search for upper bounds on a fundamentally real-valued online problem and improves upon the be... |
1604.05657 | Rafael Rodrigues da Silva | Rafael Rodrigues da Silva, Bo Wu and Hai Lin | Formal Design of Robot Integrated Task and Motion Planning | Submitted to the 55th IEEE Conference on Decision and Control (CDC16) | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Integrated Task and Motion Planning (ITMP) for mobile robots in a dynamic
environment with moving obstacles is a challenging research question and
attracts more and more attentions recently. Most existing methods either
restrict to static environments or lack performance guarantees. This motivates
us to investigate t... | [
{
"created": "Tue, 19 Apr 2016 17:25:02 GMT",
"version": "v1"
},
{
"created": "Thu, 15 Dec 2016 17:02:10 GMT",
"version": "v2"
}
] | 2016-12-16 | [
[
"da Silva",
"Rafael Rodrigues",
""
],
[
"Wu",
"Bo",
""
],
[
"Lin",
"Hai",
""
]
] | Integrated Task and Motion Planning (ITMP) for mobile robots in a dynamic environment with moving obstacles is a challenging research question and attracts more and more attentions recently. Most existing methods either restrict to static environments or lack performance guarantees. This motivates us to investigate the... |
2203.15108 | Shashi Narayan | Shashi Narayan, Gon\c{c}alo Sim\~oes, Yao Zhao, Joshua Maynez,
Dipanjan Das, Michael Collins and Mirella Lapata | A Well-Composed Text is Half Done! Composition Sampling for Diverse
Conditional Generation | 21 pages, ACL 2022 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We propose Composition Sampling, a simple but effective method to generate
diverse outputs for conditional generation of higher quality compared to
previous stochastic decoding strategies. It builds on recently proposed
plan-based neural generation models (Narayan et al, 2021) that are trained to
first create a compo... | [
{
"created": "Mon, 28 Mar 2022 21:24:03 GMT",
"version": "v1"
}
] | 2022-03-30 | [
[
"Narayan",
"Shashi",
""
],
[
"Simões",
"Gonçalo",
""
],
[
"Zhao",
"Yao",
""
],
[
"Maynez",
"Joshua",
""
],
[
"Das",
"Dipanjan",
""
],
[
"Collins",
"Michael",
""
],
[
"Lapata",
"Mirella",
""
]
] | We propose Composition Sampling, a simple but effective method to generate diverse outputs for conditional generation of higher quality compared to previous stochastic decoding strategies. It builds on recently proposed plan-based neural generation models (Narayan et al, 2021) that are trained to first create a composi... |
1101.4632 | Serguei Mokhov | Serguei A. Mokhov and Marc-Andr\'e Laverdi\`ere and Ali Benssam and
Djamel Benredjem | A Secure Web-Based File Exchange Server: Software Requirements
Specification Document | 13 pages, 3 figures; a December 2005 report | null | null | null | cs.CR | http://creativecommons.org/licenses/by/3.0/ | This document presents brief software specification of a secure file exchange
system prototype involving mutual authentication of the users via their browser
and the application server with PKI-based certificates as credentials, the use
of LDAP for credential management, and authentication between the application
and... | [
{
"created": "Mon, 24 Jan 2011 19:49:14 GMT",
"version": "v1"
}
] | 2011-01-25 | [
[
"Mokhov",
"Serguei A.",
""
],
[
"Laverdière",
"Marc-André",
""
],
[
"Benssam",
"Ali",
""
],
[
"Benredjem",
"Djamel",
""
]
] | This document presents brief software specification of a secure file exchange system prototype involving mutual authentication of the users via their browser and the application server with PKI-based certificates as credentials, the use of LDAP for credential management, and authentication between the application and d... |
1401.6126 | Andrew Gleibman Ph.D. | Andrew Gleibman | Delegating Custom Object Detection Tasks to a Universal Classification
System | 3 pages, 2 figures, 6 refs. arXiv admin note: substantial text
overlap with arXiv:1310.7170 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a concept of multipurpose object detection system, recently
introduced in our previous work, is clarified. The business aspect of this
method is transformation of a classifier into an object detector/locator via an
image grid. This is a universal framework for locating objects of interest
through class... | [
{
"created": "Thu, 19 Dec 2013 08:17:24 GMT",
"version": "v1"
}
] | 2014-01-24 | [
[
"Gleibman",
"Andrew",
""
]
] | In this paper, a concept of multipurpose object detection system, recently introduced in our previous work, is clarified. The business aspect of this method is transformation of a classifier into an object detector/locator via an image grid. This is a universal framework for locating objects of interest through classif... |
2305.13783 | Guoming Huang | Shuqiao Huang, Xiru Wu, Guoming Huang | Deep Reinforcement Learning-based Multi-objective Path Planning on the
Off-road Terrain Environment for Ground Vehicles | 9 pages,8 figures | null | null | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to the vastly different energy consumption between up-slope and
down-slope, a path with the shortest length on a complex off-road terrain
environment (2.5D map) is not always the path with the least energy
consumption. For any energy-sensitive vehicle, realizing a good trade-off
between distance and energy consum... | [
{
"created": "Tue, 23 May 2023 07:53:35 GMT",
"version": "v1"
},
{
"created": "Wed, 12 Jul 2023 11:13:20 GMT",
"version": "v2"
}
] | 2023-07-13 | [
[
"Huang",
"Shuqiao",
""
],
[
"Wu",
"Xiru",
""
],
[
"Huang",
"Guoming",
""
]
] | Due to the vastly different energy consumption between up-slope and down-slope, a path with the shortest length on a complex off-road terrain environment (2.5D map) is not always the path with the least energy consumption. For any energy-sensitive vehicle, realizing a good trade-off between distance and energy consumpt... |
2112.12966 | Manmeet Singh | Manmeet Singh, Bipin Kumar, Rajib Chattopadhyay, K Amarjyothi, Anup K
Sutar, Sukanta Roy, Suryachandra A Rao, Ravi S. Nanjundiah | Machine learning for Earth System Science (ESS): A survey, status and
future directions for South Asia | null | null | null | null | cs.LG physics.ao-ph | http://creativecommons.org/licenses/by/4.0/ | This survey focuses on the current problems in Earth systems science where
machine learning algorithms can be applied. It provides an overview of previous
work, ongoing work at the Ministry of Earth Sciences, Gov. of India, and future
applications of ML algorithms to some significant earth science problems. We
provid... | [
{
"created": "Fri, 24 Dec 2021 06:44:55 GMT",
"version": "v1"
}
] | 2021-12-28 | [
[
"Singh",
"Manmeet",
""
],
[
"Kumar",
"Bipin",
""
],
[
"Chattopadhyay",
"Rajib",
""
],
[
"Amarjyothi",
"K",
""
],
[
"Sutar",
"Anup K",
""
],
[
"Roy",
"Sukanta",
""
],
[
"Rao",
"Suryachandra A",
""
],
[
... | This survey focuses on the current problems in Earth systems science where machine learning algorithms can be applied. It provides an overview of previous work, ongoing work at the Ministry of Earth Sciences, Gov. of India, and future applications of ML algorithms to some significant earth science problems. We provide ... |
1010.0958 | Partha Sarathi Mandal | Punit Sharma and Partha Sarathi Mandal | Reconstruction of Aggregation Tree in spite of Faulty Nodes in Wireless
Sensor Networks | this is a 5 page paper. this paper has been submitted to WCSN 2010 | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in wireless sensor networks (WSNs) have led to many new
promissing applications. However data communication between nodes consumes a
large portion of the total energy of WSNs. Consequently efficient data
aggregation technique can help greatly to reduce power consumption. Data
aggregation has emerged a... | [
{
"created": "Tue, 5 Oct 2010 17:54:58 GMT",
"version": "v1"
}
] | 2010-10-06 | [
[
"Sharma",
"Punit",
""
],
[
"Mandal",
"Partha Sarathi",
""
]
] | Recent advances in wireless sensor networks (WSNs) have led to many new promissing applications. However data communication between nodes consumes a large portion of the total energy of WSNs. Consequently efficient data aggregation technique can help greatly to reduce power consumption. Data aggregation has emerged as ... |
1803.09730 | Brent Schlotfeldt | Brent Schlotfeldt, Vasileios Tzoumas, Dinesh Thakur, George J. Pappas | Resilient Active Information Gathering with Mobile Robots | null | null | null | null | cs.RO cs.MA math.OC stat.AP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Applications of safety, security, and rescue in robotics, such as multi-robot
target tracking, involve the execution of information acquisition tasks by
teams of mobile robots. However, in failure-prone or adversarial environments,
robots get attacked, their communication channels get jammed, and their sensors
may fa... | [
{
"created": "Mon, 26 Mar 2018 17:41:05 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Aug 2018 03:32:18 GMT",
"version": "v2"
},
{
"created": "Sun, 2 Sep 2018 14:59:22 GMT",
"version": "v3"
}
] | 2018-09-05 | [
[
"Schlotfeldt",
"Brent",
""
],
[
"Tzoumas",
"Vasileios",
""
],
[
"Thakur",
"Dinesh",
""
],
[
"Pappas",
"George J.",
""
]
] | Applications of safety, security, and rescue in robotics, such as multi-robot target tracking, involve the execution of information acquisition tasks by teams of mobile robots. However, in failure-prone or adversarial environments, robots get attacked, their communication channels get jammed, and their sensors may fail... |
2005.02934 | Pierre-Alexandre Kamienny Mr | Pierre-Alexandre Kamienny, Matteo Pirotta, Alessandro Lazaric,
Thibault Lavril, Nicolas Usunier, Ludovic Denoyer | Learning Adaptive Exploration Strategies in Dynamic Environments Through
Informed Policy Regularization | 18 pages | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of learning exploration-exploitation strategies that
effectively adapt to dynamic environments, where the task may change over time.
While RNN-based policies could in principle represent such strategies, in
practice their training time is prohibitive and the learning process often
converges to po... | [
{
"created": "Wed, 6 May 2020 16:14:48 GMT",
"version": "v1"
}
] | 2020-05-07 | [
[
"Kamienny",
"Pierre-Alexandre",
""
],
[
"Pirotta",
"Matteo",
""
],
[
"Lazaric",
"Alessandro",
""
],
[
"Lavril",
"Thibault",
""
],
[
"Usunier",
"Nicolas",
""
],
[
"Denoyer",
"Ludovic",
""
]
] | We study the problem of learning exploration-exploitation strategies that effectively adapt to dynamic environments, where the task may change over time. While RNN-based policies could in principle represent such strategies, in practice their training time is prohibitive and the learning process often converges to poor... |
2305.04827 | Jos\'e L. Risco-Mart\'in | J. Ignacio Hidalgo, J. Manuel Colmenar, Jos\'e L. Risco-Mart\'in,
Alfredo Cuesta-Infante, Esther Maqueda, Marta Botella and Jos\'e Antonio
Rubio | Modeling glycemia in humans by means of Grammatical Evolution | null | Applied Soft Computing, 20, pp. 40-53, 2014 | 10.1016/j.asoc.2013.11.006 | null | cs.NE cs.AI | http://creativecommons.org/licenses/by-sa/4.0/ | Diabetes mellitus is a disease that affects to hundreds of millions of people
worldwide. Maintaining a good control of the disease is critical to avoid
severe long-term complications. In recent years, several artificial pancreas
systems have been proposed and developed, which are increasingly advanced.
However there ... | [
{
"created": "Thu, 27 Apr 2023 14:33:52 GMT",
"version": "v1"
}
] | 2023-05-09 | [
[
"Hidalgo",
"J. Ignacio",
""
],
[
"Colmenar",
"J. Manuel",
""
],
[
"Risco-Martín",
"José L.",
""
],
[
"Cuesta-Infante",
"Alfredo",
""
],
[
"Maqueda",
"Esther",
""
],
[
"Botella",
"Marta",
""
],
[
"Rubio",
"José ... | Diabetes mellitus is a disease that affects to hundreds of millions of people worldwide. Maintaining a good control of the disease is critical to avoid severe long-term complications. In recent years, several artificial pancreas systems have been proposed and developed, which are increasingly advanced. However there is... |
2203.05553 | Daniel McKee | Daniel McKee, Zitong Zhan, Bing Shuai, Davide Modolo, Joseph Tighe,
Svetlana Lazebnik | Transfer of Representations to Video Label Propagation: Implementation
Factors Matter | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work studies feature representations for dense label propagation in
video, with a focus on recently proposed methods that learn video
correspondence using self-supervised signals such as colorization or temporal
cycle consistency. In the literature, these methods have been evaluated with an
array of inconsistent... | [
{
"created": "Thu, 10 Mar 2022 18:58:22 GMT",
"version": "v1"
}
] | 2022-03-11 | [
[
"McKee",
"Daniel",
""
],
[
"Zhan",
"Zitong",
""
],
[
"Shuai",
"Bing",
""
],
[
"Modolo",
"Davide",
""
],
[
"Tighe",
"Joseph",
""
],
[
"Lazebnik",
"Svetlana",
""
]
] | This work studies feature representations for dense label propagation in video, with a focus on recently proposed methods that learn video correspondence using self-supervised signals such as colorization or temporal cycle consistency. In the literature, these methods have been evaluated with an array of inconsistent s... |
2310.00334 | Avi Kaplan | Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi
Kaplan, Sruthi Sekar | Bounded Simultaneous Messages | This version has a modified variant of the succinct subset sum
candidate from the original version of this paper | null | null | null | cs.CC cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the following question of bounded simultaneous messages (BSM)
protocols: Can computationally unbounded Alice and Bob evaluate a function
$f(x,y)$ of their inputs by sending polynomial-size messages to a
computationally bounded Carol? The special case where $f$ is the mod-2
inner-product function and Carol... | [
{
"created": "Sat, 30 Sep 2023 10:42:03 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Oct 2023 08:13:45 GMT",
"version": "v2"
},
{
"created": "Sun, 26 Nov 2023 11:09:30 GMT",
"version": "v3"
},
{
"created": "Thu, 21 Dec 2023 15:30:41 GMT",
"version": "v4"
}
] | 2023-12-25 | [
[
"Bogdanov",
"Andrej",
""
],
[
"Dinesh",
"Krishnamoorthy",
""
],
[
"Filmus",
"Yuval",
""
],
[
"Ishai",
"Yuval",
""
],
[
"Kaplan",
"Avi",
""
],
[
"Sekar",
"Sruthi",
""
]
] | We consider the following question of bounded simultaneous messages (BSM) protocols: Can computationally unbounded Alice and Bob evaluate a function $f(x,y)$ of their inputs by sending polynomial-size messages to a computationally bounded Carol? The special case where $f$ is the mod-2 inner-product function and Carol i... |
1601.03817 | Weining Zhu | Weining Zhu | Entity-oriented spatial coding and discrete topological spatial
relations | null | null | null | null | cs.CG cs.DM math.CO math.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Based on a newly proposed spatial data model - spatial chromatic model (SCM),
we developed a spatial coding scheme, called full-coded ordinary arranged
chromatic diagram (full-OACD). Full-OACD is a type of spatial tessellation,
where space is partitioned into a number of subspaces such as cells, edges, and
vertexes. ... | [
{
"created": "Fri, 15 Jan 2016 05:17:40 GMT",
"version": "v1"
}
] | 2016-01-18 | [
[
"Zhu",
"Weining",
""
]
] | Based on a newly proposed spatial data model - spatial chromatic model (SCM), we developed a spatial coding scheme, called full-coded ordinary arranged chromatic diagram (full-OACD). Full-OACD is a type of spatial tessellation, where space is partitioned into a number of subspaces such as cells, edges, and vertexes. Th... |
1203.3055 | David Garcia Sanchez | David Garcia Sanchez, Bruno Lacarri\`ere, Marjorie Musy, Bernard
Bourges | Application of sensitivity analysis in building energy simulations:
combining first and second order elementary effects Methods | null | null | null | null | cs.CE stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sensitivity analysis plays an important role in the understanding of complex
models. It helps to identify influence of input parameters in relation to the
outputs. It can be also a tool to understand the behavior of the model and then
can help in its development stage. This study aims to analyze and illustrate
the po... | [
{
"created": "Wed, 14 Mar 2012 11:43:21 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Dec 2012 10:54:19 GMT",
"version": "v2"
}
] | 2013-01-01 | [
[
"Sanchez",
"David Garcia",
""
],
[
"Lacarrière",
"Bruno",
""
],
[
"Musy",
"Marjorie",
""
],
[
"Bourges",
"Bernard",
""
]
] | Sensitivity analysis plays an important role in the understanding of complex models. It helps to identify influence of input parameters in relation to the outputs. It can be also a tool to understand the behavior of the model and then can help in its development stage. This study aims to analyze and illustrate the pote... |
1102.1498 | John Tadrous Mr. | John Tadrous and Mohammed Nafie | On Rate-Splitting by a Secondary Link in Multiple Access Primary Network | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An achievable rate region is obtained for a primary multiple access network
coexisting with a secondary link of one transmitter and a corresponding
receiver. The rate region depicts the sum primary rate versus the secondary
rate and is established assuming that the secondary link performs
rate-splitting. The achievab... | [
{
"created": "Tue, 8 Feb 2011 03:58:35 GMT",
"version": "v1"
}
] | 2015-03-18 | [
[
"Tadrous",
"John",
""
],
[
"Nafie",
"Mohammed",
""
]
] | An achievable rate region is obtained for a primary multiple access network coexisting with a secondary link of one transmitter and a corresponding receiver. The rate region depicts the sum primary rate versus the secondary rate and is established assuming that the secondary link performs rate-splitting. The achievable... |
2407.00676 | Yuchuan Tian | Yuchuan Tian, Jianhong Han, Hanting Chen, Yuanyuan Xi, Guoyang Zhang,
Jie Hu, Chao Xu, Yunhe Wang | Instruct-IPT: All-in-One Image Processing Transformer via Weight
Modulation | 15 pages, 4 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to the unaffordable size and intensive computation costs of low-level
vision models, All-in-One models that are designed to address a handful of
low-level vision tasks simultaneously have been popular. However, existing
All-in-One models are limited in terms of the range of tasks and performance.
To overcome thes... | [
{
"created": "Sun, 30 Jun 2024 12:13:34 GMT",
"version": "v1"
}
] | 2024-07-02 | [
[
"Tian",
"Yuchuan",
""
],
[
"Han",
"Jianhong",
""
],
[
"Chen",
"Hanting",
""
],
[
"Xi",
"Yuanyuan",
""
],
[
"Zhang",
"Guoyang",
""
],
[
"Hu",
"Jie",
""
],
[
"Xu",
"Chao",
""
],
[
"Wang",
"Yunhe",... | Due to the unaffordable size and intensive computation costs of low-level vision models, All-in-One models that are designed to address a handful of low-level vision tasks simultaneously have been popular. However, existing All-in-One models are limited in terms of the range of tasks and performance. To overcome these ... |
1908.09530 | Aakash K.T. | Aakash KT, Parikshit Sakurikar, Saurabh Saini, P. J. Narayanan | A Flexible Neural Renderer for Material Visualization | 10 pages | null | null | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Photo realism in computer generated imagery is crucially dependent on how
well an artist is able to recreate real-world materials in the scene. The
workflow for material modeling and editing typically involves manual tweaking
of material parameters and uses a standard path tracing engine for visual
feedback. A lot of... | [
{
"created": "Mon, 26 Aug 2019 08:52:53 GMT",
"version": "v1"
}
] | 2019-08-27 | [
[
"KT",
"Aakash",
""
],
[
"Sakurikar",
"Parikshit",
""
],
[
"Saini",
"Saurabh",
""
],
[
"Narayanan",
"P. J.",
""
]
] | Photo realism in computer generated imagery is crucially dependent on how well an artist is able to recreate real-world materials in the scene. The workflow for material modeling and editing typically involves manual tweaking of material parameters and uses a standard path tracing engine for visual feedback. A lot of t... |
1405.3491 | Andrej Gajduk | Andrej Gajduk, Zoran Utkovski, Lasko Basnarkov, Ljupco Kocarev | Energy-efficiency in Decentralized Wireless Networks: A Game-theoretic
Approach inspired by Evolutionary Biology | The paper is accepted for publication at the International Workshop
on Physics-inspired Paradigms in Wireless Communications and Networks -
PHYSCOMNET 2014, in conjunction with the 12th Intl. Symposium on Modelling
and Optimization in Mobile, Ad Hoc, and Wireless Networks - WIOPT, May 12-16,
2014, Hammamet, Tun... | null | null | null | cs.NI cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Energy efficiency is gaining importance in wireless communication networks
which have nodes with limited energy supply and signal processing capabilities.
We present a numerical study of cooperative communication scenarios based on
simple local rules. This is in contrast to most of the approaches in the
literature wh... | [
{
"created": "Wed, 14 May 2014 13:31:18 GMT",
"version": "v1"
}
] | 2014-11-27 | [
[
"Gajduk",
"Andrej",
""
],
[
"Utkovski",
"Zoran",
""
],
[
"Basnarkov",
"Lasko",
""
],
[
"Kocarev",
"Ljupco",
""
]
] | Energy efficiency is gaining importance in wireless communication networks which have nodes with limited energy supply and signal processing capabilities. We present a numerical study of cooperative communication scenarios based on simple local rules. This is in contrast to most of the approaches in the literature whic... |
1901.10165 | Fabio Cunial | Fabio Cunial and Djamal Belazzougui | Fully-functional bidirectional Burrows-Wheeler indexes | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a string $T$ on an alphabet of size $\sigma$, we describe a
bidirectional Burrows-Wheeler index that takes $O(|T|\log{\sigma})$ bits of
space, and that supports the addition \emph{and removal} of one character, on
the left or right side of any substring of $T$, in constant time. Previously
known data structures... | [
{
"created": "Tue, 29 Jan 2019 08:33:09 GMT",
"version": "v1"
},
{
"created": "Sun, 9 Jun 2019 14:08:49 GMT",
"version": "v2"
}
] | 2019-06-11 | [
[
"Cunial",
"Fabio",
""
],
[
"Belazzougui",
"Djamal",
""
]
] | Given a string $T$ on an alphabet of size $\sigma$, we describe a bidirectional Burrows-Wheeler index that takes $O(|T|\log{\sigma})$ bits of space, and that supports the addition \emph{and removal} of one character, on the left or right side of any substring of $T$, in constant time. Previously known data structures t... |
2306.04636 | Liming Jiang | Shuai Yang, Liming Jiang, Ziwei Liu, Chen Change Loy | GP-UNIT: Generative Prior for Versatile Unsupervised Image-to-Image
Translation | Accepted by IEEE Transactions on Pattern Analysis and Machine
Intelligence (TPAMI). Code: https://github.com/williamyang1991/GP-UNIT
Project page: https://www.mmlab-ntu.com/project/gpunit/. arXiv admin note:
substantial text overlap with arXiv:2204.03641 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in deep learning have witnessed many successful unsupervised
image-to-image translation models that learn correspondences between two visual
domains without paired data. However, it is still a great challenge to build
robust mappings between various domains especially for those with drastic
visual dis... | [
{
"created": "Wed, 7 Jun 2023 17:59:22 GMT",
"version": "v1"
}
] | 2023-06-08 | [
[
"Yang",
"Shuai",
""
],
[
"Jiang",
"Liming",
""
],
[
"Liu",
"Ziwei",
""
],
[
"Loy",
"Chen Change",
""
]
] | Recent advances in deep learning have witnessed many successful unsupervised image-to-image translation models that learn correspondences between two visual domains without paired data. However, it is still a great challenge to build robust mappings between various domains especially for those with drastic visual discr... |
2202.03654 | Mohammad Vahid Jamali | Mohammad Vahid Jamali, Mohammad Fereydounian, Hessam Mahdavifar, Hamed
Hassani | Low-Complexity Decoding of a Class of Reed-Muller Subcodes for
Low-Capacity Channels | Accepted for presentation in the 2022 IEEE International Conference
on Communications (ICC) | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a low-complexity and low-latency decoding algorithm for a class of
Reed-Muller (RM) subcodes that are defined based on the product of smaller RM
codes. More specifically, the input sequence is shaped as a multi-dimensional
array, and the encoding over each dimension is done separately via a smaller RM
enco... | [
{
"created": "Tue, 8 Feb 2022 05:18:37 GMT",
"version": "v1"
}
] | 2022-02-09 | [
[
"Jamali",
"Mohammad Vahid",
""
],
[
"Fereydounian",
"Mohammad",
""
],
[
"Mahdavifar",
"Hessam",
""
],
[
"Hassani",
"Hamed",
""
]
] | We present a low-complexity and low-latency decoding algorithm for a class of Reed-Muller (RM) subcodes that are defined based on the product of smaller RM codes. More specifically, the input sequence is shaped as a multi-dimensional array, and the encoding over each dimension is done separately via a smaller RM encode... |
2406.13881 | Luke Marzen | Luke Marzen, Akash Dutta, Ali Jannesari | Static Generation of Efficient OpenMP Offload Data Mappings | Accepted to the 2024 International Conference for High Performance
Computing, Networking, Storage, and Analysis (SC24) | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Increasing heterogeneity in HPC architectures and compiler advancements have
led to OpenMP being frequently used to enable computations on heterogeneous
devices. However, the efficient movement of data on heterogeneous computing
platforms is crucial for achieving high utilization. The implicit OpenMP
data-mapping rul... | [
{
"created": "Wed, 19 Jun 2024 23:21:23 GMT",
"version": "v1"
}
] | 2024-06-21 | [
[
"Marzen",
"Luke",
""
],
[
"Dutta",
"Akash",
""
],
[
"Jannesari",
"Ali",
""
]
] | Increasing heterogeneity in HPC architectures and compiler advancements have led to OpenMP being frequently used to enable computations on heterogeneous devices. However, the efficient movement of data on heterogeneous computing platforms is crucial for achieving high utilization. The implicit OpenMP data-mapping rules... |
1711.04596 | William Blum | Mohit Rajpal, William Blum, Rishabh Singh | Not all bytes are equal: Neural byte sieve for fuzzing | null | null | null | null | cs.SE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fuzzing is a popular dynamic program analysis technique used to find
vulnerabilities in complex software. Fuzzing involves presenting a target
program with crafted malicious input designed to cause crashes, buffer
overflows, memory errors, and exceptions. Crafting malicious inputs in an
efficient manner is a difficul... | [
{
"created": "Fri, 10 Nov 2017 01:29:47 GMT",
"version": "v1"
}
] | 2017-11-15 | [
[
"Rajpal",
"Mohit",
""
],
[
"Blum",
"William",
""
],
[
"Singh",
"Rishabh",
""
]
] | Fuzzing is a popular dynamic program analysis technique used to find vulnerabilities in complex software. Fuzzing involves presenting a target program with crafted malicious input designed to cause crashes, buffer overflows, memory errors, and exceptions. Crafting malicious inputs in an efficient manner is a difficult ... |
2106.14574 | Paula Czarnowska | Paula Czarnowska, Yogarshi Vyas, Kashif Shah | Quantifying Social Biases in NLP: A Generalization and Empirical
Comparison of Extrinsic Fairness Metrics | Accepted for publication in Transaction of the Association for
Computational Linguistics (TACL), 2021. The arXiv version is a pre-MIT Press
publication version | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Measuring bias is key for better understanding and addressing unfairness in
NLP/ML models. This is often done via fairness metrics which quantify the
differences in a model's behaviour across a range of demographic groups. In
this work, we shed more light on the differences and similarities between the
fairness metri... | [
{
"created": "Mon, 28 Jun 2021 11:02:33 GMT",
"version": "v1"
}
] | 2021-06-29 | [
[
"Czarnowska",
"Paula",
""
],
[
"Vyas",
"Yogarshi",
""
],
[
"Shah",
"Kashif",
""
]
] | Measuring bias is key for better understanding and addressing unfairness in NLP/ML models. This is often done via fairness metrics which quantify the differences in a model's behaviour across a range of demographic groups. In this work, we shed more light on the differences and similarities between the fairness metrics... |
2310.02861 | Xiangyu Dong | Xiangyu Dong, Xingyi Zhang, Sibo Wang | Rayleigh Quotient Graph Neural Networks for Graph-level Anomaly
Detection | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph-level anomaly detection has gained significant attention as it finds
applications in various domains, such as cancer diagnosis and enzyme
prediction. However, existing methods fail to capture the spectral properties
of graph anomalies, resulting in unexplainable framework design and
unsatisfying performance. In... | [
{
"created": "Wed, 4 Oct 2023 14:47:27 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Oct 2023 03:33:59 GMT",
"version": "v2"
},
{
"created": "Fri, 23 Feb 2024 08:54:13 GMT",
"version": "v3"
},
{
"created": "Thu, 28 Mar 2024 03:29:34 GMT",
"version": "v4"
}
] | 2024-03-29 | [
[
"Dong",
"Xiangyu",
""
],
[
"Zhang",
"Xingyi",
""
],
[
"Wang",
"Sibo",
""
]
] | Graph-level anomaly detection has gained significant attention as it finds applications in various domains, such as cancer diagnosis and enzyme prediction. However, existing methods fail to capture the spectral properties of graph anomalies, resulting in unexplainable framework design and unsatisfying performance. In t... |
2403.06515 | Edon Kelmendi | Toghrul Karimov, Edon Kelmendi, Jo\"el Ouaknine, James Worrell | Multiple Reachability in Linear Dynamical Systems | null | null | null | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | We consider reachability decision problems for linear dynamical systems:
Given a linear map on $\mathbb{R}^d$ , together with source and target sets,
determine whether there is a point in the source set whose orbit, obtained by
repeatedly applying the linear map, enters the target set. When the source and
target sets... | [
{
"created": "Mon, 11 Mar 2024 08:43:42 GMT",
"version": "v1"
}
] | 2024-03-12 | [
[
"Karimov",
"Toghrul",
""
],
[
"Kelmendi",
"Edon",
""
],
[
"Ouaknine",
"Joël",
""
],
[
"Worrell",
"James",
""
]
] | We consider reachability decision problems for linear dynamical systems: Given a linear map on $\mathbb{R}^d$ , together with source and target sets, determine whether there is a point in the source set whose orbit, obtained by repeatedly applying the linear map, enters the target set. When the source and target sets a... |
2311.10293 | Yanzhao Wu | Yanzhao Wu, Ka-Ho Chow, Wenqi Wei, Ling Liu | Hierarchical Pruning of Deep Ensembles with Focal Diversity | To appear on ACM Transactions on Intelligent Systems and Technology | null | 10.1145/3633286 | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural network ensembles combine the wisdom of multiple deep neural
networks to improve the generalizability and robustness over individual
networks. It has gained increasing popularity to study deep ensemble techniques
in the deep learning community. Some mission-critical applications utilize a
large number of ... | [
{
"created": "Fri, 17 Nov 2023 02:48:20 GMT",
"version": "v1"
}
] | 2023-11-20 | [
[
"Wu",
"Yanzhao",
""
],
[
"Chow",
"Ka-Ho",
""
],
[
"Wei",
"Wenqi",
""
],
[
"Liu",
"Ling",
""
]
] | Deep neural network ensembles combine the wisdom of multiple deep neural networks to improve the generalizability and robustness over individual networks. It has gained increasing popularity to study deep ensemble techniques in the deep learning community. Some mission-critical applications utilize a large number of de... |
2404.11895 | Wei Wu | Wei Wu, Qingnan Fan, Shuai Qin, Hong Gu, Ruoyu Zhao, Antoni B. Chan | FreeDiff: Progressive Frequency Truncation for Image Editing with
Diffusion Models | Accepted by ECCV-2024 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Precise image editing with text-to-image models has attracted increasing
interest due to their remarkable generative capabilities and user-friendly
nature. However, such attempts face the pivotal challenge of misalignment
between the intended precise editing target regions and the broader area
impacted by the guidanc... | [
{
"created": "Thu, 18 Apr 2024 04:47:28 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Aug 2024 06:48:37 GMT",
"version": "v2"
}
] | 2024-08-14 | [
[
"Wu",
"Wei",
""
],
[
"Fan",
"Qingnan",
""
],
[
"Qin",
"Shuai",
""
],
[
"Gu",
"Hong",
""
],
[
"Zhao",
"Ruoyu",
""
],
[
"Chan",
"Antoni B.",
""
]
] | Precise image editing with text-to-image models has attracted increasing interest due to their remarkable generative capabilities and user-friendly nature. However, such attempts face the pivotal challenge of misalignment between the intended precise editing target regions and the broader area impacted by the guidance ... |
1110.0025 | N. Nisan | N. Nisan, A. Ronen | Computationally Feasible VCG Mechanisms | null | Journal Of Artificial Intelligence Research, Volume 29, pages
19-47, 2007 | 10.1613/jair.2046 | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A major achievement of mechanism design theory is a general method for the
construction of truthful mechanisms called VCG (Vickrey, Clarke, Groves). When
applying this method to complex problems such as combinatorial auctions, a
difficulty arises: VCG mechanisms are required to compute optimal outcomes and
are, there... | [
{
"created": "Fri, 30 Sep 2011 20:55:24 GMT",
"version": "v1"
}
] | 2011-10-04 | [
[
"Nisan",
"N.",
""
],
[
"Ronen",
"A.",
""
]
] | A major achievement of mechanism design theory is a general method for the construction of truthful mechanisms called VCG (Vickrey, Clarke, Groves). When applying this method to complex problems such as combinatorial auctions, a difficulty arises: VCG mechanisms are required to compute optimal outcomes and are, therefo... |
2101.01168 | Wieslaw Kopec | Rafa{\l} Mas{\l}yk, Kinga Skorupska, Piotr Gago, Marcin Niewi\'nski,
Barbara Karpowicz, Anna Jaskulska, Katarzyna Abramczuk, Wies{\l}aw Kope\'c | Deploying Crowdsourcing for Workflow Driven Business Process | null | null | null | null | cs.HC cs.CY cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The main goal of this paper is to discuss how to integrate the possibilities
of crowdsourcing platforms with systems supporting workflow to enable the
engagement and interaction with business tasks of a wider group of people.
Thus, this work is an attempt to expand the functional capabilities of typical
business syst... | [
{
"created": "Mon, 4 Jan 2021 18:57:21 GMT",
"version": "v1"
}
] | 2021-01-05 | [
[
"Masłyk",
"Rafał",
""
],
[
"Skorupska",
"Kinga",
""
],
[
"Gago",
"Piotr",
""
],
[
"Niewiński",
"Marcin",
""
],
[
"Karpowicz",
"Barbara",
""
],
[
"Jaskulska",
"Anna",
""
],
[
"Abramczuk",
"Katarzyna",
""
]... | The main goal of this paper is to discuss how to integrate the possibilities of crowdsourcing platforms with systems supporting workflow to enable the engagement and interaction with business tasks of a wider group of people. Thus, this work is an attempt to expand the functional capabilities of typical business system... |
2407.08506 | I\~nigo Iturrate | Diego Dall'Alba, Lorenzo Busellato, Thiusius Rajeeth Savarimuthu,
Zhuoqi Cheng, I\~nigo Iturrate | Imitation Learning for Robotic Assisted Ultrasound Examination of Deep
Venous Thrombosis using Kernelized Movement Primitives | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Vein Thrombosis (DVT) is a common yet potentially fatal condition, often
leading to critical complications like pulmonary embolism. DVT is commonly
diagnosed using Ultrasound (US) imaging, which can be inconsistent due to its
high dependence on the operator's skill. Robotic US Systems (RUSs) aim to
improve diagn... | [
{
"created": "Thu, 11 Jul 2024 13:44:41 GMT",
"version": "v1"
}
] | 2024-07-12 | [
[
"Dall'Alba",
"Diego",
""
],
[
"Busellato",
"Lorenzo",
""
],
[
"Savarimuthu",
"Thiusius Rajeeth",
""
],
[
"Cheng",
"Zhuoqi",
""
],
[
"Iturrate",
"Iñigo",
""
]
] | Deep Vein Thrombosis (DVT) is a common yet potentially fatal condition, often leading to critical complications like pulmonary embolism. DVT is commonly diagnosed using Ultrasound (US) imaging, which can be inconsistent due to its high dependence on the operator's skill. Robotic US Systems (RUSs) aim to improve diagnos... |
1903.09402 | Akihito Taya | Akihito Taya, Takayuki Nishio, Masahiro Morikura, Koji Yamamoto | Concurrent Transmission Scheduling for Perceptual Data Sharing in mmWave
Vehicular Networks | IEICE TRANS. INF. & SYST | IEICE TRANSACTIONS on Information and Systems, Vol.E102-D,No.5,
May 2019 | 10.1587/transinf.2018NTP0008 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sharing perceptual data with other vehicles enhances the traffic safety of
autonomous vehicles because it helps vehicles locate other vehicles and
pedestrians in their blind spots. Such safety applications require high
throughput and short delay, which cannot be achieved by conventional microwave
vehicular communicat... | [
{
"created": "Fri, 22 Mar 2019 08:38:11 GMT",
"version": "v1"
}
] | 2019-03-26 | [
[
"Taya",
"Akihito",
""
],
[
"Nishio",
"Takayuki",
""
],
[
"Morikura",
"Masahiro",
""
],
[
"Yamamoto",
"Koji",
""
]
] | Sharing perceptual data with other vehicles enhances the traffic safety of autonomous vehicles because it helps vehicles locate other vehicles and pedestrians in their blind spots. Such safety applications require high throughput and short delay, which cannot be achieved by conventional microwave vehicular communicatio... |
2204.11590 | Zhenyu Li | Zhenyu Li, Zehui Chen, Ang Li, Liangji Fang, Qinhong Jiang, Xianming
Liu, Junjun Jiang | Unsupervised Domain Adaptation for Monocular 3D Object Detection via
Self-Training | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Monocular 3D object detection (Mono3D) has achieved unprecedented success
with the advent of deep learning techniques and emerging large-scale autonomous
driving datasets. However, drastic performance degradation remains an
unwell-studied challenge for practical cross-domain deployment as the lack of
labels on the ta... | [
{
"created": "Mon, 25 Apr 2022 12:23:07 GMT",
"version": "v1"
},
{
"created": "Wed, 27 Apr 2022 02:08:21 GMT",
"version": "v2"
}
] | 2022-04-28 | [
[
"Li",
"Zhenyu",
""
],
[
"Chen",
"Zehui",
""
],
[
"Li",
"Ang",
""
],
[
"Fang",
"Liangji",
""
],
[
"Jiang",
"Qinhong",
""
],
[
"Liu",
"Xianming",
""
],
[
"Jiang",
"Junjun",
""
]
] | Monocular 3D object detection (Mono3D) has achieved unprecedented success with the advent of deep learning techniques and emerging large-scale autonomous driving datasets. However, drastic performance degradation remains an unwell-studied challenge for practical cross-domain deployment as the lack of labels on the targ... |
1811.05654 | Sandeep Juneja | Sandeep Juneja and Subhashini Krishnasamy | Sample complexity of partition identification using multi-armed bandits | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a vector of probability distributions, or arms, each of which can be
sampled independently, we consider the problem of identifying the partition to
which this vector belongs from a finitely partitioned universe of such vector
of distributions. We study this as a pure exploration problem in multi armed
bandit se... | [
{
"created": "Wed, 14 Nov 2018 05:41:08 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Feb 2019 12:09:25 GMT",
"version": "v2"
}
] | 2019-02-06 | [
[
"Juneja",
"Sandeep",
""
],
[
"Krishnasamy",
"Subhashini",
""
]
] | Given a vector of probability distributions, or arms, each of which can be sampled independently, we consider the problem of identifying the partition to which this vector belongs from a finitely partitioned universe of such vector of distributions. We study this as a pure exploration problem in multi armed bandit sett... |
1805.11489 | Matthieu Lequesne | Alain Couvreur and Matthieu Lequesne and Jean-Pierre Tillich | Recovering short secret keys of RLCE in polynomial time | null | null | null | null | cs.CR cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a key recovery attack against Y. Wang's Random Linear Code
Encryption (RLCE) scheme recently submitted to the NIST call for post-quantum
cryptography. This attack recovers the secret key for all the short key
parameters proposed by the author.
| [
{
"created": "Tue, 29 May 2018 14:12:25 GMT",
"version": "v1"
}
] | 2018-05-30 | [
[
"Couvreur",
"Alain",
""
],
[
"Lequesne",
"Matthieu",
""
],
[
"Tillich",
"Jean-Pierre",
""
]
] | We present a key recovery attack against Y. Wang's Random Linear Code Encryption (RLCE) scheme recently submitted to the NIST call for post-quantum cryptography. This attack recovers the secret key for all the short key parameters proposed by the author. |
1909.04238 | Ming Wu | Ming Wu, Pengcheng Wang, Kangqi Yin, Haoyu Cheng, Yun Xu and Chanchal
K.Roy | LVMapper: A Large-variance Clone Detector Using Sequencing Alignment
Approach | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To detect large-variance code clones (i.e. clones with relatively more
differences) in large-scale code repositories is difficult because most current
tools can only detect almost identical or very similar clones. It will make
promotion and changes to some software applications such as bug detection, code
completion,... | [
{
"created": "Tue, 10 Sep 2019 02:01:28 GMT",
"version": "v1"
}
] | 2019-09-11 | [
[
"Wu",
"Ming",
""
],
[
"Wang",
"Pengcheng",
""
],
[
"Yin",
"Kangqi",
""
],
[
"Cheng",
"Haoyu",
""
],
[
"Xu",
"Yun",
""
],
[
"Roy",
"Chanchal K.",
""
]
] | To detect large-variance code clones (i.e. clones with relatively more differences) in large-scale code repositories is difficult because most current tools can only detect almost identical or very similar clones. It will make promotion and changes to some software applications such as bug detection, code completion, s... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.