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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2212.04690 | Mingu Kang | Mingu Kang, Heon Song, Seonwook Park, Donggeun Yoo, S\'ergio Pereira | Benchmarking Self-Supervised Learning on Diverse Pathology Datasets | Accepted to CVPR 2023 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computational pathology can lead to saving human lives, but models are
annotation hungry and pathology images are notoriously expensive to annotate.
Self-supervised learning has shown to be an effective method for utilizing
unlabeled data, and its application to pathology could greatly benefit its
downstream tasks. Y... | [
{
"created": "Fri, 9 Dec 2022 06:38:34 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Apr 2023 15:07:46 GMT",
"version": "v2"
}
] | 2023-04-19 | [
[
"Kang",
"Mingu",
""
],
[
"Song",
"Heon",
""
],
[
"Park",
"Seonwook",
""
],
[
"Yoo",
"Donggeun",
""
],
[
"Pereira",
"Sérgio",
""
]
] | Computational pathology can lead to saving human lives, but models are annotation hungry and pathology images are notoriously expensive to annotate. Self-supervised learning has shown to be an effective method for utilizing unlabeled data, and its application to pathology could greatly benefit its downstream tasks. Yet... |
2206.07080 | Carl Corea | Carl Corea, John Grant, Matthias Thimm | Measuring Inconsistency in Declarative Process Specifications | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | We address the problem of measuring inconsistency in declarative process
specifications, with an emphasis on linear temporal logic on fixed traces
(LTLff). As we will show, existing inconsistency measures for classical logic
cannot provide a meaningful assessment of inconsistency in LTL in general, as
they cannot ade... | [
{
"created": "Tue, 14 Jun 2022 18:08:49 GMT",
"version": "v1"
}
] | 2022-06-16 | [
[
"Corea",
"Carl",
""
],
[
"Grant",
"John",
""
],
[
"Thimm",
"Matthias",
""
]
] | We address the problem of measuring inconsistency in declarative process specifications, with an emphasis on linear temporal logic on fixed traces (LTLff). As we will show, existing inconsistency measures for classical logic cannot provide a meaningful assessment of inconsistency in LTL in general, as they cannot adequ... |
2206.00113 | Daniel Hernandez Dr | Daniel Hernandez, Hendrik Baier, Michael Kaisers | BRExIt: On Opponent Modelling in Expert Iteration | null | null | null | null | cs.AI cs.GT | http://creativecommons.org/publicdomain/zero/1.0/ | Finding a best response policy is a central objective in game theory and
multi-agent learning, with modern population-based training approaches
employing reinforcement learning algorithms as best-response oracles to improve
play against candidate opponents (typically previously learnt policies). We
propose Best Respo... | [
{
"created": "Tue, 31 May 2022 20:49:10 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Apr 2023 15:31:34 GMT",
"version": "v2"
}
] | 2023-04-26 | [
[
"Hernandez",
"Daniel",
""
],
[
"Baier",
"Hendrik",
""
],
[
"Kaisers",
"Michael",
""
]
] | Finding a best response policy is a central objective in game theory and multi-agent learning, with modern population-based training approaches employing reinforcement learning algorithms as best-response oracles to improve play against candidate opponents (typically previously learnt policies). We propose Best Respons... |
1006.5299 | Yao Sun | Yao Sun and Dingkang Wang | The F5 Algorithm in Buchberger's Style | null | null | null | null | cs.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The famous F5 algorithm for computing \gr basis was presented by Faug\`ere in
2002. The original version of F5 is given in programming codes, so it is a bit
difficult to understand. In this paper, the F5 algorithm is simplified as F5B
in a Buchberger's style such that it is easy to understand and implement. In
order ... | [
{
"created": "Mon, 28 Jun 2010 09:23:32 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Dec 2010 01:47:14 GMT",
"version": "v2"
}
] | 2010-12-30 | [
[
"Sun",
"Yao",
""
],
[
"Wang",
"Dingkang",
""
]
] | The famous F5 algorithm for computing \gr basis was presented by Faug\`ere in 2002. The original version of F5 is given in programming codes, so it is a bit difficult to understand. In this paper, the F5 algorithm is simplified as F5B in a Buchberger's style such that it is easy to understand and implement. In order to... |
1901.02720 | Rasmus Vestergaard | Rasmus Vestergaard, Qi Zhang, Daniel E. Lucani | Generalized Deduplication: Bounds, Convergence, and Asymptotic
Properties | 15 pages, 4 figures. This is the full version of a paper accepted for
GLOBECOM 2019 | null | 10.1109/GLOBECOM38437.2019.9014012 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study a generalization of deduplication, which enables lossless
deduplication of highly similar data and show that standard deduplication with
fixed chunk length is a special case. We provide bounds on the expected length
of coded sequences for generalized deduplication and show that the coding has
asymptotic near... | [
{
"created": "Wed, 9 Jan 2019 13:17:06 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Jan 2019 10:14:50 GMT",
"version": "v2"
},
{
"created": "Mon, 29 Apr 2019 06:23:02 GMT",
"version": "v3"
},
{
"created": "Wed, 7 Aug 2019 09:44:47 GMT",
"version": "v4"
}
] | 2020-03-04 | [
[
"Vestergaard",
"Rasmus",
""
],
[
"Zhang",
"Qi",
""
],
[
"Lucani",
"Daniel E.",
""
]
] | We study a generalization of deduplication, which enables lossless deduplication of highly similar data and show that standard deduplication with fixed chunk length is a special case. We provide bounds on the expected length of coded sequences for generalized deduplication and show that the coding has asymptotic near-e... |
2101.07541 | Malisa Vucinic | Jelena Kova\v{c} (UCG), Jovan Crnogorac (UCG), Enis Ko\v{c}an (UCG),
Malisa Vucinic (EVA) | Sniffing Multi-hop Multi-channel Wireless Sensor Networks | 2020 28th Telecommunications Forum (TELFOR), Nov 2020, Belgrade,
Serbia | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As wireless sensor networks grow larger, more complex and their role more
significant, it becomes necessary to have an insight into the network traffic.
For this purpose, sniffers play an irreplaceable role. Since a sniffer is a
device of limited range, to cover a multi-hop network it is necessary to
consider the dep... | [
{
"created": "Tue, 19 Jan 2021 10:02:11 GMT",
"version": "v1"
}
] | 2021-01-20 | [
[
"Kovač",
"Jelena",
"",
"UCG"
],
[
"Crnogorac",
"Jovan",
"",
"UCG"
],
[
"Kočan",
"Enis",
"",
"UCG"
],
[
"Vucinic",
"Malisa",
"",
"EVA"
]
] | As wireless sensor networks grow larger, more complex and their role more significant, it becomes necessary to have an insight into the network traffic. For this purpose, sniffers play an irreplaceable role. Since a sniffer is a device of limited range, to cover a multi-hop network it is necessary to consider the deplo... |
2108.13927 | Michiel de Bondt | Stijn Cambie, Michiel de Bondt, and Henk Don | Extremal Binary PFAs with Small Number of States | Even more extended than the IJFCS publication referenced below, which
is an extended version of a publication in the proceedings of DLT 2021 titled
'Extremal Binary PFAs in a Cerny Family' | International Journal of Foundations of Computer Science, Vol. 34,
No. 02n03, pp. 85-115 (2023) | 10.1142/S0129054122440038 | null | cs.FL | http://creativecommons.org/licenses/by/4.0/ | The largest known reset thresholds for DFAs are equal to $(n-1)^2$, where $n$
is the number of states. This is conjectured to be the maximum possible. PFAs
(with partial transition function) can have exponentially large reset
thresholds. This is still true if we restrict to binary PFAs. However,
asymptotics do not gi... | [
{
"created": "Wed, 25 Aug 2021 07:37:51 GMT",
"version": "v1"
},
{
"created": "Thu, 6 Jan 2022 08:53:55 GMT",
"version": "v2"
},
{
"created": "Sat, 15 Apr 2023 17:31:21 GMT",
"version": "v3"
}
] | 2023-04-18 | [
[
"Cambie",
"Stijn",
""
],
[
"de Bondt",
"Michiel",
""
],
[
"Don",
"Henk",
""
]
] | The largest known reset thresholds for DFAs are equal to $(n-1)^2$, where $n$ is the number of states. This is conjectured to be the maximum possible. PFAs (with partial transition function) can have exponentially large reset thresholds. This is still true if we restrict to binary PFAs. However, asymptotics do not give... |
cs/0306106 | Joseph Y. Halpern | Joseph Y. Halpern | Lexicographic probability, conditional probability, and nonstandard
probability | A preliminary version appears in Proceedings of the Eighth Conference
on Theoretical Aspects of Rationality and Knowledge, 2001, pp. 17--30. The
final version will appear in Games and Economic Behavior | null | null | null | cs.GT cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The relationship between Popper spaces (conditional probability spaces that
satisfy some regularity conditions), lexicographic probability systems (LPS's),
and nonstandard probability spaces (NPS's) is considered. If countable
additivity is assumed, Popper spaces and a subclass of LPS's are equivalent;
without the as... | [
{
"created": "Tue, 17 Jun 2003 22:11:36 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Apr 2009 11:32:53 GMT",
"version": "v2"
}
] | 2009-04-22 | [
[
"Halpern",
"Joseph Y.",
""
]
] | The relationship between Popper spaces (conditional probability spaces that satisfy some regularity conditions), lexicographic probability systems (LPS's), and nonstandard probability spaces (NPS's) is considered. If countable additivity is assumed, Popper spaces and a subclass of LPS's are equivalent; without the assu... |
cs/0504105 | G Gordon Worley III | G Gordon Worley III | Wikis in Tuple Spaces | To appear at WMSCI 2005 | null | null | null | cs.DC cs.MM | null | We consider storing the pages of a wiki in a tuple space and the effects this
might have on the wiki experience. In particular, wiki pages are stored in
tuples with a few identifying values such as title, author, revision date,
content, etc. and pages are retrieved by sending the tuple space templates,
such as one th... | [
{
"created": "Wed, 27 Apr 2005 23:04:35 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Worley",
"G Gordon",
"III"
]
] | We consider storing the pages of a wiki in a tuple space and the effects this might have on the wiki experience. In particular, wiki pages are stored in tuples with a few identifying values such as title, author, revision date, content, etc. and pages are retrieved by sending the tuple space templates, such as one that... |
2208.10322 | Shanshan Zhong | Shanshan Zhong, Wushao Wen, Jinghui Qin | Mix-Pooling Strategy for Attention Mechanism | Work in progress | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently many effective attention modules are proposed to boot the model
performance by exploiting the internal information of convolutional neural
networks in computer vision. In general, many previous works ignore considering
the design of the pooling strategy of the attention mechanism since they adopt
the global ... | [
{
"created": "Mon, 22 Aug 2022 14:01:42 GMT",
"version": "v1"
},
{
"created": "Sun, 23 Oct 2022 03:01:03 GMT",
"version": "v2"
}
] | 2022-10-25 | [
[
"Zhong",
"Shanshan",
""
],
[
"Wen",
"Wushao",
""
],
[
"Qin",
"Jinghui",
""
]
] | Recently many effective attention modules are proposed to boot the model performance by exploiting the internal information of convolutional neural networks in computer vision. In general, many previous works ignore considering the design of the pooling strategy of the attention mechanism since they adopt the global av... |
2406.01439 | Bart Cox | Yuncong Zuo, Bart Cox, Lydia Y. Chen, J\'er\'emie Decouchant | Asynchronous Multi-Server Federated Learning for Geo-Distributed Clients | null | null | null | null | cs.LG cs.DC | http://creativecommons.org/licenses/by-sa/4.0/ | Federated learning (FL) systems enable multiple clients to train a machine
learning model iteratively through synchronously exchanging the intermediate
model weights with a single server. The scalability of such FL systems can be
limited by two factors: server idle time due to synchronous communication and
the risk o... | [
{
"created": "Mon, 3 Jun 2024 15:29:46 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Jun 2024 12:04:28 GMT",
"version": "v2"
}
] | 2024-06-21 | [
[
"Zuo",
"Yuncong",
""
],
[
"Cox",
"Bart",
""
],
[
"Chen",
"Lydia Y.",
""
],
[
"Decouchant",
"Jérémie",
""
]
] | Federated learning (FL) systems enable multiple clients to train a machine learning model iteratively through synchronously exchanging the intermediate model weights with a single server. The scalability of such FL systems can be limited by two factors: server idle time due to synchronous communication and the risk of ... |
2001.00594 | Changwei Hu | Yao Zhan, Changwei Hu, Yifan Hu, Tejaswi Kasturi, Shanmugam Ramasamy,
Matt Gillingham, Keith Yamamoto | Large-scale Gender/Age Prediction of Tumblr Users | null | IEEE ICMLA 2019 | null | null | cs.LG cs.SI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Tumblr, as a leading content provider and social media, attracts 371 million
monthly visits, 280 million blogs and 53.3 million daily posts. The popularity
of Tumblr provides great opportunities for advertisers to promote their
products through sponsored posts. However, it is a challenging task to target
specific dem... | [
{
"created": "Thu, 2 Jan 2020 19:01:45 GMT",
"version": "v1"
}
] | 2020-01-06 | [
[
"Zhan",
"Yao",
""
],
[
"Hu",
"Changwei",
""
],
[
"Hu",
"Yifan",
""
],
[
"Kasturi",
"Tejaswi",
""
],
[
"Ramasamy",
"Shanmugam",
""
],
[
"Gillingham",
"Matt",
""
],
[
"Yamamoto",
"Keith",
""
]
] | Tumblr, as a leading content provider and social media, attracts 371 million monthly visits, 280 million blogs and 53.3 million daily posts. The popularity of Tumblr provides great opportunities for advertisers to promote their products through sponsored posts. However, it is a challenging task to target specific demog... |
1701.08256 | Philipp Kemkes | Nattiya Kanhabua, Philipp Kemkes, Wolfgang Nejdl, Tu Ngoc Nguyen,
Felipe Reis, Nam Khanh Tran | How to Search the Internet Archive Without Indexing It | null | 20th International Conference on Theory and Practice of Digital
Libraries, TPDL 2016, Proceedings, pp 147-160 | 10.1007/978-3-319-43997-6_12 | null | cs.DL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Significant parts of cultural heritage are produced on the web during the
last decades. While easy accessibility to the current web is a good baseline,
optimal access to the past web faces several challenges. This includes dealing
with large-scale web archive collections and lacking of usage logs that contain
implici... | [
{
"created": "Sat, 28 Jan 2017 05:46:46 GMT",
"version": "v1"
}
] | 2017-01-31 | [
[
"Kanhabua",
"Nattiya",
""
],
[
"Kemkes",
"Philipp",
""
],
[
"Nejdl",
"Wolfgang",
""
],
[
"Nguyen",
"Tu Ngoc",
""
],
[
"Reis",
"Felipe",
""
],
[
"Tran",
"Nam Khanh",
""
]
] | Significant parts of cultural heritage are produced on the web during the last decades. While easy accessibility to the current web is a good baseline, optimal access to the past web faces several challenges. This includes dealing with large-scale web archive collections and lacking of usage logs that contain implicit ... |
1612.04790 | Vishnu Narayan | Vishnu V. Narayan | A 17/12-Approximation Algorithm for 2-Vertex-Connected Spanning
Subgraphs on Graphs with Minimum Degree At Least 3 | Revised Lemma 1 and Theorem 2, results unchanged | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We obtain a polynomial-time 17/12-approximation algorithm for the
minimum-cost 2-vertex-connected spanning subgraph problem, restricted to graphs
of minimum degree at least 3. Our algorithm uses the framework of
ear-decompositions for approximating connectivity problems, which was
previously used in algorithms for fi... | [
{
"created": "Wed, 14 Dec 2016 20:07:40 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Jan 2017 18:25:21 GMT",
"version": "v2"
}
] | 2017-01-18 | [
[
"Narayan",
"Vishnu V.",
""
]
] | We obtain a polynomial-time 17/12-approximation algorithm for the minimum-cost 2-vertex-connected spanning subgraph problem, restricted to graphs of minimum degree at least 3. Our algorithm uses the framework of ear-decompositions for approximating connectivity problems, which was previously used in algorithms for find... |
2401.11430 | Zhongqi Yue | Zhongqi Yue, Jiankun Wang, Qianru Sun, Lei Ji, Eric I-Chao Chang,
Hanwang Zhang | Exploring Diffusion Time-steps for Unsupervised Representation Learning | Accepted by ICLR 2024 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Representation learning is all about discovering the hidden modular
attributes that generate the data faithfully. We explore the potential of
Denoising Diffusion Probabilistic Model (DM) in unsupervised learning of the
modular attributes. We build a theoretical framework that connects the
diffusion time-steps and the... | [
{
"created": "Sun, 21 Jan 2024 08:35:25 GMT",
"version": "v1"
}
] | 2024-01-23 | [
[
"Yue",
"Zhongqi",
""
],
[
"Wang",
"Jiankun",
""
],
[
"Sun",
"Qianru",
""
],
[
"Ji",
"Lei",
""
],
[
"Chang",
"Eric I-Chao",
""
],
[
"Zhang",
"Hanwang",
""
]
] | Representation learning is all about discovering the hidden modular attributes that generate the data faithfully. We explore the potential of Denoising Diffusion Probabilistic Model (DM) in unsupervised learning of the modular attributes. We build a theoretical framework that connects the diffusion time-steps and the h... |
1803.00188 | Graham Neubig | Graham Neubig, Matthias Sperber, Xinyi Wang, Matthieu Felix, Austin
Matthews, Sarguna Padmanabhan, Ye Qi, Devendra Singh Sachan, Philip Arthur,
Pierre Godard, John Hewitt, Rachid Riad, Liming Wang | XNMT: The eXtensible Neural Machine Translation Toolkit | To be presented at AMTA 2018 Open Source Software Showcase | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes XNMT, the eXtensible Neural Machine Translation toolkit.
XNMT distin- guishes itself from other open-source NMT toolkits by its focus on
modular code design, with the purpose of enabling fast iteration in research
and replicable, reliable results. In this paper we describe the design of XNMT
and ... | [
{
"created": "Thu, 1 Mar 2018 03:14:54 GMT",
"version": "v1"
}
] | 2018-03-02 | [
[
"Neubig",
"Graham",
""
],
[
"Sperber",
"Matthias",
""
],
[
"Wang",
"Xinyi",
""
],
[
"Felix",
"Matthieu",
""
],
[
"Matthews",
"Austin",
""
],
[
"Padmanabhan",
"Sarguna",
""
],
[
"Qi",
"Ye",
""
],
[
"... | This paper describes XNMT, the eXtensible Neural Machine Translation toolkit. XNMT distin- guishes itself from other open-source NMT toolkits by its focus on modular code design, with the purpose of enabling fast iteration in research and replicable, reliable results. In this paper we describe the design of XNMT and it... |
2201.04100 | Yang Li | Gang Li, Gilles Baechler, Manuel Tragut, Yang Li | Learning to Denoise Raw Mobile UI Layouts for Improving Datasets at
Scale | Accepted to ACM CHI 2022 | null | null | null | cs.HC cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The layout of a mobile screen is a critical data source for UI design
research and semantic understanding of the screen. However, UI layouts in
existing datasets are often noisy, have mismatches with their visual
representation, or consists of generic or app-specific types that are difficult
to analyze and model. In ... | [
{
"created": "Tue, 11 Jan 2022 17:52:40 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Jan 2022 17:53:31 GMT",
"version": "v2"
}
] | 2022-01-14 | [
[
"Li",
"Gang",
""
],
[
"Baechler",
"Gilles",
""
],
[
"Tragut",
"Manuel",
""
],
[
"Li",
"Yang",
""
]
] | The layout of a mobile screen is a critical data source for UI design research and semantic understanding of the screen. However, UI layouts in existing datasets are often noisy, have mismatches with their visual representation, or consists of generic or app-specific types that are difficult to analyze and model. In th... |
2403.19456 | Yu Xu | Yu Xu, Fan Tang, Juan Cao, Yuxin Zhang, Oliver Deussen, Weiming Dong,
Jintao Li, Tong-Yee Lee | Break-for-Make: Modular Low-Rank Adaptations for Composable
Content-Style Customization | null | null | null | null | cs.CV cs.GR cs.MM | http://creativecommons.org/licenses/by/4.0/ | Personalized generation paradigms empower designers to customize visual
intellectual properties with the help of textual descriptions by tuning or
adapting pre-trained text-to-image models on a few images. Recent works explore
approaches for concurrently customizing both content and detailed visual style
appearance. ... | [
{
"created": "Thu, 28 Mar 2024 14:27:36 GMT",
"version": "v1"
},
{
"created": "Sun, 31 Mar 2024 13:26:11 GMT",
"version": "v2"
}
] | 2024-04-02 | [
[
"Xu",
"Yu",
""
],
[
"Tang",
"Fan",
""
],
[
"Cao",
"Juan",
""
],
[
"Zhang",
"Yuxin",
""
],
[
"Deussen",
"Oliver",
""
],
[
"Dong",
"Weiming",
""
],
[
"Li",
"Jintao",
""
],
[
"Lee",
"Tong-Yee",
... | Personalized generation paradigms empower designers to customize visual intellectual properties with the help of textual descriptions by tuning or adapting pre-trained text-to-image models on a few images. Recent works explore approaches for concurrently customizing both content and detailed visual style appearance. Ho... |
2101.04388 | Akshayaa Magesh | Meghana Bande, Akshayaa Magesh, Venugopal V. Veeravalli | Dynamic Spectrum Access using Stochastic Multi-User Bandits | null | null | null | null | cs.IT math.IT stat.ML | http://creativecommons.org/licenses/by/4.0/ | A stochastic multi-user multi-armed bandit framework is used to develop
algorithms for uncoordinated spectrum access. In contrast to prior work, it is
assumed that rewards can be non-zero even under collisions, thus allowing for
the number of users to be greater than the number of channels. The proposed
algorithm con... | [
{
"created": "Tue, 12 Jan 2021 10:29:57 GMT",
"version": "v1"
}
] | 2021-01-13 | [
[
"Bande",
"Meghana",
""
],
[
"Magesh",
"Akshayaa",
""
],
[
"Veeravalli",
"Venugopal V.",
""
]
] | A stochastic multi-user multi-armed bandit framework is used to develop algorithms for uncoordinated spectrum access. In contrast to prior work, it is assumed that rewards can be non-zero even under collisions, thus allowing for the number of users to be greater than the number of channels. The proposed algorithm consi... |
2008.06651 | Lichang Chen | Lichang Chen, Guosheng Lin, Shijie Wang, Qingyao Wu | Graph Edit Distance Reward: Learning to Edit Scene Graph | 14 pages, 6 figures, ECCV camera ready version | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scene Graph, as a vital tool to bridge the gap between language domain and
image domain, has been widely adopted in the cross-modality task like VQA. In
this paper, we propose a new method to edit the scene graph according to the
user instructions, which has never been explored. To be specific, in order to
learn edit... | [
{
"created": "Sat, 15 Aug 2020 04:52:16 GMT",
"version": "v1"
}
] | 2020-08-18 | [
[
"Chen",
"Lichang",
""
],
[
"Lin",
"Guosheng",
""
],
[
"Wang",
"Shijie",
""
],
[
"Wu",
"Qingyao",
""
]
] | Scene Graph, as a vital tool to bridge the gap between language domain and image domain, has been widely adopted in the cross-modality task like VQA. In this paper, we propose a new method to edit the scene graph according to the user instructions, which has never been explored. To be specific, in order to learn editin... |
2206.08182 | Adrian Pfleiderer | Adrian Pfleiderer, Dominik M\"uller, Frank Kramer | Nucleus Segmentation and Analysis in Breast Cancer with the MIScnn
Framework | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The NuCLS dataset contains over 220.000 annotations of cell nuclei in breast
cancers. We show how to use these data to create a multi-rater model with the
MIScnn Framework to automate the analysis of cell nuclei. For the model
creation, we use the widespread U-Net approach embedded in a pipeline. This
pipeline provid... | [
{
"created": "Thu, 16 Jun 2022 13:51:19 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Nov 2022 09:51:07 GMT",
"version": "v2"
},
{
"created": "Wed, 1 Feb 2023 16:53:32 GMT",
"version": "v3"
}
] | 2023-02-02 | [
[
"Pfleiderer",
"Adrian",
""
],
[
"Müller",
"Dominik",
""
],
[
"Kramer",
"Frank",
""
]
] | The NuCLS dataset contains over 220.000 annotations of cell nuclei in breast cancers. We show how to use these data to create a multi-rater model with the MIScnn Framework to automate the analysis of cell nuclei. For the model creation, we use the widespread U-Net approach embedded in a pipeline. This pipeline provides... |
2204.07897 | Naba Rizvi | Naba Rizvi, Harshini Ramaswamy, Reggie Casanova-Perez, Andrea
Hartzler, Nadir Weibel | Making Hidden Bias Visible: Designing a Feedback Ecosystem for Primary
Care Providers | 6 pages, 2 figures, 2 tables, CHI 2022 Workshop Publication (Complex
Health Ecosystems) | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Implicit bias may perpetuate healthcare disparities for marginalized patient
populations. Such bias is expressed in communication between patients and their
providers. We design an ecosystem with guidance from providers to make this
bias explicit in patient-provider communication. Our end users are providers
seeking ... | [
{
"created": "Sun, 17 Apr 2022 01:32:19 GMT",
"version": "v1"
}
] | 2022-04-19 | [
[
"Rizvi",
"Naba",
""
],
[
"Ramaswamy",
"Harshini",
""
],
[
"Casanova-Perez",
"Reggie",
""
],
[
"Hartzler",
"Andrea",
""
],
[
"Weibel",
"Nadir",
""
]
] | Implicit bias may perpetuate healthcare disparities for marginalized patient populations. Such bias is expressed in communication between patients and their providers. We design an ecosystem with guidance from providers to make this bias explicit in patient-provider communication. Our end users are providers seeking to... |
2204.07363 | James Caddy | James Caddy, Markus Wagner, Christoph Treude, Earl T. Barr, Miltiadis
Allamanis | Is Surprisal in Issue Trackers Actionable? | 8 pages, 1 figure. Submitted to 2022 International Conference on
Mining Software Repositories Registered Reports track | null | null | null | cs.CL cs.SE | http://creativecommons.org/licenses/by/4.0/ | Background. From information theory, surprisal is a measurement of how
unexpected an event is. Statistical language models provide a probabilistic
approximation of natural languages, and because surprisal is constructed with
the probability of an event occuring, it is therefore possible to determine the
surprisal ass... | [
{
"created": "Fri, 15 Apr 2022 07:49:40 GMT",
"version": "v1"
}
] | 2022-04-18 | [
[
"Caddy",
"James",
""
],
[
"Wagner",
"Markus",
""
],
[
"Treude",
"Christoph",
""
],
[
"Barr",
"Earl T.",
""
],
[
"Allamanis",
"Miltiadis",
""
]
] | Background. From information theory, surprisal is a measurement of how unexpected an event is. Statistical language models provide a probabilistic approximation of natural languages, and because surprisal is constructed with the probability of an event occuring, it is therefore possible to determine the surprisal assoc... |
0906.5114 | Hal Daum\'e III | Hal Daum\'e III | Non-Parametric Bayesian Areal Linguistics | null | Proceedings of the Conference of the North American Association
for Computational Linguistics, 2009 | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe a statistical model over linguistic areas and phylogeny.
Our model recovers known areas and identifies a plausible hierarchy of areal
features. The use of areas improves genetic reconstruction of languages both
qualitatively and quantitatively according to a variety of metrics. We model
linguistic areas... | [
{
"created": "Sun, 28 Jun 2009 02:32:53 GMT",
"version": "v1"
}
] | 2009-06-30 | [
[
"Daumé",
"Hal",
"III"
]
] | We describe a statistical model over linguistic areas and phylogeny. Our model recovers known areas and identifies a plausible hierarchy of areal features. The use of areas improves genetic reconstruction of languages both qualitatively and quantitatively according to a variety of metrics. We model linguistic areas by ... |
1405.0109 | Vaibhav Jha | Vaibhav Jha, Mohit Jha, GK Sharma | Estimation of Optimized Energy and Latency Constraints for Task
Allocation in 3d Network on Chip | 20 Pages,17 Figure, International Journal of Computer Science &
Information Technology. arXiv admin note: substantial text overlap with
arXiv:1404.2512 | International Journal of Computer Science & Information Technology
Vol 6,No 2,pp 67-86 April 2014 | 10.5121/ijcsit.2014.6205 | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In Network on Chip (NoC) rooted system, energy consumption is affected by
task scheduling and allocation schemes which affect the performance of the
system. In this paper we test the pre-existing proposed algorithms and
introduced a new energy skilled algorithm for 3D NoC architecture. An efficient
dynamic and cluste... | [
{
"created": "Thu, 1 May 2014 07:38:46 GMT",
"version": "v1"
}
] | 2014-05-02 | [
[
"Jha",
"Vaibhav",
""
],
[
"Jha",
"Mohit",
""
],
[
"Sharma",
"GK",
""
]
] | In Network on Chip (NoC) rooted system, energy consumption is affected by task scheduling and allocation schemes which affect the performance of the system. In this paper we test the pre-existing proposed algorithms and introduced a new energy skilled algorithm for 3D NoC architecture. An efficient dynamic and cluster ... |
1610.03612 | Xiaodong Zhuang | Xiaodong Zhuang, N. E. Mastorakis | The Analysis of Local Motion and Deformation in Image Sequences Inspired
by Physical Electromagnetic Interaction | 15 pages, 23 figures. arXiv admin note: substantial text overlap with
arXiv:1610.03615, arXiv:1610.02762 | WSEAS TRANSACTIONS on COMPUTERS, pp. 231-245, Volume 14, 2015 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In order to analyze the moving and deforming of the objects in image
sequence, a novel way is presented to analyze the local changes of object edges
between two related images (such as two adjacent frames in a video sequence),
which is inspired by the physical electromagnetic interaction. The changes of
edge between ... | [
{
"created": "Wed, 12 Oct 2016 06:39:15 GMT",
"version": "v1"
}
] | 2016-10-13 | [
[
"Zhuang",
"Xiaodong",
""
],
[
"Mastorakis",
"N. E.",
""
]
] | In order to analyze the moving and deforming of the objects in image sequence, a novel way is presented to analyze the local changes of object edges between two related images (such as two adjacent frames in a video sequence), which is inspired by the physical electromagnetic interaction. The changes of edge between ad... |
1710.00269 | Kristina Lerman | Kristina Lerman, Nathan Hodas, Hao Wu | Bounded Rationality in Scholarly Knowledge Discovery | null | null | null | null | cs.DL cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In an information-rich world, people's time and attention must be divided
among rapidly changing information sources and the diverse tasks demanded of
them. How people decide which of the many sources, such as scientific articles
or patents, to read and use in their own work affects dissemination of
scholarly knowled... | [
{
"created": "Sat, 30 Sep 2017 22:54:13 GMT",
"version": "v1"
}
] | 2017-10-03 | [
[
"Lerman",
"Kristina",
""
],
[
"Hodas",
"Nathan",
""
],
[
"Wu",
"Hao",
""
]
] | In an information-rich world, people's time and attention must be divided among rapidly changing information sources and the diverse tasks demanded of them. How people decide which of the many sources, such as scientific articles or patents, to read and use in their own work affects dissemination of scholarly knowledge... |
1607.00575 | Jie Gong | Jie Gong, Sheng Zhou, Zhenyu Zhou | Networked MIMO with Fractional Joint Transmission in Energy Harvesting
Systems | 33 pages, 7 figures, accepted by IEEE Transactions on Communications | null | 10.1109/TCOMM.2016.2589267 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers two base stations (BSs) powered by renewable energy
serving two users cooperatively. With different BS energy arrival rates, a
fractional joint transmission (JT) strategy is proposed, which divides each
transmission frame into two subframes. In the first subframe, one BS keeps
silent to store ene... | [
{
"created": "Sun, 3 Jul 2016 01:57:07 GMT",
"version": "v1"
}
] | 2016-11-18 | [
[
"Gong",
"Jie",
""
],
[
"Zhou",
"Sheng",
""
],
[
"Zhou",
"Zhenyu",
""
]
] | This paper considers two base stations (BSs) powered by renewable energy serving two users cooperatively. With different BS energy arrival rates, a fractional joint transmission (JT) strategy is proposed, which divides each transmission frame into two subframes. In the first subframe, one BS keeps silent to store energ... |
1805.10410 | Ross Hartley | Ross Hartley, Maani Ghaffari Jadidi, Jessy W. Grizzle, and Ryan M.
Eustice | Contact-Aided Invariant Extended Kalman Filtering for Legged Robot State
Estimation | Published in the proceedings of Robotics: Science and Systems 2018 | null | 10.15607/RSS.2018.XIV.050 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper derives a contact-aided inertial navigation observer for a 3D
bipedal robot using the theory of invariant observer design. Aided inertial
navigation is fundamentally a nonlinear observer design problem; thus, current
solutions are based on approximations of the system dynamics, such as an
Extended Kalman F... | [
{
"created": "Sat, 26 May 2018 01:58:02 GMT",
"version": "v1"
}
] | 2019-05-22 | [
[
"Hartley",
"Ross",
""
],
[
"Jadidi",
"Maani Ghaffari",
""
],
[
"Grizzle",
"Jessy W.",
""
],
[
"Eustice",
"Ryan M.",
""
]
] | This paper derives a contact-aided inertial navigation observer for a 3D bipedal robot using the theory of invariant observer design. Aided inertial navigation is fundamentally a nonlinear observer design problem; thus, current solutions are based on approximations of the system dynamics, such as an Extended Kalman Fil... |
2305.07006 | Yiheng Shen | Siddhartha Banerjee, Kamesh Munagala, Yiheng Shen, Kangning Wang | Fair Price Discrimination | null | null | null | null | cs.GT cs.DS econ.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A seller is pricing identical copies of a good to a stream of unit-demand
buyers. Each buyer has a value on the good as his private information. The
seller only knows the empirical value distribution of the buyer population and
chooses the revenue-optimal price. We consider a widely studied third-degree
price discrim... | [
{
"created": "Thu, 11 May 2023 17:45:06 GMT",
"version": "v1"
}
] | 2023-05-12 | [
[
"Banerjee",
"Siddhartha",
""
],
[
"Munagala",
"Kamesh",
""
],
[
"Shen",
"Yiheng",
""
],
[
"Wang",
"Kangning",
""
]
] | A seller is pricing identical copies of a good to a stream of unit-demand buyers. Each buyer has a value on the good as his private information. The seller only knows the empirical value distribution of the buyer population and chooses the revenue-optimal price. We consider a widely studied third-degree price discrimin... |
1210.2457 | EPTCS | Daniel Neider (RWTH Aachen University), Roman Rabinovich (RWTH Aachen
University), Martin Zimmermann (RWTH Aachen University and University of
Warsaw) | Down the Borel Hierarchy: Solving Muller Games via Safety Games | In Proceedings GandALF 2012, arXiv:1210.2028 | EPTCS 96, 2012, pp. 169-182 | 10.4204/EPTCS.96.13 | null | cs.LO cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We transform a Muller game with n vertices into a safety game with (n!)^3
vertices whose solution allows to determine the winning regions of the Muller
game and to compute a finite-state winning strategy for one player. This yields
a novel antichain-based memory structure and a natural notion of permissive
strategies... | [
{
"created": "Tue, 9 Oct 2012 00:54:33 GMT",
"version": "v1"
}
] | 2012-10-10 | [
[
"Neider",
"Daniel",
"",
"RWTH Aachen University"
],
[
"Rabinovich",
"Roman",
"",
"RWTH Aachen\n University"
],
[
"Zimmermann",
"Martin",
"",
"RWTH Aachen University and University of\n Warsaw"
]
] | We transform a Muller game with n vertices into a safety game with (n!)^3 vertices whose solution allows to determine the winning regions of the Muller game and to compute a finite-state winning strategy for one player. This yields a novel antichain-based memory structure and a natural notion of permissive strategies f... |
2406.02148 | Qingkai Min | Qingkai Min, Qipeng Guo, Xiangkun Hu, Songfang Huang, Zheng Zhang, Yue
Zhang | Synergetic Event Understanding: A Collaborative Approach to
Cross-Document Event Coreference Resolution with Large Language Models | Accepted to ACL-24 Main | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Cross-document event coreference resolution (CDECR) involves clustering event
mentions across multiple documents that refer to the same real-world events.
Existing approaches utilize fine-tuning of small language models (SLMs) like
BERT to address the compatibility among the contexts of event mentions.
However, due t... | [
{
"created": "Tue, 4 Jun 2024 09:35:47 GMT",
"version": "v1"
}
] | 2024-06-05 | [
[
"Min",
"Qingkai",
""
],
[
"Guo",
"Qipeng",
""
],
[
"Hu",
"Xiangkun",
""
],
[
"Huang",
"Songfang",
""
],
[
"Zhang",
"Zheng",
""
],
[
"Zhang",
"Yue",
""
]
] | Cross-document event coreference resolution (CDECR) involves clustering event mentions across multiple documents that refer to the same real-world events. Existing approaches utilize fine-tuning of small language models (SLMs) like BERT to address the compatibility among the contexts of event mentions. However, due to ... |
1612.08274 | Jinho Lee | Jinho Lee, Brian Kenji Iwana, Shouta Ide, Seiichi Uchida | Globally Optimal Object Tracking with Fully Convolutional Networks | 6pages, 8figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Tracking is one of the most important but still difficult tasks in computer
vision and pattern recognition. The main difficulties in the tracking field are
appearance variation and occlusion. Most traditional tracking methods set the
parameters or templates to track target objects in advance and should be
modified ac... | [
{
"created": "Sun, 25 Dec 2016 16:00:40 GMT",
"version": "v1"
}
] | 2016-12-28 | [
[
"Lee",
"Jinho",
""
],
[
"Iwana",
"Brian Kenji",
""
],
[
"Ide",
"Shouta",
""
],
[
"Uchida",
"Seiichi",
""
]
] | Tracking is one of the most important but still difficult tasks in computer vision and pattern recognition. The main difficulties in the tracking field are appearance variation and occlusion. Most traditional tracking methods set the parameters or templates to track target objects in advance and should be modified acco... |
1708.00634 | Junnan Li Mr | Junnan Li, Yongkang Wong, Qi Zhao, Mohan S. Kankanhalli | Dual-Glance Model for Deciphering Social Relationships | IEEE International Conference on Computer Vision (ICCV), 2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Since the beginning of early civilizations, social relationships derived from
each individual fundamentally form the basis of social structure in our daily
life. In the computer vision literature, much progress has been made in scene
understanding, such as object detection and scene parsing. Recent research
focuses o... | [
{
"created": "Wed, 2 Aug 2017 08:13:28 GMT",
"version": "v1"
}
] | 2017-08-03 | [
[
"Li",
"Junnan",
""
],
[
"Wong",
"Yongkang",
""
],
[
"Zhao",
"Qi",
""
],
[
"Kankanhalli",
"Mohan S.",
""
]
] | Since the beginning of early civilizations, social relationships derived from each individual fundamentally form the basis of social structure in our daily life. In the computer vision literature, much progress has been made in scene understanding, such as object detection and scene parsing. Recent research focuses on ... |
2306.06385 | Arian Prabowo | Arian Prabowo, Kaixuan Chen, Hao Xue, Subbu Sethuvenkatraman, Flora D.
Salim | Continually learning out-of-distribution spatiotemporal data for robust
energy forecasting | 15 pages, 3 figures, ECML PKDD ADS 2023. 2023 09 09 edit: repeated
column in tab 3. in previous version | null | 10.1007/978-3-031-43430-3_1 | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Forecasting building energy usage is essential for promoting sustainability
and reducing waste, as it enables building managers to optimize energy
consumption and reduce costs. This importance is magnified during anomalous
periods, such as the COVID-19 pandemic, which have disrupted occupancy patterns
and made accura... | [
{
"created": "Sat, 10 Jun 2023 09:12:10 GMT",
"version": "v1"
},
{
"created": "Sat, 9 Sep 2023 13:37:12 GMT",
"version": "v2"
}
] | 2023-10-05 | [
[
"Prabowo",
"Arian",
""
],
[
"Chen",
"Kaixuan",
""
],
[
"Xue",
"Hao",
""
],
[
"Sethuvenkatraman",
"Subbu",
""
],
[
"Salim",
"Flora D.",
""
]
] | Forecasting building energy usage is essential for promoting sustainability and reducing waste, as it enables building managers to optimize energy consumption and reduce costs. This importance is magnified during anomalous periods, such as the COVID-19 pandemic, which have disrupted occupancy patterns and made accurate... |
2004.14491 | Shruti Agarwal | Shruti Agarwal (1), Tarek El-Gaaly (2), Hany Farid (1), Ser-Nam Lim
(2) ((1) Univeristy of California, Berkeley, Berkeley, CA, USA, (2) Facebook
Research, New York, NY, USA) | Detecting Deep-Fake Videos from Appearance and Behavior | null | IEEE Workshop on Image Forensics and Security, 2020 | null | null | cs.CV cs.LG cs.MM eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Synthetically-generated audios and videos -- so-called deep fakes -- continue
to capture the imagination of the computer-graphics and computer-vision
communities. At the same time, the democratization of access to technology that
can create sophisticated manipulated video of anybody saying anything continues
to be of... | [
{
"created": "Wed, 29 Apr 2020 21:38:22 GMT",
"version": "v1"
}
] | 2021-01-29 | [
[
"Agarwal",
"Shruti",
""
],
[
"El-Gaaly",
"Tarek",
""
],
[
"Farid",
"Hany",
""
],
[
"Lim",
"Ser-Nam",
""
]
] | Synthetically-generated audios and videos -- so-called deep fakes -- continue to capture the imagination of the computer-graphics and computer-vision communities. At the same time, the democratization of access to technology that can create sophisticated manipulated video of anybody saying anything continues to be of c... |
2208.08417 | Giridhar Kaushik Ramachandran | Giridhar Kaushik Ramachandran, Kevin Lybarger, Yaya Liu, Diwakar
Mahajan, Jennifer J. Liang, Ching-Huei Tsou, Meliha Yetisgen, \"Ozlem Uzuner | Extracting Medication Changes in Clinical Narratives using Pre-trained
Language Models | null | Journal of Biomedical Informatics.139.2023.104302.1532-0464 | 10.1016/j.jbi.2023.104302 | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | An accurate and detailed account of patient medications, including medication
changes within the patient timeline, is essential for healthcare providers to
provide appropriate patient care. Healthcare providers or the patients
themselves may initiate changes to patient medication. Medication changes take
many forms, ... | [
{
"created": "Wed, 17 Aug 2022 17:22:48 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Jan 2023 21:23:54 GMT",
"version": "v2"
}
] | 2023-06-13 | [
[
"Ramachandran",
"Giridhar Kaushik",
""
],
[
"Lybarger",
"Kevin",
""
],
[
"Liu",
"Yaya",
""
],
[
"Mahajan",
"Diwakar",
""
],
[
"Liang",
"Jennifer J.",
""
],
[
"Tsou",
"Ching-Huei",
""
],
[
"Yetisgen",
"Meliha",
... | An accurate and detailed account of patient medications, including medication changes within the patient timeline, is essential for healthcare providers to provide appropriate patient care. Healthcare providers or the patients themselves may initiate changes to patient medication. Medication changes take many forms, in... |
1804.04212 | Hugo Caselles-Dupr\'e | Hugo Caselles-Dupr\'e, Florian Lesaint, Jimena Royo-Letelier | Word2Vec applied to Recommendation: Hyperparameters Matter | This paper is published on the 12th ACM Conference on Recommender
Systems, Vancouver, Canada, 2nd-7th October 2018 | null | null | null | cs.IR cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Skip-gram with negative sampling, a popular variant of Word2vec originally
designed and tuned to create word embeddings for Natural Language Processing,
has been used to create item embeddings with successful applications in
recommendation. While these fields do not share the same type of data, neither
evaluate on th... | [
{
"created": "Wed, 11 Apr 2018 20:37:35 GMT",
"version": "v1"
},
{
"created": "Tue, 8 May 2018 19:30:18 GMT",
"version": "v2"
},
{
"created": "Wed, 29 Aug 2018 15:16:08 GMT",
"version": "v3"
}
] | 2018-08-30 | [
[
"Caselles-Dupré",
"Hugo",
""
],
[
"Lesaint",
"Florian",
""
],
[
"Royo-Letelier",
"Jimena",
""
]
] | Skip-gram with negative sampling, a popular variant of Word2vec originally designed and tuned to create word embeddings for Natural Language Processing, has been used to create item embeddings with successful applications in recommendation. While these fields do not share the same type of data, neither evaluate on the ... |
1810.02003 | Govind Ramnarayan | Ran Canetti, Aloni Cohen, Nishanth Dikkala, Govind Ramnarayan, Sarah
Scheffler, Adam Smith | From Soft Classifiers to Hard Decisions: How fair can we be? | null | null | null | null | cs.LG cs.CY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A popular methodology for building binary decision-making classifiers in the
presence of imperfect information is to first construct a non-binary "scoring"
classifier that is calibrated over all protected groups, and then to
post-process this score to obtain a binary decision. We study the feasibility
of achieving va... | [
{
"created": "Wed, 3 Oct 2018 23:16:09 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Jan 2019 16:36:11 GMT",
"version": "v2"
}
] | 2019-01-23 | [
[
"Canetti",
"Ran",
""
],
[
"Cohen",
"Aloni",
""
],
[
"Dikkala",
"Nishanth",
""
],
[
"Ramnarayan",
"Govind",
""
],
[
"Scheffler",
"Sarah",
""
],
[
"Smith",
"Adam",
""
]
] | A popular methodology for building binary decision-making classifiers in the presence of imperfect information is to first construct a non-binary "scoring" classifier that is calibrated over all protected groups, and then to post-process this score to obtain a binary decision. We study the feasibility of achieving vari... |
2102.00696 | Selim Furkan Tekin | Selim Furkan Tekin, Arda Fazla and Suleyman Serdar Kozat | Numerical Weather Forecasting using Convolutional-LSTM with Attention
and Context Matcher Mechanisms | - In our journal submission, we removed the integration of the
observational data section since it was not used in the experiments. Thus, we
also removed the authors from the paper who were responsible for that
section. - In the second version, we also performed an experiment on
WeatherBench. We compare our res... | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Numerical weather forecasting using high-resolution physical models often
requires extensive computational resources on supercomputers, which diminishes
their wide usage in most real-life applications. As a remedy, applying deep
learning methods has revealed innovative solutions within this field. To this
end, we int... | [
{
"created": "Mon, 1 Feb 2021 08:30:42 GMT",
"version": "v1"
},
{
"created": "Wed, 4 Oct 2023 18:56:52 GMT",
"version": "v2"
}
] | 2023-10-06 | [
[
"Tekin",
"Selim Furkan",
""
],
[
"Fazla",
"Arda",
""
],
[
"Kozat",
"Suleyman Serdar",
""
]
] | Numerical weather forecasting using high-resolution physical models often requires extensive computational resources on supercomputers, which diminishes their wide usage in most real-life applications. As a remedy, applying deep learning methods has revealed innovative solutions within this field. To this end, we intro... |
1304.6274 | Rohan Padhye | Rohan Padhye and Uday P. Khedker | Interprocedural Data Flow Analysis in Soot using Value Contexts | SOAP 2013 Final Version | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An interprocedural analysis is precise if it is flow sensitive and fully
context-sensitive even in the presence of recursion. Many methods of
interprocedural analysis sacrifice precision for scalability while some are
precise but limited to only a certain class of problems.
Soot currently supports interprocedural a... | [
{
"created": "Tue, 23 Apr 2013 13:02:09 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Jul 2013 06:48:43 GMT",
"version": "v2"
}
] | 2013-07-30 | [
[
"Padhye",
"Rohan",
""
],
[
"Khedker",
"Uday P.",
""
]
] | An interprocedural analysis is precise if it is flow sensitive and fully context-sensitive even in the presence of recursion. Many methods of interprocedural analysis sacrifice precision for scalability while some are precise but limited to only a certain class of problems. Soot currently supports interprocedural analy... |
1509.06016 | Lei Deng | Lei Deng, Siyuan Huang, Yueqi Duan, Baohua Chen, Jie Zhou | Image Set Querying Based Localization | VCIP2015, 4 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Conventional single image based localization methods usually fail to localize
a querying image when there exist large variations between the querying image
and the pre-built scene. To address this, we propose an image-set querying
based localization approach. When the localization by a single image fails to
work, the... | [
{
"created": "Sun, 20 Sep 2015 13:49:30 GMT",
"version": "v1"
}
] | 2015-09-22 | [
[
"Deng",
"Lei",
""
],
[
"Huang",
"Siyuan",
""
],
[
"Duan",
"Yueqi",
""
],
[
"Chen",
"Baohua",
""
],
[
"Zhou",
"Jie",
""
]
] | Conventional single image based localization methods usually fail to localize a querying image when there exist large variations between the querying image and the pre-built scene. To address this, we propose an image-set querying based localization approach. When the localization by a single image fails to work, the s... |
1905.05053 | Guoxian Yu | Shixing Yao, Guoxian Yu, Jun Wang, Carlotta Domeniconi and Xiangliang
Zhang | Multi-View Multiple Clustering | 7 pages, 5 figures, uses ijcai19.sty | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multiple clustering aims at exploring alternative clusterings to organize the
data into meaningful groups from different perspectives. Existing multiple
clustering algorithms are designed for single-view data. We assume that the
individuality and commonality of multi-view data can be leveraged to generate
high-qualit... | [
{
"created": "Mon, 13 May 2019 14:20:44 GMT",
"version": "v1"
}
] | 2019-05-16 | [
[
"Yao",
"Shixing",
""
],
[
"Yu",
"Guoxian",
""
],
[
"Wang",
"Jun",
""
],
[
"Domeniconi",
"Carlotta",
""
],
[
"Zhang",
"Xiangliang",
""
]
] | Multiple clustering aims at exploring alternative clusterings to organize the data into meaningful groups from different perspectives. Existing multiple clustering algorithms are designed for single-view data. We assume that the individuality and commonality of multi-view data can be leveraged to generate high-quality ... |
2002.11474 | Siyue Wang | Peiyan Dong, Siyue Wang, Wei Niu, Chengming Zhang, Sheng Lin, Zhengang
Li, Yifan Gong, Bin Ren, Xue Lin, Yanzhi Wang, and Dingwen Tao | RTMobile: Beyond Real-Time Mobile Acceleration of RNNs for Speech
Recognition | null | null | null | null | cs.SD cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recurrent neural networks (RNNs) based automatic speech recognition has
nowadays become prevalent on mobile devices such as smart phones. However,
previous RNN compression techniques either suffer from hardware performance
overhead due to irregularity or significant accuracy loss due to the preserved
regularity for h... | [
{
"created": "Wed, 19 Feb 2020 00:07:32 GMT",
"version": "v1"
}
] | 2020-02-28 | [
[
"Dong",
"Peiyan",
""
],
[
"Wang",
"Siyue",
""
],
[
"Niu",
"Wei",
""
],
[
"Zhang",
"Chengming",
""
],
[
"Lin",
"Sheng",
""
],
[
"Li",
"Zhengang",
""
],
[
"Gong",
"Yifan",
""
],
[
"Ren",
"Bin",
... | Recurrent neural networks (RNNs) based automatic speech recognition has nowadays become prevalent on mobile devices such as smart phones. However, previous RNN compression techniques either suffer from hardware performance overhead due to irregularity or significant accuracy loss due to the preserved regularity for har... |
1802.01481 | Jeffrey Lienert | Jeffrey Lienert, Laura Koehly, Felix Reed-Tsochas, Christopher Steven
Marcum | An efficient counting method for the colored triad census | null | Social Networks 59 (2019) 136-142 | 10.1016/j.socnet.2019.04.003 | null | cs.DS cs.SI | http://creativecommons.org/publicdomain/zero/1.0/ | The triad census is an important approach to understand local structure in
network science, providing comprehensive assessments of the observed relational
configurations between triples of actors in a network. However, researchers are
often interested in combinations of relational and categorical nodal
attributes. In... | [
{
"created": "Mon, 5 Feb 2018 15:56:30 GMT",
"version": "v1"
},
{
"created": "Fri, 18 May 2018 15:21:29 GMT",
"version": "v2"
}
] | 2019-05-02 | [
[
"Lienert",
"Jeffrey",
""
],
[
"Koehly",
"Laura",
""
],
[
"Reed-Tsochas",
"Felix",
""
],
[
"Marcum",
"Christopher Steven",
""
]
] | The triad census is an important approach to understand local structure in network science, providing comprehensive assessments of the observed relational configurations between triples of actors in a network. However, researchers are often interested in combinations of relational and categorical nodal attributes. In t... |
2302.06279 | Gorka Abad | Gorka Abad, Oguzhan Ersoy, Stjepan Picek, Aitor Urbieta | Sneaky Spikes: Uncovering Stealthy Backdoor Attacks in Spiking Neural
Networks with Neuromorphic Data | To appear in Network and Distributed System Security (NDSS) Symposium
2024 | NDSS Symposium 2024 | 10.14722/ndss.2024.24334 | null | cs.CR cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Deep neural networks (DNNs) have demonstrated remarkable performance across
various tasks, including image and speech recognition. However, maximizing the
effectiveness of DNNs requires meticulous optimization of numerous
hyperparameters and network parameters through training. Moreover,
high-performance DNNs entail ... | [
{
"created": "Mon, 13 Feb 2023 11:34:17 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Jul 2023 07:03:22 GMT",
"version": "v2"
},
{
"created": "Mon, 5 Feb 2024 11:09:00 GMT",
"version": "v3"
}
] | 2024-06-14 | [
[
"Abad",
"Gorka",
""
],
[
"Ersoy",
"Oguzhan",
""
],
[
"Picek",
"Stjepan",
""
],
[
"Urbieta",
"Aitor",
""
]
] | Deep neural networks (DNNs) have demonstrated remarkable performance across various tasks, including image and speech recognition. However, maximizing the effectiveness of DNNs requires meticulous optimization of numerous hyperparameters and network parameters through training. Moreover, high-performance DNNs entail ma... |
2205.01685 | Sajal Saha | Sajal Saha, Anwar Haque, and Greg Sidebottom | Deep Sequence Modeling for Anomalous ISP Traffic Prediction | 6 pages, 6 images, To appear in the Proceedings of IEEE International
Conference on Communications, Seoul, South Korea, 2022. arXiv admin note:
substantial text overlap with arXiv:2205.01300 | null | null | null | cs.LG cs.NI eess.SP | http://creativecommons.org/licenses/by-sa/4.0/ | Internet traffic in the real world is susceptible to various external and
internal factors which may abruptly change the normal traffic flow. Those
unexpected changes are considered outliers in traffic. However, deep sequence
models have been used to predict complex IP traffic, but their comparative
performance for a... | [
{
"created": "Tue, 3 May 2022 17:01:45 GMT",
"version": "v1"
}
] | 2022-05-05 | [
[
"Saha",
"Sajal",
""
],
[
"Haque",
"Anwar",
""
],
[
"Sidebottom",
"Greg",
""
]
] | Internet traffic in the real world is susceptible to various external and internal factors which may abruptly change the normal traffic flow. Those unexpected changes are considered outliers in traffic. However, deep sequence models have been used to predict complex IP traffic, but their comparative performance for ano... |
2405.06749 | Dimitrios Kollias | Vasileios Karampinis, Anastasios Arsenos, Orfeas Filippopoulos,
Evangelos Petrongonas, Christos Skliros, Dimitrios Kollias, Stefanos Kollias
and Athanasios Voulodimos | Ensuring UAV Safety: A Vision-only and Real-time Framework for Collision
Avoidance Through Object Detection, Tracking, and Distance Estimation | accepted at ICUAS 2024 | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In the last twenty years, unmanned aerial vehicles (UAVs) have garnered
growing interest due to their expanding applications in both military and
civilian domains. Detecting non-cooperative aerial vehicles with efficiency and
estimating collisions accurately are pivotal for achieving fully autonomous
aircraft and fac... | [
{
"created": "Fri, 10 May 2024 18:06:41 GMT",
"version": "v1"
},
{
"created": "Thu, 16 May 2024 14:24:37 GMT",
"version": "v2"
}
] | 2024-05-17 | [
[
"Karampinis",
"Vasileios",
""
],
[
"Arsenos",
"Anastasios",
""
],
[
"Filippopoulos",
"Orfeas",
""
],
[
"Petrongonas",
"Evangelos",
""
],
[
"Skliros",
"Christos",
""
],
[
"Kollias",
"Dimitrios",
""
],
[
"Kollias",
... | In the last twenty years, unmanned aerial vehicles (UAVs) have garnered growing interest due to their expanding applications in both military and civilian domains. Detecting non-cooperative aerial vehicles with efficiency and estimating collisions accurately are pivotal for achieving fully autonomous aircraft and facil... |
1608.03819 | Chenyou Fan | Chenyou Fan, David J. Crandall | DeepDiary: Automatic Caption Generation for Lifelogging Image Streams | This is an expanded preprint of a paper appearing at the ECCV
International Workshop on Egocentric Perception, Interaction, and Computing | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Lifelogging cameras capture everyday life from a first-person perspective,
but generate so much data that it is hard for users to browse and organize
their image collections effectively. In this paper, we propose to use automatic
image captioning algorithms to generate textual representations of these
collections. We... | [
{
"created": "Fri, 12 Aug 2016 15:17:33 GMT",
"version": "v1"
}
] | 2016-08-15 | [
[
"Fan",
"Chenyou",
""
],
[
"Crandall",
"David J.",
""
]
] | Lifelogging cameras capture everyday life from a first-person perspective, but generate so much data that it is hard for users to browse and organize their image collections effectively. In this paper, we propose to use automatic image captioning algorithms to generate textual representations of these collections. We d... |
2406.05374 | Tao He | Tao He, Lizi Liao, Yixin Cao, Yuanxing Liu, Ming Liu, Zerui Chen, Bing
Qin | Planning Like Human: A Dual-process Framework for Dialogue Planning | 24 pages, 5 figures, ACL 2024 main conference | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In proactive dialogue, the challenge lies not just in generating responses
but in steering conversations toward predetermined goals, a task where Large
Language Models (LLMs) typically struggle due to their reactive nature.
Traditional approaches to enhance dialogue planning in LLMs, ranging from
elaborate prompt eng... | [
{
"created": "Sat, 8 Jun 2024 06:52:47 GMT",
"version": "v1"
}
] | 2024-06-11 | [
[
"He",
"Tao",
""
],
[
"Liao",
"Lizi",
""
],
[
"Cao",
"Yixin",
""
],
[
"Liu",
"Yuanxing",
""
],
[
"Liu",
"Ming",
""
],
[
"Chen",
"Zerui",
""
],
[
"Qin",
"Bing",
""
]
] | In proactive dialogue, the challenge lies not just in generating responses but in steering conversations toward predetermined goals, a task where Large Language Models (LLMs) typically struggle due to their reactive nature. Traditional approaches to enhance dialogue planning in LLMs, ranging from elaborate prompt engin... |
2312.03051 | Isaac Liao | Isaac Liao, Ziming Liu, Max Tegmark | Generating Interpretable Networks using Hypernetworks | 15 pages, 7 figures | null | null | null | cs.LG cs.AI cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An essential goal in mechanistic interpretability to decode a network, i.e.,
to convert a neural network's raw weights to an interpretable algorithm. Given
the difficulty of the decoding problem, progress has been made to understand
the easier encoding problem, i.e., to convert an interpretable algorithm into
network... | [
{
"created": "Tue, 5 Dec 2023 18:55:32 GMT",
"version": "v1"
}
] | 2023-12-07 | [
[
"Liao",
"Isaac",
""
],
[
"Liu",
"Ziming",
""
],
[
"Tegmark",
"Max",
""
]
] | An essential goal in mechanistic interpretability to decode a network, i.e., to convert a neural network's raw weights to an interpretable algorithm. Given the difficulty of the decoding problem, progress has been made to understand the easier encoding problem, i.e., to convert an interpretable algorithm into network w... |
1606.03662 | Haishan Wu | Mengwen Xu, Tianyi Wang, Zhengwei Wu, Jingbo Zhou, Jian Li, Haishan Wu | Store Location Selection via Mining Search Query Logs of Baidu Maps | null | null | null | null | cs.AI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Choosing a good location when opening a new store is crucial for the future
success of a business. Traditional methods include offline manual survey, which
is very time consuming, and analytic models based on census data, which are un-
able to adapt to the dynamic market. The rapid increase of the availability of
big... | [
{
"created": "Sun, 12 Jun 2016 03:42:10 GMT",
"version": "v1"
}
] | 2016-06-14 | [
[
"Xu",
"Mengwen",
""
],
[
"Wang",
"Tianyi",
""
],
[
"Wu",
"Zhengwei",
""
],
[
"Zhou",
"Jingbo",
""
],
[
"Li",
"Jian",
""
],
[
"Wu",
"Haishan",
""
]
] | Choosing a good location when opening a new store is crucial for the future success of a business. Traditional methods include offline manual survey, which is very time consuming, and analytic models based on census data, which are un- able to adapt to the dynamic market. The rapid increase of the availability of big d... |
1904.00378 | Giuseppe Silano | Giuseppe Silano, Luigi Iannelli | MAT-Fly: An Educational Platform for Simulating Unmanned Aerial Vehicles
Aimed to Detect and Track Moving Objects | 11 pages, 15 figures, journal paper | IEEE Access, 2021 | 10.1109/ACCESS.2021.3064758 | null | cs.RO cs.SY | http://creativecommons.org/licenses/by/4.0/ | The main motivation of this work is to propose a simulation approach for a
specific task within the Unmanned Aerial Vehicle (UAV) field, i.e., the visual
detection and tracking of arbitrary moving objects. In particular, it is
described MAT-Fly, a numerical simulation platform for multi-rotor aircraft
characterized b... | [
{
"created": "Sun, 31 Mar 2019 10:56:47 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Aug 2019 15:25:19 GMT",
"version": "v2"
},
{
"created": "Fri, 17 Jan 2020 15:56:56 GMT",
"version": "v3"
},
{
"created": "Wed, 10 Mar 2021 13:47:33 GMT",
"version": "v4"
}
] | 2021-03-11 | [
[
"Silano",
"Giuseppe",
""
],
[
"Iannelli",
"Luigi",
""
]
] | The main motivation of this work is to propose a simulation approach for a specific task within the Unmanned Aerial Vehicle (UAV) field, i.e., the visual detection and tracking of arbitrary moving objects. In particular, it is described MAT-Fly, a numerical simulation platform for multi-rotor aircraft characterized by ... |
2401.14743 | Takanori Ugai | Takanori Ugai, Shusaku Egami, Swe Nwe Nwe Htun, Kouji Kozaki, Takahiro
Kawamura, Ken Fukuda | Synthetic Multimodal Dataset for Empowering Safety and Well-being in
Home Environments | 7 pages, 2 figures,4 tables | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | This paper presents a synthetic multimodal dataset of daily activities that
fuses video data from a 3D virtual space simulator with knowledge graphs
depicting the spatiotemporal context of the activities. The dataset is
developed for the Knowledge Graph Reasoning Challenge for Social Issues
(KGRC4SI), which focuses o... | [
{
"created": "Fri, 26 Jan 2024 10:05:41 GMT",
"version": "v1"
}
] | 2024-01-29 | [
[
"Ugai",
"Takanori",
""
],
[
"Egami",
"Shusaku",
""
],
[
"Htun",
"Swe Nwe Nwe",
""
],
[
"Kozaki",
"Kouji",
""
],
[
"Kawamura",
"Takahiro",
""
],
[
"Fukuda",
"Ken",
""
]
] | This paper presents a synthetic multimodal dataset of daily activities that fuses video data from a 3D virtual space simulator with knowledge graphs depicting the spatiotemporal context of the activities. The dataset is developed for the Knowledge Graph Reasoning Challenge for Social Issues (KGRC4SI), which focuses on ... |
2301.04733 | Weihua Zhou | Chen Zhao, Zhihui Xu, Jingfeng Jiang, Michele Esposito, Drew Pienta,
Guang-Uei Hung, Weihua Zhou | AGMN: Association Graph-based Graph Matching Network for Coronary Artery
Semantic Labeling on Invasive Coronary Angiograms | 26 pages, 7 figures | null | 10.1016/j.patcog.2023.109789 | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Semantic labeling of coronary arterial segments in invasive coronary
angiography (ICA) is important for automated assessment and report generation
of coronary artery stenosis in the computer-aided diagnosis of coronary artery
disease (CAD). Inspired by the training procedure of interventional
cardiologists for interp... | [
{
"created": "Wed, 11 Jan 2023 21:54:28 GMT",
"version": "v1"
}
] | 2023-12-22 | [
[
"Zhao",
"Chen",
""
],
[
"Xu",
"Zhihui",
""
],
[
"Jiang",
"Jingfeng",
""
],
[
"Esposito",
"Michele",
""
],
[
"Pienta",
"Drew",
""
],
[
"Hung",
"Guang-Uei",
""
],
[
"Zhou",
"Weihua",
""
]
] | Semantic labeling of coronary arterial segments in invasive coronary angiography (ICA) is important for automated assessment and report generation of coronary artery stenosis in the computer-aided diagnosis of coronary artery disease (CAD). Inspired by the training procedure of interventional cardiologists for interpre... |
2104.03904 | Bilal Abu-Salih | Bilal Abu-Salih, Pornpit Wongthongtham, Dengya Zhu, Kit Yan Chan, Amit
Rudra | Social Big Data: An Overview and Applications | null | null | 10.1007/978-981-33-6652-7_1 | null | cs.SI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The emergence of online social media services has made a qualitative leap and
brought profound changes to various aspects of human, cultural, intellectual,
and social life. These significant Big data tributaries have further
transformed the businesses processes by establishing convergent and transparent
dialogues bet... | [
{
"created": "Thu, 1 Apr 2021 14:39:23 GMT",
"version": "v1"
}
] | 2021-04-09 | [
[
"Abu-Salih",
"Bilal",
""
],
[
"Wongthongtham",
"Pornpit",
""
],
[
"Zhu",
"Dengya",
""
],
[
"Chan",
"Kit Yan",
""
],
[
"Rudra",
"Amit",
""
]
] | The emergence of online social media services has made a qualitative leap and brought profound changes to various aspects of human, cultural, intellectual, and social life. These significant Big data tributaries have further transformed the businesses processes by establishing convergent and transparent dialogues betwe... |
2308.15768 | Michelle S Lam | Michelle S. Lam, Ayush Pandit, Colin H. Kalicki, Rachit Gupta, Poonam
Sahoo, Dana\"e Metaxa | Sociotechnical Audits: Broadening the Algorithm Auditing Lens to
Investigate Targeted Advertising | To appear at CSCW 2023 | null | 10.1145/3610209 | null | cs.HC cs.CY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Algorithm audits are powerful tools for studying black-box systems. While
very effective in examining technical components, the method stops short of a
sociotechnical frame, which would also consider users as an integral and
dynamic part of the system. Addressing this gap, we propose the concept of
sociotechnical aud... | [
{
"created": "Wed, 30 Aug 2023 05:26:47 GMT",
"version": "v1"
}
] | 2023-08-31 | [
[
"Lam",
"Michelle S.",
""
],
[
"Pandit",
"Ayush",
""
],
[
"Kalicki",
"Colin H.",
""
],
[
"Gupta",
"Rachit",
""
],
[
"Sahoo",
"Poonam",
""
],
[
"Metaxa",
"Danaë",
""
]
] | Algorithm audits are powerful tools for studying black-box systems. While very effective in examining technical components, the method stops short of a sociotechnical frame, which would also consider users as an integral and dynamic part of the system. Addressing this gap, we propose the concept of sociotechnical audit... |
2204.13997 | W B Langdon | William B. Langdon | Failed Disruption Propagation in Integer Genetic Programming | Long version of GECCO 2022 poster | null | 10.1145/3520304.3528878 | null | cs.NE cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We inject a random value into the evaluation of highly evolved deep integer
GP trees 9743720 times and find 99.7percent Suggesting crossover and mutation's
impact are dissipated and seldom propagate outside the program. Indeed only
errors near the root node have impact and disruption falls exponentially with
depth at... | [
{
"created": "Mon, 4 Apr 2022 07:20:52 GMT",
"version": "v1"
}
] | 2022-05-02 | [
[
"Langdon",
"William B.",
""
]
] | We inject a random value into the evaluation of highly evolved deep integer GP trees 9743720 times and find 99.7percent Suggesting crossover and mutation's impact are dissipated and seldom propagate outside the program. Indeed only errors near the root node have impact and disruption falls exponentially with depth at b... |
1612.03316 | Omar Alonso | Omar Alonso | Label Visualization and Exploration in IR | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is a renaissance in visual analytics systems for data analysis and
sharing, in particular, in the current wave of big data applications. We
introduce RAVE, a prototype that automates the generation of an interface that
uses facets and visualization techniques for exploring and analyzing relevance
assessments da... | [
{
"created": "Sat, 10 Dec 2016 16:33:06 GMT",
"version": "v1"
}
] | 2016-12-13 | [
[
"Alonso",
"Omar",
""
]
] | There is a renaissance in visual analytics systems for data analysis and sharing, in particular, in the current wave of big data applications. We introduce RAVE, a prototype that automates the generation of an interface that uses facets and visualization techniques for exploring and analyzing relevance assessments data... |
2407.07046 | Yangmin Li | Yangmin Li, Ruiqi Zhu, Wengen Li | CorMulT: A Semi-supervised Modality Correlation-aware Multimodal
Transformer for Sentiment Analysis | null | null | null | null | cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multimodal sentiment analysis is an active research area that combines
multiple data modalities, e.g., text, image and audio, to analyze human
emotions and benefits a variety of applications. Existing multimodal sentiment
analysis methods can be classified as modality interaction-based methods,
modality transformatio... | [
{
"created": "Tue, 9 Jul 2024 17:07:29 GMT",
"version": "v1"
}
] | 2024-07-10 | [
[
"Li",
"Yangmin",
""
],
[
"Zhu",
"Ruiqi",
""
],
[
"Li",
"Wengen",
""
]
] | Multimodal sentiment analysis is an active research area that combines multiple data modalities, e.g., text, image and audio, to analyze human emotions and benefits a variety of applications. Existing multimodal sentiment analysis methods can be classified as modality interaction-based methods, modality transformation-... |
2407.14417 | HamidReza Imani | HamidReza Imani, Abdolah Amirany, and Tarek El-Ghazawi | Mixture of Experts with Mixture of Precisions for Tuning Quality of
Service | null | null | null | null | cs.DC cs.AI cs.LG cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The increasing demand for deploying large Mixture-of-Experts (MoE) models in
resource-constrained environments necessitates efficient approaches to address
their high memory and computational requirements challenges. Moreover, given
that tasks come in different user-defined constraints and the available
resources cha... | [
{
"created": "Fri, 19 Jul 2024 15:42:49 GMT",
"version": "v1"
}
] | 2024-07-22 | [
[
"Imani",
"HamidReza",
""
],
[
"Amirany",
"Abdolah",
""
],
[
"El-Ghazawi",
"Tarek",
""
]
] | The increasing demand for deploying large Mixture-of-Experts (MoE) models in resource-constrained environments necessitates efficient approaches to address their high memory and computational requirements challenges. Moreover, given that tasks come in different user-defined constraints and the available resources chang... |
1811.04199 | Amir Ashouri | Amir H. Ashouri, Tarek S. Abdelrahman, Alwyn Dos Remedios | Fast On-the-fly Retraining-free Sparsification of Convolutional Neural
Networks | Extended Version of Our Accepted Paper in NIPS 2018, CDNNRIA
Workshop: (https://nips.cc/Conferences/2018/Schedule?showEvent=10941)-
Reviews are available at OpenReview
(https://openreview.net/forum?id=rkz1YD0vjm) | Elsevier Neurocomputing, 2019 | 10.1016/j.neucom.2019.08.063 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern Convolutional Neural Networks (CNNs) are complex, encompassing
millions of parameters. Their deployment exerts computational, storage and
energy demands, particularly on embedded platforms. Existing approaches to
prune or sparsify CNNs require retraining to maintain inference accuracy. Such
retraining is not f... | [
{
"created": "Sat, 10 Nov 2018 05:43:36 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Nov 2018 23:54:25 GMT",
"version": "v2"
},
{
"created": "Sun, 8 Sep 2019 17:03:08 GMT",
"version": "v3"
}
] | 2019-09-10 | [
[
"Ashouri",
"Amir H.",
""
],
[
"Abdelrahman",
"Tarek S.",
""
],
[
"Remedios",
"Alwyn Dos",
""
]
] | Modern Convolutional Neural Networks (CNNs) are complex, encompassing millions of parameters. Their deployment exerts computational, storage and energy demands, particularly on embedded platforms. Existing approaches to prune or sparsify CNNs require retraining to maintain inference accuracy. Such retraining is not fea... |
2404.14637 | Larissa Salerno | Larissa Salerno, Christoph Treude, Patanamon Thongtatunam | Open Source Software Development Tool Installation: Challenges and
Strategies For Novice Developers | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by-sa/4.0/ | As the world of technology advances, so do the tools that software developers
use to create new programs. In recent years, software development tools have
become more popular, allowing developers to work more efficiently and produce
higher-quality software. Still, installing such tools can be challenging for
novice d... | [
{
"created": "Tue, 23 Apr 2024 00:25:57 GMT",
"version": "v1"
}
] | 2024-04-24 | [
[
"Salerno",
"Larissa",
""
],
[
"Treude",
"Christoph",
""
],
[
"Thongtatunam",
"Patanamon",
""
]
] | As the world of technology advances, so do the tools that software developers use to create new programs. In recent years, software development tools have become more popular, allowing developers to work more efficiently and produce higher-quality software. Still, installing such tools can be challenging for novice dev... |
2304.07926 | Bruno Tafur | Bruno Tafur and Advait Sarkar | User Perceptions of Automatic Fake News Detection: Can Algorithms Fight
Online Misinformation? | null | null | null | null | cs.HC cs.CY | http://creativecommons.org/licenses/by/4.0/ | Fake news detection algorithms apply machine learning to various news
attributes and their relationships. However, their success is usually evaluated
based on how the algorithm performs on a static benchmark, independent of real
users. On the other hand, studies of user trust in fake news has identified
relevant fact... | [
{
"created": "Mon, 17 Apr 2023 00:37:53 GMT",
"version": "v1"
}
] | 2023-04-18 | [
[
"Tafur",
"Bruno",
""
],
[
"Sarkar",
"Advait",
""
]
] | Fake news detection algorithms apply machine learning to various news attributes and their relationships. However, their success is usually evaluated based on how the algorithm performs on a static benchmark, independent of real users. On the other hand, studies of user trust in fake news has identified relevant factor... |
2301.10352 | Kenneth Clarkson | Kenneth L. Clarkson, Shashanka Ubaru, Elizabeth Yang | Capacity Analysis of Vector Symbolic Architectures | null | null | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hyperdimensional computing (HDC) is a biologically-inspired framework which
represents symbols with high-dimensional vectors, and uses vector operations to
manipulate them. The ensemble of a particular vector space and a prescribed set
of vector operations (including one addition-like for "bundling" and one
outer-pro... | [
{
"created": "Tue, 24 Jan 2023 23:43:25 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Feb 2023 20:50:04 GMT",
"version": "v2"
}
] | 2023-02-16 | [
[
"Clarkson",
"Kenneth L.",
""
],
[
"Ubaru",
"Shashanka",
""
],
[
"Yang",
"Elizabeth",
""
]
] | Hyperdimensional computing (HDC) is a biologically-inspired framework which represents symbols with high-dimensional vectors, and uses vector operations to manipulate them. The ensemble of a particular vector space and a prescribed set of vector operations (including one addition-like for "bundling" and one outer-produ... |
1706.06806 | Rakesh Venkat | Yuval Rabani, Rakesh Venkat | Approximating Sparsest Cut in Low Rank Graphs via Embeddings from
Approximately Low-Dimensional Spaces | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of embedding a finite set of points $\{x_1, \ldots,
x_n\} \in \mathbb{R}^d$ that satisfy $\ell_2^2$ triangle inequalities into
$\ell_1$, when the points are approximately low-dimensional. Goemans
(unpublished, appears in a work of [Magen and Moharammi, 2008]) showed that
such points residing i... | [
{
"created": "Wed, 21 Jun 2017 09:38:37 GMT",
"version": "v1"
}
] | 2017-06-22 | [
[
"Rabani",
"Yuval",
""
],
[
"Venkat",
"Rakesh",
""
]
] | We consider the problem of embedding a finite set of points $\{x_1, \ldots, x_n\} \in \mathbb{R}^d$ that satisfy $\ell_2^2$ triangle inequalities into $\ell_1$, when the points are approximately low-dimensional. Goemans (unpublished, appears in a work of [Magen and Moharammi, 2008]) showed that such points residing in ... |
1501.00512 | Massimiliano Dal Mas | Massimiliano Dal Mas | Function of Forgetfulness for the Tedium of Oblivion on Liquidity of
Ontology Matching | 4 pages, 1 figure; for details see: http://www.maxdalmas.com | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The shallow and fragile knowledge on the Web does not examine in depth the
things: it behaves lightly. The conditions created by the Web makes our
attention labile and especially fickle, it's unable to concentrate for long as
we are trained to "surf" without going though never in depth. The Web also
brings with it th... | [
{
"created": "Fri, 2 Jan 2015 23:19:01 GMT",
"version": "v1"
}
] | 2015-01-06 | [
[
"Mas",
"Massimiliano Dal",
""
]
] | The shallow and fragile knowledge on the Web does not examine in depth the things: it behaves lightly. The conditions created by the Web makes our attention labile and especially fickle, it's unable to concentrate for long as we are trained to "surf" without going though never in depth. The Web also brings with it the ... |
2108.08712 | Matias Valdenegro-Toro | Matias Valdenegro-Toro | Teaching Uncertainty Quantification in Machine Learning through Use
Cases | 2nd Teaching in Machine Learning Workshop, Camera Ready, 5 pages, 3
figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Uncertainty in machine learning is not generally taught as general knowledge
in Machine Learning course curricula. In this paper we propose a short
curriculum for a course about uncertainty in machine learning, and complement
the course with a selection of use cases, aimed to trigger discussion and let
students play ... | [
{
"created": "Thu, 19 Aug 2021 14:22:17 GMT",
"version": "v1"
}
] | 2021-08-20 | [
[
"Valdenegro-Toro",
"Matias",
""
]
] | Uncertainty in machine learning is not generally taught as general knowledge in Machine Learning course curricula. In this paper we propose a short curriculum for a course about uncertainty in machine learning, and complement the course with a selection of use cases, aimed to trigger discussion and let students play wi... |
1911.05870 | Kushagra Mahajan | Kushagra Mahajan, Monika Sharma, Lovekesh Vig | Character Keypoint-based Homography Estimation in Scanned Documents for
Efficient Information Extraction | 6 pages, 4 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Precise homography estimation between multiple images is a pre-requisite for
many computer vision applications. One application that is particularly
relevant in today's digital era is the alignment of scanned or camera-captured
document images such as insurance claim forms for information extraction.
Traditional lear... | [
{
"created": "Thu, 14 Nov 2019 00:44:55 GMT",
"version": "v1"
}
] | 2019-11-15 | [
[
"Mahajan",
"Kushagra",
""
],
[
"Sharma",
"Monika",
""
],
[
"Vig",
"Lovekesh",
""
]
] | Precise homography estimation between multiple images is a pre-requisite for many computer vision applications. One application that is particularly relevant in today's digital era is the alignment of scanned or camera-captured document images such as insurance claim forms for information extraction. Traditional learni... |
2006.00165 | Ashraf Tantawy | Ashraf Tantawy, Sherif Abdelwahed, and Abdelkarim Erradi | Cyber LOPA: An Integrated Approach for the Design of Dependable and
Secure Cyber Physical Systems | Preprint version of the published paper | IEEE Transactions on Reliability, VOL. 71, NO. 2, JUNE 2022 | 10.1109/TR.2022.3163652 | null | cs.CR cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Safety risk assessment is an essential process to ensure a dependable
Cyber-Physical System (CPS) design. Traditional risk assessment considers only
physical failures. For modern CPS, failures caused by cyber attacks are on the
rise. The focus of latest research effort is on safety-security lifecycle
integration and ... | [
{
"created": "Sat, 30 May 2020 03:53:18 GMT",
"version": "v1"
},
{
"created": "Sat, 6 Jun 2020 18:53:26 GMT",
"version": "v2"
},
{
"created": "Thu, 15 Jul 2021 12:32:14 GMT",
"version": "v3"
},
{
"created": "Wed, 17 Aug 2022 16:05:51 GMT",
"version": "v4"
}
] | 2022-08-18 | [
[
"Tantawy",
"Ashraf",
""
],
[
"Abdelwahed",
"Sherif",
""
],
[
"Erradi",
"Abdelkarim",
""
]
] | Safety risk assessment is an essential process to ensure a dependable Cyber-Physical System (CPS) design. Traditional risk assessment considers only physical failures. For modern CPS, failures caused by cyber attacks are on the rise. The focus of latest research effort is on safety-security lifecycle integration and th... |
2402.12377 | Christian Reiser | Christian Reiser, Stephan Garbin, Pratul P. Srinivasan, Dor Verbin,
Richard Szeliski, Ben Mildenhall, Jonathan T. Barron, Peter Hedman, Andreas
Geiger | Binary Opacity Grids: Capturing Fine Geometric Detail for Mesh-Based
View Synthesis | Project page at https://binary-opacity-grid.github.io | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While surface-based view synthesis algorithms are appealing due to their low
computational requirements, they often struggle to reproduce thin structures.
In contrast, more expensive methods that model the scene's geometry as a
volumetric density field (e.g. NeRF) excel at reconstructing fine geometric
detail. Howeve... | [
{
"created": "Mon, 19 Feb 2024 18:59:41 GMT",
"version": "v1"
}
] | 2024-02-20 | [
[
"Reiser",
"Christian",
""
],
[
"Garbin",
"Stephan",
""
],
[
"Srinivasan",
"Pratul P.",
""
],
[
"Verbin",
"Dor",
""
],
[
"Szeliski",
"Richard",
""
],
[
"Mildenhall",
"Ben",
""
],
[
"Barron",
"Jonathan T.",
"... | While surface-based view synthesis algorithms are appealing due to their low computational requirements, they often struggle to reproduce thin structures. In contrast, more expensive methods that model the scene's geometry as a volumetric density field (e.g. NeRF) excel at reconstructing fine geometric detail. However,... |
1609.07053 | Johannes Bjerva | Johannes Bjerva and Barbara Plank and Johan Bos | Semantic Tagging with Deep Residual Networks | COLING 2016, camera ready version | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We propose a novel semantic tagging task, sem-tagging, tailored for the
purpose of multilingual semantic parsing, and present the first tagger using
deep residual networks (ResNets). Our tagger uses both word and character
representations and includes a novel residual bypass architecture. We evaluate
the tagset both ... | [
{
"created": "Thu, 22 Sep 2016 16:34:00 GMT",
"version": "v1"
},
{
"created": "Mon, 31 Oct 2016 18:33:13 GMT",
"version": "v2"
}
] | 2016-11-01 | [
[
"Bjerva",
"Johannes",
""
],
[
"Plank",
"Barbara",
""
],
[
"Bos",
"Johan",
""
]
] | We propose a novel semantic tagging task, sem-tagging, tailored for the purpose of multilingual semantic parsing, and present the first tagger using deep residual networks (ResNets). Our tagger uses both word and character representations and includes a novel residual bypass architecture. We evaluate the tagset both in... |
2104.03532 | Pieter van Goor | Pieter van Goor and Robert Mahony | An Equivariant Filter for Visual Inertial Odometry | 11 pages, 3 figures, to be published as {van Goor, P., Mahony, R..
(2021). An Equivariant Filter for Visual Inertial Odometry. 2020 IEEE
International Conference on Robotics and Automation (ICRA). IEEE, 2020.} | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual Inertial Odometry (VIO) is of great interest due the ubiquity of
devices equipped with both a monocular camera and Inertial Measurement Unit
(IMU). Methods based on the extended Kalman Filter remain popular in VIO due to
their low memory requirements, CPU usage, and processing time when compared to
optimisatio... | [
{
"created": "Thu, 8 Apr 2021 06:28:12 GMT",
"version": "v1"
}
] | 2021-04-09 | [
[
"van Goor",
"Pieter",
""
],
[
"Mahony",
"Robert",
""
]
] | Visual Inertial Odometry (VIO) is of great interest due the ubiquity of devices equipped with both a monocular camera and Inertial Measurement Unit (IMU). Methods based on the extended Kalman Filter remain popular in VIO due to their low memory requirements, CPU usage, and processing time when compared to optimisation-... |
1705.08759 | Stefan Lee | Qing Sun, Stefan Lee, Dhruv Batra | Bidirectional Beam Search: Forward-Backward Inference in Neural Sequence
Models for Fill-in-the-Blank Image Captioning | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop the first approximate inference algorithm for 1-Best (and M-Best)
decoding in bidirectional neural sequence models by extending Beam Search (BS)
to reason about both forward and backward time dependencies. Beam Search (BS)
is a widely used approximate inference algorithm for decoding sequences from
unidire... | [
{
"created": "Wed, 24 May 2017 13:42:47 GMT",
"version": "v1"
}
] | 2017-05-25 | [
[
"Sun",
"Qing",
""
],
[
"Lee",
"Stefan",
""
],
[
"Batra",
"Dhruv",
""
]
] | We develop the first approximate inference algorithm for 1-Best (and M-Best) decoding in bidirectional neural sequence models by extending Beam Search (BS) to reason about both forward and backward time dependencies. Beam Search (BS) is a widely used approximate inference algorithm for decoding sequences from unidirect... |
2201.11369 | Ting-Chun Lin | Ting-Chun Lin, Min-Hsiu Hsieh | $c^3$-Locally Testable Codes from Lossless Expanders | null | null | null | null | cs.IT cs.CC math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A locally testable code (LTC) is an error correcting code with a property
tester. The tester tests if a word is codeword by reading constant random bits
and rejects the word with probability proportional to the distance from the
word to the closest codeword. An important open question until recently is
whether there ... | [
{
"created": "Thu, 27 Jan 2022 08:10:13 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Jan 2022 07:33:50 GMT",
"version": "v2"
}
] | 2022-01-31 | [
[
"Lin",
"Ting-Chun",
""
],
[
"Hsieh",
"Min-Hsiu",
""
]
] | A locally testable code (LTC) is an error correcting code with a property tester. The tester tests if a word is codeword by reading constant random bits and rejects the word with probability proportional to the distance from the word to the closest codeword. An important open question until recently is whether there ex... |
1608.02201 | Hussein Al-Barazanchi | Hussein A. Al-Barazanchi, Hussam Qassim, Abhishek Verma | Residual CNDS | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Convolutional Neural networks nowadays are of tremendous importance for any
image classification system. One of the most investigated methods to increase
the accuracy of CNN is by increasing the depth of CNN. Increasing the depth by
stacking more layers also increases the difficulty of training besides making
it comp... | [
{
"created": "Sun, 7 Aug 2016 10:34:02 GMT",
"version": "v1"
}
] | 2016-08-09 | [
[
"Al-Barazanchi",
"Hussein A.",
""
],
[
"Qassim",
"Hussam",
""
],
[
"Verma",
"Abhishek",
""
]
] | Convolutional Neural networks nowadays are of tremendous importance for any image classification system. One of the most investigated methods to increase the accuracy of CNN is by increasing the depth of CNN. Increasing the depth by stacking more layers also increases the difficulty of training besides making it comput... |
1401.3493 | Uzi Zahavi | Uzi Zahavi, Ariel Felner, Neil Burch, Robert C. Holte | Predicting the Performance of IDA* using Conditional Distributions | null | Journal Of Artificial Intelligence Research, Volume 37, pages
41-83, 2010 | 10.1613/jair.2890 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Korf, Reid, and Edelkamp introduced a formula to predict the number of nodes
IDA* will expand on a single iteration for a given consistent heuristic, and
experimentally demonstrated that it could make very accurate predictions. In
this paper we show that, in addition to requiring the heuristic to be
consistent, their... | [
{
"created": "Wed, 15 Jan 2014 05:41:44 GMT",
"version": "v1"
}
] | 2014-01-16 | [
[
"Zahavi",
"Uzi",
""
],
[
"Felner",
"Ariel",
""
],
[
"Burch",
"Neil",
""
],
[
"Holte",
"Robert C.",
""
]
] | Korf, Reid, and Edelkamp introduced a formula to predict the number of nodes IDA* will expand on a single iteration for a given consistent heuristic, and experimentally demonstrated that it could make very accurate predictions. In this paper we show that, in addition to requiring the heuristic to be consistent, their f... |
1103.4513 | Jeffrey Shallit | Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit, David A. Wilson | Remarks on separating words | null | null | null | null | cs.FL cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The separating words problem asks for the size of the smallest DFA needed to
distinguish between two words of length <= n (by accepting one and rejecting
the other). In this paper we survey what is known and unknown about the
problem, consider some variations, and prove several new results.
| [
{
"created": "Wed, 23 Mar 2011 13:31:37 GMT",
"version": "v1"
}
] | 2011-03-24 | [
[
"Demaine",
"Erik D.",
""
],
[
"Eisenstat",
"Sarah",
""
],
[
"Shallit",
"Jeffrey",
""
],
[
"Wilson",
"David A.",
""
]
] | The separating words problem asks for the size of the smallest DFA needed to distinguish between two words of length <= n (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem, consider some variations, and prove several new results. |
2309.02297 | Kiran Karra | Axel Cortes-Cubero, Juan P. Madrigal-Cianci, Kiran Karra, Zixuan Zhang | Smoothening block rewards: How much should miners pay for mining pools? | 15 pages, 1 figure | null | null | null | cs.CR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The rewards a blockchain miner earns vary with time. Most of the time is
spent mining without receiving any rewards, and only occasionally the miner
wins a block and earns a reward. Mining pools smoothen the stochastic flow of
rewards, and in the ideal case, provide a steady flow of rewards over time.
Smooth block re... | [
{
"created": "Tue, 5 Sep 2023 14:59:01 GMT",
"version": "v1"
}
] | 2023-09-06 | [
[
"Cortes-Cubero",
"Axel",
""
],
[
"Madrigal-Cianci",
"Juan P.",
""
],
[
"Karra",
"Kiran",
""
],
[
"Zhang",
"Zixuan",
""
]
] | The rewards a blockchain miner earns vary with time. Most of the time is spent mining without receiving any rewards, and only occasionally the miner wins a block and earns a reward. Mining pools smoothen the stochastic flow of rewards, and in the ideal case, provide a steady flow of rewards over time. Smooth block rewa... |
2306.03189 | Margot Madina | Margot Madina, Itziar Gonzalez-Dios, Melanie Siegel | Easy-to-Read in Germany: A Survey on its Current State and Available
Resources | 10th Language & Technology Conference: Human Language Technologies as
a Challenge for Computer Science and Linguistics, 2023 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Easy-to-Read Language (E2R) is a controlled language variant that makes any
written text more accessible through the use of clear, direct and simple
language. It is mainly aimed at people with cognitive or intellectual
disabilities, among other target users. Plain Language (PL), on the other hand,
is a variant of a g... | [
{
"created": "Mon, 5 Jun 2023 19:00:25 GMT",
"version": "v1"
}
] | 2023-06-07 | [
[
"Madina",
"Margot",
""
],
[
"Gonzalez-Dios",
"Itziar",
""
],
[
"Siegel",
"Melanie",
""
]
] | Easy-to-Read Language (E2R) is a controlled language variant that makes any written text more accessible through the use of clear, direct and simple language. It is mainly aimed at people with cognitive or intellectual disabilities, among other target users. Plain Language (PL), on the other hand, is a variant of a giv... |
2110.00937 | Xuequan Lu | Sheldon Fung, Xuequan Lu, Mantas Mykolaitis, Gediminas Kostkevicius,
Domantas Ozerenskis | Anatomical Landmarks Localization for 3D Foot Point Clouds | submitted for review | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 3D anatomical landmarks play an important role in health research. Their
automated prediction/localization thus becomes a vital task. In this paper, we
introduce a deformation method for 3D anatomical landmarks prediction. It
utilizes a source model with anatomical landmarks which are annotated by
clinicians, and def... | [
{
"created": "Sun, 3 Oct 2021 06:24:40 GMT",
"version": "v1"
}
] | 2021-10-05 | [
[
"Fung",
"Sheldon",
""
],
[
"Lu",
"Xuequan",
""
],
[
"Mykolaitis",
"Mantas",
""
],
[
"Kostkevicius",
"Gediminas",
""
],
[
"Ozerenskis",
"Domantas",
""
]
] | 3D anatomical landmarks play an important role in health research. Their automated prediction/localization thus becomes a vital task. In this paper, we introduce a deformation method for 3D anatomical landmarks prediction. It utilizes a source model with anatomical landmarks which are annotated by clinicians, and defor... |
1412.1254 | Philip Bille | Philip Bille, Pawel Gawrychowski, Inge Li Goertz, Gad M. Landau, and
Oren Weimann | Longest Common Extensions in Trees | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The longest common extension (LCE) of two indices in a string is the length
of the longest identical substrings starting at these two indices. The LCE
problem asks to preprocess a string into a compact data structure that supports
fast LCE queries. In this paper we generalize the LCE problem to trees and
suggest a fe... | [
{
"created": "Wed, 3 Dec 2014 10:02:47 GMT",
"version": "v1"
},
{
"created": "Tue, 31 Mar 2015 18:06:22 GMT",
"version": "v2"
},
{
"created": "Thu, 9 Jul 2015 14:55:22 GMT",
"version": "v3"
}
] | 2015-07-10 | [
[
"Bille",
"Philip",
""
],
[
"Gawrychowski",
"Pawel",
""
],
[
"Goertz",
"Inge Li",
""
],
[
"Landau",
"Gad M.",
""
],
[
"Weimann",
"Oren",
""
]
] | The longest common extension (LCE) of two indices in a string is the length of the longest identical substrings starting at these two indices. The LCE problem asks to preprocess a string into a compact data structure that supports fast LCE queries. In this paper we generalize the LCE problem to trees and suggest a few ... |
2005.11623 | Zhihao Duan | Zhihao Duan, M. Ozan Tezcan, Hayato Nakamura, Prakash Ishwar, Janusz
Konrad | RAPiD: Rotation-Aware People Detection in Overhead Fisheye Images | CVPR 2020 OmniCV Workshop paper extended version | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent methods for people detection in overhead, fisheye images either use
radially-aligned bounding boxes to represent people, assuming people always
appear along image radius or require significant pre-/post-processing which
radically increases computational complexity. In this work, we develop an
end-to-end rotati... | [
{
"created": "Sat, 23 May 2020 23:47:18 GMT",
"version": "v1"
}
] | 2020-05-26 | [
[
"Duan",
"Zhihao",
""
],
[
"Tezcan",
"M. Ozan",
""
],
[
"Nakamura",
"Hayato",
""
],
[
"Ishwar",
"Prakash",
""
],
[
"Konrad",
"Janusz",
""
]
] | Recent methods for people detection in overhead, fisheye images either use radially-aligned bounding boxes to represent people, assuming people always appear along image radius or require significant pre-/post-processing which radically increases computational complexity. In this work, we develop an end-to-end rotation... |
2111.03171 | Victor Reis | Daniel Dadush, Haotian Jiang, Victor Reis | A New Framework for Matrix Discrepancy: Partial Coloring Bounds via
Mirror Descent | 24 pages | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | Motivated by the Matrix Spencer conjecture, we study the problem of finding
signed sums of matrices with a small matrix norm. A well-known strategy to
obtain these signs is to prove, given matrices $A_1, \dots, A_n \in
\mathbb{R}^{m \times m}$, a Gaussian measure lower bound of $2^{-O(n)}$ for a
scaling of the discre... | [
{
"created": "Thu, 4 Nov 2021 21:44:53 GMT",
"version": "v1"
}
] | 2021-11-08 | [
[
"Dadush",
"Daniel",
""
],
[
"Jiang",
"Haotian",
""
],
[
"Reis",
"Victor",
""
]
] | Motivated by the Matrix Spencer conjecture, we study the problem of finding signed sums of matrices with a small matrix norm. A well-known strategy to obtain these signs is to prove, given matrices $A_1, \dots, A_n \in \mathbb{R}^{m \times m}$, a Gaussian measure lower bound of $2^{-O(n)}$ for a scaling of the discrepa... |
2012.15503 | Qilong Zhang | Lianli Gao, Qilong Zhang, Jingkuan Song and Heng Tao Shen | Patch-wise++ Perturbation for Adversarial Targeted Attacks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although great progress has been made on adversarial attacks for deep neural
networks (DNNs), their transferability is still unsatisfactory, especially for
targeted attacks. There are two problems behind that have been long overlooked:
1) the conventional setting of $T$ iterations with the step size of
$\epsilon/T$ t... | [
{
"created": "Thu, 31 Dec 2020 08:40:42 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Jan 2021 07:34:21 GMT",
"version": "v2"
},
{
"created": "Tue, 8 Jun 2021 12:52:44 GMT",
"version": "v3"
}
] | 2021-06-09 | [
[
"Gao",
"Lianli",
""
],
[
"Zhang",
"Qilong",
""
],
[
"Song",
"Jingkuan",
""
],
[
"Shen",
"Heng Tao",
""
]
] | Although great progress has been made on adversarial attacks for deep neural networks (DNNs), their transferability is still unsatisfactory, especially for targeted attacks. There are two problems behind that have been long overlooked: 1) the conventional setting of $T$ iterations with the step size of $\epsilon/T$ to ... |
2203.04258 | Joachim Bruneau-Queyreix | Matthieu Pigaglio, Joachim Bruneau-Queyreix, David Bromberg, Davide
Frey, Etienne Rivi\`ere, Laurent R\'eveill\`ere | RAPTEE: Leveraging trusted execution environments for Byzantine-tolerant
peer sampling services | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Peer sampling is a first-class abstraction used in distributed systems for
overlay management and information dissemination. The goal of peer sampling is
to continuously build and refresh a partial and local view of the full
membership of a dynamic, large-scale distributed system. Malicious nodes under
the control of... | [
{
"created": "Tue, 8 Mar 2022 18:20:30 GMT",
"version": "v1"
}
] | 2022-03-09 | [
[
"Pigaglio",
"Matthieu",
""
],
[
"Bruneau-Queyreix",
"Joachim",
""
],
[
"Bromberg",
"David",
""
],
[
"Frey",
"Davide",
""
],
[
"Rivière",
"Etienne",
""
],
[
"Réveillère",
"Laurent",
""
]
] | Peer sampling is a first-class abstraction used in distributed systems for overlay management and information dissemination. The goal of peer sampling is to continuously build and refresh a partial and local view of the full membership of a dynamic, large-scale distributed system. Malicious nodes under the control of a... |
1612.07309 | Li Li | Li Li, Zhu Li, Bin Li, Dong Liu, and Houqiang Li | Pseudo Sequence based 2-D hierarchical reference structure for
Light-Field Image Compression | 10 pages, 4 figures, 2 tables | null | 10.1109/JSTSP.2017.2725198 | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a novel pseudo sequence based 2-D hierarchical
reference structure for light-field image compression. In the proposed scheme,
we first decompose the light-field image into multiple views and organize them
into a 2-D coding structure according to the spatial coordinates of the
corresponding m... | [
{
"created": "Wed, 21 Dec 2016 20:31:57 GMT",
"version": "v1"
}
] | 2017-11-22 | [
[
"Li",
"Li",
""
],
[
"Li",
"Zhu",
""
],
[
"Li",
"Bin",
""
],
[
"Liu",
"Dong",
""
],
[
"Li",
"Houqiang",
""
]
] | In this paper, we present a novel pseudo sequence based 2-D hierarchical reference structure for light-field image compression. In the proposed scheme, we first decompose the light-field image into multiple views and organize them into a 2-D coding structure according to the spatial coordinates of the corresponding mic... |
2105.10569 | Aileen Nielsen | Aileen Nielsen | Measuring Lay Reactions to Personal Data Markets | null | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | The recording, aggregation, and exchange of personal data is necessary to the
development of socially-relevant machine learning applications. However,
anecdotal and survey evidence show that ordinary people feel discontent and
even anger regarding data collection practices that are currently typical and
legal. This s... | [
{
"created": "Fri, 21 May 2021 20:56:19 GMT",
"version": "v1"
}
] | 2021-05-25 | [
[
"Nielsen",
"Aileen",
""
]
] | The recording, aggregation, and exchange of personal data is necessary to the development of socially-relevant machine learning applications. However, anecdotal and survey evidence show that ordinary people feel discontent and even anger regarding data collection practices that are currently typical and legal. This sug... |
1210.1639 | Vaneet Aggarwal | Melissa Duarte, Ashutosh Sabharwal, Vaneet Aggarwal, Rittwik Jana, K.
K. Ramakrishnan, Christopher Rice and N. K. Shankaranarayanan | Design and Characterization of a Full-duplex Multi-antenna System for
WiFi networks | 44 page, 11 figures, 8 tables. Submitted to IEEE Transactions on
Vehicular Technology, Oct 2012 | IEEE Transactions on Vehicular Technology, vol.63, no.3,
pp.1160--1177, March 2014 | 10.1109/TVT.2013.2284712 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present an experimental and simulation based study to
evaluate the use of full-duplex as a mode in practical IEEE 802.11 networks. To
enable the study, we designed a 20 MHz multi-antenna OFDM full-duplex physical
layer and a full-duplex capable MAC protocol which is backward compatible with
current ... | [
{
"created": "Fri, 5 Oct 2012 03:40:45 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Oct 2012 02:32:05 GMT",
"version": "v2"
}
] | 2014-07-15 | [
[
"Duarte",
"Melissa",
""
],
[
"Sabharwal",
"Ashutosh",
""
],
[
"Aggarwal",
"Vaneet",
""
],
[
"Jana",
"Rittwik",
""
],
[
"Ramakrishnan",
"K. K.",
""
],
[
"Rice",
"Christopher",
""
],
[
"Shankaranarayanan",
"N. K.... | In this paper, we present an experimental and simulation based study to evaluate the use of full-duplex as a mode in practical IEEE 802.11 networks. To enable the study, we designed a 20 MHz multi-antenna OFDM full-duplex physical layer and a full-duplex capable MAC protocol which is backward compatible with current 80... |
2207.10777 | Khalid Oublal | Khalid Oublal and Xinyi Dai | An advanced combination of semi-supervised Normalizing Flow & Yolo
(YoloNF) to detect and recognize vehicle license plates | arXiv admin note: text overlap with arXiv:1802.09567 by other
authors; text overlap with arXiv:2012.06737 by other authors without
attribution | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Fully Automatic License Plate Recognition (ALPR) has been a frequent research
topic due to several practical applications. However, many of the current
solutions are still not robust enough in real situations, commonly depending on
many constraints. This paper presents a robust and efficient ALPR system based
on the ... | [
{
"created": "Thu, 21 Jul 2022 22:22:57 GMT",
"version": "v1"
}
] | 2022-07-25 | [
[
"Oublal",
"Khalid",
""
],
[
"Dai",
"Xinyi",
""
]
] | Fully Automatic License Plate Recognition (ALPR) has been a frequent research topic due to several practical applications. However, many of the current solutions are still not robust enough in real situations, commonly depending on many constraints. This paper presents a robust and efficient ALPR system based on the st... |
2006.13341 | Liliane Almeida | Liliane Rodrigues de Almeida, Gilson A. Giraldi, Marcelo Bernardes
Vieira | Applying Lie Groups Approaches for Rigid Registration of Point Clouds | 29 pages, 4 figures, 1 table | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In the last decades, some literature appeared using the Lie groups theory to
solve problems in computer vision. On the other hand, Lie algebraic
representations of the transformations therein were introduced to overcome the
difficulties behind group structure by mapping the transformation groups to
linear spaces. In ... | [
{
"created": "Tue, 23 Jun 2020 21:26:57 GMT",
"version": "v1"
}
] | 2020-06-25 | [
[
"de Almeida",
"Liliane Rodrigues",
""
],
[
"Giraldi",
"Gilson A.",
""
],
[
"Vieira",
"Marcelo Bernardes",
""
]
] | In the last decades, some literature appeared using the Lie groups theory to solve problems in computer vision. On the other hand, Lie algebraic representations of the transformations therein were introduced to overcome the difficulties behind group structure by mapping the transformation groups to linear spaces. In th... |
0708.2353 | Vladimir Vovk | Vladimir Vovk | Continuous and randomized defensive forecasting: unified view | 10 pages. The new version: (1) relaxes the assumption that the
outcome space is finite, and now it is only assumed to be compact; (2) shows
that in the case where the outcome space is finite of cardinality C, the
randomized forecasts can be chosen concentrated on a finite set of
cardinality at most C | null | null | null | cs.LG | null | Defensive forecasting is a method of transforming laws of probability (stated
in game-theoretic terms as strategies for Sceptic) into forecasting algorithms.
There are two known varieties of defensive forecasting: "continuous", in which
Sceptic's moves are assumed to depend on the forecasts in a (semi)continuous
mann... | [
{
"created": "Fri, 17 Aug 2007 12:18:24 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Aug 2007 12:44:34 GMT",
"version": "v2"
}
] | 2007-08-23 | [
[
"Vovk",
"Vladimir",
""
]
] | Defensive forecasting is a method of transforming laws of probability (stated in game-theoretic terms as strategies for Sceptic) into forecasting algorithms. There are two known varieties of defensive forecasting: "continuous", in which Sceptic's moves are assumed to depend on the forecasts in a (semi)continuous manner... |
2209.12028 | Lichen Zhao | Lichen Zhao, Daigang Cai, Jing Zhang, Lu Sheng, Dong Xu, Rui Zheng,
Yinjie Zhao, Lipeng Wang and Xibo Fan | Towards Explainable 3D Grounded Visual Question Answering: A New
Benchmark and Strong Baseline | 13 pages, 10 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, 3D vision-and-language tasks have attracted increasing research
interest. Compared to other vision-and-language tasks, the 3D visual question
answering (VQA) task is less exploited and is more susceptible to language
priors and co-reference ambiguity. Meanwhile, a couple of recently proposed 3D
VQA datasets... | [
{
"created": "Sat, 24 Sep 2022 15:09:02 GMT",
"version": "v1"
}
] | 2022-09-27 | [
[
"Zhao",
"Lichen",
""
],
[
"Cai",
"Daigang",
""
],
[
"Zhang",
"Jing",
""
],
[
"Sheng",
"Lu",
""
],
[
"Xu",
"Dong",
""
],
[
"Zheng",
"Rui",
""
],
[
"Zhao",
"Yinjie",
""
],
[
"Wang",
"Lipeng",
... | Recently, 3D vision-and-language tasks have attracted increasing research interest. Compared to other vision-and-language tasks, the 3D visual question answering (VQA) task is less exploited and is more susceptible to language priors and co-reference ambiguity. Meanwhile, a couple of recently proposed 3D VQA datasets d... |
1810.06917 | Fragkiskos Malliaros | Abdulkadir \c{C}elikkanat, Fragkiskos D. Malliaros | TNE: A Latent Model for Representation Learning on Networks | 9 pages | null | null | null | cs.LG cs.SI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Network representation learning (NRL) methods aim to map each vertex into a
low dimensional space by preserving the local and global structure of a given
network, and in recent years they have received a significant attention thanks
to their success in several challenging problems. Although various approaches
have be... | [
{
"created": "Tue, 16 Oct 2018 10:26:47 GMT",
"version": "v1"
}
] | 2018-10-17 | [
[
"Çelikkanat",
"Abdulkadir",
""
],
[
"Malliaros",
"Fragkiskos D.",
""
]
] | Network representation learning (NRL) methods aim to map each vertex into a low dimensional space by preserving the local and global structure of a given network, and in recent years they have received a significant attention thanks to their success in several challenging problems. Although various approaches have been... |
2408.05065 | Wenwen Min | Lin Huang, Xiaofei Liu, Shunfang Wang and Wenwen Min | Masked adversarial neural network for cell type deconvolution in spatial
transcriptomics | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accurately determining cell type composition in disease-relevant tissues is
crucial for identifying disease targets. Most existing spatial transcriptomics
(ST) technologies cannot achieve single-cell resolution, making it challenging
to accurately determine cell types. To address this issue, various
deconvolution met... | [
{
"created": "Fri, 9 Aug 2024 13:46:28 GMT",
"version": "v1"
}
] | 2024-08-12 | [
[
"Huang",
"Lin",
""
],
[
"Liu",
"Xiaofei",
""
],
[
"Wang",
"Shunfang",
""
],
[
"Min",
"Wenwen",
""
]
] | Accurately determining cell type composition in disease-relevant tissues is crucial for identifying disease targets. Most existing spatial transcriptomics (ST) technologies cannot achieve single-cell resolution, making it challenging to accurately determine cell types. To address this issue, various deconvolution metho... |
2407.19705 | Jingwei Zhu | Jingwei Zhu, Minghuan Tan, Min Yang, Ruixue Li, Hamid Alinejad-Rokny | CollectiveSFT: Scaling Large Language Models for Chinese Medical
Benchmark with Collective Instructions in Healthcare | Technical Report | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The rapid progress in Large Language Models (LLMs) has prompted the creation
of numerous benchmarks to evaluate their capabilities.This study focuses on the
Comprehensive Medical Benchmark in Chinese (CMB), showcasing how dataset
diversity and distribution in supervised fine-tuning (SFT) may enhance LLM
performance.R... | [
{
"created": "Mon, 29 Jul 2024 05:00:48 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Jul 2024 08:23:05 GMT",
"version": "v2"
}
] | 2024-07-31 | [
[
"Zhu",
"Jingwei",
""
],
[
"Tan",
"Minghuan",
""
],
[
"Yang",
"Min",
""
],
[
"Li",
"Ruixue",
""
],
[
"Alinejad-Rokny",
"Hamid",
""
]
] | The rapid progress in Large Language Models (LLMs) has prompted the creation of numerous benchmarks to evaluate their capabilities.This study focuses on the Comprehensive Medical Benchmark in Chinese (CMB), showcasing how dataset diversity and distribution in supervised fine-tuning (SFT) may enhance LLM performance.Rem... |
2106.13901 | Ramya Srinivasan | Ramya Srinivasan and Devi Parikh | Building Bridges: Generative Artworks to Explore AI Ethics | null | CVPR Workshop on Ethical Considerations in Creative Applications
of Computer Vision, 2022 | null | null | cs.CY cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In recent years, there has been an increased emphasis on understanding and
mitigating adverse impacts of artificial intelligence (AI) technologies on
society. Across academia, industry, and government bodies, a variety of
endeavours are being pursued towards enhancing AI ethics. A significant
challenge in the design ... | [
{
"created": "Fri, 25 Jun 2021 22:31:55 GMT",
"version": "v1"
}
] | 2022-05-18 | [
[
"Srinivasan",
"Ramya",
""
],
[
"Parikh",
"Devi",
""
]
] | In recent years, there has been an increased emphasis on understanding and mitigating adverse impacts of artificial intelligence (AI) technologies on society. Across academia, industry, and government bodies, a variety of endeavours are being pursued towards enhancing AI ethics. A significant challenge in the design of... |
2211.05986 | Swati Sharma | Swati Sharma, Aditi Partap, Maria Angels de Luis Balaguer, Sara
Malvar, Ranveer Chandra | DeepG2P: Fusing Multi-Modal Data to Improve Crop Production | Under review in AISTATS2023 | null | null | null | cs.LG cs.CY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Agriculture is at the heart of the solution to achieve sustainability in
feeding the world population, but advancing our understanding on how
agricultural output responds to climatic variability is still needed. Precision
Agriculture (PA), which is a management strategy that uses technology such as
remote sensing, Ge... | [
{
"created": "Fri, 11 Nov 2022 03:32:44 GMT",
"version": "v1"
}
] | 2022-11-14 | [
[
"Sharma",
"Swati",
""
],
[
"Partap",
"Aditi",
""
],
[
"Balaguer",
"Maria Angels de Luis",
""
],
[
"Malvar",
"Sara",
""
],
[
"Chandra",
"Ranveer",
""
]
] | Agriculture is at the heart of the solution to achieve sustainability in feeding the world population, but advancing our understanding on how agricultural output responds to climatic variability is still needed. Precision Agriculture (PA), which is a management strategy that uses technology such as remote sensing, Geog... |
1401.4532 | Yanfei Yan | Yanfei Yan, Ling Liu, Cong Ling | Polar Lattices for Strong Secrecy Over the Mod-$\Lambda$ Gaussian
Wiretap Channel | 7 pages, 2 figures, extended version of a paper submitted to ISIT'14 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Polar lattices, which are constructed from polar codes, are provably good for
the additive white Gaussian noise (AWGN) channel. In this work, we propose a
new polar lattice construction that achieves the secrecy capacity under the
strong secrecy criterion over the mod-$\Lambda$ Gaussian wiretap channel. This
construc... | [
{
"created": "Sat, 18 Jan 2014 11:41:44 GMT",
"version": "v1"
},
{
"created": "Fri, 24 Jan 2014 10:49:01 GMT",
"version": "v2"
}
] | 2014-01-27 | [
[
"Yan",
"Yanfei",
""
],
[
"Liu",
"Ling",
""
],
[
"Ling",
"Cong",
""
]
] | Polar lattices, which are constructed from polar codes, are provably good for the additive white Gaussian noise (AWGN) channel. In this work, we propose a new polar lattice construction that achieves the secrecy capacity under the strong secrecy criterion over the mod-$\Lambda$ Gaussian wiretap channel. This constructi... |
2202.14019 | Paritosh Parmar | Paritosh Parmar, Amol Gharat, Helge Rhodin | Domain Knowledge-Informed Self-Supervised Representations for Workout
Form Assessment | null | null | null | null | cs.CV cs.AI cs.HC cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Maintaining proper form while exercising is important for preventing injuries
and maximizing muscle mass gains. Detecting errors in workout form naturally
requires estimating human's body pose. However, off-the-shelf pose estimators
struggle to perform well on the videos recorded in gym scenarios due to factors
such ... | [
{
"created": "Mon, 28 Feb 2022 18:40:02 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Oct 2022 17:10:15 GMT",
"version": "v2"
}
] | 2022-10-24 | [
[
"Parmar",
"Paritosh",
""
],
[
"Gharat",
"Amol",
""
],
[
"Rhodin",
"Helge",
""
]
] | Maintaining proper form while exercising is important for preventing injuries and maximizing muscle mass gains. Detecting errors in workout form naturally requires estimating human's body pose. However, off-the-shelf pose estimators struggle to perform well on the videos recorded in gym scenarios due to factors such as... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.