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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2211.15787 | Ju-Chiang Wang | Ju-Chiang Wang, Jordan B. L. Smith, Yun-Ning Hung | MuSFA: Improving Music Structural Function Analysis with Partially
Labeled Data | ISMIR2022, LBD paper | null | null | null | cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | Music structure analysis (MSA) systems aim to segment a song recording into
non-overlapping sections with useful labels. Previous MSA systems typically
predict abstract labels in a post-processing step and require the full context
of the song. By contrast, we recently proposed a supervised framework, called
"Music St... | [
{
"created": "Mon, 28 Nov 2022 21:48:45 GMT",
"version": "v1"
}
] | 2022-11-30 | [
[
"Wang",
"Ju-Chiang",
""
],
[
"Smith",
"Jordan B. L.",
""
],
[
"Hung",
"Yun-Ning",
""
]
] | Music structure analysis (MSA) systems aim to segment a song recording into non-overlapping sections with useful labels. Previous MSA systems typically predict abstract labels in a post-processing step and require the full context of the song. By contrast, we recently proposed a supervised framework, called "Music Stru... |
2405.15334 | Jonathan Dong | Shuya Lin, Yuxiong Wang, Jonathan Dong, and Shiguang Ni | Detection and Positive Reconstruction of Cognitive Distortion sentences:
Mandarin Dataset and Evaluation | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This research introduces a Positive Reconstruction Framework based on
positive psychology theory. Overcoming negative thoughts can be challenging,
our objective is to address and reframe them through a positive
reinterpretation. To tackle this challenge, a two-fold approach is necessary:
identifying cognitive distort... | [
{
"created": "Fri, 24 May 2024 08:17:20 GMT",
"version": "v1"
}
] | 2024-05-27 | [
[
"Lin",
"Shuya",
""
],
[
"Wang",
"Yuxiong",
""
],
[
"Dong",
"Jonathan",
""
],
[
"Ni",
"Shiguang",
""
]
] | This research introduces a Positive Reconstruction Framework based on positive psychology theory. Overcoming negative thoughts can be challenging, our objective is to address and reframe them through a positive reinterpretation. To tackle this challenge, a two-fold approach is necessary: identifying cognitive distortio... |
2404.09833 | Hongchi Xia | Hongchi Xia, Zhi-Hao Lin, Wei-Chiu Ma, Shenlong Wang | Video2Game: Real-time, Interactive, Realistic and Browser-Compatible
Environment from a Single Video | CVPR 2024. Project page (with code): https://video2game.github.io/ | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Creating high-quality and interactive virtual environments, such as games and
simulators, often involves complex and costly manual modeling processes. In
this paper, we present Video2Game, a novel approach that automatically converts
videos of real-world scenes into realistic and interactive game environments.
At the... | [
{
"created": "Mon, 15 Apr 2024 14:32:32 GMT",
"version": "v1"
}
] | 2024-04-16 | [
[
"Xia",
"Hongchi",
""
],
[
"Lin",
"Zhi-Hao",
""
],
[
"Ma",
"Wei-Chiu",
""
],
[
"Wang",
"Shenlong",
""
]
] | Creating high-quality and interactive virtual environments, such as games and simulators, often involves complex and costly manual modeling processes. In this paper, we present Video2Game, a novel approach that automatically converts videos of real-world scenes into realistic and interactive game environments. At the h... |
2301.05586 | Bo Zhang | Chuyi Li, Lulu Li, Yifei Geng, Hongliang Jiang, Meng Cheng, Bo Zhang,
Zaidan Ke, Xiaoming Xu, Xiangxiang Chu | YOLOv6 v3.0: A Full-Scale Reloading | Tech Report. arXiv admin note: text overlap with arXiv:2209.02976 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The YOLO community has been in high spirits since our first two releases! By
the advent of Chinese New Year 2023, which sees the Year of the Rabbit, we
refurnish YOLOv6 with numerous novel enhancements on the network architecture
and the training scheme. This release is identified as YOLOv6 v3.0. For a
glimpse of per... | [
{
"created": "Fri, 13 Jan 2023 14:46:46 GMT",
"version": "v1"
}
] | 2023-01-16 | [
[
"Li",
"Chuyi",
""
],
[
"Li",
"Lulu",
""
],
[
"Geng",
"Yifei",
""
],
[
"Jiang",
"Hongliang",
""
],
[
"Cheng",
"Meng",
""
],
[
"Zhang",
"Bo",
""
],
[
"Ke",
"Zaidan",
""
],
[
"Xu",
"Xiaoming",
... | The YOLO community has been in high spirits since our first two releases! By the advent of Chinese New Year 2023, which sees the Year of the Rabbit, we refurnish YOLOv6 with numerous novel enhancements on the network architecture and the training scheme. This release is identified as YOLOv6 v3.0. For a glimpse of perfo... |
2302.06746 | Ruokai Yin | Ruokai Yin, Youngeun Kim, Yuhang Li, Abhishek Moitra, Nitin Satpute,
Anna Hambitzer, Priyadarshini Panda | Workload-Balanced Pruning for Sparse Spiking Neural Networks | 11 pages. Accepted to IEEE Transactions on Emerging Topics in
Computational Intelligence (2024) | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pruning for Spiking Neural Networks (SNNs) has emerged as a fundamental
methodology for deploying deep SNNs on resource-constrained edge devices.
Though the existing pruning methods can provide extremely high weight sparsity
for deep SNNs, the high weight sparsity brings a workload imbalance problem.
Specifically, th... | [
{
"created": "Mon, 13 Feb 2023 23:18:47 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Mar 2024 19:53:37 GMT",
"version": "v2"
}
] | 2024-03-26 | [
[
"Yin",
"Ruokai",
""
],
[
"Kim",
"Youngeun",
""
],
[
"Li",
"Yuhang",
""
],
[
"Moitra",
"Abhishek",
""
],
[
"Satpute",
"Nitin",
""
],
[
"Hambitzer",
"Anna",
""
],
[
"Panda",
"Priyadarshini",
""
]
] | Pruning for Spiking Neural Networks (SNNs) has emerged as a fundamental methodology for deploying deep SNNs on resource-constrained edge devices. Though the existing pruning methods can provide extremely high weight sparsity for deep SNNs, the high weight sparsity brings a workload imbalance problem. Specifically, the ... |
2212.05830 | Yachao Li Ph.D. | Yachao Li, Junhui Li, Jing Jiang, Shimin Tao, Hao Yang and Min Zhang | P-Transformer: Towards Better Document-to-Document Neural Machine
Translation | Submitted to TASLP | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Directly training a document-to-document (Doc2Doc) neural machine translation
(NMT) via Transformer from scratch, especially on small datasets usually fails
to converge. Our dedicated probing tasks show that 1) both the absolute
position and relative position information gets gradually weakened or even
vanished once ... | [
{
"created": "Mon, 12 Dec 2022 11:19:05 GMT",
"version": "v1"
}
] | 2022-12-13 | [
[
"Li",
"Yachao",
""
],
[
"Li",
"Junhui",
""
],
[
"Jiang",
"Jing",
""
],
[
"Tao",
"Shimin",
""
],
[
"Yang",
"Hao",
""
],
[
"Zhang",
"Min",
""
]
] | Directly training a document-to-document (Doc2Doc) neural machine translation (NMT) via Transformer from scratch, especially on small datasets usually fails to converge. Our dedicated probing tasks show that 1) both the absolute position and relative position information gets gradually weakened or even vanished once it... |
1610.09012 | Kleinner Farias | Kleinner Farias | Empirical Evaluation of Effort on Composing Design Models | PhD thesis, Pontifical Catholic University of Rio de Janeiro, Rio de
Janeiro, Brazil, 2012 - Keywords: design models, UML, development effort,
software modeling, aspect-oriented modeling, model merging, software merging,
quality model, empirical studies | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Model composition plays a central role in many software engineering
activities such as evolving models to add new features and reconciling
conflicting design models developed in parallel by different development teams.
As model composition is usually an error-prone and effort-consuming task, its
potential benefits, s... | [
{
"created": "Thu, 27 Oct 2016 20:51:55 GMT",
"version": "v1"
}
] | 2016-10-31 | [
[
"Farias",
"Kleinner",
""
]
] | Model composition plays a central role in many software engineering activities such as evolving models to add new features and reconciling conflicting design models developed in parallel by different development teams. As model composition is usually an error-prone and effort-consuming task, its potential benefits, suc... |
0805.0202 | Joao Marques-Silva | Antonio Morgado, Joao Marques-Silva | A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem | null | null | null | null | cs.AI cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Determining the evolutionary history of a given biological data is an
important task in biological sciences. Given a set of quartet topologies over a
set of taxa, the Maximum Quartet Consistency (MQC) problem consists of
computing a global phylogeny that satisfies the maximum number of quartets. A
number of solutions... | [
{
"created": "Fri, 2 May 2008 10:06:27 GMT",
"version": "v1"
}
] | 2008-12-18 | [
[
"Morgado",
"Antonio",
""
],
[
"Marques-Silva",
"Joao",
""
]
] | Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quartet Consistency (MQC) problem consists of computing a global phylogeny that satisfies the maximum number of quartets. A number of solutions h... |
2206.11335 | Debesh Jha | Debesh Jha, Ashish Rauniyar, H{\aa}vard D. Johansen, Dag Johansen,
Michael A. Riegler, P{\aa}l Halvorsen, Ulas Bagci | Video Analytics in Elite Soccer: A Distributed Computing Perspective | null | published IEEE SAM 2022 | null | null | cs.MM | http://creativecommons.org/licenses/by/4.0/ | Ubiquitous sensors and Internet of Things (IoT) technologies have
revolutionized the sports industry, providing new methodologies for planning,
effective coordination of training, and match analysis post game. New methods,
including machine learning, image and video processing, have been developed for
performance eva... | [
{
"created": "Wed, 22 Jun 2022 19:25:28 GMT",
"version": "v1"
}
] | 2022-06-24 | [
[
"Jha",
"Debesh",
""
],
[
"Rauniyar",
"Ashish",
""
],
[
"Johansen",
"Håvard D.",
""
],
[
"Johansen",
"Dag",
""
],
[
"Riegler",
"Michael A.",
""
],
[
"Halvorsen",
"Pål",
""
],
[
"Bagci",
"Ulas",
""
]
] | Ubiquitous sensors and Internet of Things (IoT) technologies have revolutionized the sports industry, providing new methodologies for planning, effective coordination of training, and match analysis post game. New methods, including machine learning, image and video processing, have been developed for performance evalu... |
2108.00439 | Seongjin Choi | Zhixiong Jin, Jiwon Kim, Hwasoo Yeo, Seongjin Choi | Transformer-based Map Matching Model with Limited Ground-Truth Data
using Transfer-Learning Approach | 25 pages, 9 figures, 4 tables | null | 10.1016/j.trc.2022.103668 | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In many spatial trajectory-based applications, it is necessary to map raw
trajectory data points onto road networks in digital maps, which is commonly
referred to as a map-matching process. While most previous map-matching methods
have focused on using rule-based algorithms to deal with the map-matching
problems, in ... | [
{
"created": "Sun, 1 Aug 2021 11:51:11 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Aug 2021 01:06:50 GMT",
"version": "v2"
},
{
"created": "Thu, 30 Sep 2021 12:53:58 GMT",
"version": "v3"
},
{
"created": "Thu, 7 Oct 2021 04:08:31 GMT",
"version": "v4"
}
] | 2023-08-15 | [
[
"Jin",
"Zhixiong",
""
],
[
"Kim",
"Jiwon",
""
],
[
"Yeo",
"Hwasoo",
""
],
[
"Choi",
"Seongjin",
""
]
] | In many spatial trajectory-based applications, it is necessary to map raw trajectory data points onto road networks in digital maps, which is commonly referred to as a map-matching process. While most previous map-matching methods have focused on using rule-based algorithms to deal with the map-matching problems, in th... |
2407.11784 | Daoyuan Chen | Daoyuan Chen, Haibin Wang, Yilun Huang, Ce Ge, Yaliang Li, Bolin Ding,
Jingren Zhou | Data-Juicer Sandbox: A Comprehensive Suite for Multimodal Data-Model
Co-development | 26 pages, 9 figures, 5 tables | null | null | null | cs.AI cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The emergence of large-scale multi-modal generative models has drastically
advanced artificial intelligence, introducing unprecedented levels of
performance and functionality. However, optimizing these models remains
challenging due to historically isolated paths of model-centric and
data-centric developments, leadin... | [
{
"created": "Tue, 16 Jul 2024 14:40:07 GMT",
"version": "v1"
}
] | 2024-07-17 | [
[
"Chen",
"Daoyuan",
""
],
[
"Wang",
"Haibin",
""
],
[
"Huang",
"Yilun",
""
],
[
"Ge",
"Ce",
""
],
[
"Li",
"Yaliang",
""
],
[
"Ding",
"Bolin",
""
],
[
"Zhou",
"Jingren",
""
]
] | The emergence of large-scale multi-modal generative models has drastically advanced artificial intelligence, introducing unprecedented levels of performance and functionality. However, optimizing these models remains challenging due to historically isolated paths of model-centric and data-centric developments, leading ... |
1406.5946 | Jan Broekaert | Lorena P\'erez-Garc\'ia, Jan Broekaert and Nicole Note | Is a `Wirikuta empowerment' of the Huichol measurable on the Internet? | 14 pages, 1 figure, 4 graphs (submitted to journal) | Internet Research, 26, 5, 1269 - 1290 (2016) | 10.1108/IntR-07-2014-0185 | null | cs.SI cs.CY cs.IR physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current social and activist movements find the opportunity in social media to
effectively impact on the agenda of governing bodies and create `global'
perceptions -- it is often claimed. Content related to the social and activist
movements is online, to be accessed, supported or disputed and distributed from
virtuall... | [
{
"created": "Mon, 23 Jun 2014 15:32:14 GMT",
"version": "v1"
}
] | 2016-12-07 | [
[
"Pérez-García",
"Lorena",
""
],
[
"Broekaert",
"Jan",
""
],
[
"Note",
"Nicole",
""
]
] | Current social and activist movements find the opportunity in social media to effectively impact on the agenda of governing bodies and create `global' perceptions -- it is often claimed. Content related to the social and activist movements is online, to be accessed, supported or disputed and distributed from virtually ... |
0805.2797 | Mikl\'os Pint\'er | M. Pinter | Young's axiomatization of the Shapley value - a new proof | 11 pages | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider Young (1985)'s characterization of the Shapley value, and give a
new proof of this axiomatization. Moreover, as applications of the new proof,
we show that Young (1985)'s axiomatization of the Shapley value works on
various well-known subclasses of TU games.
| [
{
"created": "Mon, 19 May 2008 07:11:04 GMT",
"version": "v1"
},
{
"created": "Sun, 3 May 2009 09:53:25 GMT",
"version": "v2"
},
{
"created": "Sat, 10 Mar 2012 13:32:00 GMT",
"version": "v3"
}
] | 2012-03-13 | [
[
"Pinter",
"M.",
""
]
] | We consider Young (1985)'s characterization of the Shapley value, and give a new proof of this axiomatization. Moreover, as applications of the new proof, we show that Young (1985)'s axiomatization of the Shapley value works on various well-known subclasses of TU games. |
1811.00212 | Vipul Harsh | Vipul Harsh, Sangeetha Abdu Jyothi, Inderdeep Singh, P. Brighten
Godfrey | Expander Datacenters: From Theory to Practice | 15 pages, 17 figures | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work has shown that expander-based data center topologies are robust
and can yield superior performance over Clos topologies. However, to achieve
these benefits, previous proposals use routing and transport schemes that
impede quick industry adoption. In this paper, we examine if expanders can be
effective for... | [
{
"created": "Thu, 1 Nov 2018 03:52:15 GMT",
"version": "v1"
}
] | 2018-11-02 | [
[
"Harsh",
"Vipul",
""
],
[
"Jyothi",
"Sangeetha Abdu",
""
],
[
"Singh",
"Inderdeep",
""
],
[
"Godfrey",
"P. Brighten",
""
]
] | Recent work has shown that expander-based data center topologies are robust and can yield superior performance over Clos topologies. However, to achieve these benefits, previous proposals use routing and transport schemes that impede quick industry adoption. In this paper, we examine if expanders can be effective for t... |
1606.04308 | J\"urgen Leitner | Donald G. Dansereau, Anders Eriksson and J\"urgen Leitner | Richardson-Lucy Deblurring for Moving Light Field Cameras | Paper accepted for oral presentation at LF4CV workshop at CVPR | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We generalize Richardson-Lucy (RL) deblurring to 4-D light fields by
replacing the convolution steps with light field rendering of motion blur. The
method deals correctly with blur caused by 6-degree-of-freedom camera motion in
complex 3-D scenes, without performing depth estimation. We introduce a novel
regularizati... | [
{
"created": "Tue, 14 Jun 2016 10:57:34 GMT",
"version": "v1"
},
{
"created": "Fri, 19 May 2017 08:20:54 GMT",
"version": "v2"
}
] | 2017-05-22 | [
[
"Dansereau",
"Donald G.",
""
],
[
"Eriksson",
"Anders",
""
],
[
"Leitner",
"Jürgen",
""
]
] | We generalize Richardson-Lucy (RL) deblurring to 4-D light fields by replacing the convolution steps with light field rendering of motion blur. The method deals correctly with blur caused by 6-degree-of-freedom camera motion in complex 3-D scenes, without performing depth estimation. We introduce a novel regularization... |
2405.13427 | Qiang Chen | Qiang Chen, Weizhong Yu, Feiping Nie, and Xuelong Li | Adaptive Fuzzy C-Means with Graph Embedding | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Fuzzy clustering algorithms can be roughly categorized into two main groups:
Fuzzy C-Means (FCM) based methods and mixture model based methods. However, for
almost all existing FCM based methods, how to automatically selecting proper
membership degree hyper-parameter values remains a challenging and unsolved
problem.... | [
{
"created": "Wed, 22 May 2024 08:15:50 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Chen",
"Qiang",
""
],
[
"Yu",
"Weizhong",
""
],
[
"Nie",
"Feiping",
""
],
[
"Li",
"Xuelong",
""
]
] | Fuzzy clustering algorithms can be roughly categorized into two main groups: Fuzzy C-Means (FCM) based methods and mixture model based methods. However, for almost all existing FCM based methods, how to automatically selecting proper membership degree hyper-parameter values remains a challenging and unsolved problem. M... |
2302.09325 | Jie Li | Jie Li, Yi Liu, Xiaohu Tang, Yunghsiang S. Han, Bo Bai, and Gong Zhang | MDS Array Codes With (Near) Optimal Repair Bandwidth for All Admissible
Repair Degrees | Submitted to the IEEE Transactions on Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Abundant high-rate (n, k) minimum storage regenerating (MSR) codes have been
reported in the literature. However, most of them require contacting all the
surviving nodes during a node repair process, resulting in a repair degree of
d=n-1. In practical systems, it may not always be feasible to connect and
download dat... | [
{
"created": "Sat, 18 Feb 2023 13:11:57 GMT",
"version": "v1"
},
{
"created": "Sat, 27 May 2023 03:26:51 GMT",
"version": "v2"
}
] | 2023-05-30 | [
[
"Li",
"Jie",
""
],
[
"Liu",
"Yi",
""
],
[
"Tang",
"Xiaohu",
""
],
[
"Han",
"Yunghsiang S.",
""
],
[
"Bai",
"Bo",
""
],
[
"Zhang",
"Gong",
""
]
] | Abundant high-rate (n, k) minimum storage regenerating (MSR) codes have been reported in the literature. However, most of them require contacting all the surviving nodes during a node repair process, resulting in a repair degree of d=n-1. In practical systems, it may not always be feasible to connect and download data ... |
1612.02646 | Federico Perazzi | Anna Khoreva, Federico Perazzi, Rodrigo Benenson, Bernt Schiele,
Alexander Sorkine-Hornung | Learning Video Object Segmentation from Static Images | Submitted to CVPR 2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Inspired by recent advances of deep learning in instance segmentation and
object tracking, we introduce video object segmentation problem as a concept of
guided instance segmentation. Our model proceeds on a per-frame basis, guided
by the output of the previous frame towards the object of interest in the next
frame. ... | [
{
"created": "Thu, 8 Dec 2016 13:59:18 GMT",
"version": "v1"
}
] | 2019-02-05 | [
[
"Khoreva",
"Anna",
""
],
[
"Perazzi",
"Federico",
""
],
[
"Benenson",
"Rodrigo",
""
],
[
"Schiele",
"Bernt",
""
],
[
"Sorkine-Hornung",
"Alexander",
""
]
] | Inspired by recent advances of deep learning in instance segmentation and object tracking, we introduce video object segmentation problem as a concept of guided instance segmentation. Our model proceeds on a per-frame basis, guided by the output of the previous frame towards the object of interest in the next frame. We... |
2203.11556 | Sahil Sidheekh | Sahil Sidheekh, Chris B. Dock, Tushar Jain, Radu Balan, Maneesh K.
Singh | VQ-Flows: Vector Quantized Local Normalizing Flows | Accepted to The 38th Conference on Uncertainty in Artificial
Intelligence (UAI) 2022 | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Normalizing flows provide an elegant approach to generative modeling that
allows for efficient sampling and exact density evaluation of unknown data
distributions. However, current techniques have significant limitations in
their expressivity when the data distribution is supported on a low-dimensional
manifold or ha... | [
{
"created": "Tue, 22 Mar 2022 09:22:18 GMT",
"version": "v1"
},
{
"created": "Sat, 18 Jun 2022 10:13:28 GMT",
"version": "v2"
}
] | 2022-06-22 | [
[
"Sidheekh",
"Sahil",
""
],
[
"Dock",
"Chris B.",
""
],
[
"Jain",
"Tushar",
""
],
[
"Balan",
"Radu",
""
],
[
"Singh",
"Maneesh K.",
""
]
] | Normalizing flows provide an elegant approach to generative modeling that allows for efficient sampling and exact density evaluation of unknown data distributions. However, current techniques have significant limitations in their expressivity when the data distribution is supported on a low-dimensional manifold or has ... |
1405.0637 | Bryan Ford | Cristina B\u{a}sescu, Georgia Fragkouli, Enis Ceyhun Alp, Michael F.
Nowlan, Jose M. Faleiro, Gaylor Bosson, Kelong Cong, Pierluca Bors\`o-Tan,
Vero Estrada-Gali\~nanes, and Bryan Ford | Limiting Lamport Exposure to Distant Failures in Globally-Managed
Distributed Systems | 14 pages, 9 figures, 5 algorithms, 1 table | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Globalized computing infrastructures offer the convenience and elasticity of
globally managed objects and services, but lack the resilience to distant
failures that localized infrastructures such as private clouds provide.
Providing both global management and resilience to distant failures, however,
poses a fundament... | [
{
"created": "Sun, 4 May 2014 00:35:25 GMT",
"version": "v1"
},
{
"created": "Sat, 12 May 2018 09:21:09 GMT",
"version": "v2"
},
{
"created": "Fri, 15 Jul 2022 16:06:21 GMT",
"version": "v3"
}
] | 2022-07-18 | [
[
"Băsescu",
"Cristina",
""
],
[
"Fragkouli",
"Georgia",
""
],
[
"Alp",
"Enis Ceyhun",
""
],
[
"Nowlan",
"Michael F.",
""
],
[
"Faleiro",
"Jose M.",
""
],
[
"Bosson",
"Gaylor",
""
],
[
"Cong",
"Kelong",
""
... | Globalized computing infrastructures offer the convenience and elasticity of globally managed objects and services, but lack the resilience to distant failures that localized infrastructures such as private clouds provide. Providing both global management and resilience to distant failures, however, poses a fundamental... |
2106.03937 | Zabir Al Nazi | Zabir Al Nazi, Sayed Mohammed Tasmimul Huda | Byakto Speech: Real-time long speech synthesis with convolutional neural
network: Transfer learning from English to Bangla | null | null | null | null | cs.SD cs.LG eess.AS | http://creativecommons.org/licenses/by/4.0/ | Speech synthesis is one of the challenging tasks to automate by deep
learning, also being a low-resource language there are very few attempts at
Bangla speech synthesis. Most of the existing works can't work with anything
other than simple Bangla characters script, very short sentences, etc. This
work attempts to sol... | [
{
"created": "Mon, 31 May 2021 20:39:35 GMT",
"version": "v1"
}
] | 2021-06-09 | [
[
"Nazi",
"Zabir Al",
""
],
[
"Huda",
"Sayed Mohammed Tasmimul",
""
]
] | Speech synthesis is one of the challenging tasks to automate by deep learning, also being a low-resource language there are very few attempts at Bangla speech synthesis. Most of the existing works can't work with anything other than simple Bangla characters script, very short sentences, etc. This work attempts to solve... |
2302.04515 | Clement Pernet | Cl\'ement Pernet (CASC), Hippolyte Signargout (CASC, ARIC), Gilles
Villard (ARIC) | Exact computations with quasiseparable matrices | null | null | null | null | cs.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Quasi-separable matrices are a class of rank-structured matriceswidely used
in numerical linear algebra and of growing interestin computer algebra, with
applications in e.g. the linearization ofpolynomial matrices. Various
representation formats exist for thesematrices that have rarely been
compared.We show how the m... | [
{
"created": "Thu, 9 Feb 2023 09:17:18 GMT",
"version": "v1"
}
] | 2023-02-10 | [
[
"Pernet",
"Clément",
"",
"CASC"
],
[
"Signargout",
"Hippolyte",
"",
"CASC, ARIC"
],
[
"Villard",
"Gilles",
"",
"ARIC"
]
] | Quasi-separable matrices are a class of rank-structured matriceswidely used in numerical linear algebra and of growing interestin computer algebra, with applications in e.g. the linearization ofpolynomial matrices. Various representation formats exist for thesematrices that have rarely been compared.We show how the mos... |
1205.3663 | Johannes Klaus Fichte | Johannes Klaus Fichte | The Good, the Bad, and the Odd: Cycles in Answer-Set Programs | null | null | null | null | cs.AI cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Backdoors of answer-set programs are sets of atoms that represent clever
reasoning shortcuts through the search space. Assignments to backdoor atoms
reduce the given program to several programs that belong to a tractable target
class. Previous research has considered target classes based on notions of
acyclicity wher... | [
{
"created": "Wed, 15 Feb 2012 20:19:57 GMT",
"version": "v1"
}
] | 2012-05-17 | [
[
"Fichte",
"Johannes Klaus",
""
]
] | Backdoors of answer-set programs are sets of atoms that represent clever reasoning shortcuts through the search space. Assignments to backdoor atoms reduce the given program to several programs that belong to a tractable target class. Previous research has considered target classes based on notions of acyclicity where ... |
2004.13513 | Arthur Douillard | Arthur Douillard, Matthieu Cord, Charles Ollion, Thomas Robert,
Eduardo Valle | PODNet: Pooled Outputs Distillation for Small-Tasks Incremental Learning | Accepted at ECCV 2020 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Lifelong learning has attracted much attention, but existing works still
struggle to fight catastrophic forgetting and accumulate knowledge over long
stretches of incremental learning. In this work, we propose PODNet, a model
inspired by representation learning. By carefully balancing the compromise
between rememberi... | [
{
"created": "Tue, 28 Apr 2020 13:45:23 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Jul 2020 13:20:18 GMT",
"version": "v2"
},
{
"created": "Tue, 6 Oct 2020 16:10:33 GMT",
"version": "v3"
}
] | 2020-10-07 | [
[
"Douillard",
"Arthur",
""
],
[
"Cord",
"Matthieu",
""
],
[
"Ollion",
"Charles",
""
],
[
"Robert",
"Thomas",
""
],
[
"Valle",
"Eduardo",
""
]
] | Lifelong learning has attracted much attention, but existing works still struggle to fight catastrophic forgetting and accumulate knowledge over long stretches of incremental learning. In this work, we propose PODNet, a model inspired by representation learning. By carefully balancing the compromise between remembering... |
2208.04066 | Yash Deshpande | Yash Deshpande, Cedomir Stefanovic, H. Murat G\"ursu, Wolfgang
Kellerer | On d-ary tree algorithms with successive interference cancellation | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we outline the approach for the derivation of the length of
the collision resolution interval for d-ary tree algorithms (TA) with gated
access and successive interference cancellation (SIC), conditioned on the
number of the contending users. This is the basic performance parameter for TA
with gated acc... | [
{
"created": "Mon, 8 Aug 2022 11:32:37 GMT",
"version": "v1"
}
] | 2022-08-09 | [
[
"Deshpande",
"Yash",
""
],
[
"Stefanovic",
"Cedomir",
""
],
[
"Gürsu",
"H. Murat",
""
],
[
"Kellerer",
"Wolfgang",
""
]
] | In this paper, we outline the approach for the derivation of the length of the collision resolution interval for d-ary tree algorithms (TA) with gated access and successive interference cancellation (SIC), conditioned on the number of the contending users. This is the basic performance parameter for TA with gated acces... |
0901.3906 | Manuel Carro | Pablo Chico de Guzman, Manuel Carro, Manuel V. Hermenegildo | A Program Transformation for Continuation Call-Based Tabled Execution | Part of the proceedings of CICLOPS 2008 | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The advantages of tabled evaluation regarding program termination and
reduction of complexity are well known --as are the significant implementation,
portability, and maintenance efforts that some proposals (especially those
based on suspension) require. This implementation effort is reduced by program
transformation... | [
{
"created": "Sun, 25 Jan 2009 15:40:48 GMT",
"version": "v1"
}
] | 2009-01-27 | [
[
"de Guzman",
"Pablo Chico",
""
],
[
"Carro",
"Manuel",
""
],
[
"Hermenegildo",
"Manuel V.",
""
]
] | The advantages of tabled evaluation regarding program termination and reduction of complexity are well known --as are the significant implementation, portability, and maintenance efforts that some proposals (especially those based on suspension) require. This implementation effort is reduced by program transformation-b... |
1907.03777 | Matthias Frey | Igor Bjelakovic, Matthias Frey, Slawomir Stanczak | Distributed Approximation of Functions over Fast Fading Channels with
Applications to Distributed Learning and the Max-Consensus Problem | null | 2019 57th Annual Allerton Conference on Communication, Control,
and Computing (Allerton), Monticello, IL, USA, September 24-27, 2019, pp.
1146-1153 | 10.1109/ALLERTON.2019.8919875 | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we consider the problem of distributed approximation of
functions over multiple-access channels with additive noise. In contrast to
previous works, we take fast fading into account and give explicit probability
bounds for the approximation error allowing us to derive bounds on the number
of channel uses... | [
{
"created": "Mon, 8 Jul 2019 18:00:09 GMT",
"version": "v1"
},
{
"created": "Sat, 21 Sep 2019 12:15:08 GMT",
"version": "v2"
}
] | 2021-03-01 | [
[
"Bjelakovic",
"Igor",
""
],
[
"Frey",
"Matthias",
""
],
[
"Stanczak",
"Slawomir",
""
]
] | In this work, we consider the problem of distributed approximation of functions over multiple-access channels with additive noise. In contrast to previous works, we take fast fading into account and give explicit probability bounds for the approximation error allowing us to derive bounds on the number of channel uses t... |
2208.08767 | Tommie Kerssies | Tommie Kerssies, Mert K{\i}l{\i}\c{c}kaya and Joaquin Vanschoren | Evaluating Continual Test-Time Adaptation for Contextual and Semantic
Domain Shifts | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, our goal is to adapt a pre-trained convolutional neural
network to domain shifts at test time. We do so continually with the incoming
stream of test batches, without labels. The existing literature mostly operates
on artificial shifts obtained via adversarial perturbations of a test image.
Motivated by... | [
{
"created": "Thu, 18 Aug 2022 11:05:55 GMT",
"version": "v1"
},
{
"created": "Sun, 12 Mar 2023 21:34:05 GMT",
"version": "v2"
}
] | 2023-03-14 | [
[
"Kerssies",
"Tommie",
""
],
[
"Kılıçkaya",
"Mert",
""
],
[
"Vanschoren",
"Joaquin",
""
]
] | In this paper, our goal is to adapt a pre-trained convolutional neural network to domain shifts at test time. We do so continually with the incoming stream of test batches, without labels. The existing literature mostly operates on artificial shifts obtained via adversarial perturbations of a test image. Motivated by t... |
2109.02485 | Samarth Bhatia | Samarth Bhatia (1), Yukti Makhija (1), Sneha Jayaswal (3), Shalendra
Singh (2), Ishaan Gupta (1) ((1) Indian Institute of Technology, Delhi, (2)
Armed Forces Medical College, Pune, (3) Christian Medical College Ludhiana) | Severity and Mortality Prediction Models to Triage Indian COVID-19
Patients | 31 pages, 6 figures, 8 tables. The first two authors (SB and YM) have
equal contribution. IG is the corresponding author (ishaan@iitd.ac.in)
Changes: Author List updated | null | null | null | cs.LG q-bio.PE | http://creativecommons.org/licenses/by/4.0/ | As the second wave in India mitigates, COVID-19 has now infected about 29
million patients countrywide, leading to more than 350 thousand people dead. As
the infections surged, the strain on the medical infrastructure in the country
became apparent. While the country vaccinates its population, opening up the
economy ... | [
{
"created": "Thu, 2 Sep 2021 23:15:04 GMT",
"version": "v1"
},
{
"created": "Sat, 23 Oct 2021 18:53:34 GMT",
"version": "v2"
}
] | 2021-10-26 | [
[
"Bhatia",
"Samarth",
""
],
[
"Makhija",
"Yukti",
""
],
[
"Jayaswal",
"Sneha",
""
],
[
"Singh",
"Shalendra",
""
],
[
"Gupta",
"Ishaan",
""
]
] | As the second wave in India mitigates, COVID-19 has now infected about 29 million patients countrywide, leading to more than 350 thousand people dead. As the infections surged, the strain on the medical infrastructure in the country became apparent. While the country vaccinates its population, opening up the economy ma... |
2304.14471 | Kangning Liu | Kangning Liu, Yu-Chuan Su, Wei (Alex) Hong, Ruijin Cang, Xuhui Jia | Controllable One-Shot Face Video Synthesis With Semantic Aware Prior | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The one-shot talking-head synthesis task aims to animate a source image to
another pose and expression, which is dictated by a driving frame. Recent
methods rely on warping the appearance feature extracted from the source, by
using motion fields estimated from the sparse keypoints, that are learned in an
unsupervised... | [
{
"created": "Thu, 27 Apr 2023 19:17:13 GMT",
"version": "v1"
}
] | 2023-05-01 | [
[
"Liu",
"Kangning",
"",
"Alex"
],
[
"Su",
"Yu-Chuan",
"",
"Alex"
],
[
"Wei",
"",
"",
"Alex"
],
[
"Hong",
"",
""
],
[
"Cang",
"Ruijin",
""
],
[
"Jia",
"Xuhui",
""
]
] | The one-shot talking-head synthesis task aims to animate a source image to another pose and expression, which is dictated by a driving frame. Recent methods rely on warping the appearance feature extracted from the source, by using motion fields estimated from the sparse keypoints, that are learned in an unsupervised m... |
2401.12051 | Dimitrije Anti\'c | Dimitrije Anti\'c, Garvita Tiwari, Batuhan Ozcomlekci, Riccardo Marin,
Gerard Pons-Moll | CloSe: A 3D Clothing Segmentation Dataset and Model | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | 3D Clothing modeling and datasets play crucial role in the entertainment,
animation, and digital fashion industries. Existing work often lacks detailed
semantic understanding or uses synthetic datasets, lacking realism and
personalization. To address this, we first introduce CloSe-D: a novel
large-scale dataset conta... | [
{
"created": "Mon, 22 Jan 2024 15:42:21 GMT",
"version": "v1"
}
] | 2024-01-23 | [
[
"Antić",
"Dimitrije",
""
],
[
"Tiwari",
"Garvita",
""
],
[
"Ozcomlekci",
"Batuhan",
""
],
[
"Marin",
"Riccardo",
""
],
[
"Pons-Moll",
"Gerard",
""
]
] | 3D Clothing modeling and datasets play crucial role in the entertainment, animation, and digital fashion industries. Existing work often lacks detailed semantic understanding or uses synthetic datasets, lacking realism and personalization. To address this, we first introduce CloSe-D: a novel large-scale dataset contain... |
1805.09549 | Iran Ramezanipour | Iran Ramezanipour, Parisa Nouri, Hirley Alves, Pedro J. H. Nardelli,
Richard Demo Souza and Ari Pouttu | Finite Blocklength Communications in Smart Grids for Dynamic Spectrum
Access and Locally Licensed Scenarios | The manuscript has been accepted for publication in IEEE sensors
journal, 2018 | null | 10.1109/JSEN.2018.2835571 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work focuses on the performance analysis of short blocklength
communication with application in smart grids. We use stochastic geometry to
compute in closed form the success probability of a typical message
transmission as a function of its size (i.e. blocklength), the number of
information bits and the density ... | [
{
"created": "Thu, 24 May 2018 08:34:39 GMT",
"version": "v1"
}
] | 2018-05-25 | [
[
"Ramezanipour",
"Iran",
""
],
[
"Nouri",
"Parisa",
""
],
[
"Alves",
"Hirley",
""
],
[
"Nardelli",
"Pedro J. H.",
""
],
[
"Souza",
"Richard Demo",
""
],
[
"Pouttu",
"Ari",
""
]
] | This work focuses on the performance analysis of short blocklength communication with application in smart grids. We use stochastic geometry to compute in closed form the success probability of a typical message transmission as a function of its size (i.e. blocklength), the number of information bits and the density of... |
1712.09652 | Huizhen Yu | Huizhen Yu | On Convergence of some Gradient-based Temporal-Differences Algorithms
for Off-Policy Learning | Revised technical report; added Section 4.2.4 and Section 4.3; 86
pages | null | null | null | cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider off-policy temporal-difference (TD) learning methods for policy
evaluation in Markov decision processes with finite spaces and discounted
reward criteria, and we present a collection of convergence results for several
gradient-based TD algorithms with linear function approximation. The algorithms
we analy... | [
{
"created": "Wed, 27 Dec 2017 18:43:21 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Mar 2018 22:41:33 GMT",
"version": "v2"
}
] | 2018-03-30 | [
[
"Yu",
"Huizhen",
""
]
] | We consider off-policy temporal-difference (TD) learning methods for policy evaluation in Markov decision processes with finite spaces and discounted reward criteria, and we present a collection of convergence results for several gradient-based TD algorithms with linear function approximation. The algorithms we analyze... |
cs/9809006 | Jim Gray | Werner Vogels, Dan Dumitriu, Ken Birman, Rod Gamache, Mike Massa, Rob
Short, John Vert, Joe Barrera | The Design and Architecture of the Microsoft Cluster Service -- A
Practical Approach to High-Availability and Scalability | Original document at:
http://research.microsoft.com/~gray/MSCS_FTCS98.doc | Proceedings of FTCS'98, June 23-25, 1998 in Munich, Germany | null | Microsoft Research MSR-TR-98-16 | cs.OS cs.DC | null | Microsoft Cluster Service (MSCS) extends the Win-dows NT operating system to
support high-availability services. The goal is to offer an execution
environment where off-the-shelf server applications can continue to operate,
even in the presence of node failures. Later ver-sions of MSCS will provide
scalability via a ... | [
{
"created": "Wed, 2 Sep 1998 17:11:54 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Vogels",
"Werner",
""
],
[
"Dumitriu",
"Dan",
""
],
[
"Birman",
"Ken",
""
],
[
"Gamache",
"Rod",
""
],
[
"Massa",
"Mike",
""
],
[
"Short",
"Rob",
""
],
[
"Vert",
"John",
""
],
[
"Barrera",
"Joe... | Microsoft Cluster Service (MSCS) extends the Win-dows NT operating system to support high-availability services. The goal is to offer an execution environment where off-the-shelf server applications can continue to operate, even in the presence of node failures. Later ver-sions of MSCS will provide scalability via a no... |
2211.06196 | Alexander Fabbri | Alexander R. Fabbri, Prafulla Kumar Choubey, Jesse Vig, Chien-Sheng
Wu, Caiming Xiong | Improving Factual Consistency in Summarization with Compression-Based
Post-Editing | EMNLP 2022 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | State-of-the-art summarization models still struggle to be factually
consistent with the input text. A model-agnostic way to address this problem is
post-editing the generated summaries. However, existing approaches typically
fail to remove entity errors if a suitable input entity replacement is not
available or may ... | [
{
"created": "Fri, 11 Nov 2022 13:35:38 GMT",
"version": "v1"
}
] | 2022-11-14 | [
[
"Fabbri",
"Alexander R.",
""
],
[
"Choubey",
"Prafulla Kumar",
""
],
[
"Vig",
"Jesse",
""
],
[
"Wu",
"Chien-Sheng",
""
],
[
"Xiong",
"Caiming",
""
]
] | State-of-the-art summarization models still struggle to be factually consistent with the input text. A model-agnostic way to address this problem is post-editing the generated summaries. However, existing approaches typically fail to remove entity errors if a suitable input entity replacement is not available or may in... |
2405.04714 | Kyle Stachowicz | Kyle Stachowicz and Sergey Levine | RACER: Epistemic Risk-Sensitive RL Enables Fast Driving with Fewer
Crashes | In review, RSS 2024 | null | null | null | cs.RO cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Reinforcement learning provides an appealing framework for robotic control
due to its ability to learn expressive policies purely through real-world
interaction. However, this requires addressing real-world constraints and
avoiding catastrophic failures during training, which might severely impede
both learning progr... | [
{
"created": "Tue, 7 May 2024 23:32:36 GMT",
"version": "v1"
}
] | 2024-05-09 | [
[
"Stachowicz",
"Kyle",
""
],
[
"Levine",
"Sergey",
""
]
] | Reinforcement learning provides an appealing framework for robotic control due to its ability to learn expressive policies purely through real-world interaction. However, this requires addressing real-world constraints and avoiding catastrophic failures during training, which might severely impede both learning progres... |
1905.03585 | Tamara Radivilova A | Igor Ivanisenko and Lyudmyla Kirichenko and Tamara Radivilova | Investigation of Multifractal Properties of Additive Data Stream | 4 pages, 5 figures, 7 equations. arXiv admin note: text overlap with
arXiv:1904.05925 | 2016 IEEE First International Conference on Data Stream Mining &
Processing (DSMP), Lviv, 2016, pp. 305-308 | 10.1109/DSMP.2016.7583564 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The work presents results of a numerical study of fractal characteristics of
multifractal stream at addition of stream, which does not have multifractal
properties. They showed that the generalized Hurst exponent of total stream
tends to one of original multifractal stream with increase in signal/noise
ratio.
| [
{
"created": "Tue, 16 Apr 2019 11:32:42 GMT",
"version": "v1"
}
] | 2019-05-10 | [
[
"Ivanisenko",
"Igor",
""
],
[
"Kirichenko",
"Lyudmyla",
""
],
[
"Radivilova",
"Tamara",
""
]
] | The work presents results of a numerical study of fractal characteristics of multifractal stream at addition of stream, which does not have multifractal properties. They showed that the generalized Hurst exponent of total stream tends to one of original multifractal stream with increase in signal/noise ratio. |
2311.05608 | Yichen Gong | Yichen Gong and Delong Ran and Jinyuan Liu and Conglei Wang and
Tianshuo Cong and Anyu Wang and Sisi Duan and Xiaoyun Wang | FigStep: Jailbreaking Large Vision-language Models via Typographic
Visual Prompts | Technical Report | null | null | null | cs.CR cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | Ensuring the safety of artificial intelligence-generated content (AIGC) is a
longstanding topic in the artificial intelligence (AI) community, and the
safety concerns associated with Large Language Models (LLMs) have been widely
investigated. Recently, large vision-language models (VLMs) represent an
unprecedented re... | [
{
"created": "Thu, 9 Nov 2023 18:59:11 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Dec 2023 17:54:16 GMT",
"version": "v2"
}
] | 2023-12-14 | [
[
"Gong",
"Yichen",
""
],
[
"Ran",
"Delong",
""
],
[
"Liu",
"Jinyuan",
""
],
[
"Wang",
"Conglei",
""
],
[
"Cong",
"Tianshuo",
""
],
[
"Wang",
"Anyu",
""
],
[
"Duan",
"Sisi",
""
],
[
"Wang",
"Xiaoy... | Ensuring the safety of artificial intelligence-generated content (AIGC) is a longstanding topic in the artificial intelligence (AI) community, and the safety concerns associated with Large Language Models (LLMs) have been widely investigated. Recently, large vision-language models (VLMs) represent an unprecedented revo... |
1105.6358 | Ali Al Khouri Dr. | Ali M. Al-Khouri | An Innovative Approach for E-Government Transformation | 22 Pages, 15 figures, 5 tables | International Journal of Managing Value and Supply Chains (IJMVSC)
Vol. 2, No. 1, March 2011 | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the immeasurable investment in e-government initiatives throughout
the world, such initiatives have yet to succeed in fully meeting expectations
and desired outcomes. A key objective of this research article is to support
the government of the UAE in realizing its vision of e-government
transformation. It pre... | [
{
"created": "Tue, 31 May 2011 18:41:10 GMT",
"version": "v1"
}
] | 2011-06-01 | [
[
"Al-Khouri",
"Ali M.",
""
]
] | Despite the immeasurable investment in e-government initiatives throughout the world, such initiatives have yet to succeed in fully meeting expectations and desired outcomes. A key objective of this research article is to support the government of the UAE in realizing its vision of e-government transformation. It prese... |
1802.09355 | Shaoshan Liu | Jie Tang, Shaoshan Liu, Songwen Pei, Stephane Zuckerman, Chen Liu,
Weisong Shi, Jean-Luc Gaudiot | Teaching Autonomous Driving Using a Modular and Integrated Approach | null | null | null | null | cs.CY cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Autonomous driving is not one single technology but rather a complex system
integrating many technologies, which means that teaching autonomous driving is
a challenging task. Indeed, most existing autonomous driving classes focus on
one of the technologies involved. This not only fails to provide a
comprehensive cove... | [
{
"created": "Thu, 22 Feb 2018 04:01:51 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Feb 2018 01:50:31 GMT",
"version": "v2"
}
] | 2018-02-28 | [
[
"Tang",
"Jie",
""
],
[
"Liu",
"Shaoshan",
""
],
[
"Pei",
"Songwen",
""
],
[
"Zuckerman",
"Stephane",
""
],
[
"Liu",
"Chen",
""
],
[
"Shi",
"Weisong",
""
],
[
"Gaudiot",
"Jean-Luc",
""
]
] | Autonomous driving is not one single technology but rather a complex system integrating many technologies, which means that teaching autonomous driving is a challenging task. Indeed, most existing autonomous driving classes focus on one of the technologies involved. This not only fails to provide a comprehensive covera... |
1502.04861 | Marius Pesavento | Adrian Schad, Ka L. Law, Marius Pesavento | Rank-Two Beamforming and Power Allocation in Multicasting Relay Networks | null | null | 10.1109/TSP.2015.2423255 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel single-group multicasting relay beamforming
scheme. We assume a source that transmits common messages via multiple
amplify-and-forward relays to multiple destinations. To increase the number of
degrees of freedom in the beamforming design, the relays process two received
signals join... | [
{
"created": "Tue, 17 Feb 2015 11:12:29 GMT",
"version": "v1"
}
] | 2023-07-19 | [
[
"Schad",
"Adrian",
""
],
[
"Law",
"Ka L.",
""
],
[
"Pesavento",
"Marius",
""
]
] | In this paper, we propose a novel single-group multicasting relay beamforming scheme. We assume a source that transmits common messages via multiple amplify-and-forward relays to multiple destinations. To increase the number of degrees of freedom in the beamforming design, the relays process two received signals jointl... |
2404.06433 | B.Sundar Rajan | Mallikharjuna Chinnapadamala, Charul Rajput and B. Sundar Rajan | A New Hotplug Coded Caching Scheme Using PDAs | 8 pages, 4 figures and 1 table. arXiv admin note: text overlap with
arXiv:2311.02856 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the original coded caching model introduced by Maddah-Ali and Niesen in
2014, the server starts broadcasting only after it receives demands from all
the users. So, all the users must be active during the delivery phase. In this
work, we consider a coded caching model called hotplug coded caching in which
some of t... | [
{
"created": "Tue, 9 Apr 2024 16:25:06 GMT",
"version": "v1"
}
] | 2024-04-10 | [
[
"Chinnapadamala",
"Mallikharjuna",
""
],
[
"Rajput",
"Charul",
""
],
[
"Rajan",
"B. Sundar",
""
]
] | In the original coded caching model introduced by Maddah-Ali and Niesen in 2014, the server starts broadcasting only after it receives demands from all the users. So, all the users must be active during the delivery phase. In this work, we consider a coded caching model called hotplug coded caching in which some of the... |
2309.04703 | Jinbo Wen | Jinbo Wen, Jiawen Kang, Zehui Xiong, Yang Zhang, Hongyang Du, Yutao
Jiao, Dusit Niyato | Task Freshness-aware Incentive Mechanism for Vehicle Twin Migration in
Vehicular Metaverses | null | null | null | null | cs.GT | http://creativecommons.org/licenses/by/4.0/ | Vehicular metaverse, which is treated as the future continuum between
automotive industry and metaverse, is envisioned as a blended immersive domain
as the digital twins of intelligent transportation systems. Vehicles access the
vehicular metaverses by their own Vehicle Twins (VTs) (e.g., avatars) that
resource-limit... | [
{
"created": "Sat, 9 Sep 2023 07:08:17 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Sep 2023 15:41:14 GMT",
"version": "v2"
}
] | 2023-09-13 | [
[
"Wen",
"Jinbo",
""
],
[
"Kang",
"Jiawen",
""
],
[
"Xiong",
"Zehui",
""
],
[
"Zhang",
"Yang",
""
],
[
"Du",
"Hongyang",
""
],
[
"Jiao",
"Yutao",
""
],
[
"Niyato",
"Dusit",
""
]
] | Vehicular metaverse, which is treated as the future continuum between automotive industry and metaverse, is envisioned as a blended immersive domain as the digital twins of intelligent transportation systems. Vehicles access the vehicular metaverses by their own Vehicle Twins (VTs) (e.g., avatars) that resource-limited... |
1811.03754 | Duong Nguyen | Duong Nguyen Anh, Hieu Nguyen Kiem, Vi Ngo Van | Neural sequence labeling for Vietnamese POS Tagging and NER | 5 pages | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | This paper presents a neural architecture for Vietnamese sequence labeling
tasks including part-of-speech (POS) tagging and named entity recognition
(NER). We applied the model described in \cite{lample-EtAl:2016:N16-1} that is
a combination of bidirectional Long-Short Term Memory and Conditional Random
Fields, which... | [
{
"created": "Fri, 9 Nov 2018 03:15:23 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Nov 2018 13:23:15 GMT",
"version": "v2"
}
] | 2018-11-13 | [
[
"Anh",
"Duong Nguyen",
""
],
[
"Kiem",
"Hieu Nguyen",
""
],
[
"Van",
"Vi Ngo",
""
]
] | This paper presents a neural architecture for Vietnamese sequence labeling tasks including part-of-speech (POS) tagging and named entity recognition (NER). We applied the model described in \cite{lample-EtAl:2016:N16-1} that is a combination of bidirectional Long-Short Term Memory and Conditional Random Fields, which r... |
1602.05257 | Deovrat Kakde | Deovrat Kakde, Arin Chaudhuri, Seunghyun Kong, Maria Jahja, Hansi
Jiang, Jorge Silva | Peak Criterion for Choosing Gaussian Kernel Bandwidth in Support Vector
Data Description | null | null | 10.1109/ICPHM.2017.7998302 | null | cs.LG stat.AP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Support Vector Data Description (SVDD) is a machine-learning technique used
for single class classification and outlier detection. SVDD formulation with
kernel function provides a flexible boundary around data. The value of kernel
function parameters affects the nature of the data boundary. For example, it is
observe... | [
{
"created": "Wed, 17 Feb 2016 00:51:18 GMT",
"version": "v1"
},
{
"created": "Wed, 11 May 2016 21:39:53 GMT",
"version": "v2"
},
{
"created": "Tue, 8 Aug 2017 18:00:45 GMT",
"version": "v3"
}
] | 2017-09-06 | [
[
"Kakde",
"Deovrat",
""
],
[
"Chaudhuri",
"Arin",
""
],
[
"Kong",
"Seunghyun",
""
],
[
"Jahja",
"Maria",
""
],
[
"Jiang",
"Hansi",
""
],
[
"Silva",
"Jorge",
""
]
] | Support Vector Data Description (SVDD) is a machine-learning technique used for single class classification and outlier detection. SVDD formulation with kernel function provides a flexible boundary around data. The value of kernel function parameters affects the nature of the data boundary. For example, it is observed ... |
2005.02940 | Remi Geraud-Stewart | Marc Beunardeau, \'Eric Brier, No\'emie Cartier, Aisling Connolly,
Nathana\"el Courant, R\'emi G\'eraud-Stewart, David Naccache, Ofer
Yifrach-Stav | Optimal Covid-19 Pool Testing with a priori Information | null | null | null | null | cs.AI cs.DM q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As humanity struggles to contain the global Covid-19 infection, prophylactic
actions are grandly slowed down by the shortage of testing kits. Governments
have taken several measures to work around this shortage: the FDA has become
more liberal on the approval of Covid-19 tests in the US. In the UK emergency
measures ... | [
{
"created": "Wed, 6 May 2020 17:08:56 GMT",
"version": "v1"
},
{
"created": "Mon, 11 May 2020 09:25:25 GMT",
"version": "v2"
}
] | 2020-05-12 | [
[
"Beunardeau",
"Marc",
""
],
[
"Brier",
"Éric",
""
],
[
"Cartier",
"Noémie",
""
],
[
"Connolly",
"Aisling",
""
],
[
"Courant",
"Nathanaël",
""
],
[
"Géraud-Stewart",
"Rémi",
""
],
[
"Naccache",
"David",
""
... | As humanity struggles to contain the global Covid-19 infection, prophylactic actions are grandly slowed down by the shortage of testing kits. Governments have taken several measures to work around this shortage: the FDA has become more liberal on the approval of Covid-19 tests in the US. In the UK emergency measures al... |
2303.09564 | Jiayi Wei | Jiayi Wei, Greg Durrett, Isil Dillig | TypeT5: Seq2seq Type Inference using Static Analysis | Published as a conference paper at ICLR 2023 | null | null | null | cs.SE cs.LG cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There has been growing interest in automatically predicting missing type
annotations in programs written in Python and JavaScript. While prior methods
have achieved impressive accuracy when predicting the most common types, they
often perform poorly on rare or complex types. In this paper, we present a new
type infer... | [
{
"created": "Thu, 16 Mar 2023 23:48:00 GMT",
"version": "v1"
}
] | 2023-03-20 | [
[
"Wei",
"Jiayi",
""
],
[
"Durrett",
"Greg",
""
],
[
"Dillig",
"Isil",
""
]
] | There has been growing interest in automatically predicting missing type annotations in programs written in Python and JavaScript. While prior methods have achieved impressive accuracy when predicting the most common types, they often perform poorly on rare or complex types. In this paper, we present a new type inferen... |
2403.09326 | Duotun Wang | Duotun Wang, Hengyu Meng, Zeyu Cai, Zhijing Shao, Qianxi Liu, Lin
Wang, Mingming Fan, Xiaohang Zhan, Zeyu Wang | HeadEvolver: Text to Head Avatars via Expressive and
Attribute-Preserving Mesh Deformation | 12 pages, 17 figures | null | null | null | cs.GR cs.AI | http://creativecommons.org/licenses/by/4.0/ | We present HeadEvolver, a novel framework to generate stylized head avatars
from text guidance. HeadEvolver uses locally learnable mesh deformation from a
template head mesh, producing high-quality digital assets for detail-preserving
editing and animation. To tackle the challenges of lacking fine-grained and
semanti... | [
{
"created": "Thu, 14 Mar 2024 12:15:23 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Jun 2024 04:50:36 GMT",
"version": "v2"
}
] | 2024-06-11 | [
[
"Wang",
"Duotun",
""
],
[
"Meng",
"Hengyu",
""
],
[
"Cai",
"Zeyu",
""
],
[
"Shao",
"Zhijing",
""
],
[
"Liu",
"Qianxi",
""
],
[
"Wang",
"Lin",
""
],
[
"Fan",
"Mingming",
""
],
[
"Zhan",
"Xiaohang... | We present HeadEvolver, a novel framework to generate stylized head avatars from text guidance. HeadEvolver uses locally learnable mesh deformation from a template head mesh, producing high-quality digital assets for detail-preserving editing and animation. To tackle the challenges of lacking fine-grained and semantic-... |
2004.05712 | Chiranjeeb Buragohain | Chiranjeeb Buragohain, Knut Magne Risvik, Paul Brett, Miguel Castro,
Wonhee Cho, Joshua Cowhig, Nikolas Gloy, Karthik Kalyanaraman, Richendra
Khanna, John Pao, Matthew Renzelmann, Alex Shamis, Timothy Tan and Shuheng
Zheng | A1: A Distributed In-Memory Graph Database | null | null | 10.1145/3318464.3386135 | null | cs.DB cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A1 is an in-memory distributed database used by the Bing search engine to
support complex queries over structured data. The key enablers for A1 are
availability of cheap DRAM and high speed RDMA (Remote Direct Memory Access)
networking in commodity hardware. A1 uses FaRM as its underlying storage layer
and builds the... | [
{
"created": "Sun, 12 Apr 2020 22:58:46 GMT",
"version": "v1"
}
] | 2020-04-14 | [
[
"Buragohain",
"Chiranjeeb",
""
],
[
"Risvik",
"Knut Magne",
""
],
[
"Brett",
"Paul",
""
],
[
"Castro",
"Miguel",
""
],
[
"Cho",
"Wonhee",
""
],
[
"Cowhig",
"Joshua",
""
],
[
"Gloy",
"Nikolas",
""
],
[
... | A1 is an in-memory distributed database used by the Bing search engine to support complex queries over structured data. The key enablers for A1 are availability of cheap DRAM and high speed RDMA (Remote Direct Memory Access) networking in commodity hardware. A1 uses FaRM as its underlying storage layer and builds the g... |
1906.02353 | Yi Ren | Yi Ren, Donald Goldfarb | Efficient Subsampled Gauss-Newton and Natural Gradient Methods for
Training Neural Networks | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present practical Levenberg-Marquardt variants of Gauss-Newton and natural
gradient methods for solving non-convex optimization problems that arise in
training deep neural networks involving enormous numbers of variables and huge
data sets. Our methods use subsampled Gauss-Newton or Fisher information
matrices and... | [
{
"created": "Wed, 5 Jun 2019 23:13:42 GMT",
"version": "v1"
}
] | 2019-06-07 | [
[
"Ren",
"Yi",
""
],
[
"Goldfarb",
"Donald",
""
]
] | We present practical Levenberg-Marquardt variants of Gauss-Newton and natural gradient methods for solving non-convex optimization problems that arise in training deep neural networks involving enormous numbers of variables and huge data sets. Our methods use subsampled Gauss-Newton or Fisher information matrices and e... |
1512.01375 | Veerle Timmermans | Tobias Harks, Veerle Timmermans | Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion
Games | 17 pages | null | null | null | cs.GT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study uniqueness of Nash equilibria in atomic splittable congestion games
and derive a uniqueness result based on polymatroid theory: when the strategy
space of every player is a bidirectional flow polymatroid, then equilibria are
unique. Bidirectional flow polymatroids are introduced as a subclass of
polymatroids... | [
{
"created": "Fri, 4 Dec 2015 11:25:25 GMT",
"version": "v1"
},
{
"created": "Tue, 8 Mar 2016 09:19:22 GMT",
"version": "v2"
},
{
"created": "Wed, 8 Aug 2018 07:01:46 GMT",
"version": "v3"
}
] | 2018-08-09 | [
[
"Harks",
"Tobias",
""
],
[
"Timmermans",
"Veerle",
""
]
] | We study uniqueness of Nash equilibria in atomic splittable congestion games and derive a uniqueness result based on polymatroid theory: when the strategy space of every player is a bidirectional flow polymatroid, then equilibria are unique. Bidirectional flow polymatroids are introduced as a subclass of polymatroids p... |
1202.4050 | Nishant Mehta | Nishant A. Mehta and Alexander G. Gray | On the Sample Complexity of Predictive Sparse Coding | Sparse Coding Stability Theorem from version 1 has been relaxed
considerably using a new notion of coding margin. Old Sparse Coding Stability
Theorem still in new version, now as Theorem 2. Presentation of all proofs
simplified/improved considerably. Paper reorganized. Empirical analysis
showing new coding marg... | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The goal of predictive sparse coding is to learn a representation of examples
as sparse linear combinations of elements from a dictionary, such that a
learned hypothesis linear in the new representation performs well on a
predictive task. Predictive sparse coding algorithms recently have demonstrated
impressive perfo... | [
{
"created": "Sat, 18 Feb 2012 02:28:49 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Oct 2012 00:07:13 GMT",
"version": "v2"
}
] | 2012-10-09 | [
[
"Mehta",
"Nishant A.",
""
],
[
"Gray",
"Alexander G.",
""
]
] | The goal of predictive sparse coding is to learn a representation of examples as sparse linear combinations of elements from a dictionary, such that a learned hypothesis linear in the new representation performs well on a predictive task. Predictive sparse coding algorithms recently have demonstrated impressive perform... |
2309.12510 | Yunye Gong | Yunye Gong, Yi Yao, Xiao Lin, Ajay Divakaran, Melinda Gervasio | Confidence Calibration for Systems with Cascaded Predictive Modules | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing conformal prediction algorithms estimate prediction intervals at
target confidence levels to characterize the performance of a regression model
on new test samples. However, considering an autonomous system consisting of
multiple modules, prediction intervals constructed for individual modules fall
short of ... | [
{
"created": "Thu, 21 Sep 2023 22:12:24 GMT",
"version": "v1"
}
] | 2023-09-25 | [
[
"Gong",
"Yunye",
""
],
[
"Yao",
"Yi",
""
],
[
"Lin",
"Xiao",
""
],
[
"Divakaran",
"Ajay",
""
],
[
"Gervasio",
"Melinda",
""
]
] | Existing conformal prediction algorithms estimate prediction intervals at target confidence levels to characterize the performance of a regression model on new test samples. However, considering an autonomous system consisting of multiple modules, prediction intervals constructed for individual modules fall short of ac... |
1502.04044 | Mohamed Hamid | Mohamed Hamid, Slimane Ben Slimane, and Niclas Bj\"orsell | Downlink Throughput Driven Channel Access Framework for Cognitive LTE
Femto-Cells | 30 pages, 11 figures. Submitted to IEEE Transactions on Wireless
Communications for review | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes an optimized sensing based channel access framework for
the LTE cognitive femto-cells, with an objective of maximizing the femto-cells
downlink throughput. Cognitive femto-cells opportunistically transmit on the
macro-cell channels when they are free of use. Those free channels are located
by mean... | [
{
"created": "Fri, 13 Feb 2015 16:18:25 GMT",
"version": "v1"
}
] | 2015-02-16 | [
[
"Hamid",
"Mohamed",
""
],
[
"Slimane",
"Slimane Ben",
""
],
[
"Björsell",
"Niclas",
""
]
] | This paper proposes an optimized sensing based channel access framework for the LTE cognitive femto-cells, with an objective of maximizing the femto-cells downlink throughput. Cognitive femto-cells opportunistically transmit on the macro-cell channels when they are free of use. Those free channels are located by means ... |
1806.00429 | Claudia Flores-Saviaga | Claudia Flores-Saviaga (1), Brian C. Keegan (2), Saiph Savage (1 and
3) ((1) West Virginia University, (2) University of Colorado Boulder, (3)
Universidad Nacional Autonoma de Mexico (UNAM)) | Mobilizing the Trump Train: Understanding Collective Action in a
Political Trolling Community | null | International 12th AAAI Conference on Web and Social Media (ICWSM
2018) | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Political trolls initiate online discord not only for the lulz (laughs) but
also for ideological reasons, such as promoting their desired political
candidates. Political troll groups recently gained spotlight because they were
considered central in helping Donald Trump win the 2016 US presidential
election, which inv... | [
{
"created": "Fri, 1 Jun 2018 16:35:42 GMT",
"version": "v1"
}
] | 2018-06-04 | [
[
"Flores-Saviaga",
"Claudia",
"",
"1 and\n 3"
],
[
"Keegan",
"Brian C.",
"",
"1 and\n 3"
],
[
"Savage",
"Saiph",
"",
"1 and\n 3"
]
] | Political trolls initiate online discord not only for the lulz (laughs) but also for ideological reasons, such as promoting their desired political candidates. Political troll groups recently gained spotlight because they were considered central in helping Donald Trump win the 2016 US presidential election, which invol... |
2211.07923 | Mitsunori Ogihara | Mitsunori Ogihara and Kei Uchizawa | A Theory for Discrete-time Boolean Finite Dynamical Systems with
Uncertainty | 37 pages | null | null | null | cs.CC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Dynamical Systems is a field that studies the collective behavior of objects
that update their states according to some rules. Discrete-time Boolean Finite
Dynamical System (DT-BFDS) is a subfield where the systems have some finite
number of objects whose states are Boolean values, and the state updates occur
in disc... | [
{
"created": "Tue, 15 Nov 2022 06:12:34 GMT",
"version": "v1"
}
] | 2022-11-16 | [
[
"Ogihara",
"Mitsunori",
""
],
[
"Uchizawa",
"Kei",
""
]
] | Dynamical Systems is a field that studies the collective behavior of objects that update their states according to some rules. Discrete-time Boolean Finite Dynamical System (DT-BFDS) is a subfield where the systems have some finite number of objects whose states are Boolean values, and the state updates occur in discre... |
1409.6584 | Bernhard Rumpe | Fred W. Rauskolb, Kai Berger, Christian Lipski, Marcus Magnor, Karsten
Cornelsen, Jan Effertz, Thomas Form, Fabian Graefe, Sebastian Ohl, Walter
Schumacher, J\"orn Marten Wille, Peter Hecker, Tobias Nothdurft, Michael
Doering, Kai Homeier, Johannes Morgenroth, Lars Wolf, Christian Basarke,
Christian Berger, Tim... | Caroline: An Autonomously Driving Vehicle for Urban Environments | 68 pages, 7 figures | M. Buehler, K. Iagnemma, S. Singh (Eds.). The DARPA Urban
Challenge - Autonomous Vehicles in City Traffic. Springer Tracts in Advanced
Robotics, Volume 56, pp. 441-508, 2010 | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The 2007 DARPA Urban Challenge afforded the golden opportunity for the
Technische Universit\"at Braunschweig to demonstrate its abilities to develop
an autonomously driving vehicle to compete with the world's best competitors.
After several stages of qualification, our team CarOLO qualified early for the
DARPA Urban ... | [
{
"created": "Mon, 22 Sep 2014 11:57:55 GMT",
"version": "v1"
}
] | 2014-09-24 | [
[
"Rauskolb",
"Fred W.",
""
],
[
"Berger",
"Kai",
""
],
[
"Lipski",
"Christian",
""
],
[
"Magnor",
"Marcus",
""
],
[
"Cornelsen",
"Karsten",
""
],
[
"Effertz",
"Jan",
""
],
[
"Form",
"Thomas",
""
],
[
... | The 2007 DARPA Urban Challenge afforded the golden opportunity for the Technische Universit\"at Braunschweig to demonstrate its abilities to develop an autonomously driving vehicle to compete with the world's best competitors. After several stages of qualification, our team CarOLO qualified early for the DARPA Urban Ch... |
2104.03651 | Daniel Reti | Daniel Reti, Norman Becker | Escape the Fake: Introducing Simulated Container-Escapes for Honeypots | null | 2020 Workshop on Next Generation Networks and Applications (NGNA) | null | null | cs.CR cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the field of network security, the concept of honeypots is well
established in research as well as in production. Honeypots are used to imitate
a legitimate target on the network and to raise an alert on any interaction.
This does not only help learning about a breach, but also allows researchers to
study the tech... | [
{
"created": "Thu, 8 Apr 2021 10:16:03 GMT",
"version": "v1"
}
] | 2021-04-09 | [
[
"Reti",
"Daniel",
""
],
[
"Becker",
"Norman",
""
]
] | In the field of network security, the concept of honeypots is well established in research as well as in production. Honeypots are used to imitate a legitimate target on the network and to raise an alert on any interaction. This does not only help learning about a breach, but also allows researchers to study the techni... |
1506.00412 | Demia Della Penda | Demia Della Penda, Liqun Fu, and Mikael Johansson | Energy efficient D2D communications in dynamic TDD systems | Submitted to IEEE Journal of Selected Areas in Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Network-assisted device-to-device communication is a promising technology for
improving the performance of proximity-based services. This paper demonstrates
how the integration of device-to-device communications and dynamic
time-division duplex can improve the energy efficiency of future cellular
networks, leading to... | [
{
"created": "Mon, 1 Jun 2015 09:59:19 GMT",
"version": "v1"
}
] | 2015-06-02 | [
[
"Della Penda",
"Demia",
""
],
[
"Fu",
"Liqun",
""
],
[
"Johansson",
"Mikael",
""
]
] | Network-assisted device-to-device communication is a promising technology for improving the performance of proximity-based services. This paper demonstrates how the integration of device-to-device communications and dynamic time-division duplex can improve the energy efficiency of future cellular networks, leading to a... |
1711.00536 | Rossano Schifanella | Luca M. Aiello, Rossano Schifanella, Miriam Redi, Stacey Svetlichnaya,
Frank Liu, Simon Osindero | Beautiful and damned. Combined effect of content quality and social ties
on user engagement | 13 pages, 12 figures, final version published in IEEE Transactions on
Knowledge and Data Engineering (Volume: PP, Issue: 99) | null | 10.1109/TKDE.2017.2747552 | null | cs.SI cs.AI cs.CV cs.MM physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | User participation in online communities is driven by the intertwinement of
the social network structure with the crowd-generated content that flows along
its links. These aspects are rarely explored jointly and at scale. By looking
at how users generate and access pictures of varying beauty on Flickr, we
investigate... | [
{
"created": "Wed, 1 Nov 2017 20:48:30 GMT",
"version": "v1"
}
] | 2017-11-03 | [
[
"Aiello",
"Luca M.",
""
],
[
"Schifanella",
"Rossano",
""
],
[
"Redi",
"Miriam",
""
],
[
"Svetlichnaya",
"Stacey",
""
],
[
"Liu",
"Frank",
""
],
[
"Osindero",
"Simon",
""
]
] | User participation in online communities is driven by the intertwinement of the social network structure with the crowd-generated content that flows along its links. These aspects are rarely explored jointly and at scale. By looking at how users generate and access pictures of varying beauty on Flickr, we investigate h... |
0912.3004 | Panagiotis Cheilaris | Panagiotis Cheilaris and Geza Toth | Graph unique-maximum and conflict-free colorings | null | null | null | null | cs.DM cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the relationship between two kinds of vertex colorings of
graphs: unique-maximum colorings and conflict-free colorings. In a
unique-maximum coloring, the colors are ordered, and in every path of the graph
the maximum color appears only once. In a conflict-free coloring, in every path
of the graph there... | [
{
"created": "Tue, 15 Dec 2009 21:01:42 GMT",
"version": "v1"
}
] | 2009-12-17 | [
[
"Cheilaris",
"Panagiotis",
""
],
[
"Toth",
"Geza",
""
]
] | We investigate the relationship between two kinds of vertex colorings of graphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ordered, and in every path of the graph the maximum color appears only once. In a conflict-free coloring, in every path of the graph there i... |
1609.09395 | Constantinos Heracleous | Constantinos Heracleous | Micropolis Interdependency Modeling using Open Hybrid Automata | 7 pages | null | null | null | cs.SY | http://creativecommons.org/licenses/by/4.0/ | Micropolis is a virtual city that is used for various studies, such as
modeling and analyzing water networks. In this paper we model the various
interdependencies between three major infrastructures in Micropolis, the power
system, the communication network and the water network, in order to study
cascades effects be... | [
{
"created": "Tue, 27 Sep 2016 20:47:43 GMT",
"version": "v1"
}
] | 2016-09-30 | [
[
"Heracleous",
"Constantinos",
""
]
] | Micropolis is a virtual city that is used for various studies, such as modeling and analyzing water networks. In this paper we model the various interdependencies between three major infrastructures in Micropolis, the power system, the communication network and the water network, in order to study cascades effects betw... |
2211.11380 | Yuhao Wang | Yuhao Wang, Kai Wang, Xiaohong Liu, Tianrun Gao, Jingyue Zhang,
Guangyu Wang | Self adaptive global-local feature enhancement for radiology report
generation | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Automated radiology report generation aims at automatically generating a
detailed description of medical images, which can greatly alleviate the
workload of radiologists and provide better medical services to remote areas.
Most existing works pay attention to the holistic impression of medical images,
failing to util... | [
{
"created": "Mon, 21 Nov 2022 11:50:42 GMT",
"version": "v1"
}
] | 2022-11-22 | [
[
"Wang",
"Yuhao",
""
],
[
"Wang",
"Kai",
""
],
[
"Liu",
"Xiaohong",
""
],
[
"Gao",
"Tianrun",
""
],
[
"Zhang",
"Jingyue",
""
],
[
"Wang",
"Guangyu",
""
]
] | Automated radiology report generation aims at automatically generating a detailed description of medical images, which can greatly alleviate the workload of radiologists and provide better medical services to remote areas. Most existing works pay attention to the holistic impression of medical images, failing to utiliz... |
2002.11495 | Joni Pajarinen | Joni Pajarinen, Oleg Arenz, Jan Peters, Gerhard Neumann | Probabilistic approach to physical object disentangling | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Physically disentangling entangled objects from each other is a problem
encountered in waste segregation or in any task that requires disassembly of
structures. Often there are no object models, and, especially with cluttered
irregularly shaped objects, the robot can not create a model of the scene due
to occlusion. ... | [
{
"created": "Wed, 26 Feb 2020 14:01:24 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Apr 2021 13:06:49 GMT",
"version": "v2"
}
] | 2021-04-13 | [
[
"Pajarinen",
"Joni",
""
],
[
"Arenz",
"Oleg",
""
],
[
"Peters",
"Jan",
""
],
[
"Neumann",
"Gerhard",
""
]
] | Physically disentangling entangled objects from each other is a problem encountered in waste segregation or in any task that requires disassembly of structures. Often there are no object models, and, especially with cluttered irregularly shaped objects, the robot can not create a model of the scene due to occlusion. On... |
2308.10410 | Irene Li | Fan Gao, Hang Jiang, Rui Yang, Qingcheng Zeng, Jinghui Lu, Moritz
Blum, Dairui Liu, Tianwei She, Yuang Jiang, Irene Li | Large Language Models on Wikipedia-Style Survey Generation: an
Evaluation in NLP Concepts | null | ACL 2024 Findings | null | null | cs.CL | http://creativecommons.org/publicdomain/zero/1.0/ | Educational materials such as survey articles in specialized fields like
computer science traditionally require tremendous expert inputs and are
therefore expensive to create and update. Recently, Large Language Models
(LLMs) have achieved significant success across various general tasks. However,
their effectiveness... | [
{
"created": "Mon, 21 Aug 2023 01:32:45 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Sep 2023 00:03:11 GMT",
"version": "v2"
},
{
"created": "Thu, 22 Feb 2024 02:54:19 GMT",
"version": "v3"
},
{
"created": "Thu, 23 May 2024 12:42:06 GMT",
"version": "v4"
}
] | 2024-05-24 | [
[
"Gao",
"Fan",
""
],
[
"Jiang",
"Hang",
""
],
[
"Yang",
"Rui",
""
],
[
"Zeng",
"Qingcheng",
""
],
[
"Lu",
"Jinghui",
""
],
[
"Blum",
"Moritz",
""
],
[
"Liu",
"Dairui",
""
],
[
"She",
"Tianwei",
... | Educational materials such as survey articles in specialized fields like computer science traditionally require tremendous expert inputs and are therefore expensive to create and update. Recently, Large Language Models (LLMs) have achieved significant success across various general tasks. However, their effectiveness a... |
2010.16095 | Mrigank Raman | Mrigank Raman, Ojal Kumar, Arpan Chattopadhyay | Centralized active tracking of a Markov chain with unknown dynamics | Accepted at the IEEE MASS 2020 Conference | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, selection of an active sensor subset for tracking a discrete
time, finite state Markov chain having an unknown transition probability matrix
(TPM) is considered. A total of N sensors are available for making observations
of the Markov chain, out of which a subset of sensors are activated each time
in o... | [
{
"created": "Fri, 30 Oct 2020 06:32:11 GMT",
"version": "v1"
}
] | 2020-11-02 | [
[
"Raman",
"Mrigank",
""
],
[
"Kumar",
"Ojal",
""
],
[
"Chattopadhyay",
"Arpan",
""
]
] | In this paper, selection of an active sensor subset for tracking a discrete time, finite state Markov chain having an unknown transition probability matrix (TPM) is considered. A total of N sensors are available for making observations of the Markov chain, out of which a subset of sensors are activated each time in ord... |
1910.08914 | Yuhang Li | Yuhang Li, Xuejin Chen, Feng Wu, and Zheng-Jun Zha | LinesToFacePhoto: Face Photo Generation from Lines with Conditional
Self-Attention Generative Adversarial Network | null | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we explore the task of generating photo-realistic face images
from lines. Previous methods based on conditional generative adversarial
networks (cGANs) have shown their power to generate visually plausible images
when a conditional image and an output image share well-aligned structures.
However, these... | [
{
"created": "Sun, 20 Oct 2019 07:05:24 GMT",
"version": "v1"
}
] | 2019-10-22 | [
[
"Li",
"Yuhang",
""
],
[
"Chen",
"Xuejin",
""
],
[
"Wu",
"Feng",
""
],
[
"Zha",
"Zheng-Jun",
""
]
] | In this paper, we explore the task of generating photo-realistic face images from lines. Previous methods based on conditional generative adversarial networks (cGANs) have shown their power to generate visually plausible images when a conditional image and an output image share well-aligned structures. However, these m... |
1809.10846 | Najma Gill | Najma Gill | Comparison of Self-Aware and Organic Computing Systems | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With increasing complexity and heterogeneity of computing devices, it has
become crucial for system to be autonomous, adaptive to dynamic environment,
robust, flexible, and having so called self-*properties. These autonomous
systems are called organic computing(OC) systems. OC system was proposed as a
solution to tac... | [
{
"created": "Tue, 28 Aug 2018 13:52:44 GMT",
"version": "v1"
}
] | 2018-10-01 | [
[
"Gill",
"Najma",
""
]
] | With increasing complexity and heterogeneity of computing devices, it has become crucial for system to be autonomous, adaptive to dynamic environment, robust, flexible, and having so called self-*properties. These autonomous systems are called organic computing(OC) systems. OC system was proposed as a solution to tackl... |
2304.14790 | Jose Manuel S\'anchez Ruiz | Jos\'e Manuel S\'anchez Ruiz, Francisco Jos\'e Dom\'inguez Mayo,
Xavier Oriol, Jos\'e Francisco Crespo, David Benavides, Ernest Teniente | A Benchmarking Proposal for DevOps Practices on Open Source Software
Projects | 18 pages, 10 figures | null | null | null | cs.SE cs.PF | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The popularity of open-source software (OSS) projects has grown significantly
over the last few years with more organizations relying on them. As these
projects become larger, the need for higher quality also increases. DevOps
practices have been shown to improve quality and performance. The DORA
benchmarking reports... | [
{
"created": "Fri, 28 Apr 2023 12:00:16 GMT",
"version": "v1"
}
] | 2023-05-01 | [
[
"Ruiz",
"José Manuel Sánchez",
""
],
[
"Mayo",
"Francisco José Domínguez",
""
],
[
"Oriol",
"Xavier",
""
],
[
"Crespo",
"José Francisco",
""
],
[
"Benavides",
"David",
""
],
[
"Teniente",
"Ernest",
""
]
] | The popularity of open-source software (OSS) projects has grown significantly over the last few years with more organizations relying on them. As these projects become larger, the need for higher quality also increases. DevOps practices have been shown to improve quality and performance. The DORA benchmarking reports p... |
2107.13429 | Weixia Zhang | Weixia Zhang and Kede Ma and Guangtao Zhai and Xiaokang Yang | Task-Specific Normalization for Continual Learning of Blind Image
Quality Models | Accepted by IEEE T-IP | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In this paper, we present a simple yet effective continual learning method
for blind image quality assessment (BIQA) with improved quality prediction
accuracy, plasticity-stability trade-off, and task-order/-length robustness.
The key step in our approach is to freeze all convolution filters of a
pre-trained deep neu... | [
{
"created": "Wed, 28 Jul 2021 15:21:01 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Mar 2023 06:39:53 GMT",
"version": "v2"
},
{
"created": "Mon, 19 Feb 2024 15:36:23 GMT",
"version": "v3"
}
] | 2024-02-20 | [
[
"Zhang",
"Weixia",
""
],
[
"Ma",
"Kede",
""
],
[
"Zhai",
"Guangtao",
""
],
[
"Yang",
"Xiaokang",
""
]
] | In this paper, we present a simple yet effective continual learning method for blind image quality assessment (BIQA) with improved quality prediction accuracy, plasticity-stability trade-off, and task-order/-length robustness. The key step in our approach is to freeze all convolution filters of a pre-trained deep neura... |
cs/0012002 | Abdun | Md. Enamul Karim (1), Abdun Naser Mahmood (1) ((1) University of
Dhaka) | Random Shuffling to Reduce Disorder in Adaptive Sorting Scheme | 7 pages, 2 tables | null | null | null | cs.DS | null | In this paper we present a random shuffling scheme to apply with adaptive
sorting algorithms. Adaptive sorting algorithms utilize the presortedness
present in a given sequence. We have probabilistically increased the amount of
presortedness present in a sequence by using a random shuffling technique that
requires lit... | [
{
"created": "Sat, 2 Dec 2000 17:47:26 GMT",
"version": "v1"
}
] | 2016-08-31 | [
[
"Karim",
"Md. Enamul",
""
],
[
"Mahmood",
"Abdun Naser",
""
]
] | In this paper we present a random shuffling scheme to apply with adaptive sorting algorithms. Adaptive sorting algorithms utilize the presortedness present in a given sequence. We have probabilistically increased the amount of presortedness present in a sequence by using a random shuffling technique that requires littl... |
2311.03797 | Daogao Liu | Hilal Asi, Daogao Liu | User-level Differentially Private Stochastic Convex Optimization:
Efficient Algorithms with Optimal Rates | null | null | null | null | cs.LG cs.CR cs.DS math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study differentially private stochastic convex optimization (DP-SCO) under
user-level privacy, where each user may hold multiple data items. Existing work
for user-level DP-SCO either requires super-polynomial runtime [Ghazi et al.
(2023)] or requires the number of users to grow polynomially with the
dimensionalit... | [
{
"created": "Tue, 7 Nov 2023 08:26:51 GMT",
"version": "v1"
}
] | 2023-11-08 | [
[
"Asi",
"Hilal",
""
],
[
"Liu",
"Daogao",
""
]
] | We study differentially private stochastic convex optimization (DP-SCO) under user-level privacy, where each user may hold multiple data items. Existing work for user-level DP-SCO either requires super-polynomial runtime [Ghazi et al. (2023)] or requires the number of users to grow polynomially with the dimensionality ... |
2405.15861 | Zhe Li | Zhe Li, Bicheng Ying, Zidong Liu, Haibo Yang | Achieving Dimension-Free Communication in Federated Learning via
Zeroth-Order Optimization | null | null | null | null | cs.LG cs.DC | http://creativecommons.org/licenses/by/4.0/ | Federated Learning (FL) offers a promising framework for collaborative and
privacy-preserving machine learning across distributed data sources. However,
the substantial communication costs associated with FL pose a significant
challenge to its efficiency. Specifically, in each communication round, the
communication c... | [
{
"created": "Fri, 24 May 2024 18:07:05 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Jun 2024 04:52:25 GMT",
"version": "v2"
}
] | 2024-06-25 | [
[
"Li",
"Zhe",
""
],
[
"Ying",
"Bicheng",
""
],
[
"Liu",
"Zidong",
""
],
[
"Yang",
"Haibo",
""
]
] | Federated Learning (FL) offers a promising framework for collaborative and privacy-preserving machine learning across distributed data sources. However, the substantial communication costs associated with FL pose a significant challenge to its efficiency. Specifically, in each communication round, the communication cos... |
2209.10017 | Jonathan Ponniah | Jonathan Ponniah | Compress-Forward Schemes for General Networks | arXiv admin note: text overlap with arXiv:1801.04310 | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | Compress-forward (CF) schemes are studied in general networks. The CF rate
for the one-relay channel defines outerbounds on both the CF rate for general
networks and the compression rate-vector region supporting this rate. We show
the outerbound is achievable using regular decoding with constant encoding
delays, avoi... | [
{
"created": "Tue, 20 Sep 2022 21:57:36 GMT",
"version": "v1"
}
] | 2022-09-22 | [
[
"Ponniah",
"Jonathan",
""
]
] | Compress-forward (CF) schemes are studied in general networks. The CF rate for the one-relay channel defines outerbounds on both the CF rate for general networks and the compression rate-vector region supporting this rate. We show the outerbound is achievable using regular decoding with constant encoding delays, avoidi... |
1503.03378 | Marlon Dumas | T\~onis Saar, Marlon Dumas, Marti Kaljuve and Nataliia Semenenko | Browserbite: Cross-Browser Testing via Image Processing | 28 pages, 16 figures | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cross-browser compatibility testing is concerned with identifying perceptible
differences in the way a Web page is rendered across different browsers or
configurations thereof. Existing automated cross-browser compatibility testing
methods are generally based on Document Object Model (DOM) analysis, or in some
cases,... | [
{
"created": "Wed, 11 Mar 2015 15:37:15 GMT",
"version": "v1"
}
] | 2015-03-12 | [
[
"Saar",
"Tõnis",
""
],
[
"Dumas",
"Marlon",
""
],
[
"Kaljuve",
"Marti",
""
],
[
"Semenenko",
"Nataliia",
""
]
] | Cross-browser compatibility testing is concerned with identifying perceptible differences in the way a Web page is rendered across different browsers or configurations thereof. Existing automated cross-browser compatibility testing methods are generally based on Document Object Model (DOM) analysis, or in some cases, a... |
2311.06861 | Xinquan Wang | Xinquan Wang, Fenghao Zhu, Qianyun Zhou, Qihao Yu, Chongwen Huang,
Ahmed Alhammadi, Zhaoyang Zhang, Chau Yuen, and M\'erouane Debbah | Energy-efficient Beamforming for RISs-aided Communications: Gradient
Based Meta Learning | 5 pages, 8 figures. Accepted in IEEE ICC 2024 (GCSN symposium) | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reconfigurable intelligent surfaces (RISs) have become a promising technology
to meet the requirements of energy efficiency and scalability in future
six-generation (6G) communications. However, a significant challenge in
RISs-aided communications is the joint optimization of active and passive
beamforming at base st... | [
{
"created": "Sun, 12 Nov 2023 14:34:08 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Feb 2024 15:04:02 GMT",
"version": "v2"
},
{
"created": "Fri, 16 Feb 2024 13:17:27 GMT",
"version": "v3"
}
] | 2024-02-19 | [
[
"Wang",
"Xinquan",
""
],
[
"Zhu",
"Fenghao",
""
],
[
"Zhou",
"Qianyun",
""
],
[
"Yu",
"Qihao",
""
],
[
"Huang",
"Chongwen",
""
],
[
"Alhammadi",
"Ahmed",
""
],
[
"Zhang",
"Zhaoyang",
""
],
[
"Yuen",... | Reconfigurable intelligent surfaces (RISs) have become a promising technology to meet the requirements of energy efficiency and scalability in future six-generation (6G) communications. However, a significant challenge in RISs-aided communications is the joint optimization of active and passive beamforming at base stat... |
2105.09742 | Aashish Agarwal | Aashish Agarwal and Torsten Zesch | Robustness of end-to-end Automatic Speech Recognition Models -- A Case
Study using Mozilla DeepSpeech | null | null | null | null | cs.CL cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | When evaluating the performance of automatic speech recognition models,
usually word error rate within a certain dataset is used. Special care must be
taken in understanding the dataset in order to report realistic performance
numbers. We argue that many performance numbers reported probably underestimate
the expecte... | [
{
"created": "Sat, 8 May 2021 16:46:44 GMT",
"version": "v1"
}
] | 2021-05-21 | [
[
"Agarwal",
"Aashish",
""
],
[
"Zesch",
"Torsten",
""
]
] | When evaluating the performance of automatic speech recognition models, usually word error rate within a certain dataset is used. Special care must be taken in understanding the dataset in order to report realistic performance numbers. We argue that many performance numbers reported probably underestimate the expected ... |
1606.09163 | Akash Kumar Dhaka | Akash Kumar Dhaka and Giampiero Salvi | Optimising The Input Window Alignment in CD-DNN Based Phoneme
Recognition for Low Latency Processing | 4 pages, 3 figures | null | null | null | cs.CL cs.CV cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a systematic analysis on the performance of a phonetic recogniser
when the window of input features is not symmetric with respect to the current
frame. The recogniser is based on Context Dependent Deep Neural Networks
(CD-DNNs) and Hidden Markov Models (HMMs). The objective is to reduce the
latency of the ... | [
{
"created": "Wed, 29 Jun 2016 15:51:44 GMT",
"version": "v1"
}
] | 2016-06-30 | [
[
"Dhaka",
"Akash Kumar",
""
],
[
"Salvi",
"Giampiero",
""
]
] | We present a systematic analysis on the performance of a phonetic recogniser when the window of input features is not symmetric with respect to the current frame. The recogniser is based on Context Dependent Deep Neural Networks (CD-DNNs) and Hidden Markov Models (HMMs). The objective is to reduce the latency of the sy... |
2307.06479 | Emek Baris Kucuktabak | Emek Bar{\i}\c{s} K\"u\c{c}\"uktabak, Yue Wen, Matthew Short, Efe
Demirba\c{s}, Kevin Lynch, Jose Pons | Virtual Physical Coupling of Two Lower-Limb Exoskeletons | 6 pages, 9 figures, accepted at 2023 IEEE International Conference on
Rehabilitation Robotics (ICORR) | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Physical interaction between individuals plays an important role in human
motor learning and performance during shared tasks. Using robotic devices,
researchers have studied the effects of dyadic haptic interaction mostly
focusing on the upper-limb. Developing infrastructure that enables physical
interactions between... | [
{
"created": "Wed, 12 Jul 2023 22:43:41 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Jul 2023 22:08:51 GMT",
"version": "v2"
}
] | 2023-07-24 | [
[
"Küçüktabak",
"Emek Barış",
""
],
[
"Wen",
"Yue",
""
],
[
"Short",
"Matthew",
""
],
[
"Demirbaş",
"Efe",
""
],
[
"Lynch",
"Kevin",
""
],
[
"Pons",
"Jose",
""
]
] | Physical interaction between individuals plays an important role in human motor learning and performance during shared tasks. Using robotic devices, researchers have studied the effects of dyadic haptic interaction mostly focusing on the upper-limb. Developing infrastructure that enables physical interactions between m... |
2208.12653 | Jianing Li | Jianing Li, Jiaming Liu, Xiaobao Wei, Jiyuan Zhang, Ming Lu, Lei Ma,
Li Du, Tiejun Huang, Shanghang Zhang | Uncertainty Guided Depth Fusion for Spike Camera | 18 pages, 11 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Depth estimation is essential for various important real-world applications
such as autonomous driving. However, it suffers from severe performance
degradation in high-velocity scenario since traditional cameras can only
capture blurred images. To deal with this problem, the spike camera is designed
to capture the pi... | [
{
"created": "Fri, 26 Aug 2022 13:04:01 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Aug 2022 06:48:58 GMT",
"version": "v2"
}
] | 2022-08-30 | [
[
"Li",
"Jianing",
""
],
[
"Liu",
"Jiaming",
""
],
[
"Wei",
"Xiaobao",
""
],
[
"Zhang",
"Jiyuan",
""
],
[
"Lu",
"Ming",
""
],
[
"Ma",
"Lei",
""
],
[
"Du",
"Li",
""
],
[
"Huang",
"Tiejun",
""
... | Depth estimation is essential for various important real-world applications such as autonomous driving. However, it suffers from severe performance degradation in high-velocity scenario since traditional cameras can only capture blurred images. To deal with this problem, the spike camera is designed to capture the pixe... |
0908.0932 | Grenville Croll | M. Sriram Iyengar, John R. Svirbely | The Medical Algorithms Project | 6 Pages, 2 Colour Figures | Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2009 113-118
ISBN 978-1-905617-89-0 | null | null | cs.HC cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Medical Algorithms Project, a web-based resource located at
www.medal.org, is the world's largest collection of medical-related
spreadsheets, consisting of over 13,500 Excel spreadsheets each encoding a
medical algorithm from 45 different areas of medical practice. This free
resource is in use worldwide with over... | [
{
"created": "Thu, 6 Aug 2009 18:52:41 GMT",
"version": "v1"
}
] | 2009-08-07 | [
[
"Iyengar",
"M. Sriram",
""
],
[
"Svirbely",
"John R.",
""
]
] | The Medical Algorithms Project, a web-based resource located at www.medal.org, is the world's largest collection of medical-related spreadsheets, consisting of over 13,500 Excel spreadsheets each encoding a medical algorithm from 45 different areas of medical practice. This free resource is in use worldwide with over 1... |
2306.13937 | Luiz Fernando Afra Brito | Luiz F. Afra Brito and Marcelo Keese Albertini and Bruno A. N.
Traven\c{c}olo | A Dynamic Data Structure for Representing Timed Transitive Closures on
Disk | 22 pages, 4 figures | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | Temporal graphs represent interactions between entities over time. These
interactions may be direct, a contact between two vertices at some time
instant, or indirect, through sequences of contacts called journeys. Deciding
whether an entity can reach another through a journey is useful for various
applications in com... | [
{
"created": "Sat, 24 Jun 2023 10:58:23 GMT",
"version": "v1"
}
] | 2023-06-27 | [
[
"Brito",
"Luiz F. Afra",
""
],
[
"Albertini",
"Marcelo Keese",
""
],
[
"Travençolo",
"Bruno A. N.",
""
]
] | Temporal graphs represent interactions between entities over time. These interactions may be direct, a contact between two vertices at some time instant, or indirect, through sequences of contacts called journeys. Deciding whether an entity can reach another through a journey is useful for various applications in compl... |
1705.09888 | Peng Xu | Peng Xu, Qiyue Yin, Yongye Huang, Yi-Zhe Song, Zhanyu Ma, Liang Wang,
Tao Xiang, W. Bastiaan Kleijn, Jun Guo | Cross-modal Subspace Learning for Fine-grained Sketch-based Image
Retrieval | Accepted by Neurocomputing | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sketch-based image retrieval (SBIR) is challenging due to the inherent
domain-gap between sketch and photo. Compared with pixel-perfect depictions of
photos, sketches are iconic renderings of the real world with highly abstract.
Therefore, matching sketch and photo directly using low-level visual clues are
unsufficie... | [
{
"created": "Sun, 28 May 2017 03:45:26 GMT",
"version": "v1"
}
] | 2017-05-30 | [
[
"Xu",
"Peng",
""
],
[
"Yin",
"Qiyue",
""
],
[
"Huang",
"Yongye",
""
],
[
"Song",
"Yi-Zhe",
""
],
[
"Ma",
"Zhanyu",
""
],
[
"Wang",
"Liang",
""
],
[
"Xiang",
"Tao",
""
],
[
"Kleijn",
"W. Bastiaan... | Sketch-based image retrieval (SBIR) is challenging due to the inherent domain-gap between sketch and photo. Compared with pixel-perfect depictions of photos, sketches are iconic renderings of the real world with highly abstract. Therefore, matching sketch and photo directly using low-level visual clues are unsufficient... |
1602.04234 | Stefanos Baros Stefanos Baros | Stefanos Baros | Consensus-Based Torque Control of Deloaded Wind DFIGs for Distributed
and Fair Dynamic Dispatching | null | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we aim to address the problem of dynamically dispatching a
group of state-of-the-art deloaded wind generators (WGs) in a fair-sharing
manner. We use the term dynamically since the WGs aim to dispatch themselves
according to a varying committed WF power output. We first propose a
leader-follower protocol... | [
{
"created": "Fri, 12 Feb 2016 21:50:26 GMT",
"version": "v1"
}
] | 2016-02-16 | [
[
"Baros",
"Stefanos",
""
]
] | In this paper we aim to address the problem of dynamically dispatching a group of state-of-the-art deloaded wind generators (WGs) in a fair-sharing manner. We use the term dynamically since the WGs aim to dispatch themselves according to a varying committed WF power output. We first propose a leader-follower protocol w... |
cs/0406013 | Ester Zumpano | G. Greco, S. Greco, I. Trubtsyna, E. Zumpano | Optimization of Bound Disjunctive Queries with Constraints | 35 pages | null | null | null | cs.LO | null | "To Appear in Theory and Practice of Logic Programming (TPLP)" This paper
presents a technique for the optimization of bound queries over disjunctive
deductive databases with constraints. The proposed approach is an extension of
the well-known Magic-Set technique and is well-suited for being integrated in
current bot... | [
{
"created": "Mon, 7 Jun 2004 12:13:58 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Greco",
"G.",
""
],
[
"Greco",
"S.",
""
],
[
"Trubtsyna",
"I.",
""
],
[
"Zumpano",
"E.",
""
]
] | "To Appear in Theory and Practice of Logic Programming (TPLP)" This paper presents a technique for the optimization of bound queries over disjunctive deductive databases with constraints. The proposed approach is an extension of the well-known Magic-Set technique and is well-suited for being integrated in current botto... |
1606.05614 | Cristiano Premebida | C. Premebida, L. Garrote, A. Asvadi, A. Pedro Ribeiro, and U. Nunes | High-resolution LIDAR-based Depth Mapping using Bilateral Filter | 8 pages, 6 figures, submitted to IEEE-ITSC'16 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | High resolution depth-maps, obtained by upsampling sparse range data from a
3D-LIDAR, find applications in many fields ranging from sensory perception to
semantic segmentation and object detection. Upsampling is often based on
combining data from a monocular camera to compensate the low-resolution of a
LIDAR. This pa... | [
{
"created": "Fri, 17 Jun 2016 18:14:59 GMT",
"version": "v1"
}
] | 2016-06-20 | [
[
"Premebida",
"C.",
""
],
[
"Garrote",
"L.",
""
],
[
"Asvadi",
"A.",
""
],
[
"Ribeiro",
"A. Pedro",
""
],
[
"Nunes",
"U.",
""
]
] | High resolution depth-maps, obtained by upsampling sparse range data from a 3D-LIDAR, find applications in many fields ranging from sensory perception to semantic segmentation and object detection. Upsampling is often based on combining data from a monocular camera to compensate the low-resolution of a LIDAR. This pape... |
2407.14912 | Weiqin Jiao | Weiqin Jiao, Claudio Persello, George Vosselman | PolyR-CNN: R-CNN for end-to-end polygonal building outline extraction | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Polygonal building outline extraction has been a research focus in recent
years. Most existing methods have addressed this challenging task by
decomposing it into several subtasks and employing carefully designed
architectures. Despite their accuracy, such pipelines often introduce
inefficiencies during training and ... | [
{
"created": "Sat, 20 Jul 2024 15:48:54 GMT",
"version": "v1"
}
] | 2024-07-23 | [
[
"Jiao",
"Weiqin",
""
],
[
"Persello",
"Claudio",
""
],
[
"Vosselman",
"George",
""
]
] | Polygonal building outline extraction has been a research focus in recent years. Most existing methods have addressed this challenging task by decomposing it into several subtasks and employing carefully designed architectures. Despite their accuracy, such pipelines often introduce inefficiencies during training and in... |
2205.12523 | Rongjie Huang | Rongjie Huang, Jinglin Liu, Huadai Liu, Yi Ren, Lichao Zhang, Jinzheng
He, Zhou Zhao | TranSpeech: Speech-to-Speech Translation With Bilateral Perturbation | Accpeted to ICLR 2023 | null | null | null | cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Direct speech-to-speech translation (S2ST) with discrete units leverages
recent progress in speech representation learning. Specifically, a sequence of
discrete representations derived in a self-supervised manner are predicted from
the model and passed to a vocoder for speech reconstruction, while still facing
the fo... | [
{
"created": "Wed, 25 May 2022 06:34:14 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Mar 2023 09:17:01 GMT",
"version": "v2"
}
] | 2023-03-03 | [
[
"Huang",
"Rongjie",
""
],
[
"Liu",
"Jinglin",
""
],
[
"Liu",
"Huadai",
""
],
[
"Ren",
"Yi",
""
],
[
"Zhang",
"Lichao",
""
],
[
"He",
"Jinzheng",
""
],
[
"Zhao",
"Zhou",
""
]
] | Direct speech-to-speech translation (S2ST) with discrete units leverages recent progress in speech representation learning. Specifically, a sequence of discrete representations derived in a self-supervised manner are predicted from the model and passed to a vocoder for speech reconstruction, while still facing the foll... |
2102.11097 | Joseph O'Rourke | Joseph O'Rourke and Costin V\^ilcu | Cut Locus Realizations on Convex Polyhedra | 16 pages, 7 figures, 16 references | null | null | null | cs.CG math.MG | http://creativecommons.org/licenses/by/4.0/ | We prove that every positively-weighted tree T can be realized as the cut
locus C(x) of a point x on a convex polyhedron P, with T weights matching C(x)
lengths. If T has n leaves, P has (in general) n+1 vertices. We show there are
in fact a continuum of polyhedra P each realizing T for some x on P. Three main
tools ... | [
{
"created": "Mon, 22 Feb 2021 15:11:44 GMT",
"version": "v1"
}
] | 2021-02-23 | [
[
"O'Rourke",
"Joseph",
""
],
[
"Vîlcu",
"Costin",
""
]
] | We prove that every positively-weighted tree T can be realized as the cut locus C(x) of a point x on a convex polyhedron P, with T weights matching C(x) lengths. If T has n leaves, P has (in general) n+1 vertices. We show there are in fact a continuum of polyhedra P each realizing T for some x on P. Three main tools in... |
2402.04520 | Jerry Yao-Chieh Hu | Jerry Yao-Chieh Hu, Thomas Lin, Zhao Song, Han Liu | On Computational Limits of Modern Hopfield Models: A Fine-Grained
Complexity Analysis | Accepted at ICML 2024; v2 corrected typos; v3 added clarifications
and references; v4,5 updated to camera-ready version | null | null | null | cs.LG cs.AI stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We investigate the computational limits of the memory retrieval dynamics of
modern Hopfield models from the fine-grained complexity analysis. Our key
contribution is the characterization of a phase transition behavior in the
efficiency of all possible modern Hopfield models based on the norm of
patterns. Specifically... | [
{
"created": "Wed, 7 Feb 2024 01:58:21 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Feb 2024 20:35:31 GMT",
"version": "v2"
},
{
"created": "Thu, 4 Apr 2024 21:56:56 GMT",
"version": "v3"
},
{
"created": "Sun, 26 May 2024 17:18:34 GMT",
"version": "v4"
},
{
"cre... | 2024-06-04 | [
[
"Hu",
"Jerry Yao-Chieh",
""
],
[
"Lin",
"Thomas",
""
],
[
"Song",
"Zhao",
""
],
[
"Liu",
"Han",
""
]
] | We investigate the computational limits of the memory retrieval dynamics of modern Hopfield models from the fine-grained complexity analysis. Our key contribution is the characterization of a phase transition behavior in the efficiency of all possible modern Hopfield models based on the norm of patterns. Specifically, ... |
2004.12881 | Shay Golan | Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat | The Streaming k-Mismatch Problem: Tradeoffs between Space and Total Time | Extended abstract to appear in CPM 2020 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We revisit the $k$-mismatch problem in the streaming model on a pattern of
length $m$ and a streaming text of length $n$, both over a size-$\sigma$
alphabet. The current state-of-the-art algorithm for the streaming $k$-mismatch
problem, by Clifford et al. [SODA 2019], uses $\tilde O(k)$ space and $\tilde
O\big(\sqrt ... | [
{
"created": "Mon, 27 Apr 2020 15:41:49 GMT",
"version": "v1"
}
] | 2020-04-28 | [
[
"Golan",
"Shay",
""
],
[
"Kociumaka",
"Tomasz",
""
],
[
"Kopelowitz",
"Tsvi",
""
],
[
"Porat",
"Ely",
""
]
] | We revisit the $k$-mismatch problem in the streaming model on a pattern of length $m$ and a streaming text of length $n$, both over a size-$\sigma$ alphabet. The current state-of-the-art algorithm for the streaming $k$-mismatch problem, by Clifford et al. [SODA 2019], uses $\tilde O(k)$ space and $\tilde O\big(\sqrt k\... |
2202.12885 | Sadra Seyedmasoumian | Sadra Seyedmasoumian, Tolga M. Duman | Approximate Weight Distribution of Polarization-Adjusted Convolutional
(PAC) Codes | 6 pages, 5 figures | 2022 IEEE International Symposium on Information Theory (ISIT) | 10.1109/ISIT50566.2022.9834587 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Polarization-adjusted convolutional (PAC) codes combine the polar and
convolutional transformations to enhance the distance properties of polar
codes. They offer a performance very close to the finite length
information-theoretic bounds for short block lengths. In this paper, we develop
a method of computing the weig... | [
{
"created": "Fri, 25 Feb 2022 18:53:36 GMT",
"version": "v1"
}
] | 2022-11-17 | [
[
"Seyedmasoumian",
"Sadra",
""
],
[
"Duman",
"Tolga M.",
""
]
] | Polarization-adjusted convolutional (PAC) codes combine the polar and convolutional transformations to enhance the distance properties of polar codes. They offer a performance very close to the finite length information-theoretic bounds for short block lengths. In this paper, we develop a method of computing the weight... |
1706.03824 | Baskaran Sankaran | Baskaran Sankaran, Markus Freitag and Yaser Al-Onaizan | Attention-based Vocabulary Selection for NMT Decoding | Submitted to Second Conference on Machine Translation (WMT-17); 7
pages | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural Machine Translation (NMT) models usually use large target vocabulary
sizes to capture most of the words in the target language. The vocabulary size
is a big factor when decoding new sentences as the final softmax layer
normalizes over all possible target words. To address this problem, it is
widely common to r... | [
{
"created": "Mon, 12 Jun 2017 19:51:00 GMT",
"version": "v1"
}
] | 2017-06-14 | [
[
"Sankaran",
"Baskaran",
""
],
[
"Freitag",
"Markus",
""
],
[
"Al-Onaizan",
"Yaser",
""
]
] | Neural Machine Translation (NMT) models usually use large target vocabulary sizes to capture most of the words in the target language. The vocabulary size is a big factor when decoding new sentences as the final softmax layer normalizes over all possible target words. To address this problem, it is widely common to res... |
1409.6624 | Bernhard Rumpe | Holger Krahn, Bernhard Rumpe, Steven V\"olkel | Integrated Definition of Abstract and Concrete Syntax for Textual
Languages | 15 pages, 12 figures. arXiv admin note: text overlap with
arXiv:1409.2367 | Proceedings of the ACM/IEEE 10th International Conference on Model
Driven Engineering Languages and Systems (MODELS 2007), Nashville, TN, USA,
LNCS 4735 | 10.1007/978-3-540-75209-7_20 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An understandable concrete syntax and a comprehensible abstract syntax are
two central aspects of defining a modeling language. Both representations of a
language significantly overlap in their structure and also information, but may
also differ in parts of the information. To avoid discrepancies and problems
while h... | [
{
"created": "Mon, 22 Sep 2014 12:39:44 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Krahn",
"Holger",
""
],
[
"Rumpe",
"Bernhard",
""
],
[
"Völkel",
"Steven",
""
]
] | An understandable concrete syntax and a comprehensible abstract syntax are two central aspects of defining a modeling language. Both representations of a language significantly overlap in their structure and also information, but may also differ in parts of the information. To avoid discrepancies and problems while han... |
2310.14858 | Patrick Holzer | Patrick Holzer, Tania Jacob, Shubham Kavane | Dynamically Weighted Federated k-Means | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated clustering, an integral aspect of federated machine learning,
enables multiple data sources to collaboratively cluster their data,
maintaining decentralization and preserving privacy. In this paper, we
introduce a novel federated clustering algorithm named Dynamically Weighted
Federated k-means (DWF k-means... | [
{
"created": "Mon, 23 Oct 2023 12:28:21 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Nov 2023 10:35:48 GMT",
"version": "v2"
}
] | 2023-11-20 | [
[
"Holzer",
"Patrick",
""
],
[
"Jacob",
"Tania",
""
],
[
"Kavane",
"Shubham",
""
]
] | Federated clustering, an integral aspect of federated machine learning, enables multiple data sources to collaboratively cluster their data, maintaining decentralization and preserving privacy. In this paper, we introduce a novel federated clustering algorithm named Dynamically Weighted Federated k-means (DWF k-means) ... |
2407.03652 | Teo Susnjak | Teo Susnjak, Timothy R. McIntosh, Andre L. C. Barczak, Napoleon H.
Reyes, Tong Liu, Paul Watters, Malka N. Halgamuge | Over the Edge of Chaos? Excess Complexity as a Roadblock to Artificial
General Intelligence | null | null | null | null | cs.AI cs.CC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In this study, we explored the progression trajectories of artificial
intelligence (AI) systems through the lens of complexity theory. We challenged
the conventional linear and exponential projections of AI advancement toward
Artificial General Intelligence (AGI) underpinned by transformer-based
architectures, and po... | [
{
"created": "Thu, 4 Jul 2024 05:46:39 GMT",
"version": "v1"
}
] | 2024-07-08 | [
[
"Susnjak",
"Teo",
""
],
[
"McIntosh",
"Timothy R.",
""
],
[
"Barczak",
"Andre L. C.",
""
],
[
"Reyes",
"Napoleon H.",
""
],
[
"Liu",
"Tong",
""
],
[
"Watters",
"Paul",
""
],
[
"Halgamuge",
"Malka N.",
""
... | In this study, we explored the progression trajectories of artificial intelligence (AI) systems through the lens of complexity theory. We challenged the conventional linear and exponential projections of AI advancement toward Artificial General Intelligence (AGI) underpinned by transformer-based architectures, and posi... |
0910.5947 | Jennifer Kloke | Jennifer Kloke and Gunnar Carlsson | Topological De-Noising: Strengthening the Topological Signal | 13 pages, 37 figures, content added | null | null | null | cs.CG cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Topological methods, including persistent homology, are powerful tools for
analysis of high-dimensional data sets but these methods rely almost
exclusively on thresholding techniques. In noisy data sets, thresholding does
not always allow for the recovery of topological information. We present an
easy to implement, c... | [
{
"created": "Fri, 30 Oct 2009 19:08:44 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Feb 2010 23:50:41 GMT",
"version": "v2"
}
] | 2016-09-08 | [
[
"Kloke",
"Jennifer",
""
],
[
"Carlsson",
"Gunnar",
""
]
] | Topological methods, including persistent homology, are powerful tools for analysis of high-dimensional data sets but these methods rely almost exclusively on thresholding techniques. In noisy data sets, thresholding does not always allow for the recovery of topological information. We present an easy to implement, com... |
2111.15651 | Stuart Synakowski | Stuart Synakowski, Fabian Benitez-Quiroz, Aleix M. Martinez | Leveraging The Topological Consistencies of Learning in Deep Neural
Networks | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Recently, methods have been developed to accurately predict the testing
performance of a Deep Neural Network (DNN) on a particular task, given
statistics of its underlying topological structure. However, further leveraging
this newly found insight for practical applications is intractable due to the
high computationa... | [
{
"created": "Tue, 30 Nov 2021 18:34:48 GMT",
"version": "v1"
}
] | 2021-12-01 | [
[
"Synakowski",
"Stuart",
""
],
[
"Benitez-Quiroz",
"Fabian",
""
],
[
"Martinez",
"Aleix M.",
""
]
] | Recently, methods have been developed to accurately predict the testing performance of a Deep Neural Network (DNN) on a particular task, given statistics of its underlying topological structure. However, further leveraging this newly found insight for practical applications is intractable due to the high computational ... |
2204.07196 | Arsen Vasilyan | Ronitt Rubinfeld and Arsen Vasilyan | Testing distributional assumptions of learning algorithms | null | null | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There are many high dimensional function classes that have fast agnostic
learning algorithms when assumptions on the distribution of examples can be
made, such as Gaussianity or uniformity over the domain. But how can one be
confident that data indeed satisfies such assumption, so that one can trust in
output quality... | [
{
"created": "Thu, 14 Apr 2022 19:10:53 GMT",
"version": "v1"
},
{
"created": "Sun, 20 Nov 2022 01:01:47 GMT",
"version": "v2"
}
] | 2022-11-22 | [
[
"Rubinfeld",
"Ronitt",
""
],
[
"Vasilyan",
"Arsen",
""
]
] | There are many high dimensional function classes that have fast agnostic learning algorithms when assumptions on the distribution of examples can be made, such as Gaussianity or uniformity over the domain. But how can one be confident that data indeed satisfies such assumption, so that one can trust in output quality o... |
1911.03607 | Ke Xu | Ke Xu, Kaiyu Guan, Jian Peng, Yunan Luo, Sibo Wang | DeepMask: an algorithm for cloud and cloud shadow detection in optical
satellite remote sensing images using deep residual network | 17 pages, 4 figures, 6 tables | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Detecting and masking cloud and cloud shadow from satellite remote sensing
images is a pervasive problem in the remote sensing community. Accurate and
efficient detection of cloud and cloud shadow is an essential step to harness
the value of remotely sensed data for almost all downstream analysis. DeepMask,
a new alg... | [
{
"created": "Sat, 9 Nov 2019 03:44:07 GMT",
"version": "v1"
}
] | 2019-11-12 | [
[
"Xu",
"Ke",
""
],
[
"Guan",
"Kaiyu",
""
],
[
"Peng",
"Jian",
""
],
[
"Luo",
"Yunan",
""
],
[
"Wang",
"Sibo",
""
]
] | Detecting and masking cloud and cloud shadow from satellite remote sensing images is a pervasive problem in the remote sensing community. Accurate and efficient detection of cloud and cloud shadow is an essential step to harness the value of remotely sensed data for almost all downstream analysis. DeepMask, a new algor... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.