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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2111.03278 | Eric Neyman | Rafael Frongillo, Eric Neyman, Bo Waggoner | Agreement Implies Accuracy for Substitutable Signals | 31 pages, 1 figure | null | null | null | cs.GT | http://creativecommons.org/licenses/by/4.0/ | Inspired by Aumann's agreement theorem, Scott Aaronson studied the amount of
communication necessary for two Bayesian experts to approximately agree on the
expectation of a random variable. Aaronson showed that, remarkably, the number
of bits does not depend on the amount of information available to each expert.
Howe... | [
{
"created": "Fri, 5 Nov 2021 05:47:03 GMT",
"version": "v1"
}
] | 2021-11-08 | [
[
"Frongillo",
"Rafael",
""
],
[
"Neyman",
"Eric",
""
],
[
"Waggoner",
"Bo",
""
]
] | Inspired by Aumann's agreement theorem, Scott Aaronson studied the amount of communication necessary for two Bayesian experts to approximately agree on the expectation of a random variable. Aaronson showed that, remarkably, the number of bits does not depend on the amount of information available to each expert. Howeve... |
2404.00466 | Heqiang Wang | Heqiang Wang, Jieming Bian, Lei Wang | Computation and Communication Efficient Lightweighting Vertical
Federated Learning | null | null | null | null | cs.LG cs.DC | http://creativecommons.org/licenses/by/4.0/ | The exploration of computational and communication efficiency within
Federated Learning (FL) has emerged as a prominent and crucial field of study.
While most existing efforts to enhance these efficiencies have focused on
Horizontal FL, the distinct processes and model structures of Vertical FL
preclude the direct ap... | [
{
"created": "Sat, 30 Mar 2024 20:19:28 GMT",
"version": "v1"
}
] | 2024-04-02 | [
[
"Wang",
"Heqiang",
""
],
[
"Bian",
"Jieming",
""
],
[
"Wang",
"Lei",
""
]
] | The exploration of computational and communication efficiency within Federated Learning (FL) has emerged as a prominent and crucial field of study. While most existing efforts to enhance these efficiencies have focused on Horizontal FL, the distinct processes and model structures of Vertical FL preclude the direct appl... |
1106.1910 | Vahid Majid Nezhad | Vahid Majid Nezhad, Habib Motee Gader and Evgueni Efimov | A Novel Hybrid Algorithm for Task Graph Scheduling | null | IJCSI, Vol 8, Issue 2, March 2011, p32-38 | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the important problems in multiprocessor systems is Task Graph
Scheduling. Task Graph Scheduling is an NP-Hard problem. Both learning automata
and genetic algorithms are search tools which are used for solving many NP-Hard
problems. In this paper a new hybrid method based on Genetic Algorithm and
Learning Auto... | [
{
"created": "Thu, 9 Jun 2011 20:26:22 GMT",
"version": "v1"
}
] | 2011-06-13 | [
[
"Nezhad",
"Vahid Majid",
""
],
[
"Gader",
"Habib Motee",
""
],
[
"Efimov",
"Evgueni",
""
]
] | One of the important problems in multiprocessor systems is Task Graph Scheduling. Task Graph Scheduling is an NP-Hard problem. Both learning automata and genetic algorithms are search tools which are used for solving many NP-Hard problems. In this paper a new hybrid method based on Genetic Algorithm and Learning Automa... |
1909.02273 | Chengyi Wang | Chengyi Wang, Shuangzhi Wu, Shujie Liu | Source Dependency-Aware Transformer with Supervised Self-Attention | 6 pages | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, Transformer has achieved the state-of-the-art performance on many
machine translation tasks. However, without syntax knowledge explicitly
considered in the encoder, incorrect context information that violates the
syntax structure may be integrated into source hidden states, leading to
erroneous translations... | [
{
"created": "Thu, 5 Sep 2019 09:17:37 GMT",
"version": "v1"
}
] | 2019-09-06 | [
[
"Wang",
"Chengyi",
""
],
[
"Wu",
"Shuangzhi",
""
],
[
"Liu",
"Shujie",
""
]
] | Recently, Transformer has achieved the state-of-the-art performance on many machine translation tasks. However, without syntax knowledge explicitly considered in the encoder, incorrect context information that violates the syntax structure may be integrated into source hidden states, leading to erroneous translations. ... |
1607.01284 | Ruifeng Duan | Ruifeng Duan, Riku J\"antti, H\"useyin Yi\u{g}itler, and Kalle Ruttik | On the Achievable Rate of Bi-Static Modulated Re-Scatter Systems | 5 pages, 3 figures, accepted | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In ambient re-scatter communications, devices convey information by
modulating and re-scattering the radio frequency signals impinging on their
antennas. In this correspondence, we consider a system consisting of a legacy
modulated continuous carrier multiple-input-multiple-output (MIMO) link and a
multi-antenna modu... | [
{
"created": "Tue, 5 Jul 2016 14:54:14 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Jun 2017 13:19:10 GMT",
"version": "v2"
}
] | 2017-06-13 | [
[
"Duan",
"Ruifeng",
""
],
[
"Jäntti",
"Riku",
""
],
[
"Yiğitler",
"Hüseyin",
""
],
[
"Ruttik",
"Kalle",
""
]
] | In ambient re-scatter communications, devices convey information by modulating and re-scattering the radio frequency signals impinging on their antennas. In this correspondence, we consider a system consisting of a legacy modulated continuous carrier multiple-input-multiple-output (MIMO) link and a multi-antenna modula... |
1405.5202 | Altaf Rahman | Altaf Rahman, Vincent Ng | Narrowing the Modeling Gap: A Cluster-Ranking Approach to Coreference
Resolution | null | Journal Of Artificial Intelligence Research, Volume 40, pages
469-521, 2011 | 10.1613/jair.3120 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traditional learning-based coreference resolvers operate by training the
mention-pair model for determining whether two mentions are coreferent or not.
Though conceptually simple and easy to understand, the mention-pair model is
linguistically rather unappealing and lags far behind the heuristic-based
coreference mod... | [
{
"created": "Thu, 16 Jan 2014 05:06:09 GMT",
"version": "v1"
}
] | 2014-05-21 | [
[
"Rahman",
"Altaf",
""
],
[
"Ng",
"Vincent",
""
]
] | Traditional learning-based coreference resolvers operate by training the mention-pair model for determining whether two mentions are coreferent or not. Though conceptually simple and easy to understand, the mention-pair model is linguistically rather unappealing and lags far behind the heuristic-based coreference model... |
1412.2716 | Paul Ginsparg | Daniel T. Citron and Paul Ginsparg | Patterns of Text Reuse in a Scientific Corpus | 6 pages, plus 10 pages of supplementary material. To appear in PNAS
(online 8 Dec 2014) | null | 10.1073/pnas.1415135111 | null | cs.DL physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the incidence of text "reuse" by researchers, via a systematic
pairwise comparison of the text content of all articles deposited to arXiv.org
from 1991--2012. We measure the global frequencies of three classes of text
reuse, and measure how chronic text reuse is distributed among authors in the
dataset. W... | [
{
"created": "Mon, 8 Dec 2014 20:01:17 GMT",
"version": "v1"
}
] | 2014-12-09 | [
[
"Citron",
"Daniel T.",
""
],
[
"Ginsparg",
"Paul",
""
]
] | We consider the incidence of text "reuse" by researchers, via a systematic pairwise comparison of the text content of all articles deposited to arXiv.org from 1991--2012. We measure the global frequencies of three classes of text reuse, and measure how chronic text reuse is distributed among authors in the dataset. We ... |
2205.11107 | Lara Scavuzzo | Lara Scavuzzo and Feng Yang Chen and Didier Ch\'etelat and Maxime
Gasse and Andrea Lodi and Neil Yorke-Smith and Karen Aardal | Learning to branch with Tree MDPs | 10 pages, 2 figures, plus supplementary material | null | null | null | cs.LG math.OC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | State-of-the-art Mixed Integer Linear Program (MILP) solvers combine
systematic tree search with a plethora of hard-coded heuristics, such as the
branching rule. The idea of learning branching rules from data has received
increasing attention recently, and promising results have been obtained by
learning fast approxi... | [
{
"created": "Mon, 23 May 2022 07:57:32 GMT",
"version": "v1"
},
{
"created": "Tue, 31 May 2022 11:05:56 GMT",
"version": "v2"
},
{
"created": "Thu, 13 Oct 2022 13:37:42 GMT",
"version": "v3"
}
] | 2022-10-14 | [
[
"Scavuzzo",
"Lara",
""
],
[
"Chen",
"Feng Yang",
""
],
[
"Chételat",
"Didier",
""
],
[
"Gasse",
"Maxime",
""
],
[
"Lodi",
"Andrea",
""
],
[
"Yorke-Smith",
"Neil",
""
],
[
"Aardal",
"Karen",
""
]
] | State-of-the-art Mixed Integer Linear Program (MILP) solvers combine systematic tree search with a plethora of hard-coded heuristics, such as the branching rule. The idea of learning branching rules from data has received increasing attention recently, and promising results have been obtained by learning fast approxima... |
2209.12413 | P B Sujit Dr | Kasi Vishwanath, P.B. Sujit and Srikanth Saripalli | CAMEL: Learning Cost-maps Made Easy for Off-road Driving | null | null | null | null | cs.RO cs.CV | http://creativecommons.org/licenses/by/4.0/ | Cost-maps are used by robotic vehicles to plan collision-free paths. The cost
associated with each cell in the map represents the sensed environment
information which is often determined manually after several trial-and-error
efforts. In off-road environments, due to the presence of several types of
features, it is c... | [
{
"created": "Mon, 26 Sep 2022 04:37:03 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Oct 2022 08:07:59 GMT",
"version": "v2"
}
] | 2022-10-19 | [
[
"Vishwanath",
"Kasi",
""
],
[
"Sujit",
"P. B.",
""
],
[
"Saripalli",
"Srikanth",
""
]
] | Cost-maps are used by robotic vehicles to plan collision-free paths. The cost associated with each cell in the map represents the sensed environment information which is often determined manually after several trial-and-error efforts. In off-road environments, due to the presence of several types of features, it is cha... |
1303.2764 | Lin Na | Na Lin, Hong-Dong Liu, Chang-Qing Gong | Research and Simulation on Drivers' Route Choice Behavior Cognition
Model | 6 pages,8 figures,a table | null | null | null | cs.NI | http://creativecommons.org/licenses/by-nc-sa/3.0/ | This paper studied the behavior-cognitive model of drivers during their
travel based on the current research on driver behavior. Firstly, a route
choice behavior-cognitive model was proposed for describing the decision-making
mechanism of drivers during his travel; then, simulation experiments were
carried out on the... | [
{
"created": "Tue, 12 Mar 2013 02:59:15 GMT",
"version": "v1"
}
] | 2013-03-13 | [
[
"Lin",
"Na",
""
],
[
"Liu",
"Hong-Dong",
""
],
[
"Gong",
"Chang-Qing",
""
]
] | This paper studied the behavior-cognitive model of drivers during their travel based on the current research on driver behavior. Firstly, a route choice behavior-cognitive model was proposed for describing the decision-making mechanism of drivers during his travel; then, simulation experiments were carried out on the c... |
1609.00559 | Ted Pedersen | Bridget T. McInnes and Ted Pedersen | Improving Correlation with Human Judgments by Integrating Semantic
Similarity with Second--Order Vectors | 10 pages, Appears in the Proceedings of the 16th Workshop on
Biomedical Natural Language Processing (BioNLP-2017), August 2017, Vancouver,
BC | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vector space methods that measure semantic similarity and relatedness often
rely on distributional information such as co--occurrence frequencies or
statistical measures of association to weight the importance of particular
co--occurrences. In this paper, we extend these methods by incorporating a
measure of semantic... | [
{
"created": "Fri, 2 Sep 2016 11:44:17 GMT",
"version": "v1"
},
{
"created": "Sat, 27 May 2017 00:23:06 GMT",
"version": "v2"
}
] | 2017-05-30 | [
[
"McInnes",
"Bridget T.",
""
],
[
"Pedersen",
"Ted",
""
]
] | Vector space methods that measure semantic similarity and relatedness often rely on distributional information such as co--occurrence frequencies or statistical measures of association to weight the importance of particular co--occurrences. In this paper, we extend these methods by incorporating a measure of semantic s... |
2301.11716 | Phuong-Hang Le | Phuong-Hang Le, Hongyu Gong, Changhan Wang, Juan Pino, Benjamin
Lecouteux, Didier Schwab | Pre-training for Speech Translation: CTC Meets Optimal Transport | ICML 2023 (oral presentation). This version fixed URLs, updated
affiliations & acknowledgements, and improved formatting | null | null | null | cs.CL cs.LG cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | The gap between speech and text modalities is a major challenge in
speech-to-text translation (ST). Different methods have been proposed to reduce
this gap, but most of them require architectural changes in ST training. In
this work, we propose to mitigate this issue at the pre-training stage,
requiring no change in ... | [
{
"created": "Fri, 27 Jan 2023 14:03:09 GMT",
"version": "v1"
},
{
"created": "Tue, 30 May 2023 09:06:22 GMT",
"version": "v2"
},
{
"created": "Mon, 5 Jun 2023 11:44:02 GMT",
"version": "v3"
}
] | 2023-06-06 | [
[
"Le",
"Phuong-Hang",
""
],
[
"Gong",
"Hongyu",
""
],
[
"Wang",
"Changhan",
""
],
[
"Pino",
"Juan",
""
],
[
"Lecouteux",
"Benjamin",
""
],
[
"Schwab",
"Didier",
""
]
] | The gap between speech and text modalities is a major challenge in speech-to-text translation (ST). Different methods have been proposed to reduce this gap, but most of them require architectural changes in ST training. In this work, we propose to mitigate this issue at the pre-training stage, requiring no change in th... |
1804.07663 | Andreas Steyven | Andreas Steyven, Emma Hart, Ben Paechter | An Investigation of Environmental Influence on the Benefits of
Adaptation Mechanisms in Evolutionary Swarm Robotics | In GECCO 2017 | null | 10.1145/3071178.3071232 | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A robotic swarm that is required to operate for long periods in a potentially
unknown environment can use both evolution and individual learning methods in
order to adapt. However, the role played by the environment in influencing the
effectiveness of each type of learning is not well understood. In this paper,
we ad... | [
{
"created": "Fri, 20 Apr 2018 15:13:47 GMT",
"version": "v1"
}
] | 2018-04-23 | [
[
"Steyven",
"Andreas",
""
],
[
"Hart",
"Emma",
""
],
[
"Paechter",
"Ben",
""
]
] | A robotic swarm that is required to operate for long periods in a potentially unknown environment can use both evolution and individual learning methods in order to adapt. However, the role played by the environment in influencing the effectiveness of each type of learning is not well understood. In this paper, we addr... |
1306.0322 | Hector Zenil | Hector Zenil, Fernando Soler-Toscano, Kamaludin Dingle and Ard A.
Louis | Correlation of Automorphism Group Size and Topological Properties with
Program-size Complexity Evaluations of Graphs and Complex Networks | 15 2-column pages, 20 figures. Forthcoming in Physica A: Statistical
Mechanics and its Applications | null | 10.1016/j.physa.2014.02.060 | null | cs.IT cs.CC cs.CG math.IT q-bio.MN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that numerical approximations of Kolmogorov complexity (K) applied to
graph adjacency matrices capture some group-theoretic and topological
properties of graphs and empirical networks ranging from metabolic to social
networks. That K and the size of the group of automorphisms of a graph are
correlated opens u... | [
{
"created": "Mon, 3 Jun 2013 08:36:11 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Jun 2013 11:32:00 GMT",
"version": "v2"
},
{
"created": "Sun, 23 Feb 2014 01:42:27 GMT",
"version": "v3"
}
] | 2015-06-16 | [
[
"Zenil",
"Hector",
""
],
[
"Soler-Toscano",
"Fernando",
""
],
[
"Dingle",
"Kamaludin",
""
],
[
"Louis",
"Ard A.",
""
]
] | We show that numerical approximations of Kolmogorov complexity (K) applied to graph adjacency matrices capture some group-theoretic and topological properties of graphs and empirical networks ranging from metabolic to social networks. That K and the size of the group of automorphisms of a graph are correlated opens up ... |
2307.01831 | Shentong Mo | Shentong Mo, Enze Xie, Ruihang Chu, Lewei Yao, Lanqing Hong, Matthias
Nie{\ss}ner, Zhenguo Li | DiT-3D: Exploring Plain Diffusion Transformers for 3D Shape Generation | Project Page: https://dit-3d.github.io/ | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent Diffusion Transformers (e.g., DiT) have demonstrated their powerful
effectiveness in generating high-quality 2D images. However, it is still being
determined whether the Transformer architecture performs equally well in 3D
shape generation, as previous 3D diffusion methods mostly adopted the U-Net
architecture... | [
{
"created": "Tue, 4 Jul 2023 17:15:46 GMT",
"version": "v1"
}
] | 2023-07-06 | [
[
"Mo",
"Shentong",
""
],
[
"Xie",
"Enze",
""
],
[
"Chu",
"Ruihang",
""
],
[
"Yao",
"Lewei",
""
],
[
"Hong",
"Lanqing",
""
],
[
"Nießner",
"Matthias",
""
],
[
"Li",
"Zhenguo",
""
]
] | Recent Diffusion Transformers (e.g., DiT) have demonstrated their powerful effectiveness in generating high-quality 2D images. However, it is still being determined whether the Transformer architecture performs equally well in 3D shape generation, as previous 3D diffusion methods mostly adopted the U-Net architecture. ... |
2206.00564 | Laurie Burchell | Laurie Burchell, Alexandra Birch, Kenneth Heafield | Exploring Diversity in Back Translation for Low-Resource Machine
Translation | null | null | 10.18653/v1/2022.deeplo-1.8 | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Back translation is one of the most widely used methods for improving the
performance of neural machine translation systems. Recent research has sought
to enhance the effectiveness of this method by increasing the 'diversity' of
the generated translations. We argue that the definitions and metrics used to
quantify 'd... | [
{
"created": "Wed, 1 Jun 2022 15:21:16 GMT",
"version": "v1"
}
] | 2023-09-01 | [
[
"Burchell",
"Laurie",
""
],
[
"Birch",
"Alexandra",
""
],
[
"Heafield",
"Kenneth",
""
]
] | Back translation is one of the most widely used methods for improving the performance of neural machine translation systems. Recent research has sought to enhance the effectiveness of this method by increasing the 'diversity' of the generated translations. We argue that the definitions and metrics used to quantify 'div... |
2207.01171 | Alessandra Carneiro | Alessandra Carneiro and Lorena Nascimento and Mauricio Noernberg and
Carmem Hara and Aurora Pozo | Portuguese Man-of-War Image Classification with Convolutional Neural
Networks | null | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Portuguese man-of-war (PMW) is a gelatinous organism with long tentacles
capable of causing severe burns, thus leading to negative impacts on human
activities, such as tourism and fishing. There is a lack of information about
the spatio-temporal dynamics of this species. Therefore, the use of alternative
methods for ... | [
{
"created": "Mon, 4 Jul 2022 03:06:45 GMT",
"version": "v1"
}
] | 2022-07-05 | [
[
"Carneiro",
"Alessandra",
""
],
[
"Nascimento",
"Lorena",
""
],
[
"Noernberg",
"Mauricio",
""
],
[
"Hara",
"Carmem",
""
],
[
"Pozo",
"Aurora",
""
]
] | Portuguese man-of-war (PMW) is a gelatinous organism with long tentacles capable of causing severe burns, thus leading to negative impacts on human activities, such as tourism and fishing. There is a lack of information about the spatio-temporal dynamics of this species. Therefore, the use of alternative methods for co... |
2107.13165 | Kushal Chawla | Kushal Chawla, Rene Clever, Jaysa Ramirez, Gale Lucas, Jonathan Gratch | Towards Emotion-Aware Agents For Negotiation Dialogues | Accepted at 9th International Conference on Affective Computing &
Intelligent Interaction (ACII 2021) | null | null | null | cs.HC cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | Negotiation is a complex social interaction that encapsulates emotional
encounters in human decision-making. Virtual agents that can negotiate with
humans are useful in pedagogy and conversational AI. To advance the development
of such agents, we explore the prediction of two important subjective goals in
a negotiati... | [
{
"created": "Wed, 28 Jul 2021 04:42:36 GMT",
"version": "v1"
}
] | 2021-07-29 | [
[
"Chawla",
"Kushal",
""
],
[
"Clever",
"Rene",
""
],
[
"Ramirez",
"Jaysa",
""
],
[
"Lucas",
"Gale",
""
],
[
"Gratch",
"Jonathan",
""
]
] | Negotiation is a complex social interaction that encapsulates emotional encounters in human decision-making. Virtual agents that can negotiate with humans are useful in pedagogy and conversational AI. To advance the development of such agents, we explore the prediction of two important subjective goals in a negotiation... |
1410.1237 | Mahantesh Halappanavar | Hao Lu and Mahantesh Halappanavar and Ananth Kalyanaraman | Parallel Heuristics for Scalable Community Detection | Submitted to a journal | null | null | null | cs.SI cs.DC physics.soc-ph | http://creativecommons.org/licenses/publicdomain/ | Community detection has become a fundamental operation in numerous
graph-theoretic applications. It is used to reveal natural divisions that exist
within real world networks without imposing prior size or cardinality
constraints on the set of communities. Despite its potential for application,
there is only limited s... | [
{
"created": "Mon, 6 Oct 2014 01:54:15 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Oct 2014 01:01:12 GMT",
"version": "v2"
}
] | 2014-10-08 | [
[
"Lu",
"Hao",
""
],
[
"Halappanavar",
"Mahantesh",
""
],
[
"Kalyanaraman",
"Ananth",
""
]
] | Community detection has become a fundamental operation in numerous graph-theoretic applications. It is used to reveal natural divisions that exist within real world networks without imposing prior size or cardinality constraints on the set of communities. Despite its potential for application, there is only limited sup... |
1907.05016 | Jing Li | Jing Li and Dongning Guo | On Analysis of the Bitcoin and Prism Backbone Protocols | null | null | null | null | cs.CR cs.DC cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bitcoin is a peer-to-peer payment system proposed by Nakamoto in 2008.
Properties of the bitcoin backbone protocol have been investigated in some
depth: the blockchain growth property quantifies the number of blocks added to
the blockchain during any time intervals; the blockchain quality property
ensures the honest ... | [
{
"created": "Thu, 11 Jul 2019 06:35:05 GMT",
"version": "v1"
},
{
"created": "Sun, 20 Oct 2019 01:10:42 GMT",
"version": "v2"
}
] | 2019-10-22 | [
[
"Li",
"Jing",
""
],
[
"Guo",
"Dongning",
""
]
] | Bitcoin is a peer-to-peer payment system proposed by Nakamoto in 2008. Properties of the bitcoin backbone protocol have been investigated in some depth: the blockchain growth property quantifies the number of blocks added to the blockchain during any time intervals; the blockchain quality property ensures the honest mi... |
1512.01872 | Pranav Rajpurkar | Pranav Rajpurkar, Toki Migimatsu, Jeff Kiske, Royce Cheng-Yue, Sameep
Tandon, Tao Wang, Andrew Ng | Driverseat: Crowdstrapping Learning Tasks for Autonomous Driving | null | null | null | null | cs.HC cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While emerging deep-learning systems have outclassed knowledge-based
approaches in many tasks, their application to detection tasks for autonomous
technologies remains an open field for scientific exploration. Broadly, there
are two major developmental bottlenecks: the unavailability of comprehensively
labeled datase... | [
{
"created": "Mon, 7 Dec 2015 01:34:23 GMT",
"version": "v1"
}
] | 2015-12-08 | [
[
"Rajpurkar",
"Pranav",
""
],
[
"Migimatsu",
"Toki",
""
],
[
"Kiske",
"Jeff",
""
],
[
"Cheng-Yue",
"Royce",
""
],
[
"Tandon",
"Sameep",
""
],
[
"Wang",
"Tao",
""
],
[
"Ng",
"Andrew",
""
]
] | While emerging deep-learning systems have outclassed knowledge-based approaches in many tasks, their application to detection tasks for autonomous technologies remains an open field for scientific exploration. Broadly, there are two major developmental bottlenecks: the unavailability of comprehensively labeled datasets... |
1803.09413 | Sumita Mishra | Sachin Kumar, Sumita Mishra, Pooja Khanna, Pragya | Precision Sugarcane Monitoring Using SVM Classifier | This is a pre-print of an article published in [Procedia Computer
Science 2017] | Procedia Computer Science,2017,vol.122,pp. 881-887 | 10.1016/j.procs.2017.11.450 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | India is agriculture based economy and sugarcane is one of the major crops
produced in northern India. Productivity of sugarcane decreases due to
inappropriate soil conditions and infections caused by various types of
diseases , timely and accurate disease diagnosis, plays an important role
towards optimizing crop yi... | [
{
"created": "Mon, 26 Mar 2018 05:05:25 GMT",
"version": "v1"
}
] | 2018-03-28 | [
[
"Kumar",
"Sachin",
""
],
[
"Mishra",
"Sumita",
""
],
[
"Khanna",
"Pooja",
""
],
[
"Pragya",
"",
""
]
] | India is agriculture based economy and sugarcane is one of the major crops produced in northern India. Productivity of sugarcane decreases due to inappropriate soil conditions and infections caused by various types of diseases , timely and accurate disease diagnosis, plays an important role towards optimizing crop yiel... |
2402.14162 | Minh-Hao Van | Minh-Hao Van, Prateek Verma, Xintao Wu | On Large Visual Language Models for Medical Imaging Analysis: An
Empirical Study | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Recently, large language models (LLMs) have taken the spotlight in natural
language processing. Further, integrating LLMs with vision enables the users to
explore emergent abilities with multimodal data. Visual language models (VLMs),
such as LLaVA, Flamingo, or CLIP, have demonstrated impressive performance on
vario... | [
{
"created": "Wed, 21 Feb 2024 23:01:38 GMT",
"version": "v1"
}
] | 2024-02-23 | [
[
"Van",
"Minh-Hao",
""
],
[
"Verma",
"Prateek",
""
],
[
"Wu",
"Xintao",
""
]
] | Recently, large language models (LLMs) have taken the spotlight in natural language processing. Further, integrating LLMs with vision enables the users to explore emergent abilities with multimodal data. Visual language models (VLMs), such as LLaVA, Flamingo, or CLIP, have demonstrated impressive performance on various... |
2312.07381 | Hallee Wong | Hallee E. Wong, Marianne Rakic, John Guttag, Adrian V. Dalca | ScribblePrompt: Fast and Flexible Interactive Segmentation for Any
Biomedical Image | Accepted by ECCV 2024. Project Website:
https://scribbleprompt.csail.mit.edu Keywords: Interactive Segmentation,
Medical Imaging, Segment Anything Model, SAM, Scribble Annotations, Prompt | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Biomedical image segmentation is a crucial part of both scientific research
and clinical care. With enough labelled data, deep learning models can be
trained to accurately automate specific biomedical image segmentation tasks.
However, manually segmenting images to create training data is highly labor
intensive and r... | [
{
"created": "Tue, 12 Dec 2023 15:57:03 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Apr 2024 20:41:14 GMT",
"version": "v2"
},
{
"created": "Tue, 16 Jul 2024 21:21:42 GMT",
"version": "v3"
}
] | 2024-07-18 | [
[
"Wong",
"Hallee E.",
""
],
[
"Rakic",
"Marianne",
""
],
[
"Guttag",
"John",
""
],
[
"Dalca",
"Adrian V.",
""
]
] | Biomedical image segmentation is a crucial part of both scientific research and clinical care. With enough labelled data, deep learning models can be trained to accurately automate specific biomedical image segmentation tasks. However, manually segmenting images to create training data is highly labor intensive and req... |
1712.06897 | Jie Lyu | Jie Lyu, Zejian Yuan, Dapeng Chen | Learning Fixation Point Strategy for Object Detection and Classification | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel recurrent attentional structure to localize and recognize
objects jointly. The network can learn to extract a sequence of local
observations with detailed appearance and rough context, instead of sliding
windows or convolutions on the entire image. Meanwhile, those observations are
fused to complet... | [
{
"created": "Tue, 19 Dec 2017 12:28:01 GMT",
"version": "v1"
}
] | 2017-12-20 | [
[
"Lyu",
"Jie",
""
],
[
"Yuan",
"Zejian",
""
],
[
"Chen",
"Dapeng",
""
]
] | We propose a novel recurrent attentional structure to localize and recognize objects jointly. The network can learn to extract a sequence of local observations with detailed appearance and rough context, instead of sliding windows or convolutions on the entire image. Meanwhile, those observations are fused to complete ... |
2310.14162 | Rohan Gupta | Rohan Gupta | Augmenting End-to-End Steering Angle Prediction with CAN Bus Data | 5 pages | null | null | null | cs.CV cs.AI | http://creativecommons.org/publicdomain/zero/1.0/ | In recent years, end to end steering prediction for autonomous vehicles has
become a major area of research. The primary method for achieving end to end
steering was to use computer vision models on a live feed of video data.
However, to further increase accuracy, many companies have added data from
light detection a... | [
{
"created": "Sun, 22 Oct 2023 03:24:53 GMT",
"version": "v1"
}
] | 2023-10-24 | [
[
"Gupta",
"Rohan",
""
]
] | In recent years, end to end steering prediction for autonomous vehicles has become a major area of research. The primary method for achieving end to end steering was to use computer vision models on a live feed of video data. However, to further increase accuracy, many companies have added data from light detection and... |
1309.6455 | Gwen Spencer PhD | Gwen Spencer and Richard Howarth | Maximizing the Spread of Stable Influence: Leveraging Norm-driven
Moral-Motivation for Green Behavior Change in Networks | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In an effort to understand why individuals choose to participate in
personally-expensive pro-environmental behaviors, environmental and behavioral
economists have examined a moral-motivation model in which the decision to
adopt a pro-environmental behavior depends on the society-wide market share of
that behavior. An... | [
{
"created": "Wed, 25 Sep 2013 10:30:57 GMT",
"version": "v1"
}
] | 2013-09-26 | [
[
"Spencer",
"Gwen",
""
],
[
"Howarth",
"Richard",
""
]
] | In an effort to understand why individuals choose to participate in personally-expensive pro-environmental behaviors, environmental and behavioral economists have examined a moral-motivation model in which the decision to adopt a pro-environmental behavior depends on the society-wide market share of that behavior. An i... |
2305.02309 | Erik Nijkamp Dr. | Erik Nijkamp, Hiroaki Hayashi, Caiming Xiong, Silvio Savarese, Yingbo
Zhou | CodeGen2: Lessons for Training LLMs on Programming and Natural Languages | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large language models (LLMs) have demonstrated remarkable abilities in
representation learning for program synthesis and understanding tasks. The
quality of the learned representations appears to be dictated by the neural
scaling laws as a function of the number of model parameters and observations,
while imposing up... | [
{
"created": "Wed, 3 May 2023 17:55:25 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Jul 2023 21:11:23 GMT",
"version": "v2"
}
] | 2023-07-13 | [
[
"Nijkamp",
"Erik",
""
],
[
"Hayashi",
"Hiroaki",
""
],
[
"Xiong",
"Caiming",
""
],
[
"Savarese",
"Silvio",
""
],
[
"Zhou",
"Yingbo",
""
]
] | Large language models (LLMs) have demonstrated remarkable abilities in representation learning for program synthesis and understanding tasks. The quality of the learned representations appears to be dictated by the neural scaling laws as a function of the number of model parameters and observations, while imposing uppe... |
2007.03338 | Mehdi Ghatee Dr. | Marzieh Heidari, Mehdi Ghatee, Ahmad Nickabadi, Arash Pourhasan Nezhad | Diverse and Styled Image Captioning Using SVD-Based Mixture of Recurrent
Experts | 13 pages, 4 figures and 5 tables, extracted from an MSc thesis in the
Amirkabir University of Technology, Tehran, Iran | Concurrency and Computation: Practice and Experience, 2022 | 10.1002/cpe.6866 | null | cs.CV cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With great advances in vision and natural language processing, the generation
of image captions becomes a need. In a recent paper, Mathews, Xie and He [1],
extended a new model to generate styled captions by separating semantics and
style. In continuation of this work, here a new captioning model is developed
includi... | [
{
"created": "Tue, 7 Jul 2020 11:00:27 GMT",
"version": "v1"
}
] | 2022-02-03 | [
[
"Heidari",
"Marzieh",
""
],
[
"Ghatee",
"Mehdi",
""
],
[
"Nickabadi",
"Ahmad",
""
],
[
"Nezhad",
"Arash Pourhasan",
""
]
] | With great advances in vision and natural language processing, the generation of image captions becomes a need. In a recent paper, Mathews, Xie and He [1], extended a new model to generate styled captions by separating semantics and style. In continuation of this work, here a new captioning model is developed including... |
1905.03919 | Filippo Menczer | Kazutoshi Sasahara, Wen Chen, Hao Peng, Giovanni Luca Ciampaglia,
Alessandro Flammini, Filippo Menczer | Social Influence and Unfollowing Accelerate the Emergence of Echo
Chambers | 28 pages, 11 figures. Forthcoming in Journal of Computational Social
Science | J Comput Soc Sc (2020) | 10.1007/s42001-020-00084-7 | null | cs.CY cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While social media make it easy to connect with and access information from
anyone, they also facilitate basic influence and unfriending mechanisms that
may lead to segregated and polarized clusters known as "echo chambers." Here we
study the conditions in which such echo chambers emerge by introducing a simple
model... | [
{
"created": "Fri, 10 May 2019 03:08:23 GMT",
"version": "v1"
},
{
"created": "Mon, 20 May 2019 16:40:50 GMT",
"version": "v2"
},
{
"created": "Tue, 25 Aug 2020 02:27:40 GMT",
"version": "v3"
}
] | 2020-09-15 | [
[
"Sasahara",
"Kazutoshi",
""
],
[
"Chen",
"Wen",
""
],
[
"Peng",
"Hao",
""
],
[
"Ciampaglia",
"Giovanni Luca",
""
],
[
"Flammini",
"Alessandro",
""
],
[
"Menczer",
"Filippo",
""
]
] | While social media make it easy to connect with and access information from anyone, they also facilitate basic influence and unfriending mechanisms that may lead to segregated and polarized clusters known as "echo chambers." Here we study the conditions in which such echo chambers emerge by introducing a simple model o... |
1702.07478 | Igor Tarasyuk | Igor V. Tarasyuk, Hermenegilda Maci\`a, Valent\'in Valero | Stochastic equivalence for performance analysis of concurrent systems in
dtsiPBC | Prepared for submission to Discrete Mathematics and Theoretical
Computer Science | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an extension with immediate multiactions of discrete time
stochastic Petri Box Calculus (dtsPBC), presented by I.V. Tarasyuk. The
resulting algebra dtsiPBC is a discrete time analogue of stochastic Petri Box
Calculus (sPBC) with immediate multiactions, designed by H. Maci\`a, V. Valero
et al. within a cont... | [
{
"created": "Fri, 24 Feb 2017 07:07:24 GMT",
"version": "v1"
}
] | 2017-02-27 | [
[
"Tarasyuk",
"Igor V.",
""
],
[
"Macià",
"Hermenegilda",
""
],
[
"Valero",
"Valentín",
""
]
] | We propose an extension with immediate multiactions of discrete time stochastic Petri Box Calculus (dtsPBC), presented by I.V. Tarasyuk. The resulting algebra dtsiPBC is a discrete time analogue of stochastic Petri Box Calculus (sPBC) with immediate multiactions, designed by H. Maci\`a, V. Valero et al. within a contin... |
1810.01966 | Ekram Hossain | Mohammad Salehi, Hina Tabassum, and Ekram Hossain | Accuracy of Distance-Based Ranking of Users in the Analysis of NOMA
Systems | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We characterize the accuracy of analyzing the performance of a NOMA system
where users are ranked according to their distances instead of instantaneous
channel gains, i.e., product of distance-based path-loss and fading channel
gains. Distance-based ranking is analytically tractable and can lead to
important insights... | [
{
"created": "Wed, 3 Oct 2018 20:50:32 GMT",
"version": "v1"
}
] | 2018-10-05 | [
[
"Salehi",
"Mohammad",
""
],
[
"Tabassum",
"Hina",
""
],
[
"Hossain",
"Ekram",
""
]
] | We characterize the accuracy of analyzing the performance of a NOMA system where users are ranked according to their distances instead of instantaneous channel gains, i.e., product of distance-based path-loss and fading channel gains. Distance-based ranking is analytically tractable and can lead to important insights. ... |
1203.0587 | Alex Brik | Alex Brik, Jeffrey B. Remmel | Expressing Preferences using Preference Set Constraint Atoms | 9 pages | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces an extension of Answer Set Programming called
Preference Set Constraint Programming which is a convenient and general
formalism to reason with preferences. PSC programming extends Set Constraint
Programming introduced by Marek and Remmel (Marek and Remmel 2004) by
introducing two types of prefer... | [
{
"created": "Fri, 2 Mar 2012 23:25:07 GMT",
"version": "v1"
}
] | 2012-03-06 | [
[
"Brik",
"Alex",
""
],
[
"Remmel",
"Jeffrey B.",
""
]
] | This paper introduces an extension of Answer Set Programming called Preference Set Constraint Programming which is a convenient and general formalism to reason with preferences. PSC programming extends Set Constraint Programming introduced by Marek and Remmel (Marek and Remmel 2004) by introducing two types of preferen... |
1711.09008 | Yuming Jiang | Atef Abdelkefi and Yuming Jiang and Sachin Sharma | SENATUS: An Approach to Joint Traffic Anomaly Detection and Root Cause
Analysis | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel approach, called SENATUS, for joint traffic
anomaly detection and root-cause analysis. Inspired from the concept of a
senate, the key idea of the proposed approach is divided into three stages:
election, voting and decision. At the election stage, a small number of
\nop{traffic flow ... | [
{
"created": "Fri, 24 Nov 2017 15:14:50 GMT",
"version": "v1"
}
] | 2017-11-27 | [
[
"Abdelkefi",
"Atef",
""
],
[
"Jiang",
"Yuming",
""
],
[
"Sharma",
"Sachin",
""
]
] | In this paper, we propose a novel approach, called SENATUS, for joint traffic anomaly detection and root-cause analysis. Inspired from the concept of a senate, the key idea of the proposed approach is divided into three stages: election, voting and decision. At the election stage, a small number of \nop{traffic flow se... |
1602.03599 | EPTCS | Juliana Franco (Imperial College London), Sophia Drossopoulou
(Imperial College London) | Behavioural types for non-uniform memory accesses | In Proceedings PLACES 2015, arXiv:1602.03254 | EPTCS 203, 2016, pp. 109-120 | 10.4204/EPTCS.203.9 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Concurrent programs executing on NUMA architectures consist of concurrent
entities (e.g. threads, actors) and data placed on different nodes. Execution
of these concurrent entities often reads or updates states from remote nodes.
The performance of such systems depends on the extent to which the concurrent
entities c... | [
{
"created": "Thu, 11 Feb 2016 01:21:09 GMT",
"version": "v1"
}
] | 2016-02-12 | [
[
"Franco",
"Juliana",
"",
"Imperial College London"
],
[
"Drossopoulou",
"Sophia",
"",
"Imperial College London"
]
] | Concurrent programs executing on NUMA architectures consist of concurrent entities (e.g. threads, actors) and data placed on different nodes. Execution of these concurrent entities often reads or updates states from remote nodes. The performance of such systems depends on the extent to which the concurrent entities can... |
2105.03655 | Huy Ha | Huy Ha, Shuran Song | FlingBot: The Unreasonable Effectiveness of Dynamic Manipulation for
Cloth Unfolding | 11 pages, 6 figures. Code, data, and simulation environment publicly
available at https://flingbot.cs.columbia.edu | Conference on Robot Learning (CoRL 2021) | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | High-velocity dynamic actions (e.g., fling or throw) play a crucial role in
our everyday interaction with deformable objects by improving our efficiency
and effectively expanding our physical reach range. Yet, most prior works have
tackled cloth manipulation using exclusively single-arm quasi-static actions,
which re... | [
{
"created": "Sat, 8 May 2021 09:48:15 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Jun 2021 05:47:27 GMT",
"version": "v2"
},
{
"created": "Mon, 18 Oct 2021 19:03:27 GMT",
"version": "v3"
}
] | 2021-10-20 | [
[
"Ha",
"Huy",
""
],
[
"Song",
"Shuran",
""
]
] | High-velocity dynamic actions (e.g., fling or throw) play a crucial role in our everyday interaction with deformable objects by improving our efficiency and effectively expanding our physical reach range. Yet, most prior works have tackled cloth manipulation using exclusively single-arm quasi-static actions, which requ... |
2405.16091 | Myong Chol Jung | Myong Chol Jung, He Zhao, Joanna Dipnall, Belinda Gabbe, Lan Du | Enhancing Near OOD Detection in Prompt Learning: Maximum Gains, Minimal
Costs | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Prompt learning has shown to be an efficient and effective fine-tuning method
for vision-language models like CLIP. While numerous studies have focused on
the generalisation of these models in few-shot classification, their capability
in near out-of-distribution (OOD) detection has been overlooked. A few recent
works... | [
{
"created": "Sat, 25 May 2024 06:46:16 GMT",
"version": "v1"
}
] | 2024-05-28 | [
[
"Jung",
"Myong Chol",
""
],
[
"Zhao",
"He",
""
],
[
"Dipnall",
"Joanna",
""
],
[
"Gabbe",
"Belinda",
""
],
[
"Du",
"Lan",
""
]
] | Prompt learning has shown to be an efficient and effective fine-tuning method for vision-language models like CLIP. While numerous studies have focused on the generalisation of these models in few-shot classification, their capability in near out-of-distribution (OOD) detection has been overlooked. A few recent works h... |
1401.3682 | Minglai Cai | Holger Boche, Minglai Cai, and Christian Deppe | Broadcast Classical-Quantum Capacity Region of Two-Phase Bidirectional
Relaying Channel | null | Quantum Information Processing: Volume 14, Issue 10 (2015), Page
3879-3897 | 10.1007/s11128-015-1065-2 | null | cs.IT math.IT math.QA quant-ph | http://creativecommons.org/licenses/by/4.0/ | We study a three-node quantum network which enables bidirectional
communication between two nodes with a half-duplex relay node. A
decode-and-forward protocol is used to perform the communication in two phases.
In the first phase, the messages of two nodes are transmitted to the relay
node. In the second phase, the r... | [
{
"created": "Wed, 15 Jan 2014 17:29:23 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Jan 2014 10:27:07 GMT",
"version": "v2"
},
{
"created": "Mon, 27 Jul 2015 13:02:18 GMT",
"version": "v3"
},
{
"created": "Mon, 28 Sep 2015 15:23:00 GMT",
"version": "v4"
}
] | 2015-09-29 | [
[
"Boche",
"Holger",
""
],
[
"Cai",
"Minglai",
""
],
[
"Deppe",
"Christian",
""
]
] | We study a three-node quantum network which enables bidirectional communication between two nodes with a half-duplex relay node. A decode-and-forward protocol is used to perform the communication in two phases. In the first phase, the messages of two nodes are transmitted to the relay node. In the second phase, the rel... |
2306.01996 | Han Wang | Han Wang, Ming Tang, Ke Xu, Quancheng Wang | BandwidthBreach: Unleashing Covert and Side Channels through Cache
Bandwidth Exploitation | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the modern CPU architecture, enhancements such as the Line Fill Buffer
(LFB) and Super Queue (SQ), which are designed to track pending cache requests,
have significantly boosted performance. To exploit this structures, we
deliberately engineered blockages in the L2 to L1d route by controlling LFB
conflict and trig... | [
{
"created": "Sat, 3 Jun 2023 04:09:07 GMT",
"version": "v1"
}
] | 2023-06-06 | [
[
"Wang",
"Han",
""
],
[
"Tang",
"Ming",
""
],
[
"Xu",
"Ke",
""
],
[
"Wang",
"Quancheng",
""
]
] | In the modern CPU architecture, enhancements such as the Line Fill Buffer (LFB) and Super Queue (SQ), which are designed to track pending cache requests, have significantly boosted performance. To exploit this structures, we deliberately engineered blockages in the L2 to L1d route by controlling LFB conflict and trigge... |
2108.06832 | Sanjiang Li | Xueqing Yan, Yongming Li, Sanjiang Li | A Fast Algorithm for Computing the Deficiency Number of a Mahjong Hand | 32 pages, 3 figures | null | null | null | cs.AI cs.DM cs.MA | http://creativecommons.org/licenses/by/4.0/ | The tile-based multiplayer game Mahjong is widely played in Asia and has also
become increasingly popular worldwide. Face-to-face or online, each player
begins with a hand of 13 tiles and players draw and discard tiles in turn until
they complete a winning hand. An important notion in Mahjong is the deficiency
number... | [
{
"created": "Sun, 15 Aug 2021 22:44:14 GMT",
"version": "v1"
}
] | 2021-08-17 | [
[
"Yan",
"Xueqing",
""
],
[
"Li",
"Yongming",
""
],
[
"Li",
"Sanjiang",
""
]
] | The tile-based multiplayer game Mahjong is widely played in Asia and has also become increasingly popular worldwide. Face-to-face or online, each player begins with a hand of 13 tiles and players draw and discard tiles in turn until they complete a winning hand. An important notion in Mahjong is the deficiency number (... |
1601.04952 | Andrea Baronchelli | Vito Trianni, Daniele De Simone, Andreagiovanni Reina, Andrea
Baronchelli | Emergence of Consensus in a Multi-Robot Network: from Abstract Models to
Empirical Validation | A supporting video is available here:
https://mail.google.com/mail/u/0/#search/vito.trianni%40istc.cnr.it/15244cd6f27f0e99?projector=1 | Robotics and Automation Letters, IEEE , vol.PP, no.99, pp.1 (2016) | 10.1109/LRA.2016.2519537 | null | cs.MA cs.RO cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consensus dynamics in decentralised multiagent systems are subject to intense
studies, and several different models have been proposed and analysed. Among
these, the naming game stands out for its simplicity and applicability to a
wide range of phenomena and applications, from semiotics to engineering.
Despite the wi... | [
{
"created": "Tue, 19 Jan 2016 15:29:52 GMT",
"version": "v1"
}
] | 2016-01-21 | [
[
"Trianni",
"Vito",
""
],
[
"De Simone",
"Daniele",
""
],
[
"Reina",
"Andreagiovanni",
""
],
[
"Baronchelli",
"Andrea",
""
]
] | Consensus dynamics in decentralised multiagent systems are subject to intense studies, and several different models have been proposed and analysed. Among these, the naming game stands out for its simplicity and applicability to a wide range of phenomena and applications, from semiotics to engineering. Despite the wide... |
1804.07419 | Rafael Menelau Oliveira E Cruz | Felipe N. Walmsley, George D. C. Cavalcanti, Dayvid V. R. Oliveira,
Rafael M. O. Cruz and Robert Sabourin | An Ensemble Generation Method Based on Instance Hardness | Paper accepted for publication on IJCNN 2018 | null | 10.1109/IJCNN.2018.8489269 | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In Machine Learning, ensemble methods have been receiving a great deal of
attention. Techniques such as Bagging and Boosting have been successfully
applied to a variety of problems. Nevertheless, such techniques are still
susceptible to the effects of noise and outliers in the training data. We
propose a new method f... | [
{
"created": "Fri, 20 Apr 2018 01:29:47 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Apr 2018 07:18:12 GMT",
"version": "v2"
}
] | 2018-11-01 | [
[
"Walmsley",
"Felipe N.",
""
],
[
"Cavalcanti",
"George D. C.",
""
],
[
"Oliveira",
"Dayvid V. R.",
""
],
[
"Cruz",
"Rafael M. O.",
""
],
[
"Sabourin",
"Robert",
""
]
] | In Machine Learning, ensemble methods have been receiving a great deal of attention. Techniques such as Bagging and Boosting have been successfully applied to a variety of problems. Nevertheless, such techniques are still susceptible to the effects of noise and outliers in the training data. We propose a new method for... |
2202.11423 | Kailun Yang | Kunyu Peng, Alina Roitberg, Kailun Yang, Jiaming Zhang, Rainer
Stiefelhagen | Delving Deep into One-Shot Skeleton-based Action Recognition with
Diverse Occlusions | Accepted to IEEE Transactions on Multimedia (TMM). Code is publicly
available at https://github.com/KPeng9510/Trans4SOAR | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Occlusions are universal disruptions constantly present in the real world.
Especially for sparse representations, such as human skeletons, a few occluded
points might destroy the geometrical and temporal continuity critically
affecting the results. Yet, the research of data-scarce recognition from
skeleton sequences,... | [
{
"created": "Wed, 23 Feb 2022 11:11:54 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Jul 2022 17:34:01 GMT",
"version": "v2"
},
{
"created": "Mon, 9 Jan 2023 20:55:30 GMT",
"version": "v3"
}
] | 2023-01-11 | [
[
"Peng",
"Kunyu",
""
],
[
"Roitberg",
"Alina",
""
],
[
"Yang",
"Kailun",
""
],
[
"Zhang",
"Jiaming",
""
],
[
"Stiefelhagen",
"Rainer",
""
]
] | Occlusions are universal disruptions constantly present in the real world. Especially for sparse representations, such as human skeletons, a few occluded points might destroy the geometrical and temporal continuity critically affecting the results. Yet, the research of data-scarce recognition from skeleton sequences, s... |
1210.6192 | Kasturika B Ray | Rachita Misra, Kasturika B ray | Textural Approach to Palmprint Identification | 9 pages | http://www.ijascse.in/publications-2012--2 | null | null | cs.CV cs.CR cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Biometrics which use of human physiological characteristics for identifying
an individual is now a widespread method of identification and authentication.
Biometric identification is a technology which uses several image processing
techniques and describes the general procedure for identification and
verification usi... | [
{
"created": "Tue, 23 Oct 2012 10:52:31 GMT",
"version": "v1"
}
] | 2012-10-24 | [
[
"Misra",
"Rachita",
""
],
[
"ray",
"Kasturika B",
""
]
] | Biometrics which use of human physiological characteristics for identifying an individual is now a widespread method of identification and authentication. Biometric identification is a technology which uses several image processing techniques and describes the general procedure for identification and verification using... |
2102.07312 | Shoya Ishimaru | Shoya Ishimaru, Takanori Maruichi, Andreas Dengel and Koichi Kise | Confidence-Aware Learning Assistant | 9 pages, 11 figures | null | null | null | cs.HC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Not only correctness but also self-confidence play an important role in
improving the quality of knowledge. Undesirable situations such as confident
incorrect and unconfident correct knowledge prevent learners from revising
their knowledge because it is not always easy for them to perceive the
situations. To solve th... | [
{
"created": "Mon, 15 Feb 2021 02:47:11 GMT",
"version": "v1"
}
] | 2021-02-16 | [
[
"Ishimaru",
"Shoya",
""
],
[
"Maruichi",
"Takanori",
""
],
[
"Dengel",
"Andreas",
""
],
[
"Kise",
"Koichi",
""
]
] | Not only correctness but also self-confidence play an important role in improving the quality of knowledge. Undesirable situations such as confident incorrect and unconfident correct knowledge prevent learners from revising their knowledge because it is not always easy for them to perceive the situations. To solve this... |
1808.06075 | Gehui Shen | Gehui Shen, Zhi-Hong Deng, Ting Huang and Xi Chen | Learning to Compose over Tree Structures via POS Tags | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recursive Neural Network (RecNN), a type of models which compose words or
phrases recursively over syntactic tree structures, has been proven to have
superior ability to obtain sentence representation for a variety of NLP tasks.
However, RecNN is born with a thorny problem that a shared compositional
function for eac... | [
{
"created": "Sat, 18 Aug 2018 11:53:24 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Aug 2018 01:57:49 GMT",
"version": "v2"
}
] | 2018-08-22 | [
[
"Shen",
"Gehui",
""
],
[
"Deng",
"Zhi-Hong",
""
],
[
"Huang",
"Ting",
""
],
[
"Chen",
"Xi",
""
]
] | Recursive Neural Network (RecNN), a type of models which compose words or phrases recursively over syntactic tree structures, has been proven to have superior ability to obtain sentence representation for a variety of NLP tasks. However, RecNN is born with a thorny problem that a shared compositional function for each ... |
2402.17766 | Runpei Dong | Zekun Qi, Runpei Dong, Shaochen Zhang, Haoran Geng, Chunrui Han, Zheng
Ge, Li Yi, Kaisheng Ma | ShapeLLM: Universal 3D Object Understanding for Embodied Interaction | Accepted at ECCV 2024 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents ShapeLLM, the first 3D Multimodal Large Language Model
(LLM) designed for embodied interaction, exploring a universal 3D object
understanding with 3D point clouds and languages. ShapeLLM is built upon an
improved 3D encoder by extending ReCon to ReCon++ that benefits from multi-view
image distilla... | [
{
"created": "Tue, 27 Feb 2024 18:57:12 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Mar 2024 15:11:37 GMT",
"version": "v2"
},
{
"created": "Fri, 12 Jul 2024 15:36:15 GMT",
"version": "v3"
}
] | 2024-07-15 | [
[
"Qi",
"Zekun",
""
],
[
"Dong",
"Runpei",
""
],
[
"Zhang",
"Shaochen",
""
],
[
"Geng",
"Haoran",
""
],
[
"Han",
"Chunrui",
""
],
[
"Ge",
"Zheng",
""
],
[
"Yi",
"Li",
""
],
[
"Ma",
"Kaisheng",
... | This paper presents ShapeLLM, the first 3D Multimodal Large Language Model (LLM) designed for embodied interaction, exploring a universal 3D object understanding with 3D point clouds and languages. ShapeLLM is built upon an improved 3D encoder by extending ReCon to ReCon++ that benefits from multi-view image distillati... |
2308.03774 | Nick Zhang | Nick Zhang | Knowledge Consilience: One Culture, Two Cultures or Many Cultures? | null | null | null | null | cs.DL | http://creativecommons.org/licenses/by/4.0/ | The hostility between the two cultures, scientific and literary, was framed
by C.P. Snow in 1959 and later by others. The scientific culture is nowadays
often identified with STEM (Science, Technology, Engineering and Mathematics)
whereas the literary culture generally refers to humanities and social
sciences. Wilson... | [
{
"created": "Sun, 30 Jul 2023 11:26:32 GMT",
"version": "v1"
}
] | 2023-08-09 | [
[
"Zhang",
"Nick",
""
]
] | The hostility between the two cultures, scientific and literary, was framed by C.P. Snow in 1959 and later by others. The scientific culture is nowadays often identified with STEM (Science, Technology, Engineering and Mathematics) whereas the literary culture generally refers to humanities and social sciences. Wilson e... |
2404.16587 | Zhihao Zhu | Zhihao Zhu, Ninglu Shao, Defu Lian, Chenwang Wu, Zheng Liu, Yi Yang,
Enhong Chen | Understanding Privacy Risks of Embeddings Induced by Large Language
Models | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large language models (LLMs) show early signs of artificial general
intelligence but struggle with hallucinations. One promising solution to
mitigate these hallucinations is to store external knowledge as embeddings,
aiding LLMs in retrieval-augmented generation. However, such a solution risks
compromising privacy, a... | [
{
"created": "Thu, 25 Apr 2024 13:10:48 GMT",
"version": "v1"
}
] | 2024-04-26 | [
[
"Zhu",
"Zhihao",
""
],
[
"Shao",
"Ninglu",
""
],
[
"Lian",
"Defu",
""
],
[
"Wu",
"Chenwang",
""
],
[
"Liu",
"Zheng",
""
],
[
"Yang",
"Yi",
""
],
[
"Chen",
"Enhong",
""
]
] | Large language models (LLMs) show early signs of artificial general intelligence but struggle with hallucinations. One promising solution to mitigate these hallucinations is to store external knowledge as embeddings, aiding LLMs in retrieval-augmented generation. However, such a solution risks compromising privacy, as ... |
2406.13474 | Junhan Kim | Junhan Kim, Ho-young Kim, Eulrang Cho, Chungman Lee, Joonyoung Kim,
Yongkweon Jeon | Attention-aware Post-training Quantization without Backpropagation | 20 pages, under review | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Quantization is a promising solution for deploying large-scale language
models (LLMs) on resource-constrained devices. Existing quantization
approaches, however, rely on gradient-based optimization, regardless of it
being post-training quantization (PTQ) or quantization-aware training (QAT),
which becomes problematic... | [
{
"created": "Wed, 19 Jun 2024 11:53:21 GMT",
"version": "v1"
}
] | 2024-06-21 | [
[
"Kim",
"Junhan",
""
],
[
"Kim",
"Ho-young",
""
],
[
"Cho",
"Eulrang",
""
],
[
"Lee",
"Chungman",
""
],
[
"Kim",
"Joonyoung",
""
],
[
"Jeon",
"Yongkweon",
""
]
] | Quantization is a promising solution for deploying large-scale language models (LLMs) on resource-constrained devices. Existing quantization approaches, however, rely on gradient-based optimization, regardless of it being post-training quantization (PTQ) or quantization-aware training (QAT), which becomes problematic f... |
2405.11471 | Kento Uchida | Kento Uchida, Kenta Nishihara, Shinichi Shirakawa | CMA-ES with Adaptive Reevaluation for Multiplicative Noise | This paper has been accepted as a full paper at GECCO2024 | null | null | null | cs.NE | http://creativecommons.org/licenses/by-sa/4.0/ | The covariance matrix adaptation evolution strategy (CMA-ES) is a powerful
optimization method for continuous black-box optimization problems. Several
noise-handling methods have been proposed to bring out the optimization
performance of the CMA-ES on noisy objective functions. The adaptations of the
population size ... | [
{
"created": "Sun, 19 May 2024 07:42:10 GMT",
"version": "v1"
}
] | 2024-05-21 | [
[
"Uchida",
"Kento",
""
],
[
"Nishihara",
"Kenta",
""
],
[
"Shirakawa",
"Shinichi",
""
]
] | The covariance matrix adaptation evolution strategy (CMA-ES) is a powerful optimization method for continuous black-box optimization problems. Several noise-handling methods have been proposed to bring out the optimization performance of the CMA-ES on noisy objective functions. The adaptations of the population size an... |
2106.06272 | Stefano Maria Nicoletti | Stefano M. Nicoletti, Marijn Peppelman, Christina Kolb, Mari\"elle
Stoelinga | Model-based Joint Analysis of Safety and Security: Survey and
Identification of Gaps | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We survey the state-of-the-art on model-based formalisms for safety and
security joint analysis, where safety refers to the absence of unintended
failures, and security to absence of malicious attacks. We conduct a thorough
literature review and - as a result - we consider fourteen model-based
formalisms and compare ... | [
{
"created": "Fri, 11 Jun 2021 09:38:23 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Jan 2022 11:02:54 GMT",
"version": "v2"
},
{
"created": "Mon, 23 Oct 2023 09:34:05 GMT",
"version": "v3"
}
] | 2023-10-24 | [
[
"Nicoletti",
"Stefano M.",
""
],
[
"Peppelman",
"Marijn",
""
],
[
"Kolb",
"Christina",
""
],
[
"Stoelinga",
"Mariëlle",
""
]
] | We survey the state-of-the-art on model-based formalisms for safety and security joint analysis, where safety refers to the absence of unintended failures, and security to absence of malicious attacks. We conduct a thorough literature review and - as a result - we consider fourteen model-based formalisms and compare th... |
2402.01296 | Man-Jie Yuan | Man-Jie Yuan, Zheng Zou, Wei Gao | Bi-CryptoNets: Leveraging Different-Level Privacy for Encrypted
Inference | null | null | null | null | cs.LG cs.CR cs.CV | http://creativecommons.org/licenses/by/4.0/ | Privacy-preserving neural networks have attracted increasing attention in
recent years, and various algorithms have been developed to keep the balance
between accuracy, computational complexity and information security from the
cryptographic view. This work takes a different view from the input data and
structure of ... | [
{
"created": "Fri, 2 Feb 2024 10:35:05 GMT",
"version": "v1"
}
] | 2024-02-05 | [
[
"Yuan",
"Man-Jie",
""
],
[
"Zou",
"Zheng",
""
],
[
"Gao",
"Wei",
""
]
] | Privacy-preserving neural networks have attracted increasing attention in recent years, and various algorithms have been developed to keep the balance between accuracy, computational complexity and information security from the cryptographic view. This work takes a different view from the input data and structure of ne... |
0805.4219 | Grenville Croll | Andrew Hawker | Building Financial Accuracy into Spreadsheets | 6 Pages | Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2000 35-40
ISBN:1 86166 158 4 | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Students learning how to apply spreadsheets to accounting problems are not
always well served by the built-in financial functions. Problems can arise
because of differences between UK and US practice, through anomalies in the
functions themselves, and because the promptings of Wizards' engender an
attitude of filling... | [
{
"created": "Tue, 27 May 2008 21:11:48 GMT",
"version": "v1"
}
] | 2008-05-29 | [
[
"Hawker",
"Andrew",
""
]
] | Students learning how to apply spreadsheets to accounting problems are not always well served by the built-in financial functions. Problems can arise because of differences between UK and US practice, through anomalies in the functions themselves, and because the promptings of Wizards' engender an attitude of filling i... |
2209.07749 | Diana Negoescu | Diana M. Negoescu, Pasha Khosravi, Shadow Zhao, Nanyu Chen, Parvez
Ahammad, Humberto Gonzalez | Sales Channel Optimization via Simulations Based on Observational Data
with Delayed Rewards: A Case Study at LinkedIn | Accepted at REVEAL'22 Workshop (16th ACM Conference on Recommender
Systems - RecSys 2022) | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Training models on data obtained from randomized experiments is ideal for
making good decisions. However, randomized experiments are often
time-consuming, expensive, risky, infeasible or unethical to perform, leaving
decision makers little choice but to rely on observational data collected under
historical policies w... | [
{
"created": "Fri, 16 Sep 2022 07:08:37 GMT",
"version": "v1"
}
] | 2022-09-19 | [
[
"Negoescu",
"Diana M.",
""
],
[
"Khosravi",
"Pasha",
""
],
[
"Zhao",
"Shadow",
""
],
[
"Chen",
"Nanyu",
""
],
[
"Ahammad",
"Parvez",
""
],
[
"Gonzalez",
"Humberto",
""
]
] | Training models on data obtained from randomized experiments is ideal for making good decisions. However, randomized experiments are often time-consuming, expensive, risky, infeasible or unethical to perform, leaving decision makers little choice but to rely on observational data collected under historical policies whe... |
2210.05791 | Shalaleh Rismani | Renee Shelby, Shalaleh Rismani, Kathryn Henne, AJung Moon, Negar
Rostamzadeh, Paul Nicholas, N'Mah Yilla, Jess Gallegos, Andrew Smart, Emilio
Garcia, Gurleen Virk | Sociotechnical Harms of Algorithmic Systems: Scoping a Taxonomy for Harm
Reduction | null | null | null | null | cs.HC cs.GL | http://creativecommons.org/licenses/by/4.0/ | Understanding the landscape of potential harms from algorithmic systems
enables practitioners to better anticipate consequences of the systems they
build. It also supports the prospect of incorporating controls to help minimize
harms that emerge from the interplay of technologies and social and cultural
dynamics. A g... | [
{
"created": "Tue, 11 Oct 2022 21:22:30 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Feb 2023 03:31:48 GMT",
"version": "v2"
},
{
"created": "Wed, 19 Jul 2023 02:56:32 GMT",
"version": "v3"
}
] | 2023-07-21 | [
[
"Shelby",
"Renee",
""
],
[
"Rismani",
"Shalaleh",
""
],
[
"Henne",
"Kathryn",
""
],
[
"Moon",
"AJung",
""
],
[
"Rostamzadeh",
"Negar",
""
],
[
"Nicholas",
"Paul",
""
],
[
"Yilla",
"N'Mah",
""
],
[
"... | Understanding the landscape of potential harms from algorithmic systems enables practitioners to better anticipate consequences of the systems they build. It also supports the prospect of incorporating controls to help minimize harms that emerge from the interplay of technologies and social and cultural dynamics. A gro... |
2112.00270 | Jamison Ebert | Vamsi K. Amalladinne, Jamison R. Ebert, Jean-Francois Chamberland, and
Krishna R. Narayanan | An Enhanced Decoding Algorithm for Coded Compressed Sensing with
Applications to Unsourced Random Access | Submitted to MDPI Sensors | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Unsourced random access (URA) has emerged as a pragmatic framework for
next-generation distributed sensor networks. Within URA, concatenated coding
structures are often employed to ensure that the central base station can
accurately recover the set of sent codewords during a given transmission
period. Many URA algori... | [
{
"created": "Wed, 1 Dec 2021 04:30:30 GMT",
"version": "v1"
}
] | 2021-12-02 | [
[
"Amalladinne",
"Vamsi K.",
""
],
[
"Ebert",
"Jamison R.",
""
],
[
"Chamberland",
"Jean-Francois",
""
],
[
"Narayanan",
"Krishna R.",
""
]
] | Unsourced random access (URA) has emerged as a pragmatic framework for next-generation distributed sensor networks. Within URA, concatenated coding structures are often employed to ensure that the central base station can accurately recover the set of sent codewords during a given transmission period. Many URA algorith... |
1102.4121 | EPTCS | Laurent Doyen (LSV, ENS Cachan & CNRS, France), Thierry Massart
(Universit\'e Libre de Bruxelles, Belgium), Mahsa Shirmohammadi (Universit\'e
Libre de Bruxelles, Belgium) | Synchronizing Objectives for Markov Decision Processes | In Proceedings iWIGP 2011, arXiv:1102.3741 | EPTCS 50, 2011, pp. 61-75 | 10.4204/EPTCS.50.5 | null | cs.LO cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce synchronizing objectives for Markov decision processes (MDP).
Intuitively, a synchronizing objective requires that eventually, at every step
there is a state which concentrates almost all the probability mass. In
particular, it implies that the probabilistic system behaves in the long run
like a determin... | [
{
"created": "Mon, 21 Feb 2011 02:30:55 GMT",
"version": "v1"
}
] | 2011-02-22 | [
[
"Doyen",
"Laurent",
"",
"LSV, ENS Cachan & CNRS, France"
],
[
"Massart",
"Thierry",
"",
"Université Libre de Bruxelles, Belgium"
],
[
"Shirmohammadi",
"Mahsa",
"",
"Université\n Libre de Bruxelles, Belgium"
]
] | We introduce synchronizing objectives for Markov decision processes (MDP). Intuitively, a synchronizing objective requires that eventually, at every step there is a state which concentrates almost all the probability mass. In particular, it implies that the probabilistic system behaves in the long run like a determinis... |
cs/0510044 | Andrea Montanari | Andrea Montanari, Balaji Prabhakar, David Tse | Belief Propagation Based Multi--User Detection | 9 pages, 4 eps figures. Forty-third Allerton Conference on
Communications, Control and Computing, invited paper | null | null | null | cs.IT math.IT | null | We apply belief propagation (BP) to multi--user detection in a spread
spectrum system, under the assumption of Gaussian symbols. We prove that BP is
both convergent and allows to estimate the correct conditional expectation of
the input symbols. It is therefore an optimal --minimum mean square error--
detection algor... | [
{
"created": "Sun, 16 Oct 2005 16:05:31 GMT",
"version": "v1"
},
{
"created": "Mon, 22 May 2006 10:56:18 GMT",
"version": "v2"
}
] | 2007-07-13 | [
[
"Montanari",
"Andrea",
""
],
[
"Prabhakar",
"Balaji",
""
],
[
"Tse",
"David",
""
]
] | We apply belief propagation (BP) to multi--user detection in a spread spectrum system, under the assumption of Gaussian symbols. We prove that BP is both convergent and allows to estimate the correct conditional expectation of the input symbols. It is therefore an optimal --minimum mean square error-- detection algorit... |
2003.12299 | Youngjae Yu | Youngjae Yu, Seunghwan Lee, Yuncheol Choi, Gunhee Kim | CurlingNet: Compositional Learning between Images and Text for Fashion
IQ Data | 4 pages, 4 figures, ICCV 2019 Linguistics Meets image and video
retrieval workshop, Fashion IQ challenge | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an approach named CurlingNet that can measure the semantic
distance of composition of image-text embedding. In order to learn an effective
image-text composition for the data in the fashion domain, our model proposes
two key components as follows. First, the Delivery makes the transition of a
source image ... | [
{
"created": "Fri, 27 Mar 2020 09:36:32 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Mar 2020 04:35:16 GMT",
"version": "v2"
}
] | 2020-03-31 | [
[
"Yu",
"Youngjae",
""
],
[
"Lee",
"Seunghwan",
""
],
[
"Choi",
"Yuncheol",
""
],
[
"Kim",
"Gunhee",
""
]
] | We present an approach named CurlingNet that can measure the semantic distance of composition of image-text embedding. In order to learn an effective image-text composition for the data in the fashion domain, our model proposes two key components as follows. First, the Delivery makes the transition of a source image in... |
1309.4035 | Peter Turney | Peter D. Turney | Domain and Function: A Dual-Space Model of Semantic Relations and
Compositions | null | Journal of Artificial Intelligence Research (JAIR), (2012), 44,
533-585 | 10.1613/jair.3640 | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given appropriate representations of the semantic relations between carpenter
and wood and between mason and stone (for example, vectors in a vector space
model), a suitable algorithm should be able to recognize that these relations
are highly similar (carpenter is to wood as mason is to stone; the relations
are anal... | [
{
"created": "Mon, 16 Sep 2013 16:51:02 GMT",
"version": "v1"
}
] | 2013-09-17 | [
[
"Turney",
"Peter D.",
""
]
] | Given appropriate representations of the semantic relations between carpenter and wood and between mason and stone (for example, vectors in a vector space model), a suitable algorithm should be able to recognize that these relations are highly similar (carpenter is to wood as mason is to stone; the relations are analog... |
2004.00794 | Zhonghao Wang | Zhonghao Wang, Yunchao Wei, Rogerior Feris, Jinjun Xiong, Wen-Mei Hwu,
Thomas S. Huang, Humphrey Shi | Alleviating Semantic-level Shift: A Semi-supervised Domain Adaptation
Method for Semantic Segmentation | CVPRW 2020 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning segmentation from synthetic data and adapting to real data can
significantly relieve human efforts in labelling pixel-level masks. A key
challenge of this task is how to alleviate the data distribution discrepancy
between the source and target domains, i.e. reducing domain shift. The common
approach to this ... | [
{
"created": "Thu, 2 Apr 2020 03:25:05 GMT",
"version": "v1"
},
{
"created": "Tue, 9 Jun 2020 22:38:27 GMT",
"version": "v2"
}
] | 2020-06-11 | [
[
"Wang",
"Zhonghao",
""
],
[
"Wei",
"Yunchao",
""
],
[
"Feris",
"Rogerior",
""
],
[
"Xiong",
"Jinjun",
""
],
[
"Hwu",
"Wen-Mei",
""
],
[
"Huang",
"Thomas S.",
""
],
[
"Shi",
"Humphrey",
""
]
] | Learning segmentation from synthetic data and adapting to real data can significantly relieve human efforts in labelling pixel-level masks. A key challenge of this task is how to alleviate the data distribution discrepancy between the source and target domains, i.e. reducing domain shift. The common approach to this pr... |
1707.03642 | Longfei Zhou | L. Zhou, L. Zheng, X. Wang, W. Jiang, and W. Luo | Coordinated Multicell Multicast Beamforming Based on Manifold
Optimization | This paper is already available in IEEE Commmunication Letter. See
http://ieeexplore.ieee.org/document/7898517/ | null | 10.1109/LCOMM.2017.2693374 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multicast beamforming is a key technology for next-generation wireless
cellular networks to support high-rate content distribution services. In this
paper, the coordinated downlink multicast beamforming design in multicell
networks is considered. The goal is to maximize the minimum
signal-to-interference-plus-noise r... | [
{
"created": "Wed, 12 Jul 2017 10:56:50 GMT",
"version": "v1"
}
] | 2017-07-13 | [
[
"Zhou",
"L.",
""
],
[
"Zheng",
"L.",
""
],
[
"Wang",
"X.",
""
],
[
"Jiang",
"W.",
""
],
[
"Luo",
"W.",
""
]
] | Multicast beamforming is a key technology for next-generation wireless cellular networks to support high-rate content distribution services. In this paper, the coordinated downlink multicast beamforming design in multicell networks is considered. The goal is to maximize the minimum signal-to-interference-plus-noise rat... |
1703.07384 | Vishal Jain | Vishal Jain and Dr. Mayank Singh | Ontology Based Pivoted normalization using Vector Based Approach for
information Retrieval | null | 7th International Conference on Advanced Computing and
Communication Technologies, 16th November, 2013 | null | null | cs.IR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The proposed methodology is procedural i.e. it follows finite number of steps
that extracts relevant documents according to users query. It is based on
principles of Data Mining for analyzing web data. Data Mining first adapts
integration of data to generate warehouse. Then, it extracts useful information
with the he... | [
{
"created": "Tue, 21 Mar 2017 18:34:34 GMT",
"version": "v1"
}
] | 2017-03-23 | [
[
"Jain",
"Vishal",
""
],
[
"Singh",
"Dr. Mayank",
""
]
] | The proposed methodology is procedural i.e. it follows finite number of steps that extracts relevant documents according to users query. It is based on principles of Data Mining for analyzing web data. Data Mining first adapts integration of data to generate warehouse. Then, it extracts useful information with the help... |
2312.10273 | Rui Jin | Rui Jin, Yong Liao, and Pengyuan Zhou | User Authentication and Identity Inconsistency Detection via
Mouse-trajectory Similarity Measurement | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Completely Automated Public Turing Test To Tell Computers and Humans Apart
(CAPTCHA) is a type of challenge-response test widely used in authentication
systems. A well-known challenge it faces is the CAPTCHA farm, where workers are
hired to solve CAPTCHAs manually. In this work, we propose to tackle this
challenge fr... | [
{
"created": "Sat, 16 Dec 2023 00:28:10 GMT",
"version": "v1"
}
] | 2023-12-19 | [
[
"Jin",
"Rui",
""
],
[
"Liao",
"Yong",
""
],
[
"Zhou",
"Pengyuan",
""
]
] | Completely Automated Public Turing Test To Tell Computers and Humans Apart (CAPTCHA) is a type of challenge-response test widely used in authentication systems. A well-known challenge it faces is the CAPTCHA farm, where workers are hired to solve CAPTCHAs manually. In this work, we propose to tackle this challenge from... |
1410.8808 | Paolo Pareti Mr. | Paolo Pareti, Ewan Klein and Adam Barker | A Semantic Web of Know-How: Linked Data for Community-Centric Tasks | 6th International Workshop on Web Intelligence & Communities (WIC14),
Proceedings of the companion publication of the 23rd International Conference
on World Wide Web (WWW 2014) | null | null | null | cs.AI cs.CL | http://creativecommons.org/licenses/by-nc-sa/3.0/ | This paper proposes a novel framework for representing community know-how on
the Semantic Web. Procedural knowledge generated by web communities typically
takes the form of natural language instructions or videos and is largely
unstructured. The absence of semantic structure impedes the deployment of many
useful appl... | [
{
"created": "Wed, 29 Oct 2014 15:48:40 GMT",
"version": "v1"
}
] | 2014-11-03 | [
[
"Pareti",
"Paolo",
""
],
[
"Klein",
"Ewan",
""
],
[
"Barker",
"Adam",
""
]
] | This paper proposes a novel framework for representing community know-how on the Semantic Web. Procedural knowledge generated by web communities typically takes the form of natural language instructions or videos and is largely unstructured. The absence of semantic structure impedes the deployment of many useful applic... |
2210.02594 | Jeongyeol Kwon | Jeongyeol Kwon, Yonathan Efroni, Constantine Caramanis, Shie Mannor | Reward-Mixing MDPs with a Few Latent Contexts are Learnable | null | null | null | null | cs.LG cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider episodic reinforcement learning in reward-mixing Markov decision
processes (RMMDPs): at the beginning of every episode nature randomly picks a
latent reward model among $M$ candidates and an agent interacts with the MDP
throughout the episode for $H$ time steps. Our goal is to learn a near-optimal
policy ... | [
{
"created": "Wed, 5 Oct 2022 22:52:00 GMT",
"version": "v1"
}
] | 2022-10-07 | [
[
"Kwon",
"Jeongyeol",
""
],
[
"Efroni",
"Yonathan",
""
],
[
"Caramanis",
"Constantine",
""
],
[
"Mannor",
"Shie",
""
]
] | We consider episodic reinforcement learning in reward-mixing Markov decision processes (RMMDPs): at the beginning of every episode nature randomly picks a latent reward model among $M$ candidates and an agent interacts with the MDP throughout the episode for $H$ time steps. Our goal is to learn a near-optimal policy th... |
2206.03761 | Yifan Wang | Yifan Wang, Weizhi Ma, Min Zhang, Yiqun Liu, and Shaoping Ma | A Survey on the Fairness of Recommender Systems | Submitted to the Special Section on Trustworthy Recommendation and
Search of ACM TOIS on March 27, 2022 and accepted on June 6 | null | 10.1145/3547333 | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recommender systems are an essential tool to relieve the information overload
challenge and play an important role in people's daily lives. Since
recommendations involve allocations of social resources (e.g., job
recommendation), an important issue is whether recommendations are fair. Unfair
recommendations are not o... | [
{
"created": "Wed, 8 Jun 2022 09:15:08 GMT",
"version": "v1"
},
{
"created": "Sun, 19 Jun 2022 16:14:06 GMT",
"version": "v2"
}
] | 2022-07-12 | [
[
"Wang",
"Yifan",
""
],
[
"Ma",
"Weizhi",
""
],
[
"Zhang",
"Min",
""
],
[
"Liu",
"Yiqun",
""
],
[
"Ma",
"Shaoping",
""
]
] | Recommender systems are an essential tool to relieve the information overload challenge and play an important role in people's daily lives. Since recommendations involve allocations of social resources (e.g., job recommendation), an important issue is whether recommendations are fair. Unfair recommendations are not onl... |
1402.5078 | Kri\v{s}j\=anis Pr\=usis | Andris Ambainis and Kri\v{s}j\=anis Pr\=usis | A Tight Lower Bound on Certificate Complexity in Terms of Block
Sensitivity and Sensitivity | 12 pages | null | 10.1007/978-3-662-44465-8_4 | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sensitivity, certificate complexity and block sensitivity are widely used
Boolean function complexity measures. A longstanding open problem, proposed by
Nisan and Szegedy, is whether sensitivity and block sensitivity are
polynomially related. Motivated by the constructions of functions which achieve
the largest known... | [
{
"created": "Thu, 20 Feb 2014 17:16:23 GMT",
"version": "v1"
},
{
"created": "Thu, 31 Jul 2014 11:55:55 GMT",
"version": "v2"
}
] | 2015-03-27 | [
[
"Ambainis",
"Andris",
""
],
[
"Prūsis",
"Krišjānis",
""
]
] | Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding open problem, proposed by Nisan and Szegedy, is whether sensitivity and block sensitivity are polynomially related. Motivated by the constructions of functions which achieve the largest known s... |
2109.06853 | Naoya Inoue | Naoya Inoue, Harsh Trivedi, Steven Sinha, Niranjan Balasubramanian and
Kentaro Inui | Summarize-then-Answer: Generating Concise Explanations for Multi-hop
Reading Comprehension | Accepted to EMNLP2021 Long Paper (Main Track) | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | How can we generate concise explanations for multi-hop Reading Comprehension
(RC)? The current strategies of identifying supporting sentences can be seen as
an extractive question-focused summarization of the input text. However, these
extractive explanations are not necessarily concise i.e. not minimally
sufficient ... | [
{
"created": "Tue, 14 Sep 2021 17:44:34 GMT",
"version": "v1"
}
] | 2021-09-15 | [
[
"Inoue",
"Naoya",
""
],
[
"Trivedi",
"Harsh",
""
],
[
"Sinha",
"Steven",
""
],
[
"Balasubramanian",
"Niranjan",
""
],
[
"Inui",
"Kentaro",
""
]
] | How can we generate concise explanations for multi-hop Reading Comprehension (RC)? The current strategies of identifying supporting sentences can be seen as an extractive question-focused summarization of the input text. However, these extractive explanations are not necessarily concise i.e. not minimally sufficient fo... |
2102.00321 | Orestis Papadigenopoulos | Orestis Papadigenopoulos and Constantine Caramanis | Recurrent Submodular Welfare and Matroid Blocking Bandits | Corrected Remark 3.2 | null | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A recent line of research focuses on the study of the stochastic multi-armed
bandits problem (MAB), in the case where temporal correlations of specific
structure are imposed between the player's actions and the reward distributions
of the arms (Kleinberg and Immorlica [FOCS18], Basu et al. [NeurIPS19]). As
opposed to... | [
{
"created": "Sat, 30 Jan 2021 21:51:47 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Feb 2021 06:30:35 GMT",
"version": "v2"
},
{
"created": "Sun, 28 Feb 2021 03:34:19 GMT",
"version": "v3"
}
] | 2021-03-02 | [
[
"Papadigenopoulos",
"Orestis",
""
],
[
"Caramanis",
"Constantine",
""
]
] | A recent line of research focuses on the study of the stochastic multi-armed bandits problem (MAB), in the case where temporal correlations of specific structure are imposed between the player's actions and the reward distributions of the arms (Kleinberg and Immorlica [FOCS18], Basu et al. [NeurIPS19]). As opposed to t... |
2404.05587 | Wolfgang Otto | Wolfgang Otto, Sharmila Upadhyaya, Stefan Dietze | Enhancing Software-Related Information Extraction via Single-Choice
Question Answering with Large Language Models | Accepted at: 1st Workshop on Natural Scientific Language Processing
and Research Knowledge Graphs (NSLP 2024) Co-located with Extended Semantic
Web Conference (ESWC 2024) | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | This paper describes our participation in the Shared Task on Software
Mentions Disambiguation (SOMD), with a focus on improving relation extraction
in scholarly texts through generative Large Language Models (LLMs) using
single-choice question-answering. The methodology prioritises the use of
in-context learning capa... | [
{
"created": "Mon, 8 Apr 2024 15:00:36 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Apr 2024 23:19:17 GMT",
"version": "v2"
}
] | 2024-04-23 | [
[
"Otto",
"Wolfgang",
""
],
[
"Upadhyaya",
"Sharmila",
""
],
[
"Dietze",
"Stefan",
""
]
] | This paper describes our participation in the Shared Task on Software Mentions Disambiguation (SOMD), with a focus on improving relation extraction in scholarly texts through generative Large Language Models (LLMs) using single-choice question-answering. The methodology prioritises the use of in-context learning capabi... |
1909.00440 | Abir De | Abir De, Adish Singla, Utkarsh Upadhyay, Manuel Gomez-Rodriguez | Can A User Anticipate What Her Followers Want? | Fixed some typos | null | null | null | cs.SI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Whenever a social media user decides to share a story, she is typically
pleased to receive likes, comments, shares, or, more generally, feedback from
her followers. As a result, she may feel compelled to use the feedback she
receives to (re-)estimate her followers' preferences and decides which stories
to share next ... | [
{
"created": "Sun, 1 Sep 2019 18:19:51 GMT",
"version": "v1"
},
{
"created": "Thu, 19 Sep 2019 12:28:39 GMT",
"version": "v2"
}
] | 2019-09-20 | [
[
"De",
"Abir",
""
],
[
"Singla",
"Adish",
""
],
[
"Upadhyay",
"Utkarsh",
""
],
[
"Gomez-Rodriguez",
"Manuel",
""
]
] | Whenever a social media user decides to share a story, she is typically pleased to receive likes, comments, shares, or, more generally, feedback from her followers. As a result, she may feel compelled to use the feedback she receives to (re-)estimate her followers' preferences and decides which stories to share next to... |
2011.03659 | Jingnan Shi | Jingnan Shi, Heng Yang, Luca Carlone | ROBIN: a Graph-Theoretic Approach to Reject Outliers in Robust
Estimation using Invariants | null | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many estimation problems in robotics, computer vision, and learning require
estimating unknown quantities in the face of outliers. Outliers are typically
the result of incorrect data association or feature matching, and it is common
to have problems where more than 90% of the measurements used for estimation
are outl... | [
{
"created": "Sat, 7 Nov 2020 02:09:33 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Mar 2021 20:02:00 GMT",
"version": "v2"
}
] | 2021-03-25 | [
[
"Shi",
"Jingnan",
""
],
[
"Yang",
"Heng",
""
],
[
"Carlone",
"Luca",
""
]
] | Many estimation problems in robotics, computer vision, and learning require estimating unknown quantities in the face of outliers. Outliers are typically the result of incorrect data association or feature matching, and it is common to have problems where more than 90% of the measurements used for estimation are outlie... |
1609.01755 | Ulf R\"uegg | Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf R\"uegg, and
Reinhard von Hanxleden | Compact Layered Drawings of General Directed Graphs | Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016) | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of layering general directed graphs under height and
possibly also width constraints. Given a directed graph G = (V,A) and a maximal
height, we propose a layering approach that minimizes a weighted sum of the
number of reversed arcs, the arc lengths, and the width of the drawing. We call
this ... | [
{
"created": "Mon, 29 Aug 2016 22:09:37 GMT",
"version": "v1"
}
] | 2016-09-08 | [
[
"Jabrayilov",
"Adalat",
""
],
[
"Mallach",
"Sven",
""
],
[
"Mutzel",
"Petra",
""
],
[
"Rüegg",
"Ulf",
""
],
[
"von Hanxleden",
"Reinhard",
""
]
] | We consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a layering approach that minimizes a weighted sum of the number of reversed arcs, the arc lengths, and the width of the drawing. We call this th... |
2204.09009 | Ishay Haviv | Ishay Haviv | Fixed-Parameter Algorithms for the Kneser and Schrijver Problems | 31 pages. This paper includes and extends the content of
arXiv:2204.06761 | null | null | null | cs.DS math.CO | http://creativecommons.org/licenses/by/4.0/ | The Kneser graph $K(n,k)$ is defined for integers $n$ and $k$ with $n \geq
2k$ as the graph whose vertices are all the $k$-subsets of
$[n]=\{1,2,\ldots,n\}$ where two such sets are adjacent if they are disjoint.
The Schrijver graph $S(n,k)$ is defined as the subgraph of $K(n,k)$ induced by
the collection of all $k$-s... | [
{
"created": "Tue, 19 Apr 2022 17:09:01 GMT",
"version": "v1"
},
{
"created": "Sun, 1 May 2022 06:49:00 GMT",
"version": "v2"
},
{
"created": "Tue, 13 Feb 2024 08:11:56 GMT",
"version": "v3"
}
] | 2024-02-14 | [
[
"Haviv",
"Ishay",
""
]
] | The Kneser graph $K(n,k)$ is defined for integers $n$ and $k$ with $n \geq 2k$ as the graph whose vertices are all the $k$-subsets of $[n]=\{1,2,\ldots,n\}$ where two such sets are adjacent if they are disjoint. The Schrijver graph $S(n,k)$ is defined as the subgraph of $K(n,k)$ induced by the collection of all $k$-sub... |
2402.09872 | Arman Isajanyan | Arman Isajanyan, Artur Shatveryan, David Kocharyan, Zhangyang Wang,
Humphrey Shi | Social Reward: Evaluating and Enhancing Generative AI through
Million-User Feedback from an Online Creative Community | 16 pages with 10 figures, accepted at ICLR 2024 as a spotlight, codes
can be accessed at https://github.com/Picsart-AI-Research/Social-Reward | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Social reward as a form of community recognition provides a strong source of
motivation for users of online platforms to engage and contribute with content.
The recent progress of text-conditioned image synthesis has ushered in a
collaborative era where AI empowers users to craft original visual artworks
seeking comm... | [
{
"created": "Thu, 15 Feb 2024 10:56:31 GMT",
"version": "v1"
}
] | 2024-02-16 | [
[
"Isajanyan",
"Arman",
""
],
[
"Shatveryan",
"Artur",
""
],
[
"Kocharyan",
"David",
""
],
[
"Wang",
"Zhangyang",
""
],
[
"Shi",
"Humphrey",
""
]
] | Social reward as a form of community recognition provides a strong source of motivation for users of online platforms to engage and contribute with content. The recent progress of text-conditioned image synthesis has ushered in a collaborative era where AI empowers users to craft original visual artworks seeking commun... |
2108.11903 | Grischa Liebel | Rodi Jolak and Andreas Wortmann and Grischa Liebel and Eric Umuhoza
and Michel R.V. Chaudron | Design Thinking and Creativity of Co-located vs. Globally Distributed
Software Developers | This is a pre-peer-review version of an article published in Wiley
Journal of Software: Evolution and Process. The final version is available
via https://dx.doi.org/10.1002/smr.2377 | null | 10.1002/smr.2377 | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Context: Designing software is an activity in which software developers think
and make design decisions that shape the structure and behavior of software
products. Designing software is one of the least understood software
engineering activities. In a collaborative design setting, various types of
distances can lead ... | [
{
"created": "Thu, 26 Aug 2021 16:50:31 GMT",
"version": "v1"
}
] | 2021-08-27 | [
[
"Jolak",
"Rodi",
""
],
[
"Wortmann",
"Andreas",
""
],
[
"Liebel",
"Grischa",
""
],
[
"Umuhoza",
"Eric",
""
],
[
"Chaudron",
"Michel R. V.",
""
]
] | Context: Designing software is an activity in which software developers think and make design decisions that shape the structure and behavior of software products. Designing software is one of the least understood software engineering activities. In a collaborative design setting, various types of distances can lead to... |
2401.13150 | Onur Cankur | Onur Cankur, Aditya Tomar, Daniel Nichols, Connor Scully-Allison,
Katherine E. Isaacs, Abhinav Bhatele | Automated Programmatic Performance Analysis of Parallel Programs | null | null | null | null | cs.DC cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Developing efficient parallel applications is critical to advancing
scientific development but requires significant performance analysis and
optimization. Performance analysis tools help developers manage the increasing
complexity and scale of performance data, but often rely on the user to
manually explore low-level... | [
{
"created": "Tue, 23 Jan 2024 23:52:48 GMT",
"version": "v1"
}
] | 2024-01-25 | [
[
"Cankur",
"Onur",
""
],
[
"Tomar",
"Aditya",
""
],
[
"Nichols",
"Daniel",
""
],
[
"Scully-Allison",
"Connor",
""
],
[
"Isaacs",
"Katherine E.",
""
],
[
"Bhatele",
"Abhinav",
""
]
] | Developing efficient parallel applications is critical to advancing scientific development but requires significant performance analysis and optimization. Performance analysis tools help developers manage the increasing complexity and scale of performance data, but often rely on the user to manually explore low-level d... |
2207.12909 | Zerui Chen | Zerui Chen, Yana Hasson, Cordelia Schmid, Ivan Laptev | AlignSDF: Pose-Aligned Signed Distance Fields for Hand-Object
Reconstruction | Accepted by ECCV 2022. Project Page:
https://zerchen.github.io/projects/alignsdf.html | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work achieved impressive progress towards joint reconstruction of
hands and manipulated objects from monocular color images. Existing methods
focus on two alternative representations in terms of either parametric meshes
or signed distance fields (SDFs). On one side, parametric models can benefit
from prior kno... | [
{
"created": "Tue, 26 Jul 2022 13:58:59 GMT",
"version": "v1"
}
] | 2022-07-27 | [
[
"Chen",
"Zerui",
""
],
[
"Hasson",
"Yana",
""
],
[
"Schmid",
"Cordelia",
""
],
[
"Laptev",
"Ivan",
""
]
] | Recent work achieved impressive progress towards joint reconstruction of hands and manipulated objects from monocular color images. Existing methods focus on two alternative representations in terms of either parametric meshes or signed distance fields (SDFs). On one side, parametric models can benefit from prior knowl... |
2403.07376 | Bingqian Lin | Bingqian Lin, Yunshuang Nie, Ziming Wei, Jiaqi Chen, Shikui Ma,
Jianhua Han, Hang Xu, Xiaojun Chang, Xiaodan Liang | NavCoT: Boosting LLM-Based Vision-and-Language Navigation via Learning
Disentangled Reasoning | null | null | null | null | cs.CV cs.AI cs.CL cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vision-and-Language Navigation (VLN), as a crucial research problem of
Embodied AI, requires an embodied agent to navigate through complex 3D
environments following natural language instructions. Recent research has
highlighted the promising capacity of large language models (LLMs) in VLN by
improving navigational re... | [
{
"created": "Tue, 12 Mar 2024 07:27:02 GMT",
"version": "v1"
}
] | 2024-03-13 | [
[
"Lin",
"Bingqian",
""
],
[
"Nie",
"Yunshuang",
""
],
[
"Wei",
"Ziming",
""
],
[
"Chen",
"Jiaqi",
""
],
[
"Ma",
"Shikui",
""
],
[
"Han",
"Jianhua",
""
],
[
"Xu",
"Hang",
""
],
[
"Chang",
"Xiaojun... | Vision-and-Language Navigation (VLN), as a crucial research problem of Embodied AI, requires an embodied agent to navigate through complex 3D environments following natural language instructions. Recent research has highlighted the promising capacity of large language models (LLMs) in VLN by improving navigational reas... |
2309.08638 | Rajan Vivek | Rajan Vivek, Kawin Ethayarajh, Diyi Yang, Douwe Kiela | Anchor Points: Benchmarking Models with Much Fewer Examples | Accepted to EACL 2024 Main Conference. Code will be released at:
https://github.com/rvivek3/AnchorPoints | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern language models often exhibit powerful but brittle behavior, leading
to the development of larger and more diverse benchmarks to reliably assess
their behavior. Here, we suggest that model performance can be benchmarked and
elucidated with much smaller evaluation sets. We first show that in six popular
languag... | [
{
"created": "Thu, 14 Sep 2023 17:45:51 GMT",
"version": "v1"
},
{
"created": "Sun, 18 Feb 2024 21:37:47 GMT",
"version": "v2"
}
] | 2024-02-20 | [
[
"Vivek",
"Rajan",
""
],
[
"Ethayarajh",
"Kawin",
""
],
[
"Yang",
"Diyi",
""
],
[
"Kiela",
"Douwe",
""
]
] | Modern language models often exhibit powerful but brittle behavior, leading to the development of larger and more diverse benchmarks to reliably assess their behavior. Here, we suggest that model performance can be benchmarked and elucidated with much smaller evaluation sets. We first show that in six popular language ... |
2112.13974 | Akansha Singh Bansal | Akansha Singh Bansal, Trapit Bansal, David Irwin | A Moment in the Sun: Solar Nowcasting from Multispectral Satellite Data
using Self-Supervised Learning | 18 pages | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | Solar energy is now the cheapest form of electricity in history.
Unfortunately, significantly increasing the grid's fraction of solar energy
remains challenging due to its variability, which makes balancing electricity's
supply and demand more difficult. While thermal generators' ramp rate -- the
maximum rate that th... | [
{
"created": "Tue, 28 Dec 2021 03:13:44 GMT",
"version": "v1"
}
] | 2021-12-30 | [
[
"Bansal",
"Akansha Singh",
""
],
[
"Bansal",
"Trapit",
""
],
[
"Irwin",
"David",
""
]
] | Solar energy is now the cheapest form of electricity in history. Unfortunately, significantly increasing the grid's fraction of solar energy remains challenging due to its variability, which makes balancing electricity's supply and demand more difficult. While thermal generators' ramp rate -- the maximum rate that they... |
2101.08918 | Tianming Feng | Tianming Feng, Shuo Shi, Shushi Gu, Ning Zhang, Wei Xiang, and Xuemai
Gu | Performance Analysis for Cache-enabled Cellular Networks with
Cooperative Transmission | arXiv admin note: text overlap with arXiv:2101.08669 | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The large amount of deployed smart devices put tremendous traffic pressure on
networks. Caching at the edge has been widely studied as a promising technique
to solve this problem. To further improve the successful transmission
probability (STP) of cache-enabled cellular networks (CEN), we combine the
cooperative tran... | [
{
"created": "Fri, 22 Jan 2021 02:00:06 GMT",
"version": "v1"
}
] | 2021-01-25 | [
[
"Feng",
"Tianming",
""
],
[
"Shi",
"Shuo",
""
],
[
"Gu",
"Shushi",
""
],
[
"Zhang",
"Ning",
""
],
[
"Xiang",
"Wei",
""
],
[
"Gu",
"Xuemai",
""
]
] | The large amount of deployed smart devices put tremendous traffic pressure on networks. Caching at the edge has been widely studied as a promising technique to solve this problem. To further improve the successful transmission probability (STP) of cache-enabled cellular networks (CEN), we combine the cooperative transm... |
2203.03704 | Jeff Delaune | Jeff Delaune, Jacob Izraelevitz, Samuel Sirlin, David Sternberg, Louis
Giersch, L. Phillipe Tosi, Evgeniy Skliyanskiy, Larry Young, Michael Mischna,
Shannah Withrow-Maser, Juergen Mueller, Joshua Bowman, Mark S Wallace, Havard
F. Grip, Larry Matthies, Wayne Johnson, Matthew Keennon, Benjamin Pipenberg,
Harsh Pa... | Mid-Air Helicopter Delivery at Mars Using a Jetpack | Accepted in 2022 IEEE Aerospace Conference | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mid-Air Helicopter Delivery (MAHD) is a new Entry, Descent and Landing (EDL)
architecture to enable in situ mobility for Mars science at lower cost than
previous missions. It uses a jetpack to slow down a Mars Science Helicopter
(MSH) after separation from the backshell, and reach aerodynamic conditions
suitable for ... | [
{
"created": "Mon, 7 Mar 2022 21:07:56 GMT",
"version": "v1"
}
] | 2022-03-09 | [
[
"Delaune",
"Jeff",
"",
"Bob"
],
[
"Izraelevitz",
"Jacob",
"",
"Bob"
],
[
"Sirlin",
"Samuel",
"",
"Bob"
],
[
"Sternberg",
"David",
"",
"Bob"
],
[
"Giersch",
"Louis",
"",
"Bob"
],
[
"Tosi",
"L. Phillipe",
... | Mid-Air Helicopter Delivery (MAHD) is a new Entry, Descent and Landing (EDL) architecture to enable in situ mobility for Mars science at lower cost than previous missions. It uses a jetpack to slow down a Mars Science Helicopter (MSH) after separation from the backshell, and reach aerodynamic conditions suitable for he... |
2211.11344 | Jakub Tetek | Shyam Narayanan, Jakub T\v{e}tek | Estimating the Effective Support Size in Constant Query Complexity | null | null | null | null | cs.DS math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Estimating the support size of a distribution is a well-studied problem in
statistics. Motivated by the fact that this problem is highly non-robust (as
small perturbations in the distributions can drastically affect the support
size) and thus hard to estimate, Goldreich [ECCC 2019] studied the query
complexity of est... | [
{
"created": "Mon, 21 Nov 2022 10:49:32 GMT",
"version": "v1"
}
] | 2022-11-22 | [
[
"Narayanan",
"Shyam",
""
],
[
"Tětek",
"Jakub",
""
]
] | Estimating the support size of a distribution is a well-studied problem in statistics. Motivated by the fact that this problem is highly non-robust (as small perturbations in the distributions can drastically affect the support size) and thus hard to estimate, Goldreich [ECCC 2019] studied the query complexity of estim... |
1901.10237 | Hai Duong Nguyen | Hai-Duong Nguyen, Soo-Hyung Kim | Automatic Whole-body Bone Age Assessment Using Deep Hierarchical
Features | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bone age assessment gives us evidence to analyze the children growth status
and the rejuvenation involved chronological and biological ages. All the
previous works consider left-hand X-ray image of a child in their works. In
this paper, we carry out a study on estimating human age using whole-body bone
CT images and ... | [
{
"created": "Tue, 29 Jan 2019 11:53:30 GMT",
"version": "v1"
}
] | 2019-01-30 | [
[
"Nguyen",
"Hai-Duong",
""
],
[
"Kim",
"Soo-Hyung",
""
]
] | Bone age assessment gives us evidence to analyze the children growth status and the rejuvenation involved chronological and biological ages. All the previous works consider left-hand X-ray image of a child in their works. In this paper, we carry out a study on estimating human age using whole-body bone CT images and a ... |
2405.10098 | Sen Huang | Sen Huang, Kaixiang Yang, Sheng Qi, Rui Wang | When Large Language Model Meets Optimization | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optimization algorithms and large language models (LLMs) enhance
decision-making in dynamic environments by integrating artificial intelligence
with traditional techniques. LLMs, with extensive domain knowledge, facilitate
intelligent modeling and strategic decision-making in optimization, while
optimization algorith... | [
{
"created": "Thu, 16 May 2024 13:54:37 GMT",
"version": "v1"
}
] | 2024-05-17 | [
[
"Huang",
"Sen",
""
],
[
"Yang",
"Kaixiang",
""
],
[
"Qi",
"Sheng",
""
],
[
"Wang",
"Rui",
""
]
] | Optimization algorithms and large language models (LLMs) enhance decision-making in dynamic environments by integrating artificial intelligence with traditional techniques. LLMs, with extensive domain knowledge, facilitate intelligent modeling and strategic decision-making in optimization, while optimization algorithms... |
1504.01802 | Morteza Hashemi | Morteza Hashemi, Yuval Cassuto, Ari Trachtenberg | Fountain Codes with Nonuniform Selection Distributions through Feedback | Submitted to the IEEE Transactions on Information Theory | null | 10.1109/TIT.2016.2570232 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One key requirement for fountain (rateless) coding schemes is to achieve a
high intermediate symbol recovery rate. Recent coding schemes have incorporated
the use of a feedback channel to improve intermediate performance of
traditional rateless codes; however, these codes with feedback are designed
based on uniformly... | [
{
"created": "Wed, 8 Apr 2015 02:11:09 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Hashemi",
"Morteza",
""
],
[
"Cassuto",
"Yuval",
""
],
[
"Trachtenberg",
"Ari",
""
]
] | One key requirement for fountain (rateless) coding schemes is to achieve a high intermediate symbol recovery rate. Recent coding schemes have incorporated the use of a feedback channel to improve intermediate performance of traditional rateless codes; however, these codes with feedback are designed based on uniformly a... |
1708.08844 | Jan Czarnowski | Jan Czarnowski, Stefan Leutenegger, Andrew Davison | Semantic Texture for Robust Dense Tracking | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We argue that robust dense SLAM systems can make valuable use of the layers
of features coming from a standard CNN as a pyramid of `semantic texture' which
is suitable for dense alignment while being much more robust to nuisance
factors such as lighting than raw RGB values. We use a straightforward
Lucas-Kanade formu... | [
{
"created": "Tue, 29 Aug 2017 15:58:18 GMT",
"version": "v1"
}
] | 2017-08-30 | [
[
"Czarnowski",
"Jan",
""
],
[
"Leutenegger",
"Stefan",
""
],
[
"Davison",
"Andrew",
""
]
] | We argue that robust dense SLAM systems can make valuable use of the layers of features coming from a standard CNN as a pyramid of `semantic texture' which is suitable for dense alignment while being much more robust to nuisance factors such as lighting than raw RGB values. We use a straightforward Lucas-Kanade formula... |
2312.10029 | Zachary Kenton | Sebastian Farquhar, Vikrant Varma, Zachary Kenton, Johannes Gasteiger,
Vladimir Mikulik, Rohin Shah | Challenges with unsupervised LLM knowledge discovery | 12 pages (38 including references and appendices). First three
authors equal contribution, randomised order | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that existing unsupervised methods on large language model (LLM)
activations do not discover knowledge -- instead they seem to discover whatever
feature of the activations is most prominent. The idea behind unsupervised
knowledge elicitation is that knowledge satisfies a consistency structure,
which can be us... | [
{
"created": "Fri, 15 Dec 2023 18:49:43 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Dec 2023 16:43:35 GMT",
"version": "v2"
}
] | 2023-12-19 | [
[
"Farquhar",
"Sebastian",
""
],
[
"Varma",
"Vikrant",
""
],
[
"Kenton",
"Zachary",
""
],
[
"Gasteiger",
"Johannes",
""
],
[
"Mikulik",
"Vladimir",
""
],
[
"Shah",
"Rohin",
""
]
] | We show that existing unsupervised methods on large language model (LLM) activations do not discover knowledge -- instead they seem to discover whatever feature of the activations is most prominent. The idea behind unsupervised knowledge elicitation is that knowledge satisfies a consistency structure, which can be used... |
1604.07153 | Kim-Manuel Klein | Klaus Jansen, Kim-Manuel Klein, Jos\'e Verschae | Closing the Gap for Makespan Scheduling via Sparsification Techniques | 20 pages, ICALP 2016 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Makespan scheduling on identical machines is one of the most basic and
fundamental packing problems studied in the discrete optimization literature.
It asks for an assignment of $n$ jobs to a set of $m$ identical machines that
minimizes the makespan. The problem is strongly NP-hard, and thus we do not
expect a $(1+\e... | [
{
"created": "Mon, 25 Apr 2016 07:47:34 GMT",
"version": "v1"
}
] | 2016-04-26 | [
[
"Jansen",
"Klaus",
""
],
[
"Klein",
"Kim-Manuel",
""
],
[
"Verschae",
"José",
""
]
] | Makespan scheduling on identical machines is one of the most basic and fundamental packing problems studied in the discrete optimization literature. It asks for an assignment of $n$ jobs to a set of $m$ identical machines that minimizes the makespan. The problem is strongly NP-hard, and thus we do not expect a $(1+\eps... |
1812.03953 | Hadi Abdi Khojasteh | Hadi Abdi Khojasteh, Alireza Abbas Alipour, Ebrahim Ansari and Parvin
Razzaghi | An Intelligent Safety System for Human-Centered Semi-Autonomous Vehicles | 15 pages and 5 figures, Submitted to the international conference on
Contemporary issues in Data Science (CiDaS 2019), Learn more about this
project at https://iasbs.ac.ir/~ansari/faraz | Nature Switzerland AG - Springer LNDECT 45(2020) 322-336 | 10.1007/978-3-030-37309-2_26 | null | cs.CV cs.LG cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nowadays, automobile manufacturers make efforts to develop ways to make cars
fully safe. Monitoring driver's actions by computer vision techniques to detect
driving mistakes in real-time and then planning for autonomous driving to avoid
vehicle collisions is one of the most important issues that has been
investigated... | [
{
"created": "Mon, 10 Dec 2018 18:08:18 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Feb 2019 22:57:02 GMT",
"version": "v2"
}
] | 2020-02-28 | [
[
"Khojasteh",
"Hadi Abdi",
""
],
[
"Alipour",
"Alireza Abbas",
""
],
[
"Ansari",
"Ebrahim",
""
],
[
"Razzaghi",
"Parvin",
""
]
] | Nowadays, automobile manufacturers make efforts to develop ways to make cars fully safe. Monitoring driver's actions by computer vision techniques to detect driving mistakes in real-time and then planning for autonomous driving to avoid vehicle collisions is one of the most important issues that has been investigated i... |
2011.10278 | Junho Koh | Junho Koh, Jaekyum Kim, Younji Shin, Byeongwon Lee, Seungji Yang and
Jun Won Choi | Joint Representation of Temporal Image Sequences and Object Motion for
Video Object Detection | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In this paper, we propose a new video object detector (VoD) method referred
to as temporal feature aggregation and motion-aware VoD (TM-VoD), which
produces a joint representation of temporal image sequences and object motion.
The proposed TM-VoD aggregates visual feature maps extracted by convolutional
neural networ... | [
{
"created": "Fri, 20 Nov 2020 08:46:12 GMT",
"version": "v1"
}
] | 2020-11-23 | [
[
"Koh",
"Junho",
""
],
[
"Kim",
"Jaekyum",
""
],
[
"Shin",
"Younji",
""
],
[
"Lee",
"Byeongwon",
""
],
[
"Yang",
"Seungji",
""
],
[
"Choi",
"Jun Won",
""
]
] | In this paper, we propose a new video object detector (VoD) method referred to as temporal feature aggregation and motion-aware VoD (TM-VoD), which produces a joint representation of temporal image sequences and object motion. The proposed TM-VoD aggregates visual feature maps extracted by convolutional neural networks... |
2102.07344 | Ana Stanescu | Ana Stanescu and Gaurav Pandey | Developing parsimonious ensembles using predictor diversity within a
reinforcement learning framework | This work was intended as a replacement of arXiv:1805.02103 and any
subsequent updates will appear there | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Heterogeneous ensembles that can aggregate an unrestricted number and variety
of base predictors can effectively address challenging prediction problems. In
particular, accurate ensembles that are also parsimonious, i.e., consist of as
few base predictors as possible, can help reveal potentially useful knowledge
abou... | [
{
"created": "Mon, 15 Feb 2021 05:00:19 GMT",
"version": "v1"
},
{
"created": "Thu, 25 Feb 2021 23:43:42 GMT",
"version": "v2"
}
] | 2021-03-01 | [
[
"Stanescu",
"Ana",
""
],
[
"Pandey",
"Gaurav",
""
]
] | Heterogeneous ensembles that can aggregate an unrestricted number and variety of base predictors can effectively address challenging prediction problems. In particular, accurate ensembles that are also parsimonious, i.e., consist of as few base predictors as possible, can help reveal potentially useful knowledge about ... |
1910.06511 | Ling-Xiao Zhang | Lin Gao, Ling-Xiao Zhang, Hsien-Yu Meng, Yi-Hui Ren, Yu-Kun Lai, Leif
Kobbelt | PRS-Net: Planar Reflective Symmetry Detection Net for 3D Models | null | IEEE Transactions on Visualization and Computer Graphics, Volume:
27, Issue: 6, 2021 | 10.1109/TVCG.2020.3003823 | null | cs.GR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In geometry processing, symmetry is a universal type of high-level structural
information of 3D models and benefits many geometry processing tasks including
shape segmentation, alignment, matching, and completion. Thus it is an
important problem to analyze various symmetry forms of 3D shapes. Planar
reflective symmet... | [
{
"created": "Tue, 15 Oct 2019 03:46:58 GMT",
"version": "v1"
},
{
"created": "Fri, 18 Oct 2019 04:05:15 GMT",
"version": "v2"
},
{
"created": "Thu, 24 Oct 2019 06:55:05 GMT",
"version": "v3"
},
{
"created": "Sat, 16 May 2020 02:21:17 GMT",
"version": "v4"
},
{
"c... | 2021-09-15 | [
[
"Gao",
"Lin",
""
],
[
"Zhang",
"Ling-Xiao",
""
],
[
"Meng",
"Hsien-Yu",
""
],
[
"Ren",
"Yi-Hui",
""
],
[
"Lai",
"Yu-Kun",
""
],
[
"Kobbelt",
"Leif",
""
]
] | In geometry processing, symmetry is a universal type of high-level structural information of 3D models and benefits many geometry processing tasks including shape segmentation, alignment, matching, and completion. Thus it is an important problem to analyze various symmetry forms of 3D shapes. Planar reflective symmetry... |
2103.03666 | Benedikt Kleppmann | Benedikt T. Kleppmann | Tree of Knowledge: an Online Platform for Learning the Behaviour of
Complex Systems | 10 pages, 5 figures | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Many social sciences such as psychology and economics try to learn the
behaviour of complex agents such as humans, organisations and countries. The
current statistical methods used for learning this behaviour try to infer
generally valid behaviour, but can only learn from one type of study at a time.
Furthermore, onl... | [
{
"created": "Sat, 27 Feb 2021 19:39:14 GMT",
"version": "v1"
}
] | 2021-03-08 | [
[
"Kleppmann",
"Benedikt T.",
""
]
] | Many social sciences such as psychology and economics try to learn the behaviour of complex agents such as humans, organisations and countries. The current statistical methods used for learning this behaviour try to infer generally valid behaviour, but can only learn from one type of study at a time. Furthermore, only ... |
1902.10439 | Su Yang | Su Yang, Yuqing Zhang, Chensi Wu | Attack-Defense Quantification Based On Game-Theory | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the developing of the attack and defense technology, the cyber
environment has been more and more sophisticated. We failed to give an accurate
evaluation of network security situation, as we lack a more accurate
quantitative evaluation of attack-defense behaviors. In response to this
situation, we proposed an at... | [
{
"created": "Wed, 27 Feb 2019 10:28:34 GMT",
"version": "v1"
}
] | 2019-02-28 | [
[
"Yang",
"Su",
""
],
[
"Zhang",
"Yuqing",
""
],
[
"Wu",
"Chensi",
""
]
] | With the developing of the attack and defense technology, the cyber environment has been more and more sophisticated. We failed to give an accurate evaluation of network security situation, as we lack a more accurate quantitative evaluation of attack-defense behaviors. In response to this situation, we proposed an atta... |
2405.11320 | Emmanouil Maragkoudakis | Emmanouil Maragkoudakis, Symeon Papadopoulos, Iraklis Varlamis and
Christos Diou | Sampling Strategies for Mitigating Bias in Face Synthesis Methods | Accepted to the BIAS 2023 ECML-PKDD Workshop | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | Synthetically generated images can be used to create media content or to
complement datasets for training image analysis models. Several methods have
recently been proposed for the synthesis of high-fidelity face images; however,
the potential biases introduced by such methods have not been sufficiently
addressed. Th... | [
{
"created": "Sat, 18 May 2024 15:30:14 GMT",
"version": "v1"
}
] | 2024-05-21 | [
[
"Maragkoudakis",
"Emmanouil",
""
],
[
"Papadopoulos",
"Symeon",
""
],
[
"Varlamis",
"Iraklis",
""
],
[
"Diou",
"Christos",
""
]
] | Synthetically generated images can be used to create media content or to complement datasets for training image analysis models. Several methods have recently been proposed for the synthesis of high-fidelity face images; however, the potential biases introduced by such methods have not been sufficiently addressed. This... |
2205.09351 | Arnab Dey | Arnab Dey, Yassine Ahmine, Andrew I. Comport | Mip-NeRF RGB-D: Depth Assisted Fast Neural Radiance Fields | null | Journal of WSCG 2022 | 10.24132/JWSCG.2022.5 | Vol.30., No.1-2, ISSN 1213-6972 | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Neural scene representations, such as Neural Radiance Fields (NeRF), are
based on training a multilayer perceptron (MLP) using a set of color images
with known poses. An increasing number of devices now produce RGB-D(color +
depth) information, which has been shown to be very important for a wide range
of tasks. Ther... | [
{
"created": "Thu, 19 May 2022 07:11:42 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Jun 2022 11:35:53 GMT",
"version": "v2"
},
{
"created": "Mon, 7 Nov 2022 13:57:58 GMT",
"version": "v3"
}
] | 2022-11-08 | [
[
"Dey",
"Arnab",
""
],
[
"Ahmine",
"Yassine",
""
],
[
"Comport",
"Andrew I.",
""
]
] | Neural scene representations, such as Neural Radiance Fields (NeRF), are based on training a multilayer perceptron (MLP) using a set of color images with known poses. An increasing number of devices now produce RGB-D(color + depth) information, which has been shown to be very important for a wide range of tasks. Theref... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.