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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2206.06620 | Weijie Chen | Rang Meng, Weijie Chen, Shicai Yang, Jie Song, Luojun Lin, Di Xie,
Shiliang Pu, Xinchao Wang, Mingli Song, Yueting Zhuang | Slimmable Domain Adaptation | To appear in CVPR 2022. Code is coming soon:
https://github.com/hikvision-research/SlimDA | IEEE/CVF Computer Vision and Pattern Recognition Conference
(CVPR), 2022 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vanilla unsupervised domain adaptation methods tend to optimize the model
with fixed neural architecture, which is not very practical in real-world
scenarios since the target data is usually processed by different
resource-limited devices. It is therefore of great necessity to facilitate
architecture adaptation acros... | [
{
"created": "Tue, 14 Jun 2022 06:28:04 GMT",
"version": "v1"
}
] | 2022-06-15 | [
[
"Meng",
"Rang",
""
],
[
"Chen",
"Weijie",
""
],
[
"Yang",
"Shicai",
""
],
[
"Song",
"Jie",
""
],
[
"Lin",
"Luojun",
""
],
[
"Xie",
"Di",
""
],
[
"Pu",
"Shiliang",
""
],
[
"Wang",
"Xinchao",
... | Vanilla unsupervised domain adaptation methods tend to optimize the model with fixed neural architecture, which is not very practical in real-world scenarios since the target data is usually processed by different resource-limited devices. It is therefore of great necessity to facilitate architecture adaptation across ... |
1305.0513 | Ruoming Jin | Ruoming Jin, Yelong Shen, Lin Liu and Xue-wen Chen | Limiting the Neighborhood: De-Small-World Network for Outbreak
Prevention | 9 pages | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we study a basic and practically important strategy to help
prevent and/or delay an outbreak in the context of network: limiting the
contact between individuals. In this paper, we introduce the average
neighborhood size as a new measure for the degree of being small-world and
utilize it to formally defi... | [
{
"created": "Thu, 2 May 2013 17:03:58 GMT",
"version": "v1"
}
] | 2013-05-03 | [
[
"Jin",
"Ruoming",
""
],
[
"Shen",
"Yelong",
""
],
[
"Liu",
"Lin",
""
],
[
"Chen",
"Xue-wen",
""
]
] | In this work, we study a basic and practically important strategy to help prevent and/or delay an outbreak in the context of network: limiting the contact between individuals. In this paper, we introduce the average neighborhood size as a new measure for the degree of being small-world and utilize it to formally define... |
2405.07326 | Mahmood Ahmadi | Amirhossein Shahrokhi and Mahmood Ahmadi | Power Evaluation of IOT Application Layer Protocols | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by-sa/4.0/ | The Internet of Things has affected all aspects of daily life, and the number
of IoT devices is increasing day by day. According to forecasts, the number of
Internet of Things devices will reach one trillion devices by 2035. The
increase in the number of devices connected to the Internet will cause various
concerns. ... | [
{
"created": "Sun, 12 May 2024 16:23:52 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"Shahrokhi",
"Amirhossein",
""
],
[
"Ahmadi",
"Mahmood",
""
]
] | The Internet of Things has affected all aspects of daily life, and the number of IoT devices is increasing day by day. According to forecasts, the number of Internet of Things devices will reach one trillion devices by 2035. The increase in the number of devices connected to the Internet will cause various concerns. On... |
1703.01619 | Graham Neubig | Graham Neubig | Neural Machine Translation and Sequence-to-sequence Models: A Tutorial | 65 Pages | null | null | null | cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This tutorial introduces a new and powerful set of techniques variously
called "neural machine translation" or "neural sequence-to-sequence models".
These techniques have been used in a number of tasks regarding the handling of
human language, and can be a powerful tool in the toolbox of anyone who wants
to model seq... | [
{
"created": "Sun, 5 Mar 2017 16:10:11 GMT",
"version": "v1"
}
] | 2017-03-07 | [
[
"Neubig",
"Graham",
""
]
] | This tutorial introduces a new and powerful set of techniques variously called "neural machine translation" or "neural sequence-to-sequence models". These techniques have been used in a number of tasks regarding the handling of human language, and can be a powerful tool in the toolbox of anyone who wants to model seque... |
1105.3259 | Frank Nielsen | Frank Nielsen and Richard Nock | On R\'enyi and Tsallis entropies and divergences for exponential
families | 7 pages | Journal of Physics A: Mathematical and Theoretical, Volume 45
Number 3, 2012 | 10.1088/1751-8113/45/3/032003 | null | cs.IT cs.LG math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many common probability distributions in statistics like the Gaussian,
multinomial, Beta or Gamma distributions can be studied under the unified
framework of exponential families. In this paper, we prove that both R\'enyi
and Tsallis divergences of distributions belonging to the same exponential
family admit a generi... | [
{
"created": "Tue, 17 May 2011 02:05:32 GMT",
"version": "v1"
}
] | 2012-02-01 | [
[
"Nielsen",
"Frank",
""
],
[
"Nock",
"Richard",
""
]
] | Many common probability distributions in statistics like the Gaussian, multinomial, Beta or Gamma distributions can be studied under the unified framework of exponential families. In this paper, we prove that both R\'enyi and Tsallis divergences of distributions belonging to the same exponential family admit a generic ... |
1408.3639 | Ye Liang | Ye Liang | Solving Polynomial Equations with Equation Constraints: the
Zero-dimensional Case | null | null | null | null | cs.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A zero-dimensional polynomial ideal may have a lot of complex zeros. But
sometimes, only some of them are needed. In this paper, for a zero-dimensional
ideal $I$, we study its complex zeros that locate in another variety
$\textbf{V}(J)$ where $J$ is an arbitrary ideal.
The main problem is that for a point in $\text... | [
{
"created": "Fri, 15 Aug 2014 20:03:21 GMT",
"version": "v1"
}
] | 2014-08-19 | [
[
"Liang",
"Ye",
""
]
] | A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal $I$, we study its complex zeros that locate in another variety $\textbf{V}(J)$ where $J$ is an arbitrary ideal. The main problem is that for a point in $\textbf{V... |
1407.4056 | Dinesh Ramasamy | Dinesh Ramasamy and Upamanyu Madhow | Scalable and Efficient Geographic Routing in Mobile Ad Hoc Wireless
Networks | IEEE Transactions on Information Theory | null | null | null | cs.NI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose and evaluate a scalable position-publish and an accompanying
routing protocol which is efficient despite operating with imperfect
information regarding the destination's location. The traffic generated by our
position-publish protocol fits within the transport capacity of large mobile ad
hoc networks (MANE... | [
{
"created": "Tue, 15 Jul 2014 16:55:19 GMT",
"version": "v1"
}
] | 2014-07-16 | [
[
"Ramasamy",
"Dinesh",
""
],
[
"Madhow",
"Upamanyu",
""
]
] | We propose and evaluate a scalable position-publish and an accompanying routing protocol which is efficient despite operating with imperfect information regarding the destination's location. The traffic generated by our position-publish protocol fits within the transport capacity of large mobile ad hoc networks (MANETs... |
2407.02651 | Majeed Kazemitabaar | Majeed Kazemitabaar, Jack Williams, Ian Drosos, Tovi Grossman, Austin
Henley, Carina Negreanu, Advait Sarkar | Improving Steering and Verification in AI-Assisted Data Analysis with
Interactive Task Decomposition | Published at UIST 2024; 19 pages, 9 figures, and 2 tables | Proceedings of the 37th Annual ACM Symposium on User Interface
Software and Technology (UIST 2024) | 10.1145/3654777.3676345 | null | cs.HC cs.AI | http://creativecommons.org/licenses/by/4.0/ | LLM-powered tools like ChatGPT Data Analysis, have the potential to help
users tackle the challenging task of data analysis programming, which requires
expertise in data processing, programming, and statistics. However, our
formative study (n=15) uncovered serious challenges in verifying AI-generated
results and stee... | [
{
"created": "Tue, 2 Jul 2024 20:33:50 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Aug 2024 15:56:00 GMT",
"version": "v2"
}
] | 2024-08-02 | [
[
"Kazemitabaar",
"Majeed",
""
],
[
"Williams",
"Jack",
""
],
[
"Drosos",
"Ian",
""
],
[
"Grossman",
"Tovi",
""
],
[
"Henley",
"Austin",
""
],
[
"Negreanu",
"Carina",
""
],
[
"Sarkar",
"Advait",
""
]
] | LLM-powered tools like ChatGPT Data Analysis, have the potential to help users tackle the challenging task of data analysis programming, which requires expertise in data processing, programming, and statistics. However, our formative study (n=15) uncovered serious challenges in verifying AI-generated results and steeri... |
2304.07689 | Zhiyuan Li | Zhiyuan Li, Ziru Liu, Anna Zou, Anca L. Ralescu | Learning Empirical Bregman Divergence for Uncertain Distance
Representation | Accepted by IEEE FUSION 2023 | null | 10.23919/FUSION52260.2023.10224080 | null | cs.CV cs.AI cs.IT cs.LG math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep metric learning techniques have been used for visual representation in
various supervised and unsupervised learning tasks through learning embeddings
of samples with deep networks. However, classic approaches, which employ a
fixed distance metric as a similarity function between two embeddings, may lead
to subop... | [
{
"created": "Sun, 16 Apr 2023 04:16:28 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Apr 2023 01:22:50 GMT",
"version": "v2"
},
{
"created": "Mon, 15 May 2023 16:38:23 GMT",
"version": "v3"
}
] | 2023-08-30 | [
[
"Li",
"Zhiyuan",
""
],
[
"Liu",
"Ziru",
""
],
[
"Zou",
"Anna",
""
],
[
"Ralescu",
"Anca L.",
""
]
] | Deep metric learning techniques have been used for visual representation in various supervised and unsupervised learning tasks through learning embeddings of samples with deep networks. However, classic approaches, which employ a fixed distance metric as a similarity function between two embeddings, may lead to subopti... |
2205.13190 | Haitao Lin | Haitao Lin, Junnan Zhu, Lu Xiang, Yu Zhou, Jiajun Zhang, Chengqing
Zong | Other Roles Matter! Enhancing Role-Oriented Dialogue Summarization via
Role Interactions | Accepted by ACL 2022 main conference | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Role-oriented dialogue summarization is to generate summaries for different
roles in the dialogue, e.g., merchants and consumers. Existing methods handle
this task by summarizing each role's content separately and thus are prone to
ignore the information from other roles. However, we believe that other roles'
content... | [
{
"created": "Thu, 26 May 2022 06:58:02 GMT",
"version": "v1"
}
] | 2022-05-27 | [
[
"Lin",
"Haitao",
""
],
[
"Zhu",
"Junnan",
""
],
[
"Xiang",
"Lu",
""
],
[
"Zhou",
"Yu",
""
],
[
"Zhang",
"Jiajun",
""
],
[
"Zong",
"Chengqing",
""
]
] | Role-oriented dialogue summarization is to generate summaries for different roles in the dialogue, e.g., merchants and consumers. Existing methods handle this task by summarizing each role's content separately and thus are prone to ignore the information from other roles. However, we believe that other roles' content c... |
2406.19878 | Ruben Interian | Ruben Interian | A political radicalization framework based on Moral Foundations Theory | null | null | null | null | cs.SI physics.soc-ph | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Moral Foundations Theory proposes that individuals with conflicting political
views base their behavior on different principles chosen from a small group of
universal moral foundations. This study proposes using a set of widely accepted
moral foundations (Fairness, Ingroup loyalty, Authority, and Purity) as proxies
t... | [
{
"created": "Fri, 28 Jun 2024 12:36:06 GMT",
"version": "v1"
}
] | 2024-07-01 | [
[
"Interian",
"Ruben",
""
]
] | Moral Foundations Theory proposes that individuals with conflicting political views base their behavior on different principles chosen from a small group of universal moral foundations. This study proposes using a set of widely accepted moral foundations (Fairness, Ingroup loyalty, Authority, and Purity) as proxies to ... |
2403.09176 | Byeongjun Park | Byeongjun Park, Hyojun Go, Jin-Young Kim, Sangmin Woo, Seokil Ham,
Changick Kim | Switch Diffusion Transformer: Synergizing Denoising Tasks with Sparse
Mixture-of-Experts | Project Page: https://byeongjun-park.github.io/Switch-DiT/ | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Diffusion models have achieved remarkable success across a range of
generative tasks. Recent efforts to enhance diffusion model architectures have
reimagined them as a form of multi-task learning, where each task corresponds
to a denoising task at a specific noise level. While these efforts have focused
on parameter ... | [
{
"created": "Thu, 14 Mar 2024 08:43:43 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Jul 2024 07:39:08 GMT",
"version": "v2"
}
] | 2024-07-11 | [
[
"Park",
"Byeongjun",
""
],
[
"Go",
"Hyojun",
""
],
[
"Kim",
"Jin-Young",
""
],
[
"Woo",
"Sangmin",
""
],
[
"Ham",
"Seokil",
""
],
[
"Kim",
"Changick",
""
]
] | Diffusion models have achieved remarkable success across a range of generative tasks. Recent efforts to enhance diffusion model architectures have reimagined them as a form of multi-task learning, where each task corresponds to a denoising task at a specific noise level. While these efforts have focused on parameter is... |
1509.04252 | Andreas Kreienbuehl | Andreas Kreienbuehl and Arne Naegel and Daniel Ruprecht and Andreas
Vogel and Gabriel Wittum and Rolf Krause | Parareal convergence for 2D unsteady flow around a cylinder | 16 pages, 7 figures | null | null | null | cs.CE cs.DC cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this technical report we study the convergence of Parareal for 2D
incompressible flow around a cylinder for different viscosities. Two methods
are used as fine integrator: backward Euler and a fractional step method. It is
found that Parareal converges better for the implicit Euler, likely because it
under-resolve... | [
{
"created": "Mon, 14 Sep 2015 19:29:41 GMT",
"version": "v1"
}
] | 2015-09-15 | [
[
"Kreienbuehl",
"Andreas",
""
],
[
"Naegel",
"Arne",
""
],
[
"Ruprecht",
"Daniel",
""
],
[
"Vogel",
"Andreas",
""
],
[
"Wittum",
"Gabriel",
""
],
[
"Krause",
"Rolf",
""
]
] | In this technical report we study the convergence of Parareal for 2D incompressible flow around a cylinder for different viscosities. Two methods are used as fine integrator: backward Euler and a fractional step method. It is found that Parareal converges better for the implicit Euler, likely because it under-resolves ... |
2202.13026 | Flash Sheridan | Flash Sheridan | Static Analysis Deployment Pitfalls | null | Supplemental Proceedings of the 21st IEEE International Symposium
on Software Reliability Engineering, November 2010 | null | null | cs.SE cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Organizational, political, and configuration mistakes in the deployment of a
static source code analysis tool within a software development organization can
result in most of the value of the tool being lost, even while apparently
meeting management goals. A list of pitfalls encountered as a static analysis
consultan... | [
{
"created": "Sat, 26 Feb 2022 01:01:08 GMT",
"version": "v1"
}
] | 2022-03-01 | [
[
"Sheridan",
"Flash",
""
]
] | Organizational, political, and configuration mistakes in the deployment of a static source code analysis tool within a software development organization can result in most of the value of the tool being lost, even while apparently meeting management goals. A list of pitfalls encountered as a static analysis consultant ... |
2305.13913 | Yun Li | Yun Li, Hongwei Liu, Sihem Mesnager | Constructions of Constant Dimension Subspace Codes | This article was submitted to Designs, Codes and Cryptography on
November 22nd, 2022 | null | null | null | cs.IT math.CO math.IT | http://creativecommons.org/licenses/by/4.0/ | Subspace codes have important applications in random network coding. It is
interesting to construct subspace codes with both sizes, and the minimum
distances are as large as possible. In particular, cyclic constant dimension
subspaces codes have additional properties which can be used to make encoding
and decoding mo... | [
{
"created": "Tue, 23 May 2023 10:37:00 GMT",
"version": "v1"
}
] | 2023-05-24 | [
[
"Li",
"Yun",
""
],
[
"Liu",
"Hongwei",
""
],
[
"Mesnager",
"Sihem",
""
]
] | Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes have additional properties which can be used to make encoding and decoding more... |
1704.02789 | Mahardhika Pratama Dr | Mahardhika Pratama, Plamen P. Angelov, Edwin Lughofer | Parsimonious Random Vector Functional Link Network for Data Streams | this paper is submitted for publication in Information Sciences | null | 10.1016/j.ins.2017.11.050 | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The theory of random vector functional link network (RVFLN) has provided a
breakthrough in the design of neural networks (NNs) since it conveys solid
theoretical justification of randomized learning. Existing works in RVFLN are
hardly scalable for data stream analytics because they are inherent to the
issue of comple... | [
{
"created": "Mon, 10 Apr 2017 10:24:34 GMT",
"version": "v1"
},
{
"created": "Sat, 6 May 2017 11:59:53 GMT",
"version": "v2"
}
] | 2018-02-06 | [
[
"Pratama",
"Mahardhika",
""
],
[
"Angelov",
"Plamen P.",
""
],
[
"Lughofer",
"Edwin",
""
]
] | The theory of random vector functional link network (RVFLN) has provided a breakthrough in the design of neural networks (NNs) since it conveys solid theoretical justification of randomized learning. Existing works in RVFLN are hardly scalable for data stream analytics because they are inherent to the issue of complexi... |
2106.00451 | Fan Huang | Fan Huang | Highlight Timestamp Detection Model for Comedy Videos via Multimodal
Sentiment Analysis | null | null | null | null | cs.CV cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nowadays, the videos on the Internet are prevailing. The precise and in-depth
understanding of the videos is a difficult but valuable problem for both
platforms and researchers. The existing video understand models do well in
object recognition tasks but currently still cannot understand the abstract and
contextual f... | [
{
"created": "Fri, 28 May 2021 08:39:19 GMT",
"version": "v1"
}
] | 2021-06-02 | [
[
"Huang",
"Fan",
""
]
] | Nowadays, the videos on the Internet are prevailing. The precise and in-depth understanding of the videos is a difficult but valuable problem for both platforms and researchers. The existing video understand models do well in object recognition tasks but currently still cannot understand the abstract and contextual fea... |
2401.14579 | Ying Dai | Kun Fu, and Ying Dai | Recognizing Multiple Ingredients in Food Images Using a
Single-Ingredient Classification Model | 9 pages, 21 figures, 6 tables | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recognizing food images presents unique challenges due to the variable
spatial layout and shape changes of ingredients with different cooking and
cutting methods. This study introduces an advanced approach for recognizing
ingredients segmented from food images. The method localizes the candidate
regions of the ingred... | [
{
"created": "Fri, 26 Jan 2024 00:46:56 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Feb 2024 11:58:59 GMT",
"version": "v2"
},
{
"created": "Mon, 19 Feb 2024 01:43:00 GMT",
"version": "v3"
}
] | 2024-02-20 | [
[
"Fu",
"Kun",
""
],
[
"Dai",
"Ying",
""
]
] | Recognizing food images presents unique challenges due to the variable spatial layout and shape changes of ingredients with different cooking and cutting methods. This study introduces an advanced approach for recognizing ingredients segmented from food images. The method localizes the candidate regions of the ingredie... |
1212.4931 | Anatolii Leukhin Nikolaevich | Anatolii Leukhin, Oscar Moreno and Andrew Tirkel | Secure CDMA Sequences | 10 pages, 8 figures | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Single sequences like Legendre have high linear complexity. Known CDMA
families of sequences all have low complexities. We present a new method of
constructing CDMA sequence sets with the complexity of the Legendre from new
frequency hop patterns, and compare them with known sequences. These are the
first families wh... | [
{
"created": "Thu, 20 Dec 2012 06:04:04 GMT",
"version": "v1"
}
] | 2012-12-21 | [
[
"Leukhin",
"Anatolii",
""
],
[
"Moreno",
"Oscar",
""
],
[
"Tirkel",
"Andrew",
""
]
] | Single sequences like Legendre have high linear complexity. Known CDMA families of sequences all have low complexities. We present a new method of constructing CDMA sequence sets with the complexity of the Legendre from new frequency hop patterns, and compare them with known sequences. These are the first families whos... |
1904.09046 | Laurent Lessard | Laurent Lessard, Peter Seiler | Direct Synthesis of Iterative Algorithms With Bounds on Achievable
Worst-Case Convergence Rate | American Control Conference, 2020 | null | null | null | cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Iterative first-order methods such as gradient descent and its variants are
widely used for solving optimization and machine learning problems. There has
been recent interest in analytic or numerically efficient methods for computing
worst-case performance bounds for such algorithms, for example over the class
of str... | [
{
"created": "Fri, 19 Apr 2019 01:07:50 GMT",
"version": "v1"
},
{
"created": "Sat, 21 Mar 2020 03:18:18 GMT",
"version": "v2"
}
] | 2020-03-24 | [
[
"Lessard",
"Laurent",
""
],
[
"Seiler",
"Peter",
""
]
] | Iterative first-order methods such as gradient descent and its variants are widely used for solving optimization and machine learning problems. There has been recent interest in analytic or numerically efficient methods for computing worst-case performance bounds for such algorithms, for example over the class of stron... |
2309.09609 | Enzo Rucci | Manuel Costanzo, Enzo Rucci, Carlos Garc\'ia S\'anchez, Marcelo
Naiouf, Manuel Prieto-Mat\'ias | Comparing Performance and Portability between CUDA and SYCL for Protein
Database Search on NVIDIA, AMD, and Intel GPUs | This article was accepted for publication in 2023 IEEE 35th
International Symposium on Computer Architecture and High Performance
Computing (SBAC-PAD) | null | 10.1109/SBAC-PAD59825.2023.00023 | null | cs.PL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The heterogeneous computing paradigm has led to the need for portable and
efficient programming solutions that can leverage the capabilities of various
hardware devices, such as NVIDIA, Intel, and AMD GPUs. This study evaluates the
portability and performance of the SYCL and CUDA languages for one fundamental
bioinfo... | [
{
"created": "Mon, 18 Sep 2023 09:26:46 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Nov 2023 12:11:08 GMT",
"version": "v2"
}
] | 2023-11-13 | [
[
"Costanzo",
"Manuel",
""
],
[
"Rucci",
"Enzo",
""
],
[
"Sánchez",
"Carlos García",
""
],
[
"Naiouf",
"Marcelo",
""
],
[
"Prieto-Matías",
"Manuel",
""
]
] | The heterogeneous computing paradigm has led to the need for portable and efficient programming solutions that can leverage the capabilities of various hardware devices, such as NVIDIA, Intel, and AMD GPUs. This study evaluates the portability and performance of the SYCL and CUDA languages for one fundamental bioinform... |
2201.12023 | Zhuohan Li | Lianmin Zheng, Zhuohan Li, Hao Zhang, Yonghao Zhuang, Zhifeng Chen,
Yanping Huang, Yida Wang, Yuanzhong Xu, Danyang Zhuo, Eric P. Xing, Joseph E.
Gonzalez, Ion Stoica | Alpa: Automating Inter- and Intra-Operator Parallelism for Distributed
Deep Learning | OSDI 2022 | null | null | null | cs.LG cs.DC cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Alpa automates model-parallel training of large deep learning (DL) models by
generating execution plans that unify data, operator, and pipeline parallelism.
Existing model-parallel training systems either require users to manually
create a parallelization plan or automatically generate one from a limited
space of mod... | [
{
"created": "Fri, 28 Jan 2022 10:13:35 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Jun 2022 09:18:24 GMT",
"version": "v2"
},
{
"created": "Tue, 28 Jun 2022 19:36:44 GMT",
"version": "v3"
}
] | 2022-06-30 | [
[
"Zheng",
"Lianmin",
""
],
[
"Li",
"Zhuohan",
""
],
[
"Zhang",
"Hao",
""
],
[
"Zhuang",
"Yonghao",
""
],
[
"Chen",
"Zhifeng",
""
],
[
"Huang",
"Yanping",
""
],
[
"Wang",
"Yida",
""
],
[
"Xu",
"Yu... | Alpa automates model-parallel training of large deep learning (DL) models by generating execution plans that unify data, operator, and pipeline parallelism. Existing model-parallel training systems either require users to manually create a parallelization plan or automatically generate one from a limited space of model... |
2307.02591 | Sunjae Kwon | Sunjae Kwon, Xun Wang, Weisong Liu, Emily Druhl, Minhee L. Sung, Joel
I. Reisman, Wenjun Li, Robert D. Kerns, William Becker, Hong Yu | ODD: A Benchmark Dataset for the Natural Language Processing based
Opioid Related Aberrant Behavior Detection | To be appeared at NAACL 2024 | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Opioid related aberrant behaviors (ORABs) present novel risk factors for
opioid overdose. This paper introduces a novel biomedical natural language
processing benchmark dataset named ODD, for ORAB Detection Dataset. ODD is an
expert-annotated dataset designed to identify ORABs from patients' EHR notes
and classify th... | [
{
"created": "Wed, 5 Jul 2023 18:41:29 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Jul 2023 00:47:23 GMT",
"version": "v2"
},
{
"created": "Thu, 15 Feb 2024 17:40:03 GMT",
"version": "v3"
},
{
"created": "Fri, 22 Mar 2024 20:01:04 GMT",
"version": "v4"
}
] | 2024-03-26 | [
[
"Kwon",
"Sunjae",
""
],
[
"Wang",
"Xun",
""
],
[
"Liu",
"Weisong",
""
],
[
"Druhl",
"Emily",
""
],
[
"Sung",
"Minhee L.",
""
],
[
"Reisman",
"Joel I.",
""
],
[
"Li",
"Wenjun",
""
],
[
"Kerns",
"... | Opioid related aberrant behaviors (ORABs) present novel risk factors for opioid overdose. This paper introduces a novel biomedical natural language processing benchmark dataset named ODD, for ORAB Detection Dataset. ODD is an expert-annotated dataset designed to identify ORABs from patients' EHR notes and classify them... |
1306.1889 | Pradeep Singla | Aakash Gupta, Pradeep Singla, Jitendra Gupta, Nitin Maheshwari | An Improved Structure Of Reversible Adder And Subtractor | null | International Journal of Electronics and Computer Science
Engineering, Vol 2, No. 2, pp712-718, June 2013 | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In today's world everyday a new technology which is faster, smaller and more
complex than its predecessor is being developed. The increased number of
transistors packed onto a chip of a conventional system results in increased
power consumption that is why Reversible logic has drawn attention of
Researchers due to it... | [
{
"created": "Sat, 8 Jun 2013 07:21:22 GMT",
"version": "v1"
}
] | 2013-06-11 | [
[
"Gupta",
"Aakash",
""
],
[
"Singla",
"Pradeep",
""
],
[
"Gupta",
"Jitendra",
""
],
[
"Maheshwari",
"Nitin",
""
]
] | In today's world everyday a new technology which is faster, smaller and more complex than its predecessor is being developed. The increased number of transistors packed onto a chip of a conventional system results in increased power consumption that is why Reversible logic has drawn attention of Researchers due to its ... |
2312.15935 | Romain Abraham | Romain Abraham (IDP), Jean-Fran\c{c}ois Delmas (CERMICS), Julien
Weibel (IDP, CERMICS) | Probability-graphons: Limits of large dense weighted graphs | null | null | null | null | cs.DM math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce probability-graphons which are probability kernels that
generalize graphons to the case of weighted graphs. Probability-graphons appear
as the limit objects to study sequences of large weighted graphs whose
distribution of subgraph sampling converge. The edge-weights are taken from a
general Polish space... | [
{
"created": "Tue, 26 Dec 2023 07:59:59 GMT",
"version": "v1"
}
] | 2023-12-27 | [
[
"Abraham",
"Romain",
"",
"IDP"
],
[
"Delmas",
"Jean-François",
"",
"CERMICS"
],
[
"Weibel",
"Julien",
"",
"IDP, CERMICS"
]
] | We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of subgraph sampling converge. The edge-weights are taken from a general Polish space, ... |
1707.06381 | Suhwan Lim | Suhwan Lim, Jong-Ho Bae, Jai-Ho Eum, Sungtae Lee, Chul-Heung Kim,
Dongseok Kwon, Byung-Gook Park, Jong-Ho Lee | Adaptive Learning Rule for Hardware-based Deep Neural Networks Using
Electronic Synapse Devices | null | Neural Comput. Appl. (2018) | 10.1007/s00521-018-3659-y | null | cs.NE cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a learning rule based on a back-propagation (BP)
algorithm that can be applied to a hardware-based deep neural network (HW-DNN)
using electronic devices that exhibit discrete and limited conductance
characteristics. This adaptive learning rule, which enables forward, backward
propagation, as... | [
{
"created": "Thu, 20 Jul 2017 06:10:36 GMT",
"version": "v1"
},
{
"created": "Sat, 19 Aug 2017 11:42:23 GMT",
"version": "v2"
}
] | 2018-08-02 | [
[
"Lim",
"Suhwan",
""
],
[
"Bae",
"Jong-Ho",
""
],
[
"Eum",
"Jai-Ho",
""
],
[
"Lee",
"Sungtae",
""
],
[
"Kim",
"Chul-Heung",
""
],
[
"Kwon",
"Dongseok",
""
],
[
"Park",
"Byung-Gook",
""
],
[
"Lee",
... | In this paper, we propose a learning rule based on a back-propagation (BP) algorithm that can be applied to a hardware-based deep neural network (HW-DNN) using electronic devices that exhibit discrete and limited conductance characteristics. This adaptive learning rule, which enables forward, backward propagation, as w... |
2104.08253 | Luyu Gao | Luyu Gao, Jamie Callan | Condenser: a Pre-training Architecture for Dense Retrieval | EMNLP 2021 | null | null | null | cs.CL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pre-trained Transformer language models (LM) have become go-to text
representation encoders. Prior research fine-tunes deep LMs to encode text
sequences such as sentences and passages into single dense vector
representations for efficient text comparison and retrieval. However, dense
encoders require a lot of data an... | [
{
"created": "Fri, 16 Apr 2021 17:36:44 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Sep 2021 18:07:10 GMT",
"version": "v2"
}
] | 2021-09-22 | [
[
"Gao",
"Luyu",
""
],
[
"Callan",
"Jamie",
""
]
] | Pre-trained Transformer language models (LM) have become go-to text representation encoders. Prior research fine-tunes deep LMs to encode text sequences such as sentences and passages into single dense vector representations for efficient text comparison and retrieval. However, dense encoders require a lot of data and ... |
1711.03543 | Anush Sankaran | Akshay Sethi, Anush Sankaran, Naveen Panwar, Shreya Khare, Senthil
Mani | DLPaper2Code: Auto-generation of Code from Deep Learning Research Papers | AAAI2018 | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With an abundance of research papers in deep learning, reproducibility or
adoption of the existing works becomes a challenge. This is due to the lack of
open source implementations provided by the authors. Further, re-implementing
research papers in a different library is a daunting task. To address these
challenges,... | [
{
"created": "Thu, 9 Nov 2017 10:00:19 GMT",
"version": "v1"
}
] | 2017-11-13 | [
[
"Sethi",
"Akshay",
""
],
[
"Sankaran",
"Anush",
""
],
[
"Panwar",
"Naveen",
""
],
[
"Khare",
"Shreya",
""
],
[
"Mani",
"Senthil",
""
]
] | With an abundance of research papers in deep learning, reproducibility or adoption of the existing works becomes a challenge. This is due to the lack of open source implementations provided by the authors. Further, re-implementing research papers in a different library is a daunting task. To address these challenges, w... |
2303.12739 | Raoul Sch\"onhof | Jannes Elstner and Raoul G. C. Sch\"onhof and Steffen Tauber and Marco
F Huber | Optimizing CAD Models with Latent Space Manipulation | null | null | null | null | cs.CV cs.AI cs.CE cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | When it comes to the optimization of CAD models in the automation domain,
neural networks currently play only a minor role. Optimizing abstract features
such as automation capability is challenging, since they can be very difficult
to simulate, are too complex for rule-based systems, and also have little to no
data a... | [
{
"created": "Thu, 9 Mar 2023 08:25:09 GMT",
"version": "v1"
}
] | 2023-03-23 | [
[
"Elstner",
"Jannes",
""
],
[
"Schönhof",
"Raoul G. C.",
""
],
[
"Tauber",
"Steffen",
""
],
[
"Huber",
"Marco F",
""
]
] | When it comes to the optimization of CAD models in the automation domain, neural networks currently play only a minor role. Optimizing abstract features such as automation capability is challenging, since they can be very difficult to simulate, are too complex for rule-based systems, and also have little to no data ava... |
1707.01204 | Santosh Vempala | Manuel Blum and Santosh Vempala | The Complexity of Human Computation: A Concrete Model with an
Application to Passwords | null | null | null | null | cs.HC cs.CC cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | What can humans compute in their heads? We are thinking of a variety of
Crypto Protocols, games like Sudoku, Crossword Puzzles, Speed Chess, and so on.
The intent of this paper is to apply the ideas and methods of theoretical
computer science to better understand what humans can compute in their heads.
For example, c... | [
{
"created": "Wed, 5 Jul 2017 03:25:52 GMT",
"version": "v1"
}
] | 2017-07-06 | [
[
"Blum",
"Manuel",
""
],
[
"Vempala",
"Santosh",
""
]
] | What can humans compute in their heads? We are thinking of a variety of Crypto Protocols, games like Sudoku, Crossword Puzzles, Speed Chess, and so on. The intent of this paper is to apply the ideas and methods of theoretical computer science to better understand what humans can compute in their heads. For example, can... |
2204.02601 | Yanyang Li | Yanyang Li, Fuli Luo, Runxin Xu, Songfang Huang, Fei Huang, Liwei Wang | Probing Structured Pruning on Multilingual Pre-trained Models: Settings,
Algorithms, and Efficiency | ACL 2022 Main Conference, Camera-ready version | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Structured pruning has been extensively studied on monolingual pre-trained
language models and is yet to be fully evaluated on their multilingual
counterparts. This work investigates three aspects of structured pruning on
multilingual pre-trained language models: settings, algorithms, and efficiency.
Experiments on n... | [
{
"created": "Wed, 6 Apr 2022 06:29:52 GMT",
"version": "v1"
}
] | 2022-04-07 | [
[
"Li",
"Yanyang",
""
],
[
"Luo",
"Fuli",
""
],
[
"Xu",
"Runxin",
""
],
[
"Huang",
"Songfang",
""
],
[
"Huang",
"Fei",
""
],
[
"Wang",
"Liwei",
""
]
] | Structured pruning has been extensively studied on monolingual pre-trained language models and is yet to be fully evaluated on their multilingual counterparts. This work investigates three aspects of structured pruning on multilingual pre-trained language models: settings, algorithms, and efficiency. Experiments on nin... |
2009.08704 | Aythami Morales | Alejandro Pe\~na and Julian Fierrez and Agata Lapedriza and Aythami
Morales | Learning Emotional-Blinded Face Representations | IAPR Intl. Conf. on Pattern Recognition, 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose two face representations that are blind to facial expressions
associated to emotional responses. This work is in part motivated by new
international regulations for personal data protection, which enforce data
controllers to protect any kind of sensitive information involved in automatic
processes. The adv... | [
{
"created": "Fri, 18 Sep 2020 09:24:10 GMT",
"version": "v1"
}
] | 2020-09-21 | [
[
"Peña",
"Alejandro",
""
],
[
"Fierrez",
"Julian",
""
],
[
"Lapedriza",
"Agata",
""
],
[
"Morales",
"Aythami",
""
]
] | We propose two face representations that are blind to facial expressions associated to emotional responses. This work is in part motivated by new international regulations for personal data protection, which enforce data controllers to protect any kind of sensitive information involved in automatic processes. The advan... |
2009.04177 | Ke Zhang | Ke Zhang, Yukun Su, Xiwang Guo, Liang Qi, and Zhenbing Zhao | MU-GAN: Facial Attribute Editing based on Multi-attention Mechanism | 12 pages, 10 figures | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Facial attribute editing has mainly two objectives: 1) translating image from
a source domain to a target one, and 2) only changing the facial regions
related to a target attribute and preserving the attribute-excluding details.
In this work, we propose a Multi-attention U-Net-based Generative Adversarial
Network (MU... | [
{
"created": "Wed, 9 Sep 2020 09:25:04 GMT",
"version": "v1"
}
] | 2020-09-10 | [
[
"Zhang",
"Ke",
""
],
[
"Su",
"Yukun",
""
],
[
"Guo",
"Xiwang",
""
],
[
"Qi",
"Liang",
""
],
[
"Zhao",
"Zhenbing",
""
]
] | Facial attribute editing has mainly two objectives: 1) translating image from a source domain to a target one, and 2) only changing the facial regions related to a target attribute and preserving the attribute-excluding details. In this work, we propose a Multi-attention U-Net-based Generative Adversarial Network (MU-G... |
1706.06936 | Kushagra Singhal | Kushagra Singhal, Daniel Cullina, Negar Kiyavash | Significance of Side Information in the Graph Matching Problem | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Percolation based graph matching algorithms rely on the availability of seed
vertex pairs as side information to efficiently match users across networks.
Although such algorithms work well in practice, there are other types of side
information available which are potentially useful to an attacker. In this
paper, we c... | [
{
"created": "Wed, 21 Jun 2017 14:42:19 GMT",
"version": "v1"
}
] | 2017-06-22 | [
[
"Singhal",
"Kushagra",
""
],
[
"Cullina",
"Daniel",
""
],
[
"Kiyavash",
"Negar",
""
]
] | Percolation based graph matching algorithms rely on the availability of seed vertex pairs as side information to efficiently match users across networks. Although such algorithms work well in practice, there are other types of side information available which are potentially useful to an attacker. In this paper, we con... |
1809.08311 | Carl Pearson | Carl Pearson and Abdul Dakkak and Cheng Li and Sarah Hashash and
Jinjun Xiong and Wen-mei Hwu | SCOPE: C3SR Systems Characterization and Benchmarking Framework | 8 pages, draft | null | null | null | cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This report presents the design of the Scope infrastructure for extensible
and portable benchmarking. Improvements in high- performance computing systems
rely on coordination across different levels of system abstraction. Developing
and defining accurate performance measurements is necessary at all levels of
the syst... | [
{
"created": "Tue, 18 Sep 2018 20:25:44 GMT",
"version": "v1"
}
] | 2018-09-25 | [
[
"Pearson",
"Carl",
""
],
[
"Dakkak",
"Abdul",
""
],
[
"Li",
"Cheng",
""
],
[
"Hashash",
"Sarah",
""
],
[
"Xiong",
"Jinjun",
""
],
[
"Hwu",
"Wen-mei",
""
]
] | This report presents the design of the Scope infrastructure for extensible and portable benchmarking. Improvements in high- performance computing systems rely on coordination across different levels of system abstraction. Developing and defining accurate performance measurements is necessary at all levels of the system... |
cs/0009001 | Andrei N. Soklakov | Andrei N. Soklakov (Royal Holloway, University of London) | Complexity analysis for algorithmically simple strings | 10 pages | null | null | null | cs.LG | null | Given a reference computer, Kolmogorov complexity is a well defined function
on all binary strings. In the standard approach, however, only the asymptotic
properties of such functions are considered because they do not depend on the
reference computer. We argue that this approach can be more useful if it is
refined t... | [
{
"created": "Tue, 5 Sep 2000 18:54:58 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Jun 2001 03:22:43 GMT",
"version": "v2"
},
{
"created": "Tue, 26 Feb 2002 01:51:09 GMT",
"version": "v3"
}
] | 2007-05-23 | [
[
"Soklakov",
"Andrei N.",
"",
"Royal Holloway, University of London"
]
] | Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functions are considered because they do not depend on the reference computer. We argue that this approach can be more useful if it is refined to ... |
2305.20009 | Samuel Stanton | Nate Gruver, Samuel Stanton, Nathan C. Frey, Tim G. J. Rudner, Isidro
Hotzel, Julien Lafrance-Vanasse, Arvind Rajpal, Kyunghyun Cho, and Andrew
Gordon Wilson | Protein Design with Guided Discrete Diffusion | null | Advances in Neural Information Processing Systems 36, December
10-16, 2023 | null | null | cs.LG q-bio.BM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A popular approach to protein design is to combine a generative model with a
discriminative model for conditional sampling. The generative model samples
plausible sequences while the discriminative model guides a search for
sequences with high fitness. Given its broad success in conditional sampling,
classifier-guide... | [
{
"created": "Wed, 31 May 2023 16:31:24 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Dec 2023 05:09:38 GMT",
"version": "v2"
}
] | 2023-12-13 | [
[
"Gruver",
"Nate",
""
],
[
"Stanton",
"Samuel",
""
],
[
"Frey",
"Nathan C.",
""
],
[
"Rudner",
"Tim G. J.",
""
],
[
"Hotzel",
"Isidro",
""
],
[
"Lafrance-Vanasse",
"Julien",
""
],
[
"Rajpal",
"Arvind",
""
... | A popular approach to protein design is to combine a generative model with a discriminative model for conditional sampling. The generative model samples plausible sequences while the discriminative model guides a search for sequences with high fitness. Given its broad success in conditional sampling, classifier-guided ... |
2305.00208 | Abdul Karim Gizzini | Abdul Karim Gizzini, Marwa Chafii | Deep Learning Based Channel Estimation in High Mobility Communications
Using Bi-RNN Networks | Accepted for presentation at IEEE 2023 IEEE International Conference
on Communications (ICC), 28 May - 01 June 2023, Rome, Italy | null | null | null | cs.IT cs.AI math.IT | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Doubly-selective channel estimation represents a key element in ensuring
communication reliability in wireless systems. Due to the impact of multi-path
propagation and Doppler interference in dynamic environments, doubly-selective
channel estimation becomes challenging. Conventional channel estimation schemes
encount... | [
{
"created": "Sat, 29 Apr 2023 09:20:28 GMT",
"version": "v1"
}
] | 2023-05-02 | [
[
"Gizzini",
"Abdul Karim",
""
],
[
"Chafii",
"Marwa",
""
]
] | Doubly-selective channel estimation represents a key element in ensuring communication reliability in wireless systems. Due to the impact of multi-path propagation and Doppler interference in dynamic environments, doubly-selective channel estimation becomes challenging. Conventional channel estimation schemes encounter... |
2405.11574 | Yash Sanjay Bhalgat | Manan Shah, Yash Bhalgat | Reproducibility Study of CDUL: CLIP-Driven Unsupervised Learning for
Multi-Label Image Classification | Reproducibility study | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | This report is a reproducibility study of the paper "CDUL: CLIP-Driven
Unsupervised Learning for Multi-Label Image Classification" (Abdelfattah et al,
ICCV 2023). Our report makes the following contributions: (1) We provide a
reproducible, well commented and open-sourced code implementation for the
entire method spec... | [
{
"created": "Sun, 19 May 2024 14:48:19 GMT",
"version": "v1"
}
] | 2024-05-21 | [
[
"Shah",
"Manan",
""
],
[
"Bhalgat",
"Yash",
""
]
] | This report is a reproducibility study of the paper "CDUL: CLIP-Driven Unsupervised Learning for Multi-Label Image Classification" (Abdelfattah et al, ICCV 2023). Our report makes the following contributions: (1) We provide a reproducible, well commented and open-sourced code implementation for the entire method specif... |
2405.20715 | Diabul Haque | Diabul Haque | Transforming Japan Real Estate | null | null | null | null | cs.CE econ.EM q-fin.ST | http://creativecommons.org/licenses/by/4.0/ | The Japanese real estate market, valued over 35 trillion USD, offers
significant investment opportunities. Accurate rent and price forecasting could
provide a substantial competitive edge. This paper explores using alternative
data variables to predict real estate performance in 1100 Japanese
municipalities. A compre... | [
{
"created": "Fri, 31 May 2024 09:12:28 GMT",
"version": "v1"
}
] | 2024-06-03 | [
[
"Haque",
"Diabul",
""
]
] | The Japanese real estate market, valued over 35 trillion USD, offers significant investment opportunities. Accurate rent and price forecasting could provide a substantial competitive edge. This paper explores using alternative data variables to predict real estate performance in 1100 Japanese municipalities. A comprehe... |
2209.11345 | Marcos V. Conde | Marcos V. Conde, Ui-Jin Choi, Maxime Burchi, Radu Timofte | Swin2SR: SwinV2 Transformer for Compressed Image Super-Resolution and
Restoration | European Conference on Computer Vision (ECCV 2022) Workshops | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Compression plays an important role on the efficient transmission and storage
of images and videos through band-limited systems such as streaming services,
virtual reality or videogames. However, compression unavoidably leads to
artifacts and the loss of the original information, which may severely degrade
the visual... | [
{
"created": "Thu, 22 Sep 2022 23:25:08 GMT",
"version": "v1"
}
] | 2022-09-26 | [
[
"Conde",
"Marcos V.",
""
],
[
"Choi",
"Ui-Jin",
""
],
[
"Burchi",
"Maxime",
""
],
[
"Timofte",
"Radu",
""
]
] | Compression plays an important role on the efficient transmission and storage of images and videos through band-limited systems such as streaming services, virtual reality or videogames. However, compression unavoidably leads to artifacts and the loss of the original information, which may severely degrade the visual q... |
1905.05408 | Kyunghwan Son | Kyunghwan Son, Daewoo Kim, Wan Ju Kang, David Earl Hostallero, Yung Yi | QTRAN: Learning to Factorize with Transformation for Cooperative
Multi-Agent Reinforcement Learning | 18 pages; Accepted to ICML 2019 | null | null | null | cs.LG cs.AI cs.MA stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We explore value-based solutions for multi-agent reinforcement learning
(MARL) tasks in the centralized training with decentralized execution (CTDE)
regime popularized recently. However, VDN and QMIX are representative examples
that use the idea of factorization of the joint action-value function into
individual ones... | [
{
"created": "Tue, 14 May 2019 06:29:51 GMT",
"version": "v1"
}
] | 2019-05-15 | [
[
"Son",
"Kyunghwan",
""
],
[
"Kim",
"Daewoo",
""
],
[
"Kang",
"Wan Ju",
""
],
[
"Hostallero",
"David Earl",
""
],
[
"Yi",
"Yung",
""
]
] | We explore value-based solutions for multi-agent reinforcement learning (MARL) tasks in the centralized training with decentralized execution (CTDE) regime popularized recently. However, VDN and QMIX are representative examples that use the idea of factorization of the joint action-value function into individual ones f... |
1803.04074 | Susana Vidrio-Bar\'on | Susana B. Vidrio Bar\'on, Andrew W. Luse, Anthony M. Townsend | Development of a culturally-oriented website usability evaluation | 15th Americas Conference on Information Systems 2009 | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the uni-cultural studies of website usability have matured, the paucity of
cross-cultural studies of usability become increasingly apparent. Moving toward
these cross-cultural studies will require the development of a new tool to
assess website usability in the context of cultural dimensions. This paper
introduces... | [
{
"created": "Mon, 12 Mar 2018 00:39:08 GMT",
"version": "v1"
}
] | 2018-03-13 | [
[
"Barón",
"Susana B. Vidrio",
""
],
[
"Luse",
"Andrew W.",
""
],
[
"Townsend",
"Anthony M.",
""
]
] | As the uni-cultural studies of website usability have matured, the paucity of cross-cultural studies of usability become increasingly apparent. Moving toward these cross-cultural studies will require the development of a new tool to assess website usability in the context of cultural dimensions. This paper introduces t... |
1603.02776 | Yang Liu | Yang Liu, Sujian Li, Xiaodong Zhang and Zhifang Sui | Implicit Discourse Relation Classification via Multi-Task Neural
Networks | This is the pre-print version of a paper accepted by AAAI-16 | null | null | null | cs.CL cs.AI cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Without discourse connectives, classifying implicit discourse relations is a
challenging task and a bottleneck for building a practical discourse parser.
Previous research usually makes use of one kind of discourse framework such as
PDTB or RST to improve the classification performance on discourse relations.
Actuall... | [
{
"created": "Wed, 9 Mar 2016 03:13:37 GMT",
"version": "v1"
}
] | 2016-03-10 | [
[
"Liu",
"Yang",
""
],
[
"Li",
"Sujian",
""
],
[
"Zhang",
"Xiaodong",
""
],
[
"Sui",
"Zhifang",
""
]
] | Without discourse connectives, classifying implicit discourse relations is a challenging task and a bottleneck for building a practical discourse parser. Previous research usually makes use of one kind of discourse framework such as PDTB or RST to improve the classification performance on discourse relations. Actually,... |
2105.10325 | Jana Kierdorf | Jana Kierdorf, Immanuel Weber, Anna Kicherer, Laura Zabawa, Lukas
Drees, Ribana Roscher | Behind the leaves -- Estimation of occluded grapevine berries with
conditional generative adversarial networks | 45 pages, 18 figures, 1 table | null | 10.3389/frai.2022.830026 | null | cs.CV cs.LG cs.NE | http://creativecommons.org/licenses/by/4.0/ | The need for accurate yield estimates for viticulture is becoming more
important due to increasing competition in the wine market worldwide. One of
the most promising methods to estimate the harvest is berry counting, as it can
be approached non-destructively, and its process can be automated. In this
article, we pre... | [
{
"created": "Fri, 21 May 2021 12:57:48 GMT",
"version": "v1"
}
] | 2022-03-28 | [
[
"Kierdorf",
"Jana",
""
],
[
"Weber",
"Immanuel",
""
],
[
"Kicherer",
"Anna",
""
],
[
"Zabawa",
"Laura",
""
],
[
"Drees",
"Lukas",
""
],
[
"Roscher",
"Ribana",
""
]
] | The need for accurate yield estimates for viticulture is becoming more important due to increasing competition in the wine market worldwide. One of the most promising methods to estimate the harvest is berry counting, as it can be approached non-destructively, and its process can be automated. In this article, we prese... |
2102.04621 | Xinchen Liu | Jinkai Zheng, Xinchen Liu, Chenggang Yan, Jiyong Zhang, Wu Liu,
Xiaoping Zhang, Tao Mei | TraND: Transferable Neighborhood Discovery for Unsupervised Cross-domain
Gait Recognition | Accepted by ISCAS 2021. 5 pages, 2 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Gait, i.e., the movement pattern of human limbs during locomotion, is a
promising biometric for the identification of persons. Despite significant
improvement in gait recognition with deep learning, existing studies still
neglect a more practical but challenging scenario -- unsupervised cross-domain
gait recognition ... | [
{
"created": "Tue, 9 Feb 2021 03:07:07 GMT",
"version": "v1"
}
] | 2021-02-10 | [
[
"Zheng",
"Jinkai",
""
],
[
"Liu",
"Xinchen",
""
],
[
"Yan",
"Chenggang",
""
],
[
"Zhang",
"Jiyong",
""
],
[
"Liu",
"Wu",
""
],
[
"Zhang",
"Xiaoping",
""
],
[
"Mei",
"Tao",
""
]
] | Gait, i.e., the movement pattern of human limbs during locomotion, is a promising biometric for the identification of persons. Despite significant improvement in gait recognition with deep learning, existing studies still neglect a more practical but challenging scenario -- unsupervised cross-domain gait recognition wh... |
1105.2934 | Ludo Waltman | Ludo Waltman, Nees Jan van Eck and Anthony F.J. van Raan | Universality of citation distributions revisited | null | null | null | null | cs.DL physics.data-an physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Radicchi, Fortunato, and Castellano [arXiv:0806.0974, PNAS 105(45), 17268]
claim that, apart from a scaling factor, all fields of science are
characterized by the same citation distribution. We present a large-scale
validation study of this universality-of-citation-distributions claim. Our
analysis shows that claimin... | [
{
"created": "Sun, 15 May 2011 09:03:04 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Jul 2011 21:28:10 GMT",
"version": "v2"
},
{
"created": "Tue, 30 Aug 2011 17:19:16 GMT",
"version": "v3"
}
] | 2011-08-31 | [
[
"Waltman",
"Ludo",
""
],
[
"van Eck",
"Nees Jan",
""
],
[
"van Raan",
"Anthony F. J.",
""
]
] | Radicchi, Fortunato, and Castellano [arXiv:0806.0974, PNAS 105(45), 17268] claim that, apart from a scaling factor, all fields of science are characterized by the same citation distribution. We present a large-scale validation study of this universality-of-citation-distributions claim. Our analysis shows that claiming ... |
1906.07523 | Emre Yilmaz | Emre Y{\i}lmaz, Samuel Cohen, Xianghu Yue, David van Leeuwen, Haizhou
Li | Multi-Graph Decoding for Code-Switching ASR | Accepted for publication at Interspeech 2019 | null | null | null | cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the FAME! Project, a code-switching (CS) automatic speech recognition
(ASR) system for Frisian-Dutch speech is developed that can accurately
transcribe the local broadcaster's bilingual archives with CS speech. This
archive contains recordings with monolingual Frisian and Dutch speech segments
as well as Frisian-D... | [
{
"created": "Tue, 18 Jun 2019 12:24:32 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Jun 2019 07:07:08 GMT",
"version": "v2"
}
] | 2019-07-01 | [
[
"Yılmaz",
"Emre",
""
],
[
"Cohen",
"Samuel",
""
],
[
"Yue",
"Xianghu",
""
],
[
"van Leeuwen",
"David",
""
],
[
"Li",
"Haizhou",
""
]
] | In the FAME! Project, a code-switching (CS) automatic speech recognition (ASR) system for Frisian-Dutch speech is developed that can accurately transcribe the local broadcaster's bilingual archives with CS speech. This archive contains recordings with monolingual Frisian and Dutch speech segments as well as Frisian-Dut... |
1708.09597 | Cunxi Yu | Cunxi Yu, Mihir Choudhury, Andrew Sullivan, Maciej Ciesielski | Advanced Datapath Synthesis using Graph Isomorphism | 6 pages, 8 figures. To appear in 2017 IEEE/ACM International
Conference on Computer-Aided Design (ICCAD'17) | null | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an advanced DAG-based algorithm for datapath synthesis
that targets area minimization using logic-level resource sharing. The problem
of identifying common specification logic is formulated using unweighted graph
isomorphism problem, in contrast to a weighted graph isomorphism using AIGs. In
the c... | [
{
"created": "Thu, 31 Aug 2017 07:34:00 GMT",
"version": "v1"
}
] | 2017-09-01 | [
[
"Yu",
"Cunxi",
""
],
[
"Choudhury",
"Mihir",
""
],
[
"Sullivan",
"Andrew",
""
],
[
"Ciesielski",
"Maciej",
""
]
] | This paper presents an advanced DAG-based algorithm for datapath synthesis that targets area minimization using logic-level resource sharing. The problem of identifying common specification logic is formulated using unweighted graph isomorphism problem, in contrast to a weighted graph isomorphism using AIGs. In the con... |
1802.05568 | Bin Guo | Yi Ouyang, Bin Guo, Xinjiang Lu, Qi Han, Tong Guo, Zhiwen Yu | CompetitiveBike: Competitive Prediction of Bike-Sharing Apps Using
Heterogeneous Crowdsourced Data | null | null | null | null | cs.HC cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, bike-sharing systems have been deployed in many cities,
which provide an economical lifestyle. With the prevalence of bike-sharing
systems, a lot of companies join the market, leading to increasingly fierce
competition. To be competitive, bike-sharing companies and app developers need
to make strateg... | [
{
"created": "Thu, 15 Feb 2018 14:36:09 GMT",
"version": "v1"
}
] | 2018-02-16 | [
[
"Ouyang",
"Yi",
""
],
[
"Guo",
"Bin",
""
],
[
"Lu",
"Xinjiang",
""
],
[
"Han",
"Qi",
""
],
[
"Guo",
"Tong",
""
],
[
"Yu",
"Zhiwen",
""
]
] | In recent years, bike-sharing systems have been deployed in many cities, which provide an economical lifestyle. With the prevalence of bike-sharing systems, a lot of companies join the market, leading to increasingly fierce competition. To be competitive, bike-sharing companies and app developers need to make strategic... |
2402.16194 | Omama Hamad | Omama Hamad, Ali Hamdi, Khaled Shaban | ASEM: Enhancing Empathy in Chatbot through Attention-based Sentiment and
Emotion Modeling | Accepted to the LREC-COLING 2024 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | Effective feature representations play a critical role in enhancing the
performance of text generation models that rely on deep neural networks.
However, current approaches suffer from several drawbacks, such as the
inability to capture the deep semantics of language and sensitivity to minor
input variations, resulti... | [
{
"created": "Sun, 25 Feb 2024 20:36:51 GMT",
"version": "v1"
}
] | 2024-02-27 | [
[
"Hamad",
"Omama",
""
],
[
"Hamdi",
"Ali",
""
],
[
"Shaban",
"Khaled",
""
]
] | Effective feature representations play a critical role in enhancing the performance of text generation models that rely on deep neural networks. However, current approaches suffer from several drawbacks, such as the inability to capture the deep semantics of language and sensitivity to minor input variations, resulting... |
1801.07555 | Hongkai Wen | Yiran Shen, Fengyuan Yang, Bowen Du, Weitao Xu, Chengwen Luo, Hongkai
Wen | Shake-n-Shack: Enabling Secure Data Exchange Between Smart Wearables via
Handshakes | To appear in PerCom'18 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Since ancient Greece, handshaking has been commonly practiced between two
people as a friendly gesture to express trust and respect, or form a mutual
agreement. In this paper, we show that such physical contact can be used to
bootstrap secure cyber contact between the smart devices worn by users. The key
observation ... | [
{
"created": "Tue, 23 Jan 2018 14:23:13 GMT",
"version": "v1"
}
] | 2018-01-24 | [
[
"Shen",
"Yiran",
""
],
[
"Yang",
"Fengyuan",
""
],
[
"Du",
"Bowen",
""
],
[
"Xu",
"Weitao",
""
],
[
"Luo",
"Chengwen",
""
],
[
"Wen",
"Hongkai",
""
]
] | Since ancient Greece, handshaking has been commonly practiced between two people as a friendly gesture to express trust and respect, or form a mutual agreement. In this paper, we show that such physical contact can be used to bootstrap secure cyber contact between the smart devices worn by users. The key observation is... |
2011.13495 | Zhizhong Han | Baorui Ma and Zhizhong Han and Yu-Shen Liu and Matthias Zwicker | Neural-Pull: Learning Signed Distance Functions from Point Clouds by
Learning to Pull Space onto Surfaces | To appear at ICML2021. Code and data are available at
https://github.com/mabaorui/NeuralPull | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reconstructing continuous surfaces from 3D point clouds is a fundamental
operation in 3D geometry processing. Several recent state-of-the-art methods
address this problem using neural networks to learn signed distance functions
(SDFs). In this paper, we introduce \textit{Neural-Pull}, a new approach that
is simple an... | [
{
"created": "Thu, 26 Nov 2020 23:18:10 GMT",
"version": "v1"
},
{
"created": "Sun, 23 May 2021 17:54:34 GMT",
"version": "v2"
}
] | 2021-05-25 | [
[
"Ma",
"Baorui",
""
],
[
"Han",
"Zhizhong",
""
],
[
"Liu",
"Yu-Shen",
""
],
[
"Zwicker",
"Matthias",
""
]
] | Reconstructing continuous surfaces from 3D point clouds is a fundamental operation in 3D geometry processing. Several recent state-of-the-art methods address this problem using neural networks to learn signed distance functions (SDFs). In this paper, we introduce \textit{Neural-Pull}, a new approach that is simple and ... |
1002.3187 | Seyed Hamed Hassani | S. Hamed Hassani, Kasra Alishahi, Rudiger Urbanke | On the scaling of Polar Codes: II. The behavior of un-polarized channels | Submitted to ISIT 2010 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We provide upper and lower bounds on the escape rate of the Bhattacharyya
process corresponding to polar codes and transmission over the the binary
erasure channel. More precisely, we bound the exponent of the number of
sub-channels whose Bhattacharyya constant falls in a fixed interval $[a,b]$.
Mathematically this c... | [
{
"created": "Wed, 17 Feb 2010 03:55:40 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Feb 2010 07:54:04 GMT",
"version": "v2"
}
] | 2010-02-18 | [
[
"Hassani",
"S. Hamed",
""
],
[
"Alishahi",
"Kasra",
""
],
[
"Urbanke",
"Rudiger",
""
]
] | We provide upper and lower bounds on the escape rate of the Bhattacharyya process corresponding to polar codes and transmission over the the binary erasure channel. More precisely, we bound the exponent of the number of sub-channels whose Bhattacharyya constant falls in a fixed interval $[a,b]$. Mathematically this can... |
1709.07758 | Farhana Ferdousi Liza | Farhana Ferdousi Liza and Marek Grzes | Improving Language Modelling with Noise-contrastive estimation | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural language models do not scale well when the vocabulary is large.
Noise-contrastive estimation (NCE) is a sampling-based method that allows for
fast learning with large vocabularies. Although NCE has shown promising
performance in neural machine translation, it was considered to be an
unsuccessful approach for l... | [
{
"created": "Fri, 22 Sep 2017 13:59:17 GMT",
"version": "v1"
}
] | 2017-09-25 | [
[
"Liza",
"Farhana Ferdousi",
""
],
[
"Grzes",
"Marek",
""
]
] | Neural language models do not scale well when the vocabulary is large. Noise-contrastive estimation (NCE) is a sampling-based method that allows for fast learning with large vocabularies. Although NCE has shown promising performance in neural machine translation, it was considered to be an unsuccessful approach for lan... |
1711.06616 | Omid Haji Maghsoudi | Omid Haji Maghsoudi | Superpixels Based Segmentation and SVM Based Classification Method to
Distinguish Five Diseases from Normal Regions in Wireless Capsule Endoscopy | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Wireless Capsule Endoscopy (WCE) is relatively a new technology to examine
the entire GI trace. During an examination, it captures more than 55,000
frames. Reviewing all these images is time-consuming and prone to human error.
It has been a challenge to develop intelligent methods assisting physicians to
review the f... | [
{
"created": "Fri, 17 Nov 2017 16:25:34 GMT",
"version": "v1"
}
] | 2017-11-20 | [
[
"Maghsoudi",
"Omid Haji",
""
]
] | Wireless Capsule Endoscopy (WCE) is relatively a new technology to examine the entire GI trace. During an examination, it captures more than 55,000 frames. Reviewing all these images is time-consuming and prone to human error. It has been a challenge to develop intelligent methods assisting physicians to review the fra... |
2104.13255 | Ting-Wu Chin | Ting-Wu Chin, Diana Marculescu, Ari S. Morcos | Width Transfer: On the (In)variance of Width Optimization | Full paper accepted at CVPR Workshops 2021; a 4-page abridged version
is accepted at ICLR 2021 NAS Workshop | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Optimizing the channel counts for different layers of a CNN has shown great
promise in improving the efficiency of CNNs at test-time. However, these
methods often introduce large computational overhead (e.g., an additional 2x
FLOPs of standard training). Minimizing this overhead could therefore
significantly speed up... | [
{
"created": "Sat, 24 Apr 2021 19:51:53 GMT",
"version": "v1"
}
] | 2021-04-28 | [
[
"Chin",
"Ting-Wu",
""
],
[
"Marculescu",
"Diana",
""
],
[
"Morcos",
"Ari S.",
""
]
] | Optimizing the channel counts for different layers of a CNN has shown great promise in improving the efficiency of CNNs at test-time. However, these methods often introduce large computational overhead (e.g., an additional 2x FLOPs of standard training). Minimizing this overhead could therefore significantly speed up t... |
1704.02958 | Arturs Backurs | Arturs Backurs, Piotr Indyk, Ludwig Schmidt | On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel
Methods and Neural Networks | null | null | null | null | cs.CC cs.DS cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Empirical risk minimization (ERM) is ubiquitous in machine learning and
underlies most supervised learning methods. While there has been a large body
of work on algorithms for various ERM problems, the exact computational
complexity of ERM is still not understood. We address this issue for multiple
popular ERM proble... | [
{
"created": "Mon, 10 Apr 2017 17:26:41 GMT",
"version": "v1"
}
] | 2017-04-11 | [
[
"Backurs",
"Arturs",
""
],
[
"Indyk",
"Piotr",
""
],
[
"Schmidt",
"Ludwig",
""
]
] | Empirical risk minimization (ERM) is ubiquitous in machine learning and underlies most supervised learning methods. While there has been a large body of work on algorithms for various ERM problems, the exact computational complexity of ERM is still not understood. We address this issue for multiple popular ERM problems... |
2003.14058 | Yuan Gao | Yuan Gao, Haoping Bai, Zequn Jie, Jiayi Ma, Kui Jia, and Wei Liu | MTL-NAS: Task-Agnostic Neural Architecture Search towards
General-Purpose Multi-Task Learning | Accepted to CVPR2020. The first two authors contribute equally | IEEE Conference on Computer Vision and Pattern Recognition, 2020 | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose to incorporate neural architecture search (NAS) into
general-purpose multi-task learning (GP-MTL). Existing NAS methods typically
define different search spaces according to different tasks. In order to adapt
to different task combinations (i.e., task sets), we disentangle the GP-MTL
networks into single-t... | [
{
"created": "Tue, 31 Mar 2020 09:49:14 GMT",
"version": "v1"
}
] | 2020-04-01 | [
[
"Gao",
"Yuan",
""
],
[
"Bai",
"Haoping",
""
],
[
"Jie",
"Zequn",
""
],
[
"Ma",
"Jiayi",
""
],
[
"Jia",
"Kui",
""
],
[
"Liu",
"Wei",
""
]
] | We propose to incorporate neural architecture search (NAS) into general-purpose multi-task learning (GP-MTL). Existing NAS methods typically define different search spaces according to different tasks. In order to adapt to different task combinations (i.e., task sets), we disentangle the GP-MTL networks into single-tas... |
1203.2511 | Victor Seal | Victor Seal, Arnab Raha, Shovan Maity, Souvik Kr Mitra, Amitava
Mukherjee and Mrinal Kanti Naskar | A Simple Flood Forecasting Scheme Using Wireless Sensor Networks | 16 pages, 4 figures, published in International Journal Of Ad-Hoc,
Sensor And Ubiquitous Computing, February 2012; V. seal et al, 'A Simple
Flood Forecasting Scheme Using Wireless Sensor Networks', IJASUC, Feb.2012 | null | 10.5121/ijasuc.2012.3105 | null | cs.LG cs.CE cs.NI cs.SY stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a forecasting model designed using WSNs (Wireless Sensor
Networks) to predict flood in rivers using simple and fast calculations to
provide real-time results and save the lives of people who may be affected by
the flood. Our prediction model uses multiple variable robust linear regression
which is... | [
{
"created": "Fri, 9 Mar 2012 18:08:34 GMT",
"version": "v1"
}
] | 2012-03-13 | [
[
"Seal",
"Victor",
""
],
[
"Raha",
"Arnab",
""
],
[
"Maity",
"Shovan",
""
],
[
"Mitra",
"Souvik Kr",
""
],
[
"Mukherjee",
"Amitava",
""
],
[
"Naskar",
"Mrinal Kanti",
""
]
] | This paper presents a forecasting model designed using WSNs (Wireless Sensor Networks) to predict flood in rivers using simple and fast calculations to provide real-time results and save the lives of people who may be affected by the flood. Our prediction model uses multiple variable robust linear regression which is e... |
1412.8185 | Yuliya Boyarinova | Yakiv O. Kalinovsky, Yuliya E. Boyarinova, Alina S. Turenko, Yana V.
Khitsko | Generalized quaternions and their relations with Grassmann-Clifford
procedure of doubling | arXiv admin note: substantial text overlap with arXiv:1409.3193 | null | null | null | cs.NA math.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The class of non-commutative hypercomplex number systems (HNS) of
4-dimension, constructed by using of non-commutative Grassmann-Clifford
procedure of doubling of 2-dimensional systems is investigated in the article
and established here are their relationships with the generalized quaternions.
Algorithms of performan... | [
{
"created": "Sun, 28 Dec 2014 16:44:30 GMT",
"version": "v1"
}
] | 2014-12-30 | [
[
"Kalinovsky",
"Yakiv O.",
""
],
[
"Boyarinova",
"Yuliya E.",
""
],
[
"Turenko",
"Alina S.",
""
],
[
"Khitsko",
"Yana V.",
""
]
] | The class of non-commutative hypercomplex number systems (HNS) of 4-dimension, constructed by using of non-commutative Grassmann-Clifford procedure of doubling of 2-dimensional systems is investigated in the article and established here are their relationships with the generalized quaternions. Algorithms of performance... |
2309.06877 | Xinyang Yu | Zhenguang Liu, Xinyang Yu, Ruili Wang, Shuai Ye, Zhe Ma, Jianfeng
Dong, Sifeng He, Feng Qian, Xiaobo Zhang, Roger Zimmermann, Lei Yang | Video Infringement Detection via Feature Disentanglement and Mutual
Information Maximization | This paper is accepted by ACM MM 2023 | null | null | null | cs.CV cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The self-media era provides us tremendous high quality videos. Unfortunately,
frequent video copyright infringements are now seriously damaging the interests
and enthusiasm of video creators. Identifying infringing videos is therefore a
compelling task. Current state-of-the-art methods tend to simply feed
high-dimens... | [
{
"created": "Wed, 13 Sep 2023 10:53:12 GMT",
"version": "v1"
}
] | 2023-09-14 | [
[
"Liu",
"Zhenguang",
""
],
[
"Yu",
"Xinyang",
""
],
[
"Wang",
"Ruili",
""
],
[
"Ye",
"Shuai",
""
],
[
"Ma",
"Zhe",
""
],
[
"Dong",
"Jianfeng",
""
],
[
"He",
"Sifeng",
""
],
[
"Qian",
"Feng",
... | The self-media era provides us tremendous high quality videos. Unfortunately, frequent video copyright infringements are now seriously damaging the interests and enthusiasm of video creators. Identifying infringing videos is therefore a compelling task. Current state-of-the-art methods tend to simply feed high-dimensio... |
1610.07563 | Jinbo Bi | Xin Wang, Jinbo Bi, Shipeng Yu, Jiangwen Sun | On Multiplicative Multitask Feature Learning | Advances in Neural Information Processing Systems 2014 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate a general framework of multiplicative multitask feature
learning which decomposes each task's model parameters into a multiplication of
two components. One of the components is used across all tasks and the other
component is task-specific. Several previous methods have been proposed as
special cases o... | [
{
"created": "Mon, 24 Oct 2016 19:27:52 GMT",
"version": "v1"
}
] | 2016-10-25 | [
[
"Wang",
"Xin",
""
],
[
"Bi",
"Jinbo",
""
],
[
"Yu",
"Shipeng",
""
],
[
"Sun",
"Jiangwen",
""
]
] | We investigate a general framework of multiplicative multitask feature learning which decomposes each task's model parameters into a multiplication of two components. One of the components is used across all tasks and the other component is task-specific. Several previous methods have been proposed as special cases of ... |
2106.02320 | Gengwei Zhang | Gengwei Zhang, Guoliang Kang, Yi Yang, Yunchao Wei | Few-Shot Segmentation via Cycle-Consistent Transformer | Advances in Neural Information Processing Systems (NeurIPS), 2021.
Project: https://github.com/GengDavid/CyCTR | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Few-shot segmentation aims to train a segmentation model that can fast adapt
to novel classes with few exemplars. The conventional training paradigm is to
learn to make predictions on query images conditioned on the features from
support images. Previous methods only utilized the semantic-level prototypes of
support ... | [
{
"created": "Fri, 4 Jun 2021 07:57:48 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Oct 2021 11:50:27 GMT",
"version": "v2"
},
{
"created": "Tue, 21 Dec 2021 07:24:53 GMT",
"version": "v3"
},
{
"created": "Tue, 8 Mar 2022 00:20:03 GMT",
"version": "v4"
}
] | 2022-03-09 | [
[
"Zhang",
"Gengwei",
""
],
[
"Kang",
"Guoliang",
""
],
[
"Yang",
"Yi",
""
],
[
"Wei",
"Yunchao",
""
]
] | Few-shot segmentation aims to train a segmentation model that can fast adapt to novel classes with few exemplars. The conventional training paradigm is to learn to make predictions on query images conditioned on the features from support images. Previous methods only utilized the semantic-level prototypes of support im... |
1204.5431 | Mohammad Tofighi | Mohammad Tofighi and Hashem Kalbkhani and Mahrokh G. Shayesteh and
Mehdi Ghasemzadeh | Robust Head Pose Estimation Using Contourlet Transform | 5 pages, conference paper | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Estimating pose of the head is an important preprocessing step in many
pattern recognition and computer vision systems such as face recognition. Since
the performance of the face recognition systems is greatly affected by the
poses of the face, how to estimate the accurate pose of the face in human face
image is stil... | [
{
"created": "Tue, 24 Apr 2012 17:08:04 GMT",
"version": "v1"
},
{
"created": "Sat, 12 May 2012 13:56:32 GMT",
"version": "v2"
}
] | 2012-05-15 | [
[
"Tofighi",
"Mohammad",
""
],
[
"Kalbkhani",
"Hashem",
""
],
[
"Shayesteh",
"Mahrokh G.",
""
],
[
"Ghasemzadeh",
"Mehdi",
""
]
] | Estimating pose of the head is an important preprocessing step in many pattern recognition and computer vision systems such as face recognition. Since the performance of the face recognition systems is greatly affected by the poses of the face, how to estimate the accurate pose of the face in human face image is still ... |
2401.00547 | Avvaru Ch Madhusudanarao | A Ch Madhusudanarao, Rahul Singh | On Learning for Ambiguous Chance Constrained Problems | We have "not considered the uniform bound" for violation
probabilities corresponding to the set of distributions in the ambiguity set | null | null | null | cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study chance constrained optimization problems $\min_x f(x)$ s.t.
$P(\left\{ \theta: g(x,\theta)\le 0 \right\})\ge 1-\epsilon$ where $\epsilon\in
(0,1)$ is the violation probability, when the distribution $P$ is not known to
the decision maker (DM). When the DM has access to a set of distributions
$\mathcal{U}$ su... | [
{
"created": "Sun, 31 Dec 2023 17:25:43 GMT",
"version": "v1"
},
{
"created": "Sun, 11 Feb 2024 06:07:17 GMT",
"version": "v2"
}
] | 2024-02-13 | [
[
"Madhusudanarao",
"A Ch",
""
],
[
"Singh",
"Rahul",
""
]
] | We study chance constrained optimization problems $\min_x f(x)$ s.t. $P(\left\{ \theta: g(x,\theta)\le 0 \right\})\ge 1-\epsilon$ where $\epsilon\in (0,1)$ is the violation probability, when the distribution $P$ is not known to the decision maker (DM). When the DM has access to a set of distributions $\mathcal{U}$ such... |
2101.00790 | Amir K. Khandani Dr. | Amir K. Khandani | Achieving Capacity Region of 2-users Weak GIC by Enlarging the Core in a
Nested Set of Polymatroids (continuation of arXiv:2012.07820 "Optimality of
Gaussian in Enlarging HK Rate Region, and its Overlap with ...") | 20 pages, 4 figures | null | null | null | cs.IT math.CO math.IT | http://creativecommons.org/publicdomain/zero/1.0/ | This article shows that achieving capacity region of a 2-users weak Gaussian
Interference Channel (GIC) is equivalent to enlarging the core in a nested set
of Polymatroids (each equivalent to capacity region of a multiple-access
channel) through maximizing a minimum rate, then projecting along its
orthogonal span and... | [
{
"created": "Mon, 4 Jan 2021 06:07:56 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Jan 2021 18:45:29 GMT",
"version": "v2"
},
{
"created": "Mon, 25 Jan 2021 05:38:25 GMT",
"version": "v3"
},
{
"created": "Thu, 28 Jan 2021 15:58:16 GMT",
"version": "v4"
},
{
"cr... | 2021-02-03 | [
[
"Khandani",
"Amir K.",
""
]
] | This article shows that achieving capacity region of a 2-users weak Gaussian Interference Channel (GIC) is equivalent to enlarging the core in a nested set of Polymatroids (each equivalent to capacity region of a multiple-access channel) through maximizing a minimum rate, then projecting along its orthogonal span and c... |
2109.13325 | Chen Quan | Chen Quan, Baocheng Geng, Yunghsiang S. Han and Pramod K. Varshney | Enhanced Audit Bit Based Distributed Bayesian Detection in the Presence
of Strategic Attacks | null | null | null | null | cs.CR eess.SP | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper employs an audit bit based mechanism to mitigate the effect of
Byzantine attacks. In this framework, the optimal attacking strategy for
intelligent attackers is investigated for the traditional audit bit based
scheme (TAS) to evaluate the robustness of the system. We show that it is
possible for an intelli... | [
{
"created": "Mon, 27 Sep 2021 19:58:26 GMT",
"version": "v1"
}
] | 2021-09-29 | [
[
"Quan",
"Chen",
""
],
[
"Geng",
"Baocheng",
""
],
[
"Han",
"Yunghsiang S.",
""
],
[
"Varshney",
"Pramod K.",
""
]
] | This paper employs an audit bit based mechanism to mitigate the effect of Byzantine attacks. In this framework, the optimal attacking strategy for intelligent attackers is investigated for the traditional audit bit based scheme (TAS) to evaluate the robustness of the system. We show that it is possible for an intellige... |
2206.05257 | Kamran Alipour | Kamran Alipour, Aditya Lahiri, Ehsan Adeli, Babak Salimi, Michael
Pazzani | Explaining Image Classifiers Using Contrastive Counterfactuals in
Generative Latent Spaces | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite their high accuracies, modern complex image classifiers cannot be
trusted for sensitive tasks due to their unknown decision-making process and
potential biases. Counterfactual explanations are very effective in providing
transparency for these black-box algorithms. Nevertheless, generating
counterfactuals tha... | [
{
"created": "Fri, 10 Jun 2022 17:54:46 GMT",
"version": "v1"
}
] | 2022-06-13 | [
[
"Alipour",
"Kamran",
""
],
[
"Lahiri",
"Aditya",
""
],
[
"Adeli",
"Ehsan",
""
],
[
"Salimi",
"Babak",
""
],
[
"Pazzani",
"Michael",
""
]
] | Despite their high accuracies, modern complex image classifiers cannot be trusted for sensitive tasks due to their unknown decision-making process and potential biases. Counterfactual explanations are very effective in providing transparency for these black-box algorithms. Nevertheless, generating counterfactuals that ... |
2001.04767 | Ulderico Fugacci | Ulderico Fugacci, Claudia Landi, Hanife Varl{\i} | Critical Sets of PL and Discrete Morse Theory: a Correspondence | In this version, we have fixed some minor typos | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Piecewise-linear (PL) Morse theory and discrete Morse theory are used in
shape analysis tasks to investigate the topological features of discretized
spaces. In spite of their common origin in smooth Morse theory, various notions
of critical points have been given in the literature for the discrete setting,
making a c... | [
{
"created": "Tue, 14 Jan 2020 13:34:19 GMT",
"version": "v1"
},
{
"created": "Sun, 19 Jan 2020 09:16:18 GMT",
"version": "v2"
},
{
"created": "Fri, 8 May 2020 12:15:32 GMT",
"version": "v3"
},
{
"created": "Mon, 18 May 2020 16:38:15 GMT",
"version": "v4"
}
] | 2020-05-19 | [
[
"Fugacci",
"Ulderico",
""
],
[
"Landi",
"Claudia",
""
],
[
"Varlı",
"Hanife",
""
]
] | Piecewise-linear (PL) Morse theory and discrete Morse theory are used in shape analysis tasks to investigate the topological features of discretized spaces. In spite of their common origin in smooth Morse theory, various notions of critical points have been given in the literature for the discrete setting, making a cle... |
2006.14117 | Shuai Zhang | Shuai Zhang, Meng Wang, Sijia Liu, Pin-Yu Chen, Jinjun Xiong | Fast Learning of Graph Neural Networks with Guaranteed Generalizability:
One-hidden-layer Case | null | International Conference on Machine Learning (ICML 2020) | null | null | cs.LG eess.SP math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although graph neural networks (GNNs) have made great progress recently on
learning from graph-structured data in practice, their theoretical guarantee on
generalizability remains elusive in the literature. In this paper, we provide a
theoretically-grounded generalizability analysis of GNNs with one hidden layer
for ... | [
{
"created": "Thu, 25 Jun 2020 00:45:52 GMT",
"version": "v1"
}
] | 2020-06-26 | [
[
"Zhang",
"Shuai",
""
],
[
"Wang",
"Meng",
""
],
[
"Liu",
"Sijia",
""
],
[
"Chen",
"Pin-Yu",
""
],
[
"Xiong",
"Jinjun",
""
]
] | Although graph neural networks (GNNs) have made great progress recently on learning from graph-structured data in practice, their theoretical guarantee on generalizability remains elusive in the literature. In this paper, we provide a theoretically-grounded generalizability analysis of GNNs with one hidden layer for bo... |
2209.13429 | Yongchan Kwon | Yongchan Kwon, James Zou | WeightedSHAP: analyzing and improving Shapley based feature attributions | null | NeurIPS2022 | null | null | cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Shapley value is a popular approach for measuring the influence of individual
features. While Shapley feature attribution is built upon desiderata from game
theory, some of its constraints may be less natural in certain machine learning
settings, leading to unintuitive model interpretation. In particular, the
Shapley... | [
{
"created": "Tue, 27 Sep 2022 14:34:07 GMT",
"version": "v1"
}
] | 2022-09-28 | [
[
"Kwon",
"Yongchan",
""
],
[
"Zou",
"James",
""
]
] | Shapley value is a popular approach for measuring the influence of individual features. While Shapley feature attribution is built upon desiderata from game theory, some of its constraints may be less natural in certain machine learning settings, leading to unintuitive model interpretation. In particular, the Shapley v... |
1709.00596 | D\"om\"ot\"or P\'alv\"olgyi | D\"om\"ot\"or P\'alv\"olgyi | Complexity of Domination in Triangulated Plane Graphs | null | null | null | null | cs.CC math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove that for a triangulated plane graph it is NP-complete to determine
its domination number and its power domination number.
| [
{
"created": "Sat, 2 Sep 2017 15:21:07 GMT",
"version": "v1"
}
] | 2017-09-05 | [
[
"Pálvölgyi",
"Dömötör",
""
]
] | We prove that for a triangulated plane graph it is NP-complete to determine its domination number and its power domination number. |
1509.08086 | Arvind Kumar | Arvind Kumar, Adarsh Anand, Pankaj Kumar Garg and Mohini Agarwal | Optimal Release Time Decision from Fuzzy Mathematical Programming
Perspective | 10 Pages. arXiv admin note: substantial overlap with text by other
authors
http://archive.org/stream/Software_Reliability_Assessment_with_OR_Applications/Software_Reliability_Assessment_with_OR_Applications_djvu.txt | International Journal of Pure and Applied Mathematics, Volume 103
No. 2 2015, 359-376 | 10.12732/ijpam.v103i2.19 | null | cs.AI math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Demand for high software reliability requires rigorous testing followed by
requirement of robust modeling techniques for software quality prediction. On
one side, firms have to steadily manage the reliability by testing it
vigorously, the optimal release time determination is their biggest concern. In
past many model... | [
{
"created": "Sun, 27 Sep 2015 11:41:05 GMT",
"version": "v1"
}
] | 2015-09-30 | [
[
"Kumar",
"Arvind",
""
],
[
"Anand",
"Adarsh",
""
],
[
"Garg",
"Pankaj Kumar",
""
],
[
"Agarwal",
"Mohini",
""
]
] | Demand for high software reliability requires rigorous testing followed by requirement of robust modeling techniques for software quality prediction. On one side, firms have to steadily manage the reliability by testing it vigorously, the optimal release time determination is their biggest concern. In past many models ... |
2204.14213 | Dallas Card | Junshen K. Chen and Dallas Card and Dan Jurafsky | Modular Domain Adaptation | Findings of ACL (2022) | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Off-the-shelf models are widely used by computational social science
researchers to measure properties of text, such as sentiment. However, without
access to source data it is difficult to account for domain shift, which
represents a threat to validity. Here, we treat domain adaptation as a modular
process that invol... | [
{
"created": "Tue, 26 Apr 2022 22:08:58 GMT",
"version": "v1"
}
] | 2022-05-02 | [
[
"Chen",
"Junshen K.",
""
],
[
"Card",
"Dallas",
""
],
[
"Jurafsky",
"Dan",
""
]
] | Off-the-shelf models are widely used by computational social science researchers to measure properties of text, such as sentiment. However, without access to source data it is difficult to account for domain shift, which represents a threat to validity. Here, we treat domain adaptation as a modular process that involve... |
2402.05467 | Guangyu Shen | Guangyu Shen, Siyuan Cheng, Kaiyuan Zhang, Guanhong Tao, Shengwei An,
Lu Yan, Zhuo Zhang, Shiqing Ma, Xiangyu Zhang | Rapid Optimization for Jailbreaking LLMs via Subconscious Exploitation
and Echopraxia | null | null | null | null | cs.AI cs.CL cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large Language Models (LLMs) have become prevalent across diverse sectors,
transforming human life with their extraordinary reasoning and comprehension
abilities. As they find increased use in sensitive tasks, safety concerns have
gained widespread attention. Extensive efforts have been dedicated to aligning
LLMs wit... | [
{
"created": "Thu, 8 Feb 2024 07:56:49 GMT",
"version": "v1"
}
] | 2024-02-09 | [
[
"Shen",
"Guangyu",
""
],
[
"Cheng",
"Siyuan",
""
],
[
"Zhang",
"Kaiyuan",
""
],
[
"Tao",
"Guanhong",
""
],
[
"An",
"Shengwei",
""
],
[
"Yan",
"Lu",
""
],
[
"Zhang",
"Zhuo",
""
],
[
"Ma",
"Shiqin... | Large Language Models (LLMs) have become prevalent across diverse sectors, transforming human life with their extraordinary reasoning and comprehension abilities. As they find increased use in sensitive tasks, safety concerns have gained widespread attention. Extensive efforts have been dedicated to aligning LLMs with ... |
2407.06293 | Xin Liu | Xin Liu, Xingchen Liu, Paul Witherell | A Framework for Simulating the Path-level Residual Stress in the Laser
Powder Bed Fusion Process | null | null | null | null | cs.CE physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Laser Powder Bed Fusion (LPBF) additive manufacturing has revolutionized
industries with its capability to create intricate and customized components.
The LPBF process uses moving heat sources to melt and solidify metal powders.
The fast melting and cooling leads to residual stress, which critically affects
the part ... | [
{
"created": "Wed, 10 Apr 2024 17:28:43 GMT",
"version": "v1"
}
] | 2024-07-10 | [
[
"Liu",
"Xin",
""
],
[
"Liu",
"Xingchen",
""
],
[
"Witherell",
"Paul",
""
]
] | Laser Powder Bed Fusion (LPBF) additive manufacturing has revolutionized industries with its capability to create intricate and customized components. The LPBF process uses moving heat sources to melt and solidify metal powders. The fast melting and cooling leads to residual stress, which critically affects the part qu... |
2405.18483 | Mengyi Shan | Mengyi Shan, Lu Dong, Yutao Han, Yuan Yao, Tao Liu, Ifeoma Nwogu,
Guo-Jun Qi, and Mitch Hill | Towards Open Domain Text-Driven Synthesis of Multi-Person Motions | ECCV 2024. Project page: https://shanmy.github.io/Multi-Motion/ | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This work aims to generate natural and diverse group motions of multiple
humans from textual descriptions. While single-person text-to-motion generation
is extensively studied, it remains challenging to synthesize motions for more
than one or two subjects from in-the-wild prompts, mainly due to the lack of
available ... | [
{
"created": "Tue, 28 May 2024 18:00:06 GMT",
"version": "v1"
},
{
"created": "Mon, 15 Jul 2024 07:55:43 GMT",
"version": "v2"
}
] | 2024-07-16 | [
[
"Shan",
"Mengyi",
""
],
[
"Dong",
"Lu",
""
],
[
"Han",
"Yutao",
""
],
[
"Yao",
"Yuan",
""
],
[
"Liu",
"Tao",
""
],
[
"Nwogu",
"Ifeoma",
""
],
[
"Qi",
"Guo-Jun",
""
],
[
"Hill",
"Mitch",
""
... | This work aims to generate natural and diverse group motions of multiple humans from textual descriptions. While single-person text-to-motion generation is extensively studied, it remains challenging to synthesize motions for more than one or two subjects from in-the-wild prompts, mainly due to the lack of available da... |
2401.09656 | Tan Chen | Tan Chen, Jintao Yan, Yuxuan Sun, Sheng Zhou, Deniz G\"und\"uz,
Zhisheng Niu | Mobility Accelerates Learning: Convergence Analysis on Hierarchical
Federated Learning in Vehicular Networks | Submitted to IEEE for possible publication | null | null | null | cs.LG cs.AI cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hierarchical federated learning (HFL) enables distributed training of models
across multiple devices with the help of several edge servers and a cloud edge
server in a privacy-preserving manner. In this paper, we consider HFL with
highly mobile devices, mainly targeting at vehicular networks. Through
convergence anal... | [
{
"created": "Thu, 18 Jan 2024 00:09:54 GMT",
"version": "v1"
}
] | 2024-01-19 | [
[
"Chen",
"Tan",
""
],
[
"Yan",
"Jintao",
""
],
[
"Sun",
"Yuxuan",
""
],
[
"Zhou",
"Sheng",
""
],
[
"Gündüz",
"Deniz",
""
],
[
"Niu",
"Zhisheng",
""
]
] | Hierarchical federated learning (HFL) enables distributed training of models across multiple devices with the help of several edge servers and a cloud edge server in a privacy-preserving manner. In this paper, we consider HFL with highly mobile devices, mainly targeting at vehicular networks. Through convergence analys... |
1006.1382 | Majid Fozunbal | Majid Fozunbal | On Regret of Parametric Mismatch in Minimum Mean Square Error Estimation | 5 Pages, 2 figures, International Symposium on Information Theory
(ISIT), June 2010 | null | null | HPL-2010-10 | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies the effect of parametric mismatch in minimum mean square
error (MMSE) estimation. In particular, we consider the problem of estimating
the input signal from the output of an additive white Gaussian channel whose
gain is fixed, but unknown. The input distribution is known, and the estimation
process... | [
{
"created": "Mon, 7 Jun 2010 21:47:09 GMT",
"version": "v1"
}
] | 2010-06-09 | [
[
"Fozunbal",
"Majid",
""
]
] | This paper studies the effect of parametric mismatch in minimum mean square error (MMSE) estimation. In particular, we consider the problem of estimating the input signal from the output of an additive white Gaussian channel whose gain is fixed, but unknown. The input distribution is known, and the estimation process c... |
2103.10668 | Ramin Shahbazi | Ramin Shahbazi, Rishab Sharma, Fatemeh H. Fard | API2Com: On the Improvement of Automatically Generated Code Comments
Using API Documentations | null | null | null | null | cs.SE cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Code comments can help in program comprehension and are considered as
important artifacts to help developers in software maintenance. However, the
comments are mostly missing or are outdated, specially in complex software
projects. As a result, several automatic comment generation models are
developed as a solution. ... | [
{
"created": "Fri, 19 Mar 2021 07:29:40 GMT",
"version": "v1"
}
] | 2021-03-22 | [
[
"Shahbazi",
"Ramin",
""
],
[
"Sharma",
"Rishab",
""
],
[
"Fard",
"Fatemeh H.",
""
]
] | Code comments can help in program comprehension and are considered as important artifacts to help developers in software maintenance. However, the comments are mostly missing or are outdated, specially in complex software projects. As a result, several automatic comment generation models are developed as a solution. Th... |
2103.01843 | Nikolaus Demmel | Nikolaus Demmel, Christiane Sommer, Daniel Cremers, Vladyslav Usenko | Square Root Bundle Adjustment for Large-Scale Reconstruction | Accepted to CVPR 2021. Updated version corresponding to CVPR
camera-ready. Formatting changes and minor tweaks to fit page requirements | null | 10.1109/CVPR46437.2021.01155 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new formulation for the bundle adjustment problem which relies
on nullspace marginalization of landmark variables by QR decomposition. Our
approach, which we call square root bundle adjustment, is algebraically
equivalent to the commonly used Schur complement trick, improves the numeric
stability of comp... | [
{
"created": "Tue, 2 Mar 2021 16:26:20 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Mar 2021 23:50:04 GMT",
"version": "v2"
}
] | 2021-11-23 | [
[
"Demmel",
"Nikolaus",
""
],
[
"Sommer",
"Christiane",
""
],
[
"Cremers",
"Daniel",
""
],
[
"Usenko",
"Vladyslav",
""
]
] | We propose a new formulation for the bundle adjustment problem which relies on nullspace marginalization of landmark variables by QR decomposition. Our approach, which we call square root bundle adjustment, is algebraically equivalent to the commonly used Schur complement trick, improves the numeric stability of comput... |
1212.6883 | Vivek Nittoor | Vivek S. Nittoor, Reiji Suda | Partition Parameters for Girth Maximum (m, r) BTUs | null | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes the calculation of the optimal partition parameters such
that the girth maximum (m, r) Balanced Tanner Unit lies in family of BTUs
specified by them using a series of proved results and thus creates a framework
for specifying a search problem for finding the girth maximum (m, r) BTU.
Several open... | [
{
"created": "Mon, 31 Dec 2012 12:53:32 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Jan 2013 15:06:22 GMT",
"version": "v2"
}
] | 2013-01-23 | [
[
"Nittoor",
"Vivek S.",
""
],
[
"Suda",
"Reiji",
""
]
] | This paper describes the calculation of the optimal partition parameters such that the girth maximum (m, r) Balanced Tanner Unit lies in family of BTUs specified by them using a series of proved results and thus creates a framework for specifying a search problem for finding the girth maximum (m, r) BTU. Several open q... |
1907.12182 | Zhenlong Li Dr. | Zhenlong Li | Geospatial Big Data Handling with High Performance Computing: Current
Approaches and Future Directions | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Geospatial big data plays a major role in the era of big data, as most data
today are inherently spatial, collected with ubiquitous location-aware sensors.
Efficiently collecting, managing, storing, and analyzing geospatial data
streams enables development of new decision-support systems and provides
unprecedented op... | [
{
"created": "Mon, 29 Jul 2019 02:37:43 GMT",
"version": "v1"
}
] | 2019-07-30 | [
[
"Li",
"Zhenlong",
""
]
] | Geospatial big data plays a major role in the era of big data, as most data today are inherently spatial, collected with ubiquitous location-aware sensors. Efficiently collecting, managing, storing, and analyzing geospatial data streams enables development of new decision-support systems and provides unprecedented oppo... |
1902.09782 | Qingyan Duan | Qingyan Duan and Lei Zhang | BoostGAN for Occlusive Profile Face Frontalization and Recognition | 9 pages, 7 figures, 7 tables | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There are many facts affecting human face recognition, such as pose,
occlusion, illumination, age, etc. First and foremost are large pose and
occlusion problems, which can even result in more than 10% performance
degradation. Pose-invariant feature representation and face frontalization with
generative adversarial ne... | [
{
"created": "Tue, 26 Feb 2019 07:59:47 GMT",
"version": "v1"
}
] | 2019-02-27 | [
[
"Duan",
"Qingyan",
""
],
[
"Zhang",
"Lei",
""
]
] | There are many facts affecting human face recognition, such as pose, occlusion, illumination, age, etc. First and foremost are large pose and occlusion problems, which can even result in more than 10% performance degradation. Pose-invariant feature representation and face frontalization with generative adversarial netw... |
2212.05560 | Priya Shukla | Ankit Kumar, Priya Shukla, Vandana Kushwaha and G.C. Nandi | Context-aware 6D Pose Estimation of Known Objects using RGB-D data | null | null | null | null | cs.CV cs.RO | http://creativecommons.org/licenses/by/4.0/ | 6D object pose estimation has been a research topic in the field of computer
vision and robotics. Many modern world applications like robot grasping,
manipulation, autonomous navigation etc, require the correct pose of objects
present in a scene to perform their specific task. It becomes even harder when
the objects ... | [
{
"created": "Sun, 11 Dec 2022 18:01:01 GMT",
"version": "v1"
}
] | 2022-12-13 | [
[
"Kumar",
"Ankit",
""
],
[
"Shukla",
"Priya",
""
],
[
"Kushwaha",
"Vandana",
""
],
[
"Nandi",
"G. C.",
""
]
] | 6D object pose estimation has been a research topic in the field of computer vision and robotics. Many modern world applications like robot grasping, manipulation, autonomous navigation etc, require the correct pose of objects present in a scene to perform their specific task. It becomes even harder when the objects ar... |
1606.05943 | EPTCS | Roly Perera (University of Glasgow), Julien Lange (Imperial College
London), Simon J. Gay (University of Glasgow) | Multiparty Compatibility for Concurrent Objects | In Proceedings PLACES 2016, arXiv:1606.05403 | EPTCS 211, 2016, pp. 73-82 | 10.4204/EPTCS.211.8 | null | cs.PL cs.DC cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Objects and actors are communicating state machines, offering and consuming
different services at different points in their lifecycle. Two complementary
challenges arise when programming such systems. When objects interact, their
state machines must be "compatible", so that services are requested only when
they are a... | [
{
"created": "Mon, 20 Jun 2016 01:09:44 GMT",
"version": "v1"
}
] | 2016-06-21 | [
[
"Perera",
"Roly",
"",
"University of Glasgow"
],
[
"Lange",
"Julien",
"",
"Imperial College\n London"
],
[
"Gay",
"Simon J.",
"",
"University of Glasgow"
]
] | Objects and actors are communicating state machines, offering and consuming different services at different points in their lifecycle. Two complementary challenges arise when programming such systems. When objects interact, their state machines must be "compatible", so that services are requested only when they are ava... |
2211.14672 | Mohammad Javad Sojdeh | Mohammad Javad Sojdeh, Mehdi Letafati, Seyed Pooya Shariatpanahi,
Babak Hossein Khalaj | Multi-Transmitter Coded Caching with Secure Delivery over Linear
Networks -- Extended Version | null | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In this paper, we consider multiple cache-enabled end-users connected to
multiple transmitters through a linear network. We also prevent a totally
passive eavesdropper, who sniffs the packets in the delivery phase, from
obtaining any information about the original files in cache-aided networks.
Three different secure... | [
{
"created": "Sat, 26 Nov 2022 21:57:45 GMT",
"version": "v1"
}
] | 2022-11-29 | [
[
"Sojdeh",
"Mohammad Javad",
""
],
[
"Letafati",
"Mehdi",
""
],
[
"Shariatpanahi",
"Seyed Pooya",
""
],
[
"Khalaj",
"Babak Hossein",
""
]
] | In this paper, we consider multiple cache-enabled end-users connected to multiple transmitters through a linear network. We also prevent a totally passive eavesdropper, who sniffs the packets in the delivery phase, from obtaining any information about the original files in cache-aided networks. Three different secure c... |
2311.06204 | Md. Motahar Mahtab | Md. Motahar Mahtab, Monirul Haque, Mehedi Hasan and Farig Sadeque | BanglaBait: Semi-Supervised Adversarial Approach for Clickbait Detection
on Bangla Clickbait Dataset | 8 pages, 3 figures, 5 tables, published in Recent Advances in Natural
Language Processing 2023 | null | 10.26615/978-954-452-092-2_081 | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Intentionally luring readers to click on a particular content by exploiting
their curiosity defines a title as clickbait. Although several studies focused
on detecting clickbait titles in English articles, low resource language like
Bangla has not been given adequate attention. To tackle clickbait titles in
Bangla, w... | [
{
"created": "Fri, 10 Nov 2023 17:38:46 GMT",
"version": "v1"
}
] | 2023-11-13 | [
[
"Mahtab",
"Md. Motahar",
""
],
[
"Haque",
"Monirul",
""
],
[
"Hasan",
"Mehedi",
""
],
[
"Sadeque",
"Farig",
""
]
] | Intentionally luring readers to click on a particular content by exploiting their curiosity defines a title as clickbait. Although several studies focused on detecting clickbait titles in English articles, low resource language like Bangla has not been given adequate attention. To tackle clickbait titles in Bangla, we ... |
1702.04956 | Aaron Gerow | Aaron Gerow, Mingyang Zhou, Stan Matwin, Feng Shi | Reflexive Regular Equivalence for Bipartite Data | A condensed version of this paper will appear in Proceedings of the
30th Canadian Conference on Artificial Intelligence, Edmonton, Alberta,
Canada | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bipartite data is common in data engineering and brings unique challenges,
particularly when it comes to clustering tasks that impose on strong structural
assumptions. This work presents an unsupervised method for assessing similarity
in bipartite data. Similar to some co-clustering methods, the method is based
on re... | [
{
"created": "Thu, 16 Feb 2017 13:29:30 GMT",
"version": "v1"
}
] | 2017-02-17 | [
[
"Gerow",
"Aaron",
""
],
[
"Zhou",
"Mingyang",
""
],
[
"Matwin",
"Stan",
""
],
[
"Shi",
"Feng",
""
]
] | Bipartite data is common in data engineering and brings unique challenges, particularly when it comes to clustering tasks that impose on strong structural assumptions. This work presents an unsupervised method for assessing similarity in bipartite data. Similar to some co-clustering methods, the method is based on regu... |
cs/0312001 | Martin Lisewski | A. M. Lisewski | The concept of strong and weak virtual reality | 17 pages; several edits in v2 | Minds and Machines, 16 (2), 201-219 (2006) | 10.1007/s11023-006-9037-z | null | cs.LO nlin.AO physics.comp-ph | null | We approach the virtual reality phenomenon by studying its relationship to
set theory, and we investigate the case where this is done using the
wellfoundedness property of sets. Our hypothesis is that non-wellfounded sets
(hypersets) give rise to a different quality of virtual reality than do
familiar wellfounded set... | [
{
"created": "Sat, 29 Nov 2003 14:08:56 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Mar 2006 20:21:55 GMT",
"version": "v2"
},
{
"created": "Thu, 30 Mar 2006 22:38:13 GMT",
"version": "v3"
}
] | 2007-05-23 | [
[
"Lisewski",
"A. M.",
""
]
] | We approach the virtual reality phenomenon by studying its relationship to set theory, and we investigate the case where this is done using the wellfoundedness property of sets. Our hypothesis is that non-wellfounded sets (hypersets) give rise to a different quality of virtual reality than do familiar wellfounded sets.... |
2205.09121 | Mahsa Yousefi | Mahsa Yousefi, Angeles Martinez | On the efficiency of Stochastic Quasi-Newton Methods for Deep Learning | null | null | null | null | cs.LG math.OC | http://creativecommons.org/licenses/by/4.0/ | While first-order methods are popular for solving optimization problems that
arise in large-scale deep learning problems, they come with some acute
deficiencies. To diminish such shortcomings, there has been recent interest in
applying second-order methods such as quasi-Newton based methods which
construct Hessians a... | [
{
"created": "Wed, 18 May 2022 20:53:58 GMT",
"version": "v1"
},
{
"created": "Wed, 4 Oct 2023 14:44:35 GMT",
"version": "v2"
}
] | 2023-10-05 | [
[
"Yousefi",
"Mahsa",
""
],
[
"Martinez",
"Angeles",
""
]
] | While first-order methods are popular for solving optimization problems that arise in large-scale deep learning problems, they come with some acute deficiencies. To diminish such shortcomings, there has been recent interest in applying second-order methods such as quasi-Newton based methods which construct Hessians app... |
2307.07134 | Zheng Gong | Qi Liu, Zheng Gong, Zhenya Huang, Chuanren Liu, Hengshu Zhu, Zhi Li,
Enhong Chen and Hui Xiong | Multi-Dimensional Ability Diagnosis for Machine Learning Algorithms | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning algorithms have become ubiquitous in a number of
applications (e.g. image classification). However, due to the insufficient
measurement of traditional metrics (e.g. the coarse-grained Accuracy of each
classifier), substantial gaps are usually observed between the real-world
performance of these algor... | [
{
"created": "Fri, 14 Jul 2023 03:15:56 GMT",
"version": "v1"
}
] | 2023-07-17 | [
[
"Liu",
"Qi",
""
],
[
"Gong",
"Zheng",
""
],
[
"Huang",
"Zhenya",
""
],
[
"Liu",
"Chuanren",
""
],
[
"Zhu",
"Hengshu",
""
],
[
"Li",
"Zhi",
""
],
[
"Chen",
"Enhong",
""
],
[
"Xiong",
"Hui",
"... | Machine learning algorithms have become ubiquitous in a number of applications (e.g. image classification). However, due to the insufficient measurement of traditional metrics (e.g. the coarse-grained Accuracy of each classifier), substantial gaps are usually observed between the real-world performance of these algorit... |
2306.15898 | Marzieh Haghighi | Marzieh Haghighi, Mario C. Cruz, Erin Weisbart, Beth A. Cimini, Avtar
Singh, Julia Bauman, Maria E. Lozada, Sanam L. Kavari, James T. Neal, Paul C.
Blainey, Anne E. Carpenter and Shantanu Singh | Pseudo-Labeling Enhanced by Privileged Information and Its Application
to In Situ Sequencing Images | This paper has been accepted for publication at IJCAI 2023 | Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence (IJCAI), Main Track, Pages 4775-4784, 2023 | 10.24963/ijcai.2023/531 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Various strategies for label-scarce object detection have been explored by
the computer vision research community. These strategies mainly rely on
assumptions that are specific to natural images and not directly applicable to
the biological and biomedical vision domains. For example, most semi-supervised
learning str... | [
{
"created": "Wed, 28 Jun 2023 03:44:42 GMT",
"version": "v1"
}
] | 2023-09-25 | [
[
"Haghighi",
"Marzieh",
""
],
[
"Cruz",
"Mario C.",
""
],
[
"Weisbart",
"Erin",
""
],
[
"Cimini",
"Beth A.",
""
],
[
"Singh",
"Avtar",
""
],
[
"Bauman",
"Julia",
""
],
[
"Lozada",
"Maria E.",
""
],
[
... | Various strategies for label-scarce object detection have been explored by the computer vision research community. These strategies mainly rely on assumptions that are specific to natural images and not directly applicable to the biological and biomedical vision domains. For example, most semi-supervised learning strat... |
1604.01595 | Kazuyuki Asada | Kazuyuki Asada and Naoki Kobayashi | On Word and Frontier Languages of Unsafe Higher-Order Grammars | null | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Higher-order grammars are extensions of regular and context-free grammars,
where non-terminals may take parameters. They have been extensively studied in
1980's, and restudied recently in the context of model checking and program
verification. We show that the class of unsafe order-(n+1) word languages
coincides with... | [
{
"created": "Wed, 6 Apr 2016 12:47:52 GMT",
"version": "v1"
},
{
"created": "Mon, 16 May 2016 11:49:15 GMT",
"version": "v2"
},
{
"created": "Fri, 20 May 2016 06:43:01 GMT",
"version": "v3"
}
] | 2016-05-23 | [
[
"Asada",
"Kazuyuki",
""
],
[
"Kobayashi",
"Naoki",
""
]
] | Higher-order grammars are extensions of regular and context-free grammars, where non-terminals may take parameters. They have been extensively studied in 1980's, and restudied recently in the context of model checking and program verification. We show that the class of unsafe order-(n+1) word languages coincides with t... |
0805.0120 | Stephen Vavasis | Michael Biggs, Ali Ghodsi, Stephen Vavasis | Nonnegative Matrix Factorization via Rank-One Downdate | null | null | null | null | cs.IR cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nonnegative matrix factorization (NMF) was popularized as a tool for data
mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with
nonnegative entries by a product of two low-rank matrices, also with
nonnegative entries. We propose an algorithm called rank-one downdate (R1D) for
computing a NMF that... | [
{
"created": "Thu, 1 May 2008 17:59:44 GMT",
"version": "v1"
}
] | 2008-05-02 | [
[
"Biggs",
"Michael",
""
],
[
"Ghodsi",
"Ali",
""
],
[
"Vavasis",
"Stephen",
""
]
] | Nonnegative matrix factorization (NMF) was popularized as a tool for data mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with nonnegative entries by a product of two low-rank matrices, also with nonnegative entries. We propose an algorithm called rank-one downdate (R1D) for computing a NMF that i... |
2402.12712 | Shitao Tang | Shitao Tang, Jiacheng Chen, Dilin Wang, Chengzhou Tang, Fuyang Zhang,
Yuchen Fan, Vikas Chandra, Yasutaka Furukawa, Rakesh Ranjan | MVDiffusion++: A Dense High-resolution Multi-view Diffusion Model for
Single or Sparse-view 3D Object Reconstruction | 3D generation, project page: https://mvdiffusion-plusplus.github.io/ | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This paper presents a neural architecture MVDiffusion++ for 3D object
reconstruction that synthesizes dense and high-resolution views of an object
given one or a few images without camera poses. MVDiffusion++ achieves superior
flexibility and scalability with two surprisingly simple ideas: 1) A
``pose-free architectu... | [
{
"created": "Tue, 20 Feb 2024 04:25:57 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Mar 2024 17:58:05 GMT",
"version": "v2"
},
{
"created": "Tue, 30 Apr 2024 04:11:58 GMT",
"version": "v3"
}
] | 2024-05-01 | [
[
"Tang",
"Shitao",
""
],
[
"Chen",
"Jiacheng",
""
],
[
"Wang",
"Dilin",
""
],
[
"Tang",
"Chengzhou",
""
],
[
"Zhang",
"Fuyang",
""
],
[
"Fan",
"Yuchen",
""
],
[
"Chandra",
"Vikas",
""
],
[
"Furukawa"... | This paper presents a neural architecture MVDiffusion++ for 3D object reconstruction that synthesizes dense and high-resolution views of an object given one or a few images without camera poses. MVDiffusion++ achieves superior flexibility and scalability with two surprisingly simple ideas: 1) A ``pose-free architecture... |
1204.4765 | Julius D'souza | Julius D'souza | String Trees | 5 pages | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A string-like compact data structure for unlabelled rooted trees is given
using 2n bits.
| [
{
"created": "Sat, 21 Apr 2012 00:36:28 GMT",
"version": "v1"
}
] | 2015-03-20 | [
[
"D'souza",
"Julius",
""
]
] | A string-like compact data structure for unlabelled rooted trees is given using 2n bits. |
1301.3865 | Tony S. Jebara | Tony S. Jebara, Tommi S. Jaakkola | Feature Selection and Dualities in Maximum Entropy Discrimination | Appears in Proceedings of the Sixteenth Conference on Uncertainty in
Artificial Intelligence (UAI2000) | null | null | UAI-P-2000-PG-291-300 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Incorporating feature selection into a classification or regression method
often carries a number of advantages. In this paper we formalize feature
selection specifically from a discriminative perspective of improving
classification/regression accuracy. The feature selection method is developed
as an extension to the... | [
{
"created": "Wed, 16 Jan 2013 15:50:50 GMT",
"version": "v1"
}
] | 2013-01-18 | [
[
"Jebara",
"Tony S.",
""
],
[
"Jaakkola",
"Tommi S.",
""
]
] | Incorporating feature selection into a classification or regression method often carries a number of advantages. In this paper we formalize feature selection specifically from a discriminative perspective of improving classification/regression accuracy. The feature selection method is developed as an extension to the r... |
2209.08731 | Sandy Irani | Dorit Aharonov and Sandy Irani | Translationally Invariant Constraint Optimization Problems | 75 pages, 13 figures | null | null | null | cs.CC quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the complexity of classical constraint satisfaction problems on a 2D
grid. Specifically, we consider the complexity of function versions of such
problems, with the additional restriction that the constraints are
translationally invariant, namely, the variables are located at the vertices of
a 2D grid and the... | [
{
"created": "Mon, 19 Sep 2022 03:03:05 GMT",
"version": "v1"
}
] | 2022-09-20 | [
[
"Aharonov",
"Dorit",
""
],
[
"Irani",
"Sandy",
""
]
] | We study the complexity of classical constraint satisfaction problems on a 2D grid. Specifically, we consider the complexity of function versions of such problems, with the additional restriction that the constraints are translationally invariant, namely, the variables are located at the vertices of a 2D grid and the c... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.