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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1201.6022 | Yuval Domb | Yuval Domb and Meir Feder | Non-Random Coding Error Exponent for Lattices | A subset of this work was submitted to the IEEE International
Symposium on Information Theory (ISIT) 2012 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An upper bound on the error probability of specific lattices, based on their
distance-spectrum, is constructed. The derivation is accomplished using a
simple alternative to the Minkowski-Hlawka mean-value theorem of the geometry
of numbers. In many ways, the new bound greatly resembles the Shulman-Feder
bound for lin... | [
{
"created": "Sun, 29 Jan 2012 09:12:30 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Feb 2012 14:10:53 GMT",
"version": "v2"
},
{
"created": "Mon, 20 Feb 2012 11:56:33 GMT",
"version": "v3"
},
{
"created": "Mon, 10 Sep 2012 11:29:23 GMT",
"version": "v4"
},
{
"cr... | 2013-01-03 | [
[
"Domb",
"Yuval",
""
],
[
"Feder",
"Meir",
""
]
] | An upper bound on the error probability of specific lattices, based on their distance-spectrum, is constructed. The derivation is accomplished using a simple alternative to the Minkowski-Hlawka mean-value theorem of the geometry of numbers. In many ways, the new bound greatly resembles the Shulman-Feder bound for linea... |
2102.03233 | Abhishek Sharma | Abhishek Sharma, Maks Ovsjanikov | Matrix Decomposition on Graphs: A Functional View | Under Review. arXiv admin note: substantial text overlap with
arXiv:2009.14343 | null | null | null | cs.LG cs.CV cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a functional view of matrix decomposition problems on graphs such
as geometric matrix completion and graph regularized dimensionality reduction.
Our unifying framework is based on the key idea that using a reduced basis to
represent functions on the product space is sufficient to recover a low rank
matrix ... | [
{
"created": "Fri, 5 Feb 2021 15:28:11 GMT",
"version": "v1"
}
] | 2021-02-08 | [
[
"Sharma",
"Abhishek",
""
],
[
"Ovsjanikov",
"Maks",
""
]
] | We propose a functional view of matrix decomposition problems on graphs such as geometric matrix completion and graph regularized dimensionality reduction. Our unifying framework is based on the key idea that using a reduced basis to represent functions on the product space is sufficient to recover a low rank matrix ap... |
2311.13088 | Yingxian Chen | Elton H.L. Yeung, Yingxian Chen, Wilton W.T. Fok, Gary K.K. Lau | Validation of Consumer-grade Digital Camera-based Human Activity
Evaluation for Upper Limb Exercises and Development of a Therapist-guided,
Automated Telerehabilitation Framework and Platform for Stroke Rehabilitation | it's not a ready paper to be uploaded | null | null | null | cs.HC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Timely and adequate rehabilitation is critical in facilitating post-stroke
recovery. However, the organization and delivery of rehabilitation are
resource-demanding, and are only available to approximately 25% of stroke
survivors in low-to-middle-income countries. Improving access to stroke
rehabilitation services th... | [
{
"created": "Wed, 22 Nov 2023 01:38:38 GMT",
"version": "v1"
},
{
"created": "Sat, 10 Feb 2024 15:48:19 GMT",
"version": "v2"
}
] | 2024-02-13 | [
[
"Yeung",
"Elton H. L.",
""
],
[
"Chen",
"Yingxian",
""
],
[
"Fok",
"Wilton W. T.",
""
],
[
"Lau",
"Gary K. K.",
""
]
] | Timely and adequate rehabilitation is critical in facilitating post-stroke recovery. However, the organization and delivery of rehabilitation are resource-demanding, and are only available to approximately 25% of stroke survivors in low-to-middle-income countries. Improving access to stroke rehabilitation services thro... |
2108.07353 | Leo Sampaio Ferraz Ribeiro | Leo Sampaio Ferraz Ribeiro and Tu Bui and John Collomosse and Moacir
Ponti | Scene Designer: a Unified Model for Scene Search and Synthesis from
Sketch | Accepted to the 1st Workshop on Sketching for Human Expressivity
(SHE), at ICCV 2021 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Scene Designer is a novel method for searching and generating images using
free-hand sketches of scene compositions; i.e. drawings that describe both the
appearance and relative positions of objects. Our core contribution is a single
unified model to learn both a cross-modal search embedding for matching
sketched com... | [
{
"created": "Mon, 16 Aug 2021 21:40:16 GMT",
"version": "v1"
}
] | 2021-08-18 | [
[
"Ribeiro",
"Leo Sampaio Ferraz",
""
],
[
"Bui",
"Tu",
""
],
[
"Collomosse",
"John",
""
],
[
"Ponti",
"Moacir",
""
]
] | Scene Designer is a novel method for searching and generating images using free-hand sketches of scene compositions; i.e. drawings that describe both the appearance and relative positions of objects. Our core contribution is a single unified model to learn both a cross-modal search embedding for matching sketched compo... |
2405.00025 | Md. Shohanur Islam Sobuj | Md. Shohanur Islam Sobuj, Md. Imran Hossen, Md. Foysal Mahmud and
Mahbub Ul Islam Khan | Leveraging Pre-trained CNNs for Efficient Feature Extraction in Rice
Leaf Disease Classification | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Rice disease classification is a critical task in agricultural research, and
in this study, we rigorously evaluate the impact of integrating feature
extraction methodologies within pre-trained convolutional neural networks
(CNNs). Initial investigations into baseline models, devoid of feature
extraction, revealed com... | [
{
"created": "Mon, 26 Feb 2024 07:19:48 GMT",
"version": "v1"
}
] | 2024-05-02 | [
[
"Sobuj",
"Md. Shohanur Islam",
""
],
[
"Hossen",
"Md. Imran",
""
],
[
"Mahmud",
"Md. Foysal",
""
],
[
"Khan",
"Mahbub Ul Islam",
""
]
] | Rice disease classification is a critical task in agricultural research, and in this study, we rigorously evaluate the impact of integrating feature extraction methodologies within pre-trained convolutional neural networks (CNNs). Initial investigations into baseline models, devoid of feature extraction, revealed comme... |
2403.10795 | Zhehui Huang | Zhehui Huang, Guangyao Shi, Gaurav S. Sukhatme | Can Large Language Models Solve Robot Routing? | Submitted to International Symposium of Robotics Research (ISRR 2024) | null | null | null | cs.CL cs.AI cs.LG cs.RO | http://creativecommons.org/licenses/by/4.0/ | Routing problems are common in mobile robotics, encompassing tasks such as
inspection, surveillance, and coverage. Depending on the objective and
constraints, these problems often reduce to variants of the Traveling Salesman
Problem (TSP), with solutions traditionally derived by translating high-level
objectives into... | [
{
"created": "Sat, 16 Mar 2024 03:54:38 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Aug 2024 21:14:23 GMT",
"version": "v2"
}
] | 2024-08-08 | [
[
"Huang",
"Zhehui",
""
],
[
"Shi",
"Guangyao",
""
],
[
"Sukhatme",
"Gaurav S.",
""
]
] | Routing problems are common in mobile robotics, encompassing tasks such as inspection, surveillance, and coverage. Depending on the objective and constraints, these problems often reduce to variants of the Traveling Salesman Problem (TSP), with solutions traditionally derived by translating high-level objectives into a... |
1805.07505 | Yang Liu | Xiang Ao, Yang Liu, Zhen Huang, Luo Zuo, Qing He | Free-rider Episode Screening via Dual Partition Model | The 23rd International Conference on Database Systems for Advanced
Applications(DASFAA 2018), 16 Pages | null | null | null | cs.DB cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the drawbacks of frequent episode mining is that overwhelmingly many
of the discovered patterns are redundant. Free-rider episode, as a typical
example, consists of a real pattern doped with some additional noise events.
Because of the possible high support of the inside noise events, such
free-rider episodes ... | [
{
"created": "Sat, 19 May 2018 03:34:09 GMT",
"version": "v1"
}
] | 2018-05-22 | [
[
"Ao",
"Xiang",
""
],
[
"Liu",
"Yang",
""
],
[
"Huang",
"Zhen",
""
],
[
"Zuo",
"Luo",
""
],
[
"He",
"Qing",
""
]
] | One of the drawbacks of frequent episode mining is that overwhelmingly many of the discovered patterns are redundant. Free-rider episode, as a typical example, consists of a real pattern doped with some additional noise events. Because of the possible high support of the inside noise events, such free-rider episodes ma... |
1703.00641 | Dong Yin | Dong Yin, Ramtin Pedarsani, Yudong Chen, Kannan Ramchandran | Learning Mixtures of Sparse Linear Regressions Using Sparse Graph Codes | To appear in IEEE Transactions on Information Theory | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider the mixture of sparse linear regressions model.
Let ${\beta}^{(1)},\ldots,{\beta}^{(L)}\in\mathbb{C}^n$ be $ L $ unknown sparse
parameter vectors with a total of $ K $ non-zero coefficients. Noisy linear
measurements are obtained in the form $y_i={x}_i^H {\beta}^{(\ell_i)} + w_i$,
each of w... | [
{
"created": "Thu, 2 Mar 2017 07:15:41 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Aug 2018 05:59:48 GMT",
"version": "v2"
}
] | 2018-08-03 | [
[
"Yin",
"Dong",
""
],
[
"Pedarsani",
"Ramtin",
""
],
[
"Chen",
"Yudong",
""
],
[
"Ramchandran",
"Kannan",
""
]
] | In this paper, we consider the mixture of sparse linear regressions model. Let ${\beta}^{(1)},\ldots,{\beta}^{(L)}\in\mathbb{C}^n$ be $ L $ unknown sparse parameter vectors with a total of $ K $ non-zero coefficients. Noisy linear measurements are obtained in the form $y_i={x}_i^H {\beta}^{(\ell_i)} + w_i$, each of whi... |
2102.02243 | Setareh Sharifian | Setareh Sharifian, Reihaneh Safavi-Naini | Information-theoretic Key Encapsulation and its Applications | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A hybrid encryption scheme is a public-key encryption system that consists of
a public-key part called the key encapsulation mechanism (KEM), and a
(symmetric) secret-key part called data encapsulation mechanism (DEM): the
public-key part is used to generate a shared secret key between two parties,
and the symmetric ... | [
{
"created": "Wed, 3 Feb 2021 19:23:55 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Apr 2021 23:15:20 GMT",
"version": "v2"
}
] | 2021-04-05 | [
[
"Sharifian",
"Setareh",
""
],
[
"Safavi-Naini",
"Reihaneh",
""
]
] | A hybrid encryption scheme is a public-key encryption system that consists of a public-key part called the key encapsulation mechanism (KEM), and a (symmetric) secret-key part called data encapsulation mechanism (DEM): the public-key part is used to generate a shared secret key between two parties, and the symmetric ke... |
1807.07761 | Marco Cremonini | Marco Cremonini and Francesca Casamassima | Controllability of Social Networks and the Strategic Use of Random
Information | null | Computational Social Networks 2017 4:10 | 10.1186/s40649-017-0046-2 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work is aimed at studying realistic social control strategies for social
networks based on the introduction of random information into the state of
selected driver agents. Deliberately exposing selected agents to random
information is a technique already experimented in recommender systems or
search engines, and... | [
{
"created": "Fri, 20 Jul 2018 09:47:35 GMT",
"version": "v1"
}
] | 2018-07-23 | [
[
"Cremonini",
"Marco",
""
],
[
"Casamassima",
"Francesca",
""
]
] | This work is aimed at studying realistic social control strategies for social networks based on the introduction of random information into the state of selected driver agents. Deliberately exposing selected agents to random information is a technique already experimented in recommender systems or search engines, and r... |
1901.08021 | Richard Klima | Richard Klima, Daan Bloembergen, Michael Kaisers, Karl Tuyls | Robust Temporal Difference Learning for Critical Domains | AAMAS 2019 | null | null | null | cs.LG cs.MA stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new Q-function operator for temporal difference (TD) learning
methods that explicitly encodes robustness against significant rare events
(SRE) in critical domains. The operator, which we call the $\kappa$-operator,
allows to learn a robust policy in a model-based fashion without actually
observing the SR... | [
{
"created": "Wed, 23 Jan 2019 17:34:51 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Mar 2019 09:27:46 GMT",
"version": "v2"
}
] | 2019-03-14 | [
[
"Klima",
"Richard",
""
],
[
"Bloembergen",
"Daan",
""
],
[
"Kaisers",
"Michael",
""
],
[
"Tuyls",
"Karl",
""
]
] | We present a new Q-function operator for temporal difference (TD) learning methods that explicitly encodes robustness against significant rare events (SRE) in critical domains. The operator, which we call the $\kappa$-operator, allows to learn a robust policy in a model-based fashion without actually observing the SRE.... |
2112.04215 | Enrico Fini | Enrico Fini, Victor G. Turrisi da Costa, Xavier Alameda-Pineda, Elisa
Ricci, Karteek Alahari, Julien Mairal | Self-Supervised Models are Continual Learners | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Self-supervised models have been shown to produce comparable or better visual
representations than their supervised counterparts when trained offline on
unlabeled data at scale. However, their efficacy is catastrophically reduced in
a Continual Learning (CL) scenario where data is presented to the model
sequentially.... | [
{
"created": "Wed, 8 Dec 2021 10:39:13 GMT",
"version": "v1"
},
{
"created": "Fri, 1 Apr 2022 12:48:43 GMT",
"version": "v2"
}
] | 2022-04-04 | [
[
"Fini",
"Enrico",
""
],
[
"da Costa",
"Victor G. Turrisi",
""
],
[
"Alameda-Pineda",
"Xavier",
""
],
[
"Ricci",
"Elisa",
""
],
[
"Alahari",
"Karteek",
""
],
[
"Mairal",
"Julien",
""
]
] | Self-supervised models have been shown to produce comparable or better visual representations than their supervised counterparts when trained offline on unlabeled data at scale. However, their efficacy is catastrophically reduced in a Continual Learning (CL) scenario where data is presented to the model sequentially. I... |
0905.4303 | Jaspreet Singh | Jaspreet Singh and Upamanyu Madhow | On Block Noncoherent Communication with Low-Precision Phase Quantization
at the Receiver | IEEE ISIT 2009 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider communication over the block noncoherent AWGN channel with
low-precision Analog-to-Digital Converters (ADCs) at the receiver. For standard
uniform Phase Shift Keying (PSK) modulation, we investigate the performance of
a receiver architecture that quantizes only the phase of the received signal;
this has t... | [
{
"created": "Tue, 26 May 2009 23:58:22 GMT",
"version": "v1"
}
] | 2009-05-28 | [
[
"Singh",
"Jaspreet",
""
],
[
"Madhow",
"Upamanyu",
""
]
] | We consider communication over the block noncoherent AWGN channel with low-precision Analog-to-Digital Converters (ADCs) at the receiver. For standard uniform Phase Shift Keying (PSK) modulation, we investigate the performance of a receiver architecture that quantizes only the phase of the received signal; this has the... |
2109.08920 | Wei Yan | Wei Yan, Sian-Jheng Lin | A Tighter Upper Bound of the Expansion Factor for Universal Coding of
Integers and Its Code Constructions | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In entropy coding, universal coding of integers~(UCI) is a binary universal
prefix code, such that the ratio of the expected codeword length to $\max\{1,
H(P)\}$ is less than or equal to a constant expansion factor $K_{\mathcal{C}}$
for any probability distribution $P$, where $H(P)$ is the Shannon entropy of
$P$. $K_... | [
{
"created": "Sat, 18 Sep 2021 12:29:59 GMT",
"version": "v1"
}
] | 2021-09-21 | [
[
"Yan",
"Wei",
""
],
[
"Lin",
"Sian-Jheng",
""
]
] | In entropy coding, universal coding of integers~(UCI) is a binary universal prefix code, such that the ratio of the expected codeword length to $\max\{1, H(P)\}$ is less than or equal to a constant expansion factor $K_{\mathcal{C}}$ for any probability distribution $P$, where $H(P)$ is the Shannon entropy of $P$. $K_{\... |
1507.05164 | Andrew Mironov | Andrew M. Mironov | A theory of probabilistic automata, part 1 | 123 pages, in Russian | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the book we present main concepts of probabilistic automata theory.
| [
{
"created": "Sat, 18 Jul 2015 09:49:30 GMT",
"version": "v1"
}
] | 2015-07-21 | [
[
"Mironov",
"Andrew M.",
""
]
] | In the book we present main concepts of probabilistic automata theory. |
2403.01314 | Srivatsan Ravi Mr | Michael Collins and Jyotirmoy V. Deshmukh and Dristi Dinesh and Mukund
Raghothaman and Srivatsan Ravi and Yuan Xia | Superflows: A New Tool for Forensic Network Flow Analysis | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Network security analysts gather data from diverse sources, from high-level
summaries of network flow and traffic volumes to low-level details such as
service logs from servers and the contents of individual packets. They validate
and check this data against traffic patterns and historical indicators of
compromise. B... | [
{
"created": "Sat, 2 Mar 2024 21:22:36 GMT",
"version": "v1"
}
] | 2024-03-05 | [
[
"Collins",
"Michael",
""
],
[
"Deshmukh",
"Jyotirmoy V.",
""
],
[
"Dinesh",
"Dristi",
""
],
[
"Raghothaman",
"Mukund",
""
],
[
"Ravi",
"Srivatsan",
""
],
[
"Xia",
"Yuan",
""
]
] | Network security analysts gather data from diverse sources, from high-level summaries of network flow and traffic volumes to low-level details such as service logs from servers and the contents of individual packets. They validate and check this data against traffic patterns and historical indicators of compromise. Bas... |
2212.09750 | Jiaao Chen | Jiaao Chen, Mohan Dodda, Diyi Yang | Human-in-the-loop Abstractive Dialogue Summarization | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Abstractive dialogue summarization has received increasing attention
recently. Despite the fact that most of the current dialogue summarization
systems are trained to maximize the likelihood of human-written summaries and
have achieved significant results, there is still a huge gap in generating
high-quality summarie... | [
{
"created": "Mon, 19 Dec 2022 19:11:27 GMT",
"version": "v1"
}
] | 2022-12-21 | [
[
"Chen",
"Jiaao",
""
],
[
"Dodda",
"Mohan",
""
],
[
"Yang",
"Diyi",
""
]
] | Abstractive dialogue summarization has received increasing attention recently. Despite the fact that most of the current dialogue summarization systems are trained to maximize the likelihood of human-written summaries and have achieved significant results, there is still a huge gap in generating high-quality summaries ... |
2001.10719 | Lekshmi Beena Gopalakrishnan Nair | Lekshmi B.G., Andreas Becher, Klaus Meyer-Wegener | Query-Sequence Optimization on a Reconfigurable Hardware-Accelerated
System | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hardware acceleration of database query processing can be done with the help
of FPGAs. In particular, they are partially reconfigurable during runtime,
which allows for the runtime adaption of the hardware to a variety of queries.
Reconfiguration itself, however, takes some time. As the affected area of the
FPGA is n... | [
{
"created": "Wed, 29 Jan 2020 08:23:13 GMT",
"version": "v1"
}
] | 2020-01-30 | [
[
"G.",
"Lekshmi B.",
""
],
[
"Becher",
"Andreas",
""
],
[
"Meyer-Wegener",
"Klaus",
""
]
] | Hardware acceleration of database query processing can be done with the help of FPGAs. In particular, they are partially reconfigurable during runtime, which allows for the runtime adaption of the hardware to a variety of queries. Reconfiguration itself, however, takes some time. As the affected area of the FPGA is not... |
1912.00581 | William Paul Boyce | W. Paul Boyce, Tony Lindsay, Arkady Zgonnikov, Ignacio Rano, and
KongFatt Wong-Lin | Optimality and limitations of audio-visual integration for cognitive
systems | 20 pages, 6 figures, 1 table 16/06/2020: Updated version includes
expanded discussion and addition of new references. Also updated author
affiliation information. This version has been accepted for publication with
Frontiers | null | null | null | cs.AI cs.HC q-bio.NC | http://creativecommons.org/licenses/by/4.0/ | Multimodal integration is an important process in perceptual decision-making.
In humans, this process has often been shown to be statistically optimal, or
near optimal: sensory information is combined in a fashion that minimises the
average error in perceptual representation of stimuli. However, sometimes there
are c... | [
{
"created": "Mon, 2 Dec 2019 05:08:39 GMT",
"version": "v1"
},
{
"created": "Sat, 11 Jan 2020 06:27:55 GMT",
"version": "v2"
},
{
"created": "Tue, 16 Jun 2020 02:10:31 GMT",
"version": "v3"
}
] | 2020-06-17 | [
[
"Boyce",
"W. Paul",
""
],
[
"Lindsay",
"Tony",
""
],
[
"Zgonnikov",
"Arkady",
""
],
[
"Rano",
"Ignacio",
""
],
[
"Wong-Lin",
"KongFatt",
""
]
] | Multimodal integration is an important process in perceptual decision-making. In humans, this process has often been shown to be statistically optimal, or near optimal: sensory information is combined in a fashion that minimises the average error in perceptual representation of stimuli. However, sometimes there are cos... |
2302.04113 | Andreas G\"obel | Tobias Friedrich, Andreas G\"obel, Maximilian Katzmann, Leon Schiller | Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs | null | SIAM Journal on Discrete Mathematics, Vol. 38, Iss. 2 (2024) | 10.1137/23M157394X | null | cs.DM | http://creativecommons.org/licenses/by/4.0/ | A recent trend in the context of graph theory is to bring theoretical
analyses closer to empirical observations, by focusing the studies on random
graph models that are used to represent practical instances. There, it was
observed that geometric inhomogeneous random graphs (GIRGs) yield good
representations of comple... | [
{
"created": "Wed, 8 Feb 2023 15:11:31 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Jul 2024 16:50:18 GMT",
"version": "v2"
}
] | 2024-07-11 | [
[
"Friedrich",
"Tobias",
""
],
[
"Göbel",
"Andreas",
""
],
[
"Katzmann",
"Maximilian",
""
],
[
"Schiller",
"Leon",
""
]
] | A recent trend in the context of graph theory is to bring theoretical analyses closer to empirical observations, by focusing the studies on random graph models that are used to represent practical instances. There, it was observed that geometric inhomogeneous random graphs (GIRGs) yield good representations of complex ... |
2405.03652 | Zhiyuan Li | Chenyu Gao, Shunxing Bao, Michael Kim, Nancy Newlin, Praitayini
Kanakaraj, Tianyuan Yao, Gaurav Rudravaram, Yuankai Huo, Daniel Moyer, Kurt
Schilling, Walter Kukull, Arthur Toga, Derek Archer, Timothy Hohman, Bennett
Landman, Zhiyuan Li | Field-of-View Extension for Diffusion MRI via Deep Generative Models | 20 pages, 11 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Purpose: In diffusion MRI (dMRI), the volumetric and bundle analyses of
whole-brain tissue microstructure and connectivity can be severely impeded by
an incomplete field-of-view (FOV). This work aims to develop a method for
imputing the missing slices directly from existing dMRI scans with an
incomplete FOV. We hypot... | [
{
"created": "Mon, 6 May 2024 17:23:42 GMT",
"version": "v1"
}
] | 2024-05-07 | [
[
"Gao",
"Chenyu",
""
],
[
"Bao",
"Shunxing",
""
],
[
"Kim",
"Michael",
""
],
[
"Newlin",
"Nancy",
""
],
[
"Kanakaraj",
"Praitayini",
""
],
[
"Yao",
"Tianyuan",
""
],
[
"Rudravaram",
"Gaurav",
""
],
[
... | Purpose: In diffusion MRI (dMRI), the volumetric and bundle analyses of whole-brain tissue microstructure and connectivity can be severely impeded by an incomplete field-of-view (FOV). This work aims to develop a method for imputing the missing slices directly from existing dMRI scans with an incomplete FOV. We hypothe... |
2207.11730 | Praveen Kumar | Praveen Kumar, Sudhan Majhi, Subhabrata Paul | A Direct Construction of Cross Z-Complementary Sets with Flexible
Lengths and Large Zero Correlation Zone | null | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | This letter proposes a direct construction for cross Z-complementary sets
(CZCSs) with flexible lengths and a large zero correlation zone (ZCZ). CZCS is
an extension of the cross Z-complementary pair (CZCP). The maximum possible ZCZ
width of a CZCP is half of its sequence length. In this letter, for the first
time, a... | [
{
"created": "Sun, 24 Jul 2022 12:22:11 GMT",
"version": "v1"
}
] | 2022-07-26 | [
[
"Kumar",
"Praveen",
""
],
[
"Majhi",
"Sudhan",
""
],
[
"Paul",
"Subhabrata",
""
]
] | This letter proposes a direct construction for cross Z-complementary sets (CZCSs) with flexible lengths and a large zero correlation zone (ZCZ). CZCS is an extension of the cross Z-complementary pair (CZCP). The maximum possible ZCZ width of a CZCP is half of its sequence length. In this letter, for the first time, a g... |
2401.00974 | Chi-Hua Wang | Yinan Cheng, Chi-Hua Wang, Vamsi K. Potluru, Tucker Balch, Guang Cheng | Downstream Task-Oriented Generative Model Selections on Synthetic Data
Training for Fraud Detection Models | The following article has been accepted by ICAIF22, Synthetic Data
for AI in Finance; see
https://sites.google.com/view/icaif-synthetic-2022/program | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Devising procedures for downstream task-oriented generative model selections
is an unresolved problem of practical importance. Existing studies focused on
the utility of a single family of generative models. They provided limited
insights on how synthetic data practitioners select the best family generative
models fo... | [
{
"created": "Mon, 1 Jan 2024 23:33:56 GMT",
"version": "v1"
}
] | 2024-01-03 | [
[
"Cheng",
"Yinan",
""
],
[
"Wang",
"Chi-Hua",
""
],
[
"Potluru",
"Vamsi K.",
""
],
[
"Balch",
"Tucker",
""
],
[
"Cheng",
"Guang",
""
]
] | Devising procedures for downstream task-oriented generative model selections is an unresolved problem of practical importance. Existing studies focused on the utility of a single family of generative models. They provided limited insights on how synthetic data practitioners select the best family generative models for ... |
2205.08664 | Taro L. Saito | Taro L. Saito, Naoki Takezoe, Yukihiro Okada, Takako Shimamoto,
Dongmin Yu, Suprith Chandrashekharachar, Kai Sasaki, Shohei Okumiya, Yan
Wang, Takashi Kurihara, Ryu Kobayashi, Keisuke Suzuki, Zhenghong Yang, Makoto
Onizuka | Journey of Migrating Millions of Queries on The Cloud | This version is published in DBTest '22: Proceedings of the 2022
workshop on 9th International Workshop of Testing Database Systems | null | 10.1145/3531348.3532177 | null | cs.DB | http://creativecommons.org/licenses/by/4.0/ | Treasure Data is processing millions of distributed SQL queries every day on
the cloud. Upgrading the query engine service at this scale is challenging
because we need to migrate all of the production queries of the customers to a
new version while preserving the correctness and performance of the data
processing pip... | [
{
"created": "Tue, 17 May 2022 23:48:26 GMT",
"version": "v1"
}
] | 2022-05-19 | [
[
"Saito",
"Taro L.",
""
],
[
"Takezoe",
"Naoki",
""
],
[
"Okada",
"Yukihiro",
""
],
[
"Shimamoto",
"Takako",
""
],
[
"Yu",
"Dongmin",
""
],
[
"Chandrashekharachar",
"Suprith",
""
],
[
"Sasaki",
"Kai",
""
]... | Treasure Data is processing millions of distributed SQL queries every day on the cloud. Upgrading the query engine service at this scale is challenging because we need to migrate all of the production queries of the customers to a new version while preserving the correctness and performance of the data processing pipel... |
2305.17523 | Jaydip Sen Prof | Jaydip Sen, Aditya Jaiswal, Anshuman Pathak, Atish Kumar Majee,
Kushagra Kumar, Manas Kumar Sarkar, and Soubhik Maji | A Comparative Analysis of Portfolio Optimization Using Mean-Variance,
Hierarchical Risk Parity, and Reinforcement Learning Approaches on the Indian
Stock Market | The report is 52 pages long. It is based on the capstone project done
in the post graduate course of data science in Praxis Business School,
Kolkata, India, of the Autumn Batch, 2022 | null | null | null | cs.LG q-fin.PM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a comparative analysis of the performances of three
portfolio optimization approaches. Three approaches of portfolio optimization
that are considered in this work are the mean-variance portfolio (MVP),
hierarchical risk parity (HRP) portfolio, and reinforcement learning-based
portfolio. The portfo... | [
{
"created": "Sat, 27 May 2023 16:38:18 GMT",
"version": "v1"
}
] | 2023-05-30 | [
[
"Sen",
"Jaydip",
""
],
[
"Jaiswal",
"Aditya",
""
],
[
"Pathak",
"Anshuman",
""
],
[
"Majee",
"Atish Kumar",
""
],
[
"Kumar",
"Kushagra",
""
],
[
"Sarkar",
"Manas Kumar",
""
],
[
"Maji",
"Soubhik",
""
]
] | This paper presents a comparative analysis of the performances of three portfolio optimization approaches. Three approaches of portfolio optimization that are considered in this work are the mean-variance portfolio (MVP), hierarchical risk parity (HRP) portfolio, and reinforcement learning-based portfolio. The portfoli... |
2012.05228 | Xuanchi Ren | Xuanchi Ren, Zian Qian, Qifeng Chen | Video Deblurring by Fitting to Test Data | Project Page: https://github.com/xrenaa/Deblur-by-Fitting | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motion blur in videos captured by autonomous vehicles and robots can degrade
their perception capability. In this work, we present a novel approach to video
deblurring by fitting a deep network to the test video. Our key observation is
that some frames in a video with motion blur are much sharper than others, and
thu... | [
{
"created": "Wed, 9 Dec 2020 18:49:24 GMT",
"version": "v1"
},
{
"created": "Sat, 6 Mar 2021 07:22:22 GMT",
"version": "v2"
}
] | 2021-03-09 | [
[
"Ren",
"Xuanchi",
""
],
[
"Qian",
"Zian",
""
],
[
"Chen",
"Qifeng",
""
]
] | Motion blur in videos captured by autonomous vehicles and robots can degrade their perception capability. In this work, we present a novel approach to video deblurring by fitting a deep network to the test video. Our key observation is that some frames in a video with motion blur are much sharper than others, and thus ... |
1705.02737 | Lovedeep Gondara | Lovedeep Gondara, Ke Wang | MIDA: Multiple Imputation using Denoising Autoencoders | To appear in the proceedings of the 22nd Pacific-Asia Conference on
Knowledge Discovery and Data Mining (PAKDD 2018) | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Missing data is a significant problem impacting all domains. State-of-the-art
framework for minimizing missing data bias is multiple imputation, for which
the choice of an imputation model remains nontrivial. We propose a multiple
imputation model based on overcomplete deep denoising autoencoders. Our
proposed model ... | [
{
"created": "Mon, 8 May 2017 04:00:25 GMT",
"version": "v1"
},
{
"created": "Fri, 19 May 2017 21:15:44 GMT",
"version": "v2"
},
{
"created": "Sat, 17 Feb 2018 16:05:32 GMT",
"version": "v3"
}
] | 2018-02-20 | [
[
"Gondara",
"Lovedeep",
""
],
[
"Wang",
"Ke",
""
]
] | Missing data is a significant problem impacting all domains. State-of-the-art framework for minimizing missing data bias is multiple imputation, for which the choice of an imputation model remains nontrivial. We propose a multiple imputation model based on overcomplete deep denoising autoencoders. Our proposed model is... |
2311.04145 | Shiwei Zhang | Shiwei Zhang, Jiayu Wang, Yingya Zhang, Kang Zhao, Hangjie Yuan, Zhiwu
Qin, Xiang Wang, Deli Zhao, Jingren Zhou | I2VGen-XL: High-Quality Image-to-Video Synthesis via Cascaded Diffusion
Models | Project page: https://i2vgen-xl.github.io | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Video synthesis has recently made remarkable strides benefiting from the
rapid development of diffusion models. However, it still encounters challenges
in terms of semantic accuracy, clarity and spatio-temporal continuity. They
primarily arise from the scarcity of well-aligned text-video data and the
complex inherent... | [
{
"created": "Tue, 7 Nov 2023 17:16:06 GMT",
"version": "v1"
}
] | 2023-11-08 | [
[
"Zhang",
"Shiwei",
""
],
[
"Wang",
"Jiayu",
""
],
[
"Zhang",
"Yingya",
""
],
[
"Zhao",
"Kang",
""
],
[
"Yuan",
"Hangjie",
""
],
[
"Qin",
"Zhiwu",
""
],
[
"Wang",
"Xiang",
""
],
[
"Zhao",
"Deli",... | Video synthesis has recently made remarkable strides benefiting from the rapid development of diffusion models. However, it still encounters challenges in terms of semantic accuracy, clarity and spatio-temporal continuity. They primarily arise from the scarcity of well-aligned text-video data and the complex inherent s... |
1808.02696 | Sascha Kurz | Sascha Kurz and Stefan Napel | The roll call interpretation of the Shapley value | 9 pages | null | 10.1016/j.econlet.2018.09.025 | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Shapley value is commonly illustrated by roll call votes in which players
support or reject a proposal in sequence. If all sequences are equiprobable, a
voter's Shapley value can be interpreted as the probability of being pivotal,
i.e., to bring about the required majority or to make this impossible for
others. W... | [
{
"created": "Wed, 8 Aug 2018 09:53:15 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Sep 2018 08:52:17 GMT",
"version": "v2"
}
] | 2018-10-04 | [
[
"Kurz",
"Sascha",
""
],
[
"Napel",
"Stefan",
""
]
] | The Shapley value is commonly illustrated by roll call votes in which players support or reject a proposal in sequence. If all sequences are equiprobable, a voter's Shapley value can be interpreted as the probability of being pivotal, i.e., to bring about the required majority or to make this impossible for others. We ... |
2009.10976 | Dingqing Yang | Dingqing Yang, Amin Ghasemazar, Xiaowei Ren, Maximilian Golub, Guy
Lemieux, Mieszko Lis | Procrustes: a Dataflow and Accelerator for Sparse Deep Neural Network
Training | Appears in the Proceedings of the 53$^\mathit{rd}$ IEEE/ACM
International Symposium on Microarchitecture (MICRO 2020) | null | null | null | cs.NE cs.AR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The success of DNN pruning has led to the development of energy-efficient
inference accelerators that support pruned models with sparse weight and
activation tensors. Because the memory layouts and dataflows in these
architectures are optimized for the access patterns during
$\mathit{inference}$, however, they do not... | [
{
"created": "Wed, 23 Sep 2020 07:39:55 GMT",
"version": "v1"
}
] | 2020-09-24 | [
[
"Yang",
"Dingqing",
""
],
[
"Ghasemazar",
"Amin",
""
],
[
"Ren",
"Xiaowei",
""
],
[
"Golub",
"Maximilian",
""
],
[
"Lemieux",
"Guy",
""
],
[
"Lis",
"Mieszko",
""
]
] | The success of DNN pruning has led to the development of energy-efficient inference accelerators that support pruned models with sparse weight and activation tensors. Because the memory layouts and dataflows in these architectures are optimized for the access patterns during $\mathit{inference}$, however, they do not e... |
2208.12539 | Tianyi Li | Tianyi Li, Wenyu Huang, Nikos Papasarantopoulos, Pavlos Vougiouklis,
Jeff Z. Pan | Task-specific Pre-training and Prompt Decomposition for Knowledge Graph
Population with Language Models | To appear in ISWC 2022 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We present a system for knowledge graph population with Language Models,
evaluated on the Knowledge Base Construction from Pre-trained Language Models
(LM-KBC) challenge at ISWC 2022. Our system involves task-specific pre-training
to improve LM representation of the masked object tokens, prompt decomposition
for prog... | [
{
"created": "Fri, 26 Aug 2022 09:56:27 GMT",
"version": "v1"
},
{
"created": "Wed, 31 Aug 2022 10:51:58 GMT",
"version": "v2"
}
] | 2022-09-01 | [
[
"Li",
"Tianyi",
""
],
[
"Huang",
"Wenyu",
""
],
[
"Papasarantopoulos",
"Nikos",
""
],
[
"Vougiouklis",
"Pavlos",
""
],
[
"Pan",
"Jeff Z.",
""
]
] | We present a system for knowledge graph population with Language Models, evaluated on the Knowledge Base Construction from Pre-trained Language Models (LM-KBC) challenge at ISWC 2022. Our system involves task-specific pre-training to improve LM representation of the masked object tokens, prompt decomposition for progre... |
1901.11139 | Matthew Kirchner | Matthew R. Kirchner | A Level Set Approach to Online Sensing and Trajectory Optimization with
Time Delays | Updated formatting to comply with publications guidelines. Corrected
some minor typos. To appear in the proceedings of the 10th IFAC Symposium on
Intelligent Autonomous Vehicles | IFAC PapersOnLine, volume 52, issue 8, pp. 301-306, 2019 | 10.1016/j.ifacol.2019.08.087 | null | cs.SY eess.SP math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Presented is a method to compute certain classes of Hamilton-Jacobi equations
that result from optimal control and trajectory generation problems with time
delays. Many robotic control and trajectory problems have limited information
of the operating environment a priori and must continually perform online
trajectory... | [
{
"created": "Wed, 30 Jan 2019 23:10:51 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Jun 2019 17:52:43 GMT",
"version": "v2"
}
] | 2019-10-22 | [
[
"Kirchner",
"Matthew R.",
""
]
] | Presented is a method to compute certain classes of Hamilton-Jacobi equations that result from optimal control and trajectory generation problems with time delays. Many robotic control and trajectory problems have limited information of the operating environment a priori and must continually perform online trajectory o... |
2210.12339 | Junwei Bao Doctor | Junwei Bao, Yifan Wang, Jiangyong Ying, Yeyun Gong, Jing Zhao,
Youzheng Wu, Xiaodong He | P$^3$LM: Probabilistically Permuted Prophet Language Modeling for
Generative Pre-Training | Accepted to EMNLP(Findings) 2022 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | Conventional autoregressive left-to-right (L2R) sequence generation faces two
issues during decoding: limited to unidirectional target sequence modeling, and
constrained on strong local dependencies. To address the aforementioned
problem, we propose P$^3$LM, a probabilistically permuted prophet language
model, which ... | [
{
"created": "Sat, 22 Oct 2022 03:50:59 GMT",
"version": "v1"
}
] | 2022-10-25 | [
[
"Bao",
"Junwei",
""
],
[
"Wang",
"Yifan",
""
],
[
"Ying",
"Jiangyong",
""
],
[
"Gong",
"Yeyun",
""
],
[
"Zhao",
"Jing",
""
],
[
"Wu",
"Youzheng",
""
],
[
"He",
"Xiaodong",
""
]
] | Conventional autoregressive left-to-right (L2R) sequence generation faces two issues during decoding: limited to unidirectional target sequence modeling, and constrained on strong local dependencies. To address the aforementioned problem, we propose P$^3$LM, a probabilistically permuted prophet language model, which st... |
1810.12020 | Zhuoran Lyu | Zhe Yuan, Zhuoran Lyu, Jiwei Li and Xi Zhou | An improved hybrid CTC-Attention model for speech recognition | Submitted to the 2019 IEEE International Conference on Acoustics,
Speech, and Signal Processing (ICASSP), Brighton, UK, May 2019 | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, end-to-end speech recognition with a hybrid model consisting of the
connectionist temporal classification(CTC) and the attention encoder-decoder
achieved state-of-the-art results. In this paper, we propose a novel CTC
decoder structure based on the experiments we conducted and explore the
relation between d... | [
{
"created": "Mon, 29 Oct 2018 09:28:33 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Oct 2018 02:19:59 GMT",
"version": "v2"
},
{
"created": "Thu, 1 Nov 2018 07:05:44 GMT",
"version": "v3"
}
] | 2018-11-02 | [
[
"Yuan",
"Zhe",
""
],
[
"Lyu",
"Zhuoran",
""
],
[
"Li",
"Jiwei",
""
],
[
"Zhou",
"Xi",
""
]
] | Recently, end-to-end speech recognition with a hybrid model consisting of the connectionist temporal classification(CTC) and the attention encoder-decoder achieved state-of-the-art results. In this paper, we propose a novel CTC decoder structure based on the experiments we conducted and explore the relation between dec... |
2010.12433 | Gaurish Thakkar Mr | Diego Alves, Gaurish Thakkar, Marko Tadi\'c | Natural Language Processing Chains Inside a Cross-lingual Event-Centric
Knowledge Pipeline for European Union Under-resourced Languages | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article presents the strategy for developing a platform containing
Language Processing Chains for European Union languages, consisting of
Tokenization to Parsing, also including Named Entity recognition andwith
addition ofSentiment Analysis. These chains are part of the first step of an
event-centric knowledge p... | [
{
"created": "Fri, 23 Oct 2020 14:26:30 GMT",
"version": "v1"
}
] | 2020-10-26 | [
[
"Alves",
"Diego",
""
],
[
"Thakkar",
"Gaurish",
""
],
[
"Tadić",
"Marko",
""
]
] | This article presents the strategy for developing a platform containing Language Processing Chains for European Union languages, consisting of Tokenization to Parsing, also including Named Entity recognition andwith addition ofSentiment Analysis. These chains are part of the first step of an event-centric knowledge pro... |
2311.09984 | Zenin Easa Panthakkalakath | Zenin Easa Panthakkalakath, Neeraj, Jimson Mathew | A Framework for Modeling, Analyzing, and Decision-Making in Disease
Spread Dynamics and Medicine/Vaccine Distribution | null | null | null | null | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The challenges posed by epidemics and pandemics are immense, especially if
the causes are novel. This article introduces a versatile open-source
simulation framework designed to model intricate dynamics of infectious
diseases across diverse population centres. Taking inspiration from historical
precedents such as the... | [
{
"created": "Thu, 16 Nov 2023 16:03:37 GMT",
"version": "v1"
}
] | 2023-11-17 | [
[
"Panthakkalakath",
"Zenin Easa",
""
],
[
"Neeraj",
"",
""
],
[
"Mathew",
"Jimson",
""
]
] | The challenges posed by epidemics and pandemics are immense, especially if the causes are novel. This article introduces a versatile open-source simulation framework designed to model intricate dynamics of infectious diseases across diverse population centres. Taking inspiration from historical precedents such as the S... |
2311.14871 | Linzi Xing | Linzi Xing, Brad Hackinen, Giuseppe Carenini | Tracing Influence at Scale: A Contrastive Learning Approach to Linking
Public Comments and Regulator Responses | Accepted to the Natural Legal Language Processing Workshop 2023 (NLLP
2023) | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | U.S. Federal Regulators receive over one million comment letters each year
from businesses, interest groups, and members of the public, all advocating for
changes to proposed regulations. These comments are believed to have
wide-ranging impacts on public policy. However, measuring the impact of
specific comments is c... | [
{
"created": "Fri, 24 Nov 2023 23:32:13 GMT",
"version": "v1"
}
] | 2023-11-28 | [
[
"Xing",
"Linzi",
""
],
[
"Hackinen",
"Brad",
""
],
[
"Carenini",
"Giuseppe",
""
]
] | U.S. Federal Regulators receive over one million comment letters each year from businesses, interest groups, and members of the public, all advocating for changes to proposed regulations. These comments are believed to have wide-ranging impacts on public policy. However, measuring the impact of specific comments is cha... |
2108.05798 | Harald Koestler Prof. Dr. | Sam Jacob Jacob, Markus Mrosek, Carsten Othmer, Harald K\"ostler | Deep Learning for Real-Time Aerodynamic Evaluations of Arbitrary Vehicle
Shapes | null | null | 10.4271/15-15-02-0006 | null | cs.CE | http://creativecommons.org/licenses/by/4.0/ | The aerodynamic optimization process of cars requires multiple iterations
between aerodynamicists and stylists. Response Surface Modeling and
Reduced-Order Modeling are commonly used to eliminate the overhead due to
Computational Fluid Dynamics, leading to faster iterations. However, a primary
drawback of these model... | [
{
"created": "Thu, 12 Aug 2021 15:26:24 GMT",
"version": "v1"
}
] | 2022-05-26 | [
[
"Jacob",
"Sam Jacob",
""
],
[
"Mrosek",
"Markus",
""
],
[
"Othmer",
"Carsten",
""
],
[
"Köstler",
"Harald",
""
]
] | The aerodynamic optimization process of cars requires multiple iterations between aerodynamicists and stylists. Response Surface Modeling and Reduced-Order Modeling are commonly used to eliminate the overhead due to Computational Fluid Dynamics, leading to faster iterations. However, a primary drawback of these models ... |
2009.11898 | Anna Glazkova | Anna Glazkova, Yury Egorov, Maksim Glazkov | A Comparative Study of Feature Types for Age-Based Text Classification | Accepted to AIST-2020 (The 9th International Conference on Analysis
of Images, Social Networks and Texts) | Analysis of Images, Social Networks and Texts. AIST 2020. Lecture
Notes in Computer Science, vol 12602, pp. 120-134. Springer, Cham | 10.1007/978-3-030-72610-2_9 | null | cs.CL cs.IR cs.LG | http://creativecommons.org/licenses/by/4.0/ | The ability to automatically determine the age audience of a novel provides
many opportunities for the development of information retrieval tools. Firstly,
developers of book recommendation systems and electronic libraries may be
interested in filtering texts by the age of the most likely readers. Further,
parents ma... | [
{
"created": "Thu, 24 Sep 2020 18:41:10 GMT",
"version": "v1"
}
] | 2021-08-30 | [
[
"Glazkova",
"Anna",
""
],
[
"Egorov",
"Yury",
""
],
[
"Glazkov",
"Maksim",
""
]
] | The ability to automatically determine the age audience of a novel provides many opportunities for the development of information retrieval tools. Firstly, developers of book recommendation systems and electronic libraries may be interested in filtering texts by the age of the most likely readers. Further, parents may ... |
2206.03826 | Jiachun Pan | Jiachun Pan, Pan Zhou, Shuicheng Yan | Towards Understanding Why Mask-Reconstruction Pretraining Helps in
Downstream Tasks | null | null | null | null | cs.LG cs.CV cs.NE stat.ML | http://creativecommons.org/licenses/by/4.0/ | For unsupervised pretraining, mask-reconstruction pretraining (MRP)
approaches, e.g. MAE and data2vec, randomly mask input patches and then
reconstruct the pixels or semantic features of these masked patches via an
auto-encoder. Then for a downstream task, supervised fine-tuning the pretrained
encoder remarkably surp... | [
{
"created": "Wed, 8 Jun 2022 11:49:26 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Jun 2022 01:46:19 GMT",
"version": "v2"
},
{
"created": "Fri, 10 Jun 2022 00:37:44 GMT",
"version": "v3"
},
{
"created": "Tue, 14 Jun 2022 14:06:48 GMT",
"version": "v4"
},
{
"cre... | 2023-02-14 | [
[
"Pan",
"Jiachun",
""
],
[
"Zhou",
"Pan",
""
],
[
"Yan",
"Shuicheng",
""
]
] | For unsupervised pretraining, mask-reconstruction pretraining (MRP) approaches, e.g. MAE and data2vec, randomly mask input patches and then reconstruct the pixels or semantic features of these masked patches via an auto-encoder. Then for a downstream task, supervised fine-tuning the pretrained encoder remarkably surpas... |
2404.03819 | Yirui Wang | Qinji Yu, Yirui Wang, Ke Yan, Haoshen Li, Dazhou Guo, Li Zhang, Le Lu,
Na Shen, Qifeng Wang, Xiaowei Ding, Xianghua Ye, Dakai Jin | Effective Lymph Nodes Detection in CT Scans Using Location Debiased
Query Selection and Contrastive Query Representation in Transformer | Technical report | null | null | null | cs.CV | http://creativecommons.org/licenses/by-sa/4.0/ | Lymph node (LN) assessment is a critical, indispensable yet very challenging
task in the routine clinical workflow of radiology and oncology. Accurate LN
analysis is essential for cancer diagnosis, staging, and treatment planning.
Finding scatteredly distributed, low-contrast clinically relevant LNs in 3D CT
is diffi... | [
{
"created": "Thu, 4 Apr 2024 22:31:15 GMT",
"version": "v1"
}
] | 2024-04-08 | [
[
"Yu",
"Qinji",
""
],
[
"Wang",
"Yirui",
""
],
[
"Yan",
"Ke",
""
],
[
"Li",
"Haoshen",
""
],
[
"Guo",
"Dazhou",
""
],
[
"Zhang",
"Li",
""
],
[
"Lu",
"Le",
""
],
[
"Shen",
"Na",
""
],
[
... | Lymph node (LN) assessment is a critical, indispensable yet very challenging task in the routine clinical workflow of radiology and oncology. Accurate LN analysis is essential for cancer diagnosis, staging, and treatment planning. Finding scatteredly distributed, low-contrast clinically relevant LNs in 3D CT is difficu... |
2403.00520 | Nolwenn Bernard | Nolwenn Bernard and Ivica Kostric and Krisztian Balog | IAI MovieBot 2.0: An Enhanced Research Platform with Trainable Neural
Components and Transparent User Modeling | Proceedings of the 17th ACM International Conference on Web Search
and Data Mining (WSDM '24), March 4--8, 2024, Merida, Mexico | null | 10.1145/3616855.3635699 | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While interest in conversational recommender systems has been on the rise,
operational systems suitable for serving as research platforms for
comprehensive studies are currently lacking. This paper introduces an enhanced
version of the IAI MovieBot conversational movie recommender system, aiming to
evolve it into a r... | [
{
"created": "Fri, 1 Mar 2024 13:30:34 GMT",
"version": "v1"
}
] | 2024-03-04 | [
[
"Bernard",
"Nolwenn",
""
],
[
"Kostric",
"Ivica",
""
],
[
"Balog",
"Krisztian",
""
]
] | While interest in conversational recommender systems has been on the rise, operational systems suitable for serving as research platforms for comprehensive studies are currently lacking. This paper introduces an enhanced version of the IAI MovieBot conversational movie recommender system, aiming to evolve it into a rob... |
1902.02439 | Paola Quaglia | Paola Quaglia | Walking on SR-automata to detect grammar ambiguity | null | null | null | null | cs.FL | http://creativecommons.org/licenses/by/4.0/ | We exploit the nondeterminism of LR parsing tables to reason about grammar
ambiguity after a conflict-driven strategy. First, from parsing tables we
define specialized structures, called SR-automata. Next, we search for
ambiguous words along the paths of SR-automata that reach a conflict state and
then diverge along ... | [
{
"created": "Thu, 7 Feb 2019 00:22:10 GMT",
"version": "v1"
}
] | 2019-02-08 | [
[
"Quaglia",
"Paola",
""
]
] | We exploit the nondeterminism of LR parsing tables to reason about grammar ambiguity after a conflict-driven strategy. First, from parsing tables we define specialized structures, called SR-automata. Next, we search for ambiguous words along the paths of SR-automata that reach a conflict state and then diverge along th... |
1702.08396 | Shengjia Zhao | Shengjia Zhao, Jiaming Song, Stefano Ermon | Learning Hierarchical Features from Generative Models | ICML'2017 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks have been shown to be very successful at learning
feature hierarchies in supervised learning tasks. Generative models, on the
other hand, have benefited less from hierarchical models with multiple layers
of latent variables. In this paper, we prove that hierarchical latent variable
models do not ... | [
{
"created": "Mon, 27 Feb 2017 17:43:34 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Jun 2017 17:19:15 GMT",
"version": "v2"
}
] | 2017-06-12 | [
[
"Zhao",
"Shengjia",
""
],
[
"Song",
"Jiaming",
""
],
[
"Ermon",
"Stefano",
""
]
] | Deep neural networks have been shown to be very successful at learning feature hierarchies in supervised learning tasks. Generative models, on the other hand, have benefited less from hierarchical models with multiple layers of latent variables. In this paper, we prove that hierarchical latent variable models do not ta... |
1912.12394 | Da Ju | Da Ju, Kurt Shuster, Y-Lan Boureau, Jason Weston | All-in-One Image-Grounded Conversational Agents | null | null | null | null | cs.CL cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As single-task accuracy on individual language and image tasks has improved
substantially in the last few years, the long-term goal of a generally skilled
agent that can both see and talk becomes more feasible to explore. In this
work, we focus on leveraging individual language and image tasks, along with
resources t... | [
{
"created": "Sat, 28 Dec 2019 03:51:52 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Jan 2020 23:10:55 GMT",
"version": "v2"
}
] | 2020-01-17 | [
[
"Ju",
"Da",
""
],
[
"Shuster",
"Kurt",
""
],
[
"Boureau",
"Y-Lan",
""
],
[
"Weston",
"Jason",
""
]
] | As single-task accuracy on individual language and image tasks has improved substantially in the last few years, the long-term goal of a generally skilled agent that can both see and talk becomes more feasible to explore. In this work, we focus on leveraging individual language and image tasks, along with resources tha... |
2402.00575 | Ruisheng Gao | Ruisheng Gao, Yutong Liu, Zeyu Xiao, Zhiwei Xiong | Diffusion-based Light Field Synthesis | 11 pages,9 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Light fields (LFs), conducive to comprehensive scene radiance recorded across
angular dimensions, find wide applications in 3D reconstruction, virtual
reality, and computational photography.However, the LF acquisition is
inevitably time-consuming and resource-intensive due to the mainstream
acquisition strategy invol... | [
{
"created": "Thu, 1 Feb 2024 13:13:16 GMT",
"version": "v1"
}
] | 2024-02-02 | [
[
"Gao",
"Ruisheng",
""
],
[
"Liu",
"Yutong",
""
],
[
"Xiao",
"Zeyu",
""
],
[
"Xiong",
"Zhiwei",
""
]
] | Light fields (LFs), conducive to comprehensive scene radiance recorded across angular dimensions, find wide applications in 3D reconstruction, virtual reality, and computational photography.However, the LF acquisition is inevitably time-consuming and resource-intensive due to the mainstream acquisition strategy involvi... |
2106.13469 | Mathieu Andro | Mathieu Andro (DSAF, SPM), Marc Maisonneuve | Digital libraries: textual analysis for a systematic review and
meta-analysis | null | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Purpose: We seek to explore the realm of literature about digital libraries.
We specifically seek to ascertain how interest in this subject has evolved, its
impact, the most productive journals and countries, the number of occurrences
of digital libraries, the relationships and dynamics of the main concepts
mentioned... | [
{
"created": "Fri, 25 Jun 2021 07:33:09 GMT",
"version": "v1"
}
] | 2021-06-28 | [
[
"Andro",
"Mathieu",
"",
"DSAF, SPM"
],
[
"Maisonneuve",
"Marc",
""
]
] | Purpose: We seek to explore the realm of literature about digital libraries. We specifically seek to ascertain how interest in this subject has evolved, its impact, the most productive journals and countries, the number of occurrences of digital libraries, the relationships and dynamics of the main concepts mentioned, ... |
2312.01509 | Vithya Yogarajan | Vithya Yogarajan, Gillian Dobbie, Te Taka Keegan, Rostam J. Neuwirth | Tackling Bias in Pre-trained Language Models: Current Trends and
Under-represented Societies | 38 pages, 5 figures, 11 tables. arXiv admin note: text overlap with
arXiv:2309.00770 by other authors | null | null | null | cs.CY cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | The benefits and capabilities of pre-trained language models (LLMs) in
current and future innovations are vital to any society. However, introducing
and using LLMs comes with biases and discrimination, resulting in concerns
about equality, diversity and fairness, and must be addressed. While
understanding and acknowl... | [
{
"created": "Sun, 3 Dec 2023 21:25:10 GMT",
"version": "v1"
}
] | 2023-12-05 | [
[
"Yogarajan",
"Vithya",
""
],
[
"Dobbie",
"Gillian",
""
],
[
"Keegan",
"Te Taka",
""
],
[
"Neuwirth",
"Rostam J.",
""
]
] | The benefits and capabilities of pre-trained language models (LLMs) in current and future innovations are vital to any society. However, introducing and using LLMs comes with biases and discrimination, resulting in concerns about equality, diversity and fairness, and must be addressed. While understanding and acknowled... |
1701.08530 | Anshu Shukla | Anshu Shukla, Shilpa Chaturvedi and Yogesh Simmhan | RIoTBench: A Real-time IoT Benchmark for Distributed Stream Processing
Platforms | 33 pages. arXiv admin note: substantial text overlap with
arXiv:1606.07621 | Concurrency and Computation: Practice and Experience, Volume 29,
Issue 21, 10 November 2017 | 10.1002/cpe.4257 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Internet of Things (IoT) is an emerging technology paradigm where
millions of sensors and actuators help monitor and manage, physical,
environmental and human systems in real-time. The inherent closedloop
responsiveness and decision making of IoT applications make them ideal
candidates for using low latency and s... | [
{
"created": "Mon, 30 Jan 2017 10:13:29 GMT",
"version": "v1"
}
] | 2019-05-10 | [
[
"Shukla",
"Anshu",
""
],
[
"Chaturvedi",
"Shilpa",
""
],
[
"Simmhan",
"Yogesh",
""
]
] | The Internet of Things (IoT) is an emerging technology paradigm where millions of sensors and actuators help monitor and manage, physical, environmental and human systems in real-time. The inherent closedloop responsiveness and decision making of IoT applications make them ideal candidates for using low latency and sca... |
1904.12966 | Nicholas Turner | Kisuk Lee, Nicholas Turner, Thomas Macrina, Jingpeng Wu, Ran Lu, H.
Sebastian Seung | Convolutional nets for reconstructing neural circuits from brain images
acquired by serial section electron microscopy | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural circuits can be reconstructed from brain images acquired by serial
section electron microscopy. Image analysis has been performed by manual labor
for half a century, and efforts at automation date back almost as far.
Convolutional nets were first applied to neuronal boundary detection a dozen
years ago, and ha... | [
{
"created": "Mon, 29 Apr 2019 21:54:58 GMT",
"version": "v1"
}
] | 2019-05-01 | [
[
"Lee",
"Kisuk",
""
],
[
"Turner",
"Nicholas",
""
],
[
"Macrina",
"Thomas",
""
],
[
"Wu",
"Jingpeng",
""
],
[
"Lu",
"Ran",
""
],
[
"Seung",
"H. Sebastian",
""
]
] | Neural circuits can be reconstructed from brain images acquired by serial section electron microscopy. Image analysis has been performed by manual labor for half a century, and efforts at automation date back almost as far. Convolutional nets were first applied to neuronal boundary detection a dozen years ago, and have... |
2104.02886 | Arian Nadjimzadah | Arian Nadjimzadah, David E. Narv\'aez | On Salum's Algorithm for $\mathrm{X3SAT}$ | 7 pages | null | null | null | cs.CC | http://creativecommons.org/licenses/by/4.0/ | This is a commentary on, and critique of, Latif Salum's paper titled
"Tractability of One-in-three $\mathrm{3SAT}$: $\mathrm{P} = \mathrm{NP}$."
Salum purports to give a polynomial-time algorithm that solves the
$\mathrm{NP}$-complete problem $\mathrm{X3SAT}$, thereby claiming $\mathrm{P} =
\mathrm{NP}$. The algorith... | [
{
"created": "Wed, 7 Apr 2021 03:23:38 GMT",
"version": "v1"
}
] | 2021-04-08 | [
[
"Nadjimzadah",
"Arian",
""
],
[
"Narváez",
"David E.",
""
]
] | This is a commentary on, and critique of, Latif Salum's paper titled "Tractability of One-in-three $\mathrm{3SAT}$: $\mathrm{P} = \mathrm{NP}$." Salum purports to give a polynomial-time algorithm that solves the $\mathrm{NP}$-complete problem $\mathrm{X3SAT}$, thereby claiming $\mathrm{P} = \mathrm{NP}$. The algorithm,... |
2310.14751 | Subhojyoti Mukherjee | Subhojyoti Mukherjee, Ruihao Zhu, Branislav Kveton | Efficient and Interpretable Bandit Algorithms | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Motivated by the importance of explainability in modern machine learning, we
design bandit algorithms that are efficient and interpretable. A bandit
algorithm is interpretable if it explores with the objective of reducing
uncertainty in the unknown model parameter. To quantify the interpretability,
we introduce a nov... | [
{
"created": "Mon, 23 Oct 2023 09:36:13 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Feb 2024 22:37:36 GMT",
"version": "v2"
}
] | 2024-02-12 | [
[
"Mukherjee",
"Subhojyoti",
""
],
[
"Zhu",
"Ruihao",
""
],
[
"Kveton",
"Branislav",
""
]
] | Motivated by the importance of explainability in modern machine learning, we design bandit algorithms that are efficient and interpretable. A bandit algorithm is interpretable if it explores with the objective of reducing uncertainty in the unknown model parameter. To quantify the interpretability, we introduce a novel... |
2012.15462 | Dan Lin | Dan Lin, Jiajing Wu, Qi Yuan, Zibin Zheng | Modeling and Understanding Ethereum Transaction Records via a Complex
Network Approach | 5 pages, 6 figures. arXiv admin note: substantial text overlap with
arXiv:1905.08038 | IEEE Transactions on Circuits and Systems II: Express Briefs, vol.
67, no. 11, pp. 2737 - 2741, November 2020 | 10.1109/TCSII.2020.2968376 | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the largest public blockchain-based platform supporting smart contracts,
Ethereum has accumulated a large number of user transaction records since its
debut in 2014. Analysis of Ethereum transaction records, however, is still
relatively unexplored till now. Modeling the transaction records as a static
simple graph... | [
{
"created": "Thu, 31 Dec 2020 06:04:17 GMT",
"version": "v1"
}
] | 2021-01-01 | [
[
"Lin",
"Dan",
""
],
[
"Wu",
"Jiajing",
""
],
[
"Yuan",
"Qi",
""
],
[
"Zheng",
"Zibin",
""
]
] | As the largest public blockchain-based platform supporting smart contracts, Ethereum has accumulated a large number of user transaction records since its debut in 2014. Analysis of Ethereum transaction records, however, is still relatively unexplored till now. Modeling the transaction records as a static simple graph, ... |
1712.02864 | Hossein Talebi | Hossein Talebi, Peyman Milanfar | Learned Perceptual Image Enhancement | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning a typical image enhancement pipeline involves minimization of a loss
function between enhanced and reference images. While L1 and L2 losses are
perhaps the most widely used functions for this purpose, they do not
necessarily lead to perceptually compelling results. In this paper, we show
that adding a learne... | [
{
"created": "Thu, 7 Dec 2017 21:23:12 GMT",
"version": "v1"
}
] | 2017-12-11 | [
[
"Talebi",
"Hossein",
""
],
[
"Milanfar",
"Peyman",
""
]
] | Learning a typical image enhancement pipeline involves minimization of a loss function between enhanced and reference images. While L1 and L2 losses are perhaps the most widely used functions for this purpose, they do not necessarily lead to perceptually compelling results. In this paper, we show that adding a learned ... |
2009.00771 | Xuerui Zhang | Zhang Xuerui, Yuan Xia | LSMVOS: Long-Short-Term Similarity Matching for Video Object | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Objective Semi-supervised video object segmentation refers to segmenting the
object in subsequent frames given the object label in the first frame. Existing
algorithms are mostly based on the objectives of matching and propagation
strategies, which often make use of the previous frame with masking or optical
flow. Th... | [
{
"created": "Wed, 2 Sep 2020 01:32:05 GMT",
"version": "v1"
}
] | 2020-09-03 | [
[
"Xuerui",
"Zhang",
""
],
[
"Xia",
"Yuan",
""
]
] | Objective Semi-supervised video object segmentation refers to segmenting the object in subsequent frames given the object label in the first frame. Existing algorithms are mostly based on the objectives of matching and propagation strategies, which often make use of the previous frame with masking or optical flow. This... |
2110.11417 | Souvik Kundu | Souvik Kundu, Massoud Pedram, Peter A. Beerel | HIRE-SNN: Harnessing the Inherent Robustness of Energy-Efficient Deep
Spiking Neural Networks by Training with Crafted Input Noise | 10 pages, 11 figures, 7 tables, International Conference on Computer
Vision | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Low-latency deep spiking neural networks (SNNs) have become a promising
alternative to conventional artificial neural networks (ANNs) because of their
potential for increased energy efficiency on event-driven neuromorphic
hardware. Neural networks, including SNNs, however, are subject to various
adversarial attacks a... | [
{
"created": "Wed, 6 Oct 2021 16:48:48 GMT",
"version": "v1"
}
] | 2021-10-25 | [
[
"Kundu",
"Souvik",
""
],
[
"Pedram",
"Massoud",
""
],
[
"Beerel",
"Peter A.",
""
]
] | Low-latency deep spiking neural networks (SNNs) have become a promising alternative to conventional artificial neural networks (ANNs) because of their potential for increased energy efficiency on event-driven neuromorphic hardware. Neural networks, including SNNs, however, are subject to various adversarial attacks and... |
1507.08417 | Gabriele D'Angelo | Gabriele D'Angelo, Stefano Ferretti | Highly intensive data dissemination in complex networks | null | Journal of Parallel and Distributed Computing, Elsevier, vol. 99
(January 2017). ISSN: 0743-7315 | 10.1016/j.jpdc.2016.08.004 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a study on data dissemination in unstructured
Peer-to-Peer (P2P) network overlays. The absence of a structure in unstructured
overlays eases the network management, at the cost of non-optimal mechanisms to
spread messages in the network. Thus, dissemination schemes must be employed
that allow cove... | [
{
"created": "Thu, 30 Jul 2015 08:40:44 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Aug 2016 14:30:04 GMT",
"version": "v2"
},
{
"created": "Mon, 26 Sep 2016 09:51:58 GMT",
"version": "v3"
}
] | 2016-09-27 | [
[
"D'Angelo",
"Gabriele",
""
],
[
"Ferretti",
"Stefano",
""
]
] | This paper presents a study on data dissemination in unstructured Peer-to-Peer (P2P) network overlays. The absence of a structure in unstructured overlays eases the network management, at the cost of non-optimal mechanisms to spread messages in the network. Thus, dissemination schemes must be employed that allow coveri... |
2112.13399 | Mason DiCicco | Mason DiCicco, Daniel Reichman | The Learning and Communication Complexity of Subsequence Containment | Updated to add learning results | null | null | null | cs.DM cs.DS | http://creativecommons.org/licenses/by/4.0/ | We consider the learning and communication complexity of subsequence
containment. In the learning problem, we seek to learn a classifier that
positively labels a binary string $x$ if it contains a fixed binary string $y$
as a subsequence. In the communication problem, $x$ and $y$ are partitioned
between two players, ... | [
{
"created": "Sun, 26 Dec 2021 15:42:29 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Dec 2021 17:21:04 GMT",
"version": "v2"
},
{
"created": "Mon, 3 Jan 2022 20:21:17 GMT",
"version": "v3"
},
{
"created": "Tue, 11 Jan 2022 18:08:42 GMT",
"version": "v4"
},
{
"cr... | 2023-01-23 | [
[
"DiCicco",
"Mason",
""
],
[
"Reichman",
"Daniel",
""
]
] | We consider the learning and communication complexity of subsequence containment. In the learning problem, we seek to learn a classifier that positively labels a binary string $x$ if it contains a fixed binary string $y$ as a subsequence. In the communication problem, $x$ and $y$ are partitioned between two players, Al... |
2407.16322 | Taehyun Yang | Taehyun Yang, Hyeon Jeon, Jinwook Seo | Offsetting Perceptual Bias in Visual Clustering: The Role of Point Size
Adjustment in Variable Display Sizes | work in progress | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Scatterplots are frequently shared across different displays in collaborative
and communicative visual analytics. However, variations in displays diversify
scatterplot sizes. Such variations can influence the perception of clustering
patterns, introducing potential biases leading to misinterpretations in cluster
anal... | [
{
"created": "Tue, 23 Jul 2024 09:17:15 GMT",
"version": "v1"
}
] | 2024-07-24 | [
[
"Yang",
"Taehyun",
""
],
[
"Jeon",
"Hyeon",
""
],
[
"Seo",
"Jinwook",
""
]
] | Scatterplots are frequently shared across different displays in collaborative and communicative visual analytics. However, variations in displays diversify scatterplot sizes. Such variations can influence the perception of clustering patterns, introducing potential biases leading to misinterpretations in cluster analys... |
1903.04739 | Hsu Myat Mo | Hsu Myat Mo and Khin Mar Soe | Syllable-based Neural Named Entity Recognition for Myanmar Language | Myanmar NER | International Journal on Natural Language Computing (IJNLC) Vol.8,
No.1, February 2019 | 10.5121/ijnlc.2019.8101 | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Named Entity Recognition (NER) for Myanmar Language is essential to Myanmar
natural language processing research work. In this work, NER for Myanmar
language is treated as a sequence tagging problem and the effectiveness of deep
neural networks on NER for Myanmar language has been investigated. Experiments
are perfor... | [
{
"created": "Tue, 12 Mar 2019 05:52:41 GMT",
"version": "v1"
}
] | 2019-03-13 | [
[
"Mo",
"Hsu Myat",
""
],
[
"Soe",
"Khin Mar",
""
]
] | Named Entity Recognition (NER) for Myanmar Language is essential to Myanmar natural language processing research work. In this work, NER for Myanmar language is treated as a sequence tagging problem and the effectiveness of deep neural networks on NER for Myanmar language has been investigated. Experiments are performe... |
2311.15732 | Wenhao Wu | Wenhao Wu, Huanjin Yao, Mengxi Zhang, Yuxin Song, Wanli Ouyang,
Jingdong Wang | GPT4Vis: What Can GPT-4 Do for Zero-shot Visual Recognition? | Technical report. Retest GPT-4V and update results | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper does not present a novel method. Instead, it delves into an
essential, yet must-know baseline in light of the latest advancements in
Generative Artificial Intelligence (GenAI): the utilization of GPT-4 for visual
understanding. Our study centers on the evaluation of GPT-4's linguistic and
visual capabiliti... | [
{
"created": "Mon, 27 Nov 2023 11:29:10 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Mar 2024 01:07:14 GMT",
"version": "v2"
}
] | 2024-03-13 | [
[
"Wu",
"Wenhao",
""
],
[
"Yao",
"Huanjin",
""
],
[
"Zhang",
"Mengxi",
""
],
[
"Song",
"Yuxin",
""
],
[
"Ouyang",
"Wanli",
""
],
[
"Wang",
"Jingdong",
""
]
] | This paper does not present a novel method. Instead, it delves into an essential, yet must-know baseline in light of the latest advancements in Generative Artificial Intelligence (GenAI): the utilization of GPT-4 for visual understanding. Our study centers on the evaluation of GPT-4's linguistic and visual capabilities... |
2406.06886 | Daniel Lindner | Daniel Lindner, Daniel Ritter, and Felix Naumann | Enabling Data Dependency-based Query Optimization | null | null | null | null | cs.DB | http://creativecommons.org/licenses/by/4.0/ | Data dependency-based query optimization techniques can considerably improve
database system performance: we apply three such optimization techniques to
five database management systems (DBMSs) and observe throughput improvements
between 5 % and 33 %. We address two key challenges to achieve these results:
(i) effici... | [
{
"created": "Tue, 11 Jun 2024 01:52:04 GMT",
"version": "v1"
}
] | 2024-06-12 | [
[
"Lindner",
"Daniel",
""
],
[
"Ritter",
"Daniel",
""
],
[
"Naumann",
"Felix",
""
]
] | Data dependency-based query optimization techniques can considerably improve database system performance: we apply three such optimization techniques to five database management systems (DBMSs) and observe throughput improvements between 5 % and 33 %. We address two key challenges to achieve these results: (i) efficien... |
2105.09705 | Mohammadjavad Salehi | Hamidreza Bakhshzad Mahmoodi, Bikshapathi Gouda, MohammadJavad Salehi
and Antti Tolli | Low-complexity Multicast Beamforming for Multi-stream Multi-group
Communications | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, assuming multi-antenna transmitter and receivers, we consider
multicast beamformer design for the weighted max-min-fairness (WMMF) problem in
a multi-stream multi-group communication setup. Unlike the single-stream
scenario, the WMMF objective in this setup is not equivalent to maximizing the
minimum w... | [
{
"created": "Thu, 20 May 2021 12:36:08 GMT",
"version": "v1"
}
] | 2021-05-21 | [
[
"Mahmoodi",
"Hamidreza Bakhshzad",
""
],
[
"Gouda",
"Bikshapathi",
""
],
[
"Salehi",
"MohammadJavad",
""
],
[
"Tolli",
"Antti",
""
]
] | In this paper, assuming multi-antenna transmitter and receivers, we consider multicast beamformer design for the weighted max-min-fairness (WMMF) problem in a multi-stream multi-group communication setup. Unlike the single-stream scenario, the WMMF objective in this setup is not equivalent to maximizing the minimum wei... |
1710.02765 | Ngoc Hieu Tran | Ngoc Hieu Tran, Zachariah Levine, Lei Xin, Baozhen Shan, Ming Li | Protein identification with deep learning: from abc to xyz | null | null | null | null | cs.CE cs.LG q-bio.BM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Proteins are the main workhorses of biological functions in a cell, a tissue,
or an organism. Identification and quantification of proteins in a given
sample, e.g. a cell type under normal/disease conditions, are fundamental tasks
for the understanding of human health and disease. In this paper, we present
DeepNovo, ... | [
{
"created": "Sun, 8 Oct 2017 01:23:18 GMT",
"version": "v1"
}
] | 2017-10-10 | [
[
"Tran",
"Ngoc Hieu",
""
],
[
"Levine",
"Zachariah",
""
],
[
"Xin",
"Lei",
""
],
[
"Shan",
"Baozhen",
""
],
[
"Li",
"Ming",
""
]
] | Proteins are the main workhorses of biological functions in a cell, a tissue, or an organism. Identification and quantification of proteins in a given sample, e.g. a cell type under normal/disease conditions, are fundamental tasks for the understanding of human health and disease. In this paper, we present DeepNovo, a ... |
1911.06352 | Jingjing Pan | Jingjing Pan, Yash Goyal, Stefan Lee | Question-Conditioned Counterfactual Image Generation for VQA | Accepted by the VQA Workshop at CVPR 2019 | null | null | null | cs.CV cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While Visual Question Answering (VQA) models continue to push the
state-of-the-art forward, they largely remain black-boxes - failing to provide
insight into how or why an answer is generated. In this ongoing work, we
propose addressing this shortcoming by learning to generate counterfactual
images for a VQA model - ... | [
{
"created": "Thu, 14 Nov 2019 19:37:33 GMT",
"version": "v1"
}
] | 2019-11-18 | [
[
"Pan",
"Jingjing",
""
],
[
"Goyal",
"Yash",
""
],
[
"Lee",
"Stefan",
""
]
] | While Visual Question Answering (VQA) models continue to push the state-of-the-art forward, they largely remain black-boxes - failing to provide insight into how or why an answer is generated. In this ongoing work, we propose addressing this shortcoming by learning to generate counterfactual images for a VQA model - i.... |
1308.1780 | Jonathan Heras | J\'onathan Heras, Ekaterina Komendantskaya, Moa Johansson and Ewen
Maclean | Proof-Pattern Recognition and Lemma Discovery in ACL2 | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a novel technique for combining statistical machine learning for
proof-pattern recognition with symbolic methods for lemma discovery. The
resulting tool, ACL2(ml), gathers proof statistics and uses statistical
pattern-recognition to pre-processes data from libraries, and then suggests
auxiliary lemmas in n... | [
{
"created": "Thu, 8 Aug 2013 08:17:46 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Oct 2013 15:35:32 GMT",
"version": "v2"
}
] | 2013-10-16 | [
[
"Heras",
"Jónathan",
""
],
[
"Komendantskaya",
"Ekaterina",
""
],
[
"Johansson",
"Moa",
""
],
[
"Maclean",
"Ewen",
""
]
] | We present a novel technique for combining statistical machine learning for proof-pattern recognition with symbolic methods for lemma discovery. The resulting tool, ACL2(ml), gathers proof statistics and uses statistical pattern-recognition to pre-processes data from libraries, and then suggests auxiliary lemmas in new... |
1812.10457 | Jinyuan Chen | Jinyuan Chen and Chunhua Geng | Optimal Secure GDoF of Symmetric Gaussian Wiretap Channel with a Helper | This work was presented in part at the 2019 IEEE International
Symposium on Information Theory | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study a symmetric Gaussian wiretap channel with a helper, where a
confidential message is sent from a transmitter to a legitimate receiver, in
the presence of a helper and an eavesdropper, under a weak notion of secrecy
constraint. For this setting, we characterize the optimal secure generalized
degrees-of-freedom... | [
{
"created": "Wed, 26 Dec 2018 18:46:25 GMT",
"version": "v1"
},
{
"created": "Wed, 11 Sep 2019 17:32:25 GMT",
"version": "v2"
}
] | 2019-09-12 | [
[
"Chen",
"Jinyuan",
""
],
[
"Geng",
"Chunhua",
""
]
] | We study a symmetric Gaussian wiretap channel with a helper, where a confidential message is sent from a transmitter to a legitimate receiver, in the presence of a helper and an eavesdropper, under a weak notion of secrecy constraint. For this setting, we characterize the optimal secure generalized degrees-of-freedom (... |
2308.12069 | Zengjie Zhang Dr. | Ni Dang, Tao Shi, Zengjie Zhang, Wanxin Jin, Marion Leibold, and
Martin Buss | Identifying Reaction-Aware Driving Styles of Stochastic Model Predictive
Controlled Vehicles by Inverse Reinforcement Learning | null | null | null | null | cs.RO cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The driving style of an Autonomous Vehicle (AV) refers to how it behaves and
interacts with other AVs. In a multi-vehicle autonomous driving system, an AV
capable of identifying the driving styles of its nearby AVs can reliably
evaluate the risk of collisions and make more reasonable driving decisions.
However, there... | [
{
"created": "Wed, 23 Aug 2023 11:31:50 GMT",
"version": "v1"
}
] | 2023-08-24 | [
[
"Dang",
"Ni",
""
],
[
"Shi",
"Tao",
""
],
[
"Zhang",
"Zengjie",
""
],
[
"Jin",
"Wanxin",
""
],
[
"Leibold",
"Marion",
""
],
[
"Buss",
"Martin",
""
]
] | The driving style of an Autonomous Vehicle (AV) refers to how it behaves and interacts with other AVs. In a multi-vehicle autonomous driving system, an AV capable of identifying the driving styles of its nearby AVs can reliably evaluate the risk of collisions and make more reasonable driving decisions. However, there h... |
1607.04347 | Higor Amario de Souza | Higor A. de Souza, Marcos L. Chaim, Fabio Kon | Spectrum-based Software Fault Localization: A Survey of Techniques,
Advances, and Challenges | Submitted to Software Testing, Verification and Reliability | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite being one of the most basic tasks in software development, debugging
is still performed in a mostly manual way, leading to high cost and low
performance. To address this problem, researchers have studied promising
approaches, such as Spectrum-based Fault Localization (SFL) techniques, which
pinpoint program e... | [
{
"created": "Fri, 15 Jul 2016 00:20:37 GMT",
"version": "v1"
},
{
"created": "Sun, 26 Nov 2017 17:43:49 GMT",
"version": "v2"
}
] | 2017-11-28 | [
[
"de Souza",
"Higor A.",
""
],
[
"Chaim",
"Marcos L.",
""
],
[
"Kon",
"Fabio",
""
]
] | Despite being one of the most basic tasks in software development, debugging is still performed in a mostly manual way, leading to high cost and low performance. To address this problem, researchers have studied promising approaches, such as Spectrum-based Fault Localization (SFL) techniques, which pinpoint program ele... |
2002.10111 | Zechen Liu | Zechen Liu, Zizhang Wu, Roland T\'oth | SMOKE: Single-Stage Monocular 3D Object Detection via Keypoint
Estimation | 8 pages, 6 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Estimating 3D orientation and translation of objects is essential for
infrastructure-less autonomous navigation and driving. In case of monocular
vision, successful methods have been mainly based on two ingredients: (i) a
network generating 2D region proposals, (ii) a R-CNN structure predicting 3D
object pose by util... | [
{
"created": "Mon, 24 Feb 2020 08:15:36 GMT",
"version": "v1"
}
] | 2020-02-25 | [
[
"Liu",
"Zechen",
""
],
[
"Wu",
"Zizhang",
""
],
[
"Tóth",
"Roland",
""
]
] | Estimating 3D orientation and translation of objects is essential for infrastructure-less autonomous navigation and driving. In case of monocular vision, successful methods have been mainly based on two ingredients: (i) a network generating 2D region proposals, (ii) a R-CNN structure predicting 3D object pose by utiliz... |
2208.14841 | Marcin Pilipczuk | Eun Jung Kim, Tom\'a\v{s} Masa\v{r}\'ik, Marcin Pilipczuk, Roohani
Sharma, Magnus Wahlstr\"om | On weighted graph separation problems and flow-augmentation | 17 pages, 1 figure | SIAM Journal on Discrete Mathematics 38(1), 170-189, 2024 | 10.1137/22M153118X | null | cs.DS cs.CC | http://creativecommons.org/licenses/by/4.0/ | One of the first application of the recently introduced technique of
\emph{flow-augmentation} [Kim et al., STOC 2022] is a fixed-parameter algorithm
for the weighted version of \textsc{Directed Feedback Vertex Set}, a landmark
problem in parameterized complexity. In this note we explore applicability of
flow-augmenta... | [
{
"created": "Wed, 31 Aug 2022 13:17:07 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Sep 2022 11:48:59 GMT",
"version": "v2"
}
] | 2024-01-11 | [
[
"Kim",
"Eun Jung",
""
],
[
"Masařík",
"Tomáš",
""
],
[
"Pilipczuk",
"Marcin",
""
],
[
"Sharma",
"Roohani",
""
],
[
"Wahlström",
"Magnus",
""
]
] | One of the first application of the recently introduced technique of \emph{flow-augmentation} [Kim et al., STOC 2022] is a fixed-parameter algorithm for the weighted version of \textsc{Directed Feedback Vertex Set}, a landmark problem in parameterized complexity. In this note we explore applicability of flow-augmentati... |
1501.02876 | Yi Shan | Ren Wu, Shengen Yan, Yi Shan, Qingqing Dang, Gang Sun | Deep Image: Scaling up Image Recognition | This paper has been withdrawn by the authors due to a mistake related
to ImageNet server submissions | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a state-of-the-art image recognition system, Deep Image, developed
using end-to-end deep learning. The key components are a custom-built
supercomputer dedicated to deep learning, a highly optimized parallel algorithm
using new strategies for data partitioning and communication, larger deep
neural network m... | [
{
"created": "Tue, 13 Jan 2015 03:42:24 GMT",
"version": "v1"
},
{
"created": "Fri, 6 Feb 2015 10:12:14 GMT",
"version": "v2"
},
{
"created": "Mon, 11 May 2015 17:36:20 GMT",
"version": "v3"
},
{
"created": "Mon, 1 Jun 2015 19:44:49 GMT",
"version": "v4"
},
{
"cre... | 2015-07-07 | [
[
"Wu",
"Ren",
""
],
[
"Yan",
"Shengen",
""
],
[
"Shan",
"Yi",
""
],
[
"Dang",
"Qingqing",
""
],
[
"Sun",
"Gang",
""
]
] | We present a state-of-the-art image recognition system, Deep Image, developed using end-to-end deep learning. The key components are a custom-built supercomputer dedicated to deep learning, a highly optimized parallel algorithm using new strategies for data partitioning and communication, larger deep neural network mod... |
2202.03418 | Yoonho Lee | Yoonho Lee, Huaxiu Yao, Chelsea Finn | Diversify and Disambiguate: Learning From Underspecified Data | ICLR 2023. Code is available at https://github.com/yoonholee/DivDis | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many datasets are underspecified: there exist multiple equally viable
solutions to a given task. Underspecification can be problematic for methods
that learn a single hypothesis because different functions that achieve low
training loss can focus on different predictive features and thus produce
widely varying predic... | [
{
"created": "Mon, 7 Feb 2022 18:59:06 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Jun 2022 01:41:58 GMT",
"version": "v2"
},
{
"created": "Tue, 21 Feb 2023 06:01:12 GMT",
"version": "v3"
}
] | 2023-02-22 | [
[
"Lee",
"Yoonho",
""
],
[
"Yao",
"Huaxiu",
""
],
[
"Finn",
"Chelsea",
""
]
] | Many datasets are underspecified: there exist multiple equally viable solutions to a given task. Underspecification can be problematic for methods that learn a single hypothesis because different functions that achieve low training loss can focus on different predictive features and thus produce widely varying predicti... |
1805.12051 | Saurabh Sawlani | Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani,
Junxing Wang | Graph Sparsification, Spectral Sketches, and Faster Resistance
Computation, via Short Cycle Decompositions | 80 pages | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop a framework for graph sparsification and sketching, based on a new
tool, short cycle decomposition -- a decomposition of an unweighted graph into
an edge-disjoint collection of short cycles, plus few extra edges. A simple
observation gives that every graph G on n vertices with m edges can be
decomposed in ... | [
{
"created": "Wed, 30 May 2018 16:14:18 GMT",
"version": "v1"
}
] | 2018-05-31 | [
[
"Chu",
"Timothy",
""
],
[
"Gao",
"Yu",
""
],
[
"Peng",
"Richard",
""
],
[
"Sachdeva",
"Sushant",
""
],
[
"Sawlani",
"Saurabh",
""
],
[
"Wang",
"Junxing",
""
]
] | We develop a framework for graph sparsification and sketching, based on a new tool, short cycle decomposition -- a decomposition of an unweighted graph into an edge-disjoint collection of short cycles, plus few extra edges. A simple observation gives that every graph G on n vertices with m edges can be decomposed in $O... |
2401.15508 | Yuliang Gu | Yuliang Gu, Sheng Cheng and Naira Hovakimyan | Proto-MPC: An Encoder-Prototype-Decoder Approach for Quadrotor Control
in Challenging Winds | null | null | null | null | cs.RO cs.LG cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | Quadrotors are increasingly used in the evolving field of aerial robotics for
their agility and mechanical simplicity. However, inherent uncertainties, such
as aerodynamic effects coupled with quadrotors' operation in dynamically
changing environments, pose significant challenges for traditional, nominal
model-based ... | [
{
"created": "Sat, 27 Jan 2024 21:32:04 GMT",
"version": "v1"
},
{
"created": "Tue, 21 May 2024 19:49:18 GMT",
"version": "v2"
}
] | 2024-05-24 | [
[
"Gu",
"Yuliang",
""
],
[
"Cheng",
"Sheng",
""
],
[
"Hovakimyan",
"Naira",
""
]
] | Quadrotors are increasingly used in the evolving field of aerial robotics for their agility and mechanical simplicity. However, inherent uncertainties, such as aerodynamic effects coupled with quadrotors' operation in dynamically changing environments, pose significant challenges for traditional, nominal model-based co... |
2310.09229 | Jongwook Woo Prof | Aishwarya Gupta, Rahul S. Bhogale, Priyanka Thota, Prathushkumar
Dathuri, Jongwook Woo | Insuring Smiles: Predicting routine dental coverage using Spark ML | 4 pages, 13 figures, 5 tables | null | null | null | cs.LG cs.DC | http://creativecommons.org/licenses/by/4.0/ | Finding suitable health insurance coverage can be challenging for individuals
and small enterprises in the USA. The Health Insurance Exchange Public Use
Files (Exchange PUFs) dataset provided by CMS offers valuable information on
health and dental policies [1]. In this paper, we leverage machine learning
algorithms t... | [
{
"created": "Fri, 13 Oct 2023 16:31:51 GMT",
"version": "v1"
}
] | 2023-10-16 | [
[
"Gupta",
"Aishwarya",
""
],
[
"Bhogale",
"Rahul S.",
""
],
[
"Thota",
"Priyanka",
""
],
[
"Dathuri",
"Prathushkumar",
""
],
[
"Woo",
"Jongwook",
""
]
] | Finding suitable health insurance coverage can be challenging for individuals and small enterprises in the USA. The Health Insurance Exchange Public Use Files (Exchange PUFs) dataset provided by CMS offers valuable information on health and dental policies [1]. In this paper, we leverage machine learning algorithms to ... |
2404.00524 | Yuxiao Liu | Yuxiao Liu, Zhe Li, Yebin Liu, Haoqian Wang | TexVocab: Texture Vocabulary-conditioned Human Avatars | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To adequately utilize the available image evidence in multi-view video-based
avatar modeling, we propose TexVocab, a novel avatar representation that
constructs a texture vocabulary and associates body poses with texture maps for
animation. Given multi-view RGB videos, our method initially back-projects all
the avail... | [
{
"created": "Sun, 31 Mar 2024 01:58:04 GMT",
"version": "v1"
}
] | 2024-04-02 | [
[
"Liu",
"Yuxiao",
""
],
[
"Li",
"Zhe",
""
],
[
"Liu",
"Yebin",
""
],
[
"Wang",
"Haoqian",
""
]
] | To adequately utilize the available image evidence in multi-view video-based avatar modeling, we propose TexVocab, a novel avatar representation that constructs a texture vocabulary and associates body poses with texture maps for animation. Given multi-view RGB videos, our method initially back-projects all the availab... |
1904.11052 | Benjamin Edwards | Benjamin Edwards, Jay Jacobs and Stephanie Forrest | Risky Business: Assessing Security with External Measurements | Updated data provider capitalization in text abstract | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Security practices in large organizations are notoriously difficult to
assess. The challenge only increases when organizations turn to third parties
to provide technology and business services, which typically require tight
network integration and sharing of confidential data, potentially increasing
the organization'... | [
{
"created": "Wed, 24 Apr 2019 20:18:59 GMT",
"version": "v1"
},
{
"created": "Fri, 17 May 2019 16:59:52 GMT",
"version": "v2"
},
{
"created": "Wed, 22 May 2019 13:53:52 GMT",
"version": "v3"
}
] | 2019-05-23 | [
[
"Edwards",
"Benjamin",
""
],
[
"Jacobs",
"Jay",
""
],
[
"Forrest",
"Stephanie",
""
]
] | Security practices in large organizations are notoriously difficult to assess. The challenge only increases when organizations turn to third parties to provide technology and business services, which typically require tight network integration and sharing of confidential data, potentially increasing the organization's ... |
1412.8528 | EPTCS | Frank Roumen (Inst. for Mathematics, Astrophysics and Particle Physics
(IMAPP), Radboud University Nijmegen) | Categorical characterizations of operator-valued measures | In Proceedings QPL 2013, arXiv:1412.7917 | EPTCS 171, 2014, pp. 132-144 | 10.4204/EPTCS.171.12 | null | cs.LO math.CT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The most general type of measurement in quantum physics is modeled by a
positive operator-valued measure (POVM). Mathematically, a POVM is a
generalization of a measure, whose values are not real numbers, but positive
operators on a Hilbert space. POVMs can equivalently be viewed as maps between
effect algebras or as... | [
{
"created": "Tue, 30 Dec 2014 01:43:49 GMT",
"version": "v1"
}
] | 2014-12-31 | [
[
"Roumen",
"Frank",
"",
"Inst. for Mathematics, Astrophysics and Particle Physics"
]
] | The most general type of measurement in quantum physics is modeled by a positive operator-valued measure (POVM). Mathematically, a POVM is a generalization of a measure, whose values are not real numbers, but positive operators on a Hilbert space. POVMs can equivalently be viewed as maps between effect algebras or as m... |
1703.07907 | Li Xiao | Li Xiao and Xiang-Gen Xia | Robust Polynomial Reconstruction via Chinese Remainder Theorem in the
Presence of Small Degree Residue Errors | 5 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Based on unique decoding of the polynomial residue code with non-pairwise
coprime moduli, a polynomial with degree less than that of the least common
multiple (lcm) of all the moduli can be accurately reconstructed when the
number of residue errors is less than half the minimum distance of the code.
However, once the... | [
{
"created": "Thu, 23 Mar 2017 02:20:35 GMT",
"version": "v1"
}
] | 2017-03-24 | [
[
"Xiao",
"Li",
""
],
[
"Xia",
"Xiang-Gen",
""
]
] | Based on unique decoding of the polynomial residue code with non-pairwise coprime moduli, a polynomial with degree less than that of the least common multiple (lcm) of all the moduli can be accurately reconstructed when the number of residue errors is less than half the minimum distance of the code. However, once the n... |
2006.05697 | Jun Shu | Jun Shu, Qian Zhao, Zongben Xu, Deyu Meng | Meta Transition Adaptation for Robust Deep Learning with Noisy Labels | 14 pages | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To discover intrinsic inter-class transition probabilities underlying data,
learning with noise transition has become an important approach for robust deep
learning on corrupted labels. Prior methods attempt to achieve such transition
knowledge by pre-assuming strongly confident anchor points with 1-probability
belon... | [
{
"created": "Wed, 10 Jun 2020 07:27:25 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Jun 2020 01:18:07 GMT",
"version": "v2"
}
] | 2020-06-15 | [
[
"Shu",
"Jun",
""
],
[
"Zhao",
"Qian",
""
],
[
"Xu",
"Zongben",
""
],
[
"Meng",
"Deyu",
""
]
] | To discover intrinsic inter-class transition probabilities underlying data, learning with noise transition has become an important approach for robust deep learning on corrupted labels. Prior methods attempt to achieve such transition knowledge by pre-assuming strongly confident anchor points with 1-probability belongi... |
1809.01649 | Yuliang Zou | Yuliang Zou, Zelun Luo, Jia-Bin Huang | DF-Net: Unsupervised Joint Learning of Depth and Flow using Cross-Task
Consistency | ECCV 2018. Project website: http://yuliang.vision/DF-Net/ Code:
https://github.com/vt-vl-lab/DF-Net | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an unsupervised learning framework for simultaneously training
single-view depth prediction and optical flow estimation models using unlabeled
video sequences. Existing unsupervised methods often exploit brightness
constancy and spatial smoothness priors to train depth or flow models. In this
paper, we pro... | [
{
"created": "Wed, 5 Sep 2018 17:58:25 GMT",
"version": "v1"
}
] | 2018-09-06 | [
[
"Zou",
"Yuliang",
""
],
[
"Luo",
"Zelun",
""
],
[
"Huang",
"Jia-Bin",
""
]
] | We present an unsupervised learning framework for simultaneously training single-view depth prediction and optical flow estimation models using unlabeled video sequences. Existing unsupervised methods often exploit brightness constancy and spatial smoothness priors to train depth or flow models. In this paper, we propo... |
1807.09905 | Katie Byl | Nihar Talele and Katie Byl | Toward Efficient and Robust Biped Walking Optimization | null | null | null | null | cs.RO cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Practical bipedal robot locomotion needs to be both energy efficient and
robust to variability and uncertainty. In this paper, we build upon recent
works in trajectory optimization for robot locomotion with two primary goals.
First, we wish to demonstrate the importance of (a) considering and quantifying
not only ene... | [
{
"created": "Thu, 26 Jul 2018 00:40:39 GMT",
"version": "v1"
}
] | 2018-07-27 | [
[
"Talele",
"Nihar",
""
],
[
"Byl",
"Katie",
""
]
] | Practical bipedal robot locomotion needs to be both energy efficient and robust to variability and uncertainty. In this paper, we build upon recent works in trajectory optimization for robot locomotion with two primary goals. First, we wish to demonstrate the importance of (a) considering and quantifying not only energ... |
1302.6210 | Ratnadip Adhikari | Ratnadip Adhikari, R. K. Agrawal | A Homogeneous Ensemble of Artificial Neural Networks for Time Series
Forecasting | 8 pages, 4 figures, 2 tables, 26 references, international journal | International Journal of Computer Applications, Vol. 32, No. 7,
October 2011, pp. 1-8 | 10.5120/3913-5505 | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Enhancing the robustness and accuracy of time series forecasting models is an
active area of research. Recently, Artificial Neural Networks (ANNs) have found
extensive applications in many practical forecasting problems. However, the
standard backpropagation ANN training algorithm has some critical issues, e.g.
it ha... | [
{
"created": "Mon, 25 Feb 2013 20:09:19 GMT",
"version": "v1"
}
] | 2013-02-27 | [
[
"Adhikari",
"Ratnadip",
""
],
[
"Agrawal",
"R. K.",
""
]
] | Enhancing the robustness and accuracy of time series forecasting models is an active area of research. Recently, Artificial Neural Networks (ANNs) have found extensive applications in many practical forecasting problems. However, the standard backpropagation ANN training algorithm has some critical issues, e.g. it has ... |
1512.08311 | Zhongwei Hu | Zhongwei Hu, Chaowei Yuan, Fengchao Zhu and Feifei Gao | Weighted Sum Transmit Power Minimization for Full-Duplex System with
SWIPT and Self-Energy Recycling | This paper has been withdrawn by the author due to a crucial
modification in P1 | null | null | null | cs.NI cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | This correspondence considers a full-duplex (FD) point-to-point system
consisting of one multi-antenna full-duplex access point (FD-AP) and one
two-antenna full-duplex mobile station (FD-MS). We adopt simultaneous wireless
information and power transfer (SWIPT) scheme and apply the self-energy
recycling at FD-MS. In ... | [
{
"created": "Mon, 28 Dec 2015 03:01:54 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Jun 2016 02:25:54 GMT",
"version": "v2"
}
] | 2016-07-01 | [
[
"Hu",
"Zhongwei",
""
],
[
"Yuan",
"Chaowei",
""
],
[
"Zhu",
"Fengchao",
""
],
[
"Gao",
"Feifei",
""
]
] | This correspondence considers a full-duplex (FD) point-to-point system consisting of one multi-antenna full-duplex access point (FD-AP) and one two-antenna full-duplex mobile station (FD-MS). We adopt simultaneous wireless information and power transfer (SWIPT) scheme and apply the self-energy recycling at FD-MS. In or... |
2212.02501 | Anh-Quan Cao | Anh-Quan Cao and Raoul de Charette | SceneRF: Self-Supervised Monocular 3D Scene Reconstruction with Radiance
Fields | ICCV 2023. Project page: https://astra-vision.github.io/SceneRF | null | null | null | cs.CV cs.AI cs.GR cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 3D reconstruction from a single 2D image was extensively covered in the
literature but relies on depth supervision at training time, which limits its
applicability. To relax the dependence to depth we propose SceneRF, a
self-supervised monocular scene reconstruction method using only posed image
sequences for trainin... | [
{
"created": "Mon, 5 Dec 2022 18:59:57 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Jan 2023 11:08:32 GMT",
"version": "v2"
},
{
"created": "Mon, 13 Mar 2023 18:48:14 GMT",
"version": "v3"
},
{
"created": "Thu, 24 Aug 2023 22:14:53 GMT",
"version": "v4"
}
] | 2023-08-28 | [
[
"Cao",
"Anh-Quan",
""
],
[
"de Charette",
"Raoul",
""
]
] | 3D reconstruction from a single 2D image was extensively covered in the literature but relies on depth supervision at training time, which limits its applicability. To relax the dependence to depth we propose SceneRF, a self-supervised monocular scene reconstruction method using only posed image sequences for training.... |
2402.15730 | Ghadeer Ghosheh | Ghadeer O. Ghosheh, Jin Li, and Tingting Zhu | Understanding Missingness in Time-series Electronic Health Records for
Individualized Representation | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | With the widespread of machine learning models for healthcare applications,
there is increased interest in building applications for personalized medicine.
Despite the plethora of proposed research for personalized medicine, very few
focus on representing missingness and learning from the missingness patterns in
time... | [
{
"created": "Sat, 24 Feb 2024 05:48:39 GMT",
"version": "v1"
}
] | 2024-02-27 | [
[
"Ghosheh",
"Ghadeer O.",
""
],
[
"Li",
"Jin",
""
],
[
"Zhu",
"Tingting",
""
]
] | With the widespread of machine learning models for healthcare applications, there is increased interest in building applications for personalized medicine. Despite the plethora of proposed research for personalized medicine, very few focus on representing missingness and learning from the missingness patterns in time-s... |
2307.13347 | Ziteng Sun | Adria Gascon, Peter Kairouz, Ziteng Sun, Ananda Theertha Suresh | Federated Heavy Hitter Recovery under Linear Sketching | null | null | null | null | cs.DS cs.CR cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motivated by real-life deployments of multi-round federated analytics with
secure aggregation, we investigate the fundamental communication-accuracy
tradeoffs of the heavy hitter discovery and approximate (open-domain) histogram
problems under a linear sketching constraint. We propose efficient algorithms
based on lo... | [
{
"created": "Tue, 25 Jul 2023 09:04:24 GMT",
"version": "v1"
}
] | 2023-07-26 | [
[
"Gascon",
"Adria",
""
],
[
"Kairouz",
"Peter",
""
],
[
"Sun",
"Ziteng",
""
],
[
"Suresh",
"Ananda Theertha",
""
]
] | Motivated by real-life deployments of multi-round federated analytics with secure aggregation, we investigate the fundamental communication-accuracy tradeoffs of the heavy hitter discovery and approximate (open-domain) histogram problems under a linear sketching constraint. We propose efficient algorithms based on loca... |
2210.16023 | Fei Sun | Sihao Yu, Fei Sun, Jiafeng Guo, Ruqing Zhang, Xueqi Cheng | LegoNet: A Fast and Exact Unlearning Architecture | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Machine unlearning aims to erase the impact of specific training samples upon
deleted requests from a trained model. Re-training the model on the retained
data after deletion is an effective but not efficient way due to the huge
number of model parameters and re-training samples. To speed up, a natural way
is to redu... | [
{
"created": "Fri, 28 Oct 2022 09:53:05 GMT",
"version": "v1"
}
] | 2022-10-31 | [
[
"Yu",
"Sihao",
""
],
[
"Sun",
"Fei",
""
],
[
"Guo",
"Jiafeng",
""
],
[
"Zhang",
"Ruqing",
""
],
[
"Cheng",
"Xueqi",
""
]
] | Machine unlearning aims to erase the impact of specific training samples upon deleted requests from a trained model. Re-training the model on the retained data after deletion is an effective but not efficient way due to the huge number of model parameters and re-training samples. To speed up, a natural way is to reduce... |
2305.02371 | Nizar Riane | Nizar Riane | Spectral cyclicality of networks | null | null | null | null | cs.SI math.CO | http://creativecommons.org/licenses/by/4.0/ | We introduce the spectral influence and spectral cyclicality based on the
largest eigenvalue of a graph adjacency matrix, two novel concepts of
centrality capturing diffusion and interdependence from a local and a global
point of view respectively. We define a new clustering algorithm to distinguish
communities with ... | [
{
"created": "Wed, 3 May 2023 18:16:47 GMT",
"version": "v1"
}
] | 2023-05-05 | [
[
"Riane",
"Nizar",
""
]
] | We introduce the spectral influence and spectral cyclicality based on the largest eigenvalue of a graph adjacency matrix, two novel concepts of centrality capturing diffusion and interdependence from a local and a global point of view respectively. We define a new clustering algorithm to distinguish communities with hi... |
1703.05942 | Gianfranco Nencioni | Gianfranco Nencioni, Bjarne E. Helvik, Poul E. Heegaard | Implementing the Availability Model of a Software-Defined Backbone
Network in M\"obius | IIK, NTNU, Tech. Rep., March 2017 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Software-defined networking (SDN) promises to improve the programmability and
flexibility of networks, but it may bring also new challenges that need to be
explored. One open issue is the quantitative assessment of the properties of
SDN backbone networks to determine whether they can provide similar
availability to t... | [
{
"created": "Fri, 17 Mar 2017 09:53:13 GMT",
"version": "v1"
}
] | 2017-03-20 | [
[
"Nencioni",
"Gianfranco",
""
],
[
"Helvik",
"Bjarne E.",
""
],
[
"Heegaard",
"Poul E.",
""
]
] | Software-defined networking (SDN) promises to improve the programmability and flexibility of networks, but it may bring also new challenges that need to be explored. One open issue is the quantitative assessment of the properties of SDN backbone networks to determine whether they can provide similar availability to the... |
1901.11295 | Ling-Ze Bu | Ling-Ze Bu, Wei Zhao, Wei Wang | Second order hierarchical partial least squares regression-polynomial
chaos expansion for global sensitivity and reliability analyses of
high-dimensional models | null | null | null | null | cs.NA cs.CE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | To tackle the curse of dimensionality and multicollinearity problems of
polynomial chaos expansion for analyzing global sensitivity and reliability of
models with high stochastic dimensions, this paper proposes a novel
non-intrusive algorithm called second order hierarchical partial least squares
regression-polynomia... | [
{
"created": "Thu, 31 Jan 2019 10:07:19 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Feb 2019 12:25:02 GMT",
"version": "v2"
},
{
"created": "Thu, 7 Mar 2019 06:46:14 GMT",
"version": "v3"
}
] | 2019-03-08 | [
[
"Bu",
"Ling-Ze",
""
],
[
"Zhao",
"Wei",
""
],
[
"Wang",
"Wei",
""
]
] | To tackle the curse of dimensionality and multicollinearity problems of polynomial chaos expansion for analyzing global sensitivity and reliability of models with high stochastic dimensions, this paper proposes a novel non-intrusive algorithm called second order hierarchical partial least squares regression-polynomial ... |
1908.03788 | Jocelyn Thiebaut | Marthe Bonamy and Oscar Defrain and Meike Hatzel and Jocelyn Thiebaut | Avoidable paths in graphs | 7 pages, 1 figure | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove a recent conjecture of Beisegel et al. that for every positive
integer k, every graph containing an induced P_k also contains an avoidable
P_k. Avoidability generalises the notion of simpliciality best known in the
context of chordal graphs. The conjecture was only established for k in {1,2}
(Ohtsuki et al. ... | [
{
"created": "Sat, 10 Aug 2019 17:23:53 GMT",
"version": "v1"
}
] | 2019-08-13 | [
[
"Bonamy",
"Marthe",
""
],
[
"Defrain",
"Oscar",
""
],
[
"Hatzel",
"Meike",
""
],
[
"Thiebaut",
"Jocelyn",
""
]
] | We prove a recent conjecture of Beisegel et al. that for every positive integer k, every graph containing an induced P_k also contains an avoidable P_k. Avoidability generalises the notion of simpliciality best known in the context of chordal graphs. The conjecture was only established for k in {1,2} (Ohtsuki et al. 19... |
1808.00076 | Gabriel de Souza Pereira Moreira | Gabriel de Souza P. Moreira, Felipe Ferreira, Adilson Marques da Cunha | News Session-Based Recommendations using Deep Neural Networks | Accepted for the Third Workshop on Deep Learning for Recommender
Systems - DLRS 2018, October 02-07, 2018, Vancouver, Canada.
https://recsys.acm.org/recsys18/dlrs/ | null | 10.1145/3270323.3270328 | null | cs.IR cs.AI cs.LG cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | News recommender systems are aimed to personalize users experiences and help
them to discover relevant articles from a large and dynamic search space.
Therefore, news domain is a challenging scenario for recommendations, due to
its sparse user profiling, fast growing number of items, accelerated item's
value decay, a... | [
{
"created": "Tue, 31 Jul 2018 21:15:54 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Sep 2018 01:02:00 GMT",
"version": "v2"
},
{
"created": "Mon, 17 Sep 2018 03:09:58 GMT",
"version": "v3"
}
] | 2018-09-18 | [
[
"Moreira",
"Gabriel de Souza P.",
""
],
[
"Ferreira",
"Felipe",
""
],
[
"da Cunha",
"Adilson Marques",
""
]
] | News recommender systems are aimed to personalize users experiences and help them to discover relevant articles from a large and dynamic search space. Therefore, news domain is a challenging scenario for recommendations, due to its sparse user profiling, fast growing number of items, accelerated item's value decay, and... |
2209.10973 | Abdelkrim Abdelli Mr | Meriem Achir, Abdelkrim Abdelli, Lynda Mokdad | Distributed architecture for resource description and discovery in the
IoT | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | Nowadays, the Internet of Things (IoT) creates a vast ecosystem of
intelligent objects interconnected via the Internet, allowing them to exchange
information and to interact. This paradigm has been extended to a new concept,
called the Web of Things (WoT), considering that every physical object can be
accessed and co... | [
{
"created": "Thu, 22 Sep 2022 12:49:57 GMT",
"version": "v1"
}
] | 2022-09-23 | [
[
"Achir",
"Meriem",
""
],
[
"Abdelli",
"Abdelkrim",
""
],
[
"Mokdad",
"Lynda",
""
]
] | Nowadays, the Internet of Things (IoT) creates a vast ecosystem of intelligent objects interconnected via the Internet, allowing them to exchange information and to interact. This paradigm has been extended to a new concept, called the Web of Things (WoT), considering that every physical object can be accessed and cont... |
2108.04983 | Yong Li | Yong Li, Yufei Sun, Zhen Cui, Shiguang Shan, Jian Yang | Learning Fair Face Representation With Progressive Cross Transformer | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Face recognition (FR) has made extraordinary progress owing to the
advancement of deep convolutional neural networks. However, demographic bias
among different racial cohorts still challenges the practical face recognition
system. The race factor has been proven to be a dilemma for fair FR (FFR) as
the subject-relate... | [
{
"created": "Wed, 11 Aug 2021 01:31:14 GMT",
"version": "v1"
}
] | 2021-08-12 | [
[
"Li",
"Yong",
""
],
[
"Sun",
"Yufei",
""
],
[
"Cui",
"Zhen",
""
],
[
"Shan",
"Shiguang",
""
],
[
"Yang",
"Jian",
""
]
] | Face recognition (FR) has made extraordinary progress owing to the advancement of deep convolutional neural networks. However, demographic bias among different racial cohorts still challenges the practical face recognition system. The race factor has been proven to be a dilemma for fair FR (FFR) as the subject-related ... |
2310.16123 | Jianming Huang | Jianming Huang, Xun Su, Zhongxi Fang, Hiroyuki Kasai | Anchor Space Optimal Transport: Accelerating Batch Processing of
Multiple OT Problems | 26 pages, 4 figures, 6 tables | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | The optimal transport (OT) theory provides an effective way to compare
probability distributions on a defined metric space, but it suffers from cubic
computational complexity. Although the Sinkhorn's algorithm greatly reduces the
computational complexity of OT solutions, the solutions of multiple OT problems
are stil... | [
{
"created": "Tue, 24 Oct 2023 18:55:12 GMT",
"version": "v1"
}
] | 2023-10-26 | [
[
"Huang",
"Jianming",
""
],
[
"Su",
"Xun",
""
],
[
"Fang",
"Zhongxi",
""
],
[
"Kasai",
"Hiroyuki",
""
]
] | The optimal transport (OT) theory provides an effective way to compare probability distributions on a defined metric space, but it suffers from cubic computational complexity. Although the Sinkhorn's algorithm greatly reduces the computational complexity of OT solutions, the solutions of multiple OT problems are still ... |
1908.06801 | Yoshitaka Kameya | Yoshitaka Kameya | Towards Efficient Discriminative Pattern Mining in Hybrid Domains | This paper is an English version of the paper originally presented in
the 17th Forum on Information Technology (FIT 2018), a Japanese domestic
conference held during September 19-21, 2018 | null | null | null | cs.DB cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Discriminative pattern mining is a data mining task in which we find patterns
that distinguish transactions in the class of interest from those in other
classes, and is also called emerging pattern mining or subgroup discovery. One
practical problem in discriminative pattern mining is how to handle numeric
values in ... | [
{
"created": "Thu, 15 Aug 2019 13:28:50 GMT",
"version": "v1"
}
] | 2019-08-20 | [
[
"Kameya",
"Yoshitaka",
""
]
] | Discriminative pattern mining is a data mining task in which we find patterns that distinguish transactions in the class of interest from those in other classes, and is also called emerging pattern mining or subgroup discovery. One practical problem in discriminative pattern mining is how to handle numeric values in th... |
cs/0702117 | Mathieu Couture | Prosenjit Bose and Paz Carmi and Mathieu Couture and Michiel Smid and
Daming Xu | On a family of strong geometric spanners that admit local routing
strategies | null | null | null | null | cs.CG | null | We introduce a family of directed geometric graphs, denoted $\paz$, that
depend on two parameters $\lambda$ and $\theta$. For $0\leq
\theta<\frac{\pi}{2}$ and ${1/2} < \lambda < 1$, the $\paz$ graph is a strong
$t$-spanner, with $t=\frac{1}{(1-\lambda)\cos\theta}$. The out-degree of a node
in the $\paz$ graph is at m... | [
{
"created": "Tue, 20 Feb 2007 20:54:16 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Feb 2007 14:57:44 GMT",
"version": "v2"
},
{
"created": "Thu, 22 Feb 2007 21:17:05 GMT",
"version": "v3"
}
] | 2007-05-23 | [
[
"Bose",
"Prosenjit",
""
],
[
"Carmi",
"Paz",
""
],
[
"Couture",
"Mathieu",
""
],
[
"Smid",
"Michiel",
""
],
[
"Xu",
"Daming",
""
]
] | We introduce a family of directed geometric graphs, denoted $\paz$, that depend on two parameters $\lambda$ and $\theta$. For $0\leq \theta<\frac{\pi}{2}$ and ${1/2} < \lambda < 1$, the $\paz$ graph is a strong $t$-spanner, with $t=\frac{1}{(1-\lambda)\cos\theta}$. The out-degree of a node in the $\paz$ graph is at mos... |
2408.07925 | Muhammad Arslan | Muhammad Arslan, Muhammad Mubeen, Saadullah Farooq Abbasi, Muhammad
Shahbaz Khan, Wadii Boulila, Jawad Ahmad | A Single Channel-Based Neonatal Sleep-Wake Classification using Hjorth
Parameters and Improved Gradient Boosting | 8 pages, 5 figures, 3 tables, International Polydisciplinary
Conference on Artificial Intelligence and New Technologies | null | null | null | cs.LG eess.SP | http://creativecommons.org/licenses/by/4.0/ | Sleep plays a crucial role in neonatal development. Monitoring the sleep
patterns in neonates in a Neonatal Intensive Care Unit (NICU) is imperative for
understanding the maturation process. While polysomnography (PSG) is considered
the best practice for sleep classification, its expense and reliance on human
annotat... | [
{
"created": "Thu, 15 Aug 2024 04:38:24 GMT",
"version": "v1"
}
] | 2024-08-16 | [
[
"Arslan",
"Muhammad",
""
],
[
"Mubeen",
"Muhammad",
""
],
[
"Abbasi",
"Saadullah Farooq",
""
],
[
"Khan",
"Muhammad Shahbaz",
""
],
[
"Boulila",
"Wadii",
""
],
[
"Ahmad",
"Jawad",
""
]
] | Sleep plays a crucial role in neonatal development. Monitoring the sleep patterns in neonates in a Neonatal Intensive Care Unit (NICU) is imperative for understanding the maturation process. While polysomnography (PSG) is considered the best practice for sleep classification, its expense and reliance on human annotatio... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.