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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1907.12942 | Hiroki Oshima | Hiroki Oshima | Improved randomized algorithm for $k$-submodular function maximization | 22 pages,3 figures | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Submodularity is one of the most important properties in combinatorial
optimization, and $k$-submodularity is a generalization of submodularity.
Maximization of a $k$-submodular function requires an exponential number of
value oracle queries, and approximation algorithms have been studied. For
unconstrained $k$-submo... | [
{
"created": "Sat, 27 Jul 2019 06:53:37 GMT",
"version": "v1"
}
] | 2019-07-31 | [
[
"Oshima",
"Hiroki",
""
]
] | Submodularity is one of the most important properties in combinatorial optimization, and $k$-submodularity is a generalization of submodularity. Maximization of a $k$-submodular function requires an exponential number of value oracle queries, and approximation algorithms have been studied. For unconstrained $k$-submodu... |
0801.3024 | Josep Rif\`a | J. Pujol, J. Rif\'a, F. I. Solov'eva | Construction of Z4-linear Reed-Muller codes | Paper submitted to IEEE Transactions on Information Theory | null | null | null | cs.IT math.IT | null | New quaternary Plotkin constructions are given and are used to obtain new
families of quaternary codes. The parameters of the obtained codes, such as the
length, the dimension and the minimum distance are studied. Using these
constructions new families of quaternary Reed-Muller codes are built with the
peculiarity th... | [
{
"created": "Sat, 19 Jan 2008 10:14:40 GMT",
"version": "v1"
}
] | 2008-01-22 | [
[
"Pujol",
"J.",
""
],
[
"Rifá",
"J.",
""
],
[
"Solov'eva",
"F. I.",
""
]
] | New quaternary Plotkin constructions are given and are used to obtain new families of quaternary codes. The parameters of the obtained codes, such as the length, the dimension and the minimum distance are studied. Using these constructions new families of quaternary Reed-Muller codes are built with the peculiarity that... |
1402.4067 | Santiago Aja-Fernandez | Santiago Aja-Fernandez, Gonzalo Vegas-Sanchez-Ferrero, Antonio
Trsitan-Vega | Statistical Noise Analysis in SENSE Parallel MRI | null | null | null | TECH-LPI2012-01. V2.0 | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A complete first and second order statistical characterization of noise in
SENSE reconstructed data is proposed. SENSE acquisitions have usually been
modeled as Rician distributed, since the data reconstruction takes place into
the spatial domain, where Gaussian noise is assumed. However, this model just
holds for th... | [
{
"created": "Mon, 17 Feb 2014 17:16:21 GMT",
"version": "v1"
}
] | 2014-02-18 | [
[
"Aja-Fernandez",
"Santiago",
""
],
[
"Vegas-Sanchez-Ferrero",
"Gonzalo",
""
],
[
"Trsitan-Vega",
"Antonio",
""
]
] | A complete first and second order statistical characterization of noise in SENSE reconstructed data is proposed. SENSE acquisitions have usually been modeled as Rician distributed, since the data reconstruction takes place into the spatial domain, where Gaussian noise is assumed. However, this model just holds for the ... |
2011.00230 | Jin-Yuan Wang | Jin-Yuan Wang, Xian-Tao Fu, Rong-Rong Lu, Jun-Bo Wang, Min Lin, and
Julian Cheng | Tight Capacity Bounds for Indoor Visible Light Communications With
Signal-Dependent Noise | 32 pages, 9 figures, accepted by IEEE Transactions on Wireless
Communications, 2020 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Channel capacity bounds are derived for a point-to-point indoor visible light
communications (VLC) system with signal-dependent Gaussian noise. Considering
both illumination and communication, the non-negative input of VLC is
constrained by peak and average optical intensity constraints. Two scenarios
are taken into ... | [
{
"created": "Sat, 31 Oct 2020 10:18:46 GMT",
"version": "v1"
}
] | 2020-11-03 | [
[
"Wang",
"Jin-Yuan",
""
],
[
"Fu",
"Xian-Tao",
""
],
[
"Lu",
"Rong-Rong",
""
],
[
"Wang",
"Jun-Bo",
""
],
[
"Lin",
"Min",
""
],
[
"Cheng",
"Julian",
""
]
] | Channel capacity bounds are derived for a point-to-point indoor visible light communications (VLC) system with signal-dependent Gaussian noise. Considering both illumination and communication, the non-negative input of VLC is constrained by peak and average optical intensity constraints. Two scenarios are taken into ac... |
2403.07911 | Alison Callahan | Alison Callahan, Duncan McElfresh, Juan M. Banda, Gabrielle Bunney,
Danton Char, Jonathan Chen, Conor K. Corbin, Debadutta Dash, Norman L.
Downing, Sneha S. Jain, Nikesh Kotecha, Jonathan Masterson, Michelle M.
Mello, Keith Morse, Srikar Nallan, Abby Pandya, Anurang Revri, Aditya Sharma,
Christopher Sharp, Rahu... | Standing on FURM ground -- A framework for evaluating Fair, Useful, and
Reliable AI Models in healthcare systems | null | null | null | null | cs.CY cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The impact of using artificial intelligence (AI) to guide patient care or
operational processes is an interplay of the AI model's output, the
decision-making protocol based on that output, and the capacity of the
stakeholders involved to take the necessary subsequent action. Estimating the
effects of this interplay b... | [
{
"created": "Tue, 27 Feb 2024 03:33:40 GMT",
"version": "v1"
},
{
"created": "Thu, 14 Mar 2024 18:37:53 GMT",
"version": "v2"
}
] | 2024-03-18 | [
[
"Callahan",
"Alison",
""
],
[
"McElfresh",
"Duncan",
""
],
[
"Banda",
"Juan M.",
""
],
[
"Bunney",
"Gabrielle",
""
],
[
"Char",
"Danton",
""
],
[
"Chen",
"Jonathan",
""
],
[
"Corbin",
"Conor K.",
""
],
... | The impact of using artificial intelligence (AI) to guide patient care or operational processes is an interplay of the AI model's output, the decision-making protocol based on that output, and the capacity of the stakeholders involved to take the necessary subsequent action. Estimating the effects of this interplay bef... |
1812.08257 | Luis Pablo Borja Rosales | T.C. Wesselink, P. Borja, and J.M.A. Scherpen | Saturated control without velocity measurements for planar robots with
flexible joints | 9 figures, 3 tables. A short version of this paper was presented at
the 58th Conference on Decision and Control (2019) | null | 10.1109/CDC40024.2019.9029741 | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we propose a passivity-based controller that addresses the
problem of set point regulation for planar robots with two links and flexible
joints. Moreover, the controller is saturated and does not require velocity
measurements. Additionally, we present experiments that corroborate the
theoretical results... | [
{
"created": "Wed, 19 Dec 2018 21:36:34 GMT",
"version": "v1"
},
{
"created": "Sat, 21 Nov 2020 23:49:45 GMT",
"version": "v2"
}
] | 2020-11-24 | [
[
"Wesselink",
"T. C.",
""
],
[
"Borja",
"P.",
""
],
[
"Scherpen",
"J. M. A.",
""
]
] | In this work, we propose a passivity-based controller that addresses the problem of set point regulation for planar robots with two links and flexible joints. Moreover, the controller is saturated and does not require velocity measurements. Additionally, we present experiments that corroborate the theoretical results o... |
1708.07180 | Giorgos Borboudakis | Ioannis Tsamardinos, Elissavet Greasidou, Michalis Tsagris and Giorgos
Borboudakis | Bootstrapping the Out-of-sample Predictions for Efficient and Accurate
Cross-Validation | Added acknowledgments | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cross-Validation (CV), and out-of-sample performance-estimation protocols in
general, are often employed both for (a) selecting the optimal combination of
algorithms and values of hyper-parameters (called a configuration) for
producing the final predictive model, and (b) estimating the predictive
performance of the f... | [
{
"created": "Wed, 23 Aug 2017 20:30:07 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Aug 2017 14:02:02 GMT",
"version": "v2"
}
] | 2017-08-28 | [
[
"Tsamardinos",
"Ioannis",
""
],
[
"Greasidou",
"Elissavet",
""
],
[
"Tsagris",
"Michalis",
""
],
[
"Borboudakis",
"Giorgos",
""
]
] | Cross-Validation (CV), and out-of-sample performance-estimation protocols in general, are often employed both for (a) selecting the optimal combination of algorithms and values of hyper-parameters (called a configuration) for producing the final predictive model, and (b) estimating the predictive performance of the fin... |
2405.10183 | Matthew Andres Moreno | Matthew Andres Moreno and Anika Ranjan and Emily Dolson and Luis Zaman | A Guide to Tracking Phylogenies in Parallel and Distributed Agent-based
Evolution Models | null | null | null | null | cs.NE q-bio.PE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computer simulations are an important tool for studying the mechanics of
biological evolution. In particular, in silico work with agent-based models
provides an opportunity to collect high-quality records of ancestry
relationships among simulated agents. Such phylogenies can provide insight into
evolutionary dynamics... | [
{
"created": "Thu, 16 May 2024 15:27:51 GMT",
"version": "v1"
}
] | 2024-05-17 | [
[
"Moreno",
"Matthew Andres",
""
],
[
"Ranjan",
"Anika",
""
],
[
"Dolson",
"Emily",
""
],
[
"Zaman",
"Luis",
""
]
] | Computer simulations are an important tool for studying the mechanics of biological evolution. In particular, in silico work with agent-based models provides an opportunity to collect high-quality records of ancestry relationships among simulated agents. Such phylogenies can provide insight into evolutionary dynamics w... |
1111.3122 | Iris Eshkol | Iris Eshkol (LLL), D. Maurel (LI), Nathalie Friburger (LI) | ESLO: from transcription to speakers' personal information annotation | LREC2010, Malta (2010) | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents the preliminary works to put online a French oral corpus
and its transcription. This corpus is the Socio-Linguistic Survey in Orleans,
realized in 1968. First, we numerized the corpus, then we handwritten
transcribed it with the Transcriber software adding different tags about
speakers, time, nois... | [
{
"created": "Mon, 14 Nov 2011 07:41:42 GMT",
"version": "v1"
}
] | 2011-11-15 | [
[
"Eshkol",
"Iris",
"",
"LLL"
],
[
"Maurel",
"D.",
"",
"LI"
],
[
"Friburger",
"Nathalie",
"",
"LI"
]
] | This paper presents the preliminary works to put online a French oral corpus and its transcription. This corpus is the Socio-Linguistic Survey in Orleans, realized in 1968. First, we numerized the corpus, then we handwritten transcribed it with the Transcriber software adding different tags about speakers, time, noise,... |
1802.07665 | Sreejith Sreekumar | Sreejith Sreekumar and Deniz G\"und\"uz | Distributed Hypothesis Testing Over Discrete Memoryless Channels | arXiv admin note: text overlap with arXiv:1704.01535 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A distributed binary hypothesis testing (HT) problem involving two parties,
one referred to as the observer and the other as the detector is studied. The
observer observes a discrete memoryless source (DMS) and communicates its
observations to the detector over a discrete memoryless channel (DMC). The
detector observ... | [
{
"created": "Mon, 19 Feb 2018 23:41:39 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Feb 2018 20:25:42 GMT",
"version": "v2"
},
{
"created": "Thu, 7 Jun 2018 23:03:12 GMT",
"version": "v3"
},
{
"created": "Sun, 8 Jul 2018 05:14:37 GMT",
"version": "v4"
},
{
"cre... | 2019-12-04 | [
[
"Sreekumar",
"Sreejith",
""
],
[
"Gündüz",
"Deniz",
""
]
] | A distributed binary hypothesis testing (HT) problem involving two parties, one referred to as the observer and the other as the detector is studied. The observer observes a discrete memoryless source (DMS) and communicates its observations to the detector over a discrete memoryless channel (DMC). The detector observes... |
1604.07169 | Krishnendu Chatterjee | Krishnendu Chatterjee and Hongfei Fu and Amir Kafshdar Goharshady | Termination Analysis of Probabilistic Programs through
Positivstellensatz's | A conference version will appear in CAV 2016 | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider nondeterministic probabilistic programs with the most basic
liveness property of termination. We present efficient methods for termination
analysis of nondeterministic probabilistic programs with polynomial guards and
assignments. Our approach is through synthesis of polynomial ranking
supermartingales, t... | [
{
"created": "Mon, 25 Apr 2016 08:57:28 GMT",
"version": "v1"
}
] | 2016-04-26 | [
[
"Chatterjee",
"Krishnendu",
""
],
[
"Fu",
"Hongfei",
""
],
[
"Goharshady",
"Amir Kafshdar",
""
]
] | We consider nondeterministic probabilistic programs with the most basic liveness property of termination. We present efficient methods for termination analysis of nondeterministic probabilistic programs with polynomial guards and assignments. Our approach is through synthesis of polynomial ranking supermartingales, tha... |
2001.09219 | Q.Vera Liao | Bhavya Ghai, Q. Vera Liao, Yunfeng Zhang, Rachel Bellamy, Klaus
Mueller | Explainable Active Learning (XAL): An Empirical Study of How Local
Explanations Impact Annotator Experience | replacing with a draft accepted to CSCW2020 | null | null | null | cs.HC cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The wide adoption of Machine Learning technologies has created a rapidly
growing demand for people who can train ML models. Some advocated the term
"machine teacher" to refer to the role of people who inject domain knowledge
into ML models. One promising learning paradigm is Active Learning (AL), by
which the model i... | [
{
"created": "Fri, 24 Jan 2020 22:52:18 GMT",
"version": "v1"
},
{
"created": "Fri, 31 Jan 2020 00:18:11 GMT",
"version": "v2"
},
{
"created": "Wed, 17 Jun 2020 16:47:14 GMT",
"version": "v3"
},
{
"created": "Wed, 30 Sep 2020 12:43:28 GMT",
"version": "v4"
}
] | 2020-10-01 | [
[
"Ghai",
"Bhavya",
""
],
[
"Liao",
"Q. Vera",
""
],
[
"Zhang",
"Yunfeng",
""
],
[
"Bellamy",
"Rachel",
""
],
[
"Mueller",
"Klaus",
""
]
] | The wide adoption of Machine Learning technologies has created a rapidly growing demand for people who can train ML models. Some advocated the term "machine teacher" to refer to the role of people who inject domain knowledge into ML models. One promising learning paradigm is Active Learning (AL), by which the model int... |
0705.3061 | Chao Chen | Daniel Freedman and Chao Chen | Measuring and Localing Homology Classes | References 8 and 22 are fixed | null | null | null | cs.CG math.AT | null | We develop a method for measuring and localizing homology classes. This
involves two problems. First, we define relevant notions of size for both a
homology class and a homology group basis, using ideas from relative homology.
Second, we propose an algorithm to compute the optimal homology basis, using
techniques fro... | [
{
"created": "Mon, 21 May 2007 22:16:20 GMT",
"version": "v1"
},
{
"created": "Thu, 24 May 2007 18:01:33 GMT",
"version": "v2"
}
] | 2007-06-13 | [
[
"Freedman",
"Daniel",
""
],
[
"Chen",
"Chao",
""
]
] | We develop a method for measuring and localizing homology classes. This involves two problems. First, we define relevant notions of size for both a homology class and a homology group basis, using ideas from relative homology. Second, we propose an algorithm to compute the optimal homology basis, using techniques from ... |
2403.02626 | Imad Eddine Toubal | Imad Eddine Toubal, Aditya Avinash, Neil Gordon Alldrin, Jan Dlabal,
Wenlei Zhou, Enming Luo, Otilia Stretcu, Hao Xiong, Chun-Ta Lu, Howard Zhou,
Ranjay Krishna, Ariel Fuxman, Tom Duerig | Modeling Collaborator: Enabling Subjective Vision Classification With
Minimal Human Effort via LLM Tool-Use | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | From content moderation to wildlife conservation, the number of applications
that require models to recognize nuanced or subjective visual concepts is
growing. Traditionally, developing classifiers for such concepts requires
substantial manual effort measured in hours, days, or even months to identify
and annotate da... | [
{
"created": "Tue, 5 Mar 2024 03:34:11 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Mar 2024 03:56:57 GMT",
"version": "v2"
}
] | 2024-03-21 | [
[
"Toubal",
"Imad Eddine",
""
],
[
"Avinash",
"Aditya",
""
],
[
"Alldrin",
"Neil Gordon",
""
],
[
"Dlabal",
"Jan",
""
],
[
"Zhou",
"Wenlei",
""
],
[
"Luo",
"Enming",
""
],
[
"Stretcu",
"Otilia",
""
],
[
... | From content moderation to wildlife conservation, the number of applications that require models to recognize nuanced or subjective visual concepts is growing. Traditionally, developing classifiers for such concepts requires substantial manual effort measured in hours, days, or even months to identify and annotate data... |
1902.07877 | Lei Li | Lei Li, Fuping Wu, Guang Yang, Lingchao Xu, Tom Wong, Raad Mohiaddin,
David Firmin, Jennifer Keegan, Xiahai Zhuang | Atrial Scar Quantification via Multi-scale CNN in the Graph-cuts
Framework | 13 pages, 10 figures, submitted to Medical Image Analysis | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Late gadolinium enhancement magnetic resonance imaging (LGE MRI) appears to
be a promising alternative for scar assessment in patients with atrial
fibrillation (AF). Automating the quantification and analysis of atrial scars
can be challenging due to the low image quality. In this work, we propose a
fully automated m... | [
{
"created": "Thu, 21 Feb 2019 06:13:35 GMT",
"version": "v1"
}
] | 2019-02-22 | [
[
"Li",
"Lei",
""
],
[
"Wu",
"Fuping",
""
],
[
"Yang",
"Guang",
""
],
[
"Xu",
"Lingchao",
""
],
[
"Wong",
"Tom",
""
],
[
"Mohiaddin",
"Raad",
""
],
[
"Firmin",
"David",
""
],
[
"Keegan",
"Jennifer... | Late gadolinium enhancement magnetic resonance imaging (LGE MRI) appears to be a promising alternative for scar assessment in patients with atrial fibrillation (AF). Automating the quantification and analysis of atrial scars can be challenging due to the low image quality. In this work, we propose a fully automated met... |
2107.08408 | Ashutosh Modi | Ishika Singh and Gargi Singh and Ashutosh Modi | Pre-trained Language Models as Prior Knowledge for Playing Text-based
Games | 40 Pages (8 Pages main content + 1 Page references + 31 Pages
Appendix). Some new results added | null | null | null | cs.CL cs.AI cs.MA cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Recently, text world games have been proposed to enable artificial agents to
understand and reason about real-world scenarios. These text-based games are
challenging for artificial agents, as it requires an understanding of and
interaction using natural language in a partially observable environment.
Agents observe t... | [
{
"created": "Sun, 18 Jul 2021 10:28:48 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Dec 2021 09:17:53 GMT",
"version": "v2"
}
] | 2021-12-24 | [
[
"Singh",
"Ishika",
""
],
[
"Singh",
"Gargi",
""
],
[
"Modi",
"Ashutosh",
""
]
] | Recently, text world games have been proposed to enable artificial agents to understand and reason about real-world scenarios. These text-based games are challenging for artificial agents, as it requires an understanding of and interaction using natural language in a partially observable environment. Agents observe the... |
1807.04728 | Jim Basney | Alex Withers (NCSA), Brian Bockelman (University of Nebraska-Lincoln),
Derek Weitzel (University of Nebraska-Lincoln), Duncan Brown (Syracuse
University), Jeff Gaynor (NCSA), Jim Basney (NCSA), Todd Tannenbaum
(University of Wisconsin-Madison), Zach Miller (University of
Wisconsin-Madison) | SciTokens: Capability-Based Secure Access to Remote Scientific Data | 8 pages, 6 figures, PEARC '18: Practice and Experience in Advanced
Research Computing, July 22--26, 2018, Pittsburgh, PA, USA | null | 10.1145/3219104.3219135 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The management of security credentials (e.g., passwords, secret keys) for
computational science workflows is a burden for scientists and information
security officers. Problems with credentials (e.g., expiration, privilege
mismatch) cause workflows to fail to fetch needed input data or store valuable
scientific resul... | [
{
"created": "Thu, 12 Jul 2018 17:06:19 GMT",
"version": "v1"
}
] | 2018-07-13 | [
[
"Withers",
"Alex",
"",
"NCSA"
],
[
"Bockelman",
"Brian",
"",
"University of Nebraska-Lincoln"
],
[
"Weitzel",
"Derek",
"",
"University of Nebraska-Lincoln"
],
[
"Brown",
"Duncan",
"",
"Syracuse\n University"
],
[
"Gaynor",
"J... | The management of security credentials (e.g., passwords, secret keys) for computational science workflows is a burden for scientists and information security officers. Problems with credentials (e.g., expiration, privilege mismatch) cause workflows to fail to fetch needed input data or store valuable scientific results... |
2405.00841 | Juncheng Li | Juncheng Li and David J. Cappelleri | Sim-Grasp: Learning 6-DOF Grasp Policies for Cluttered Environments
Using a Synthetic Benchmark | null | IEEE Robotics and Automation Letters (2024) 1-8 | 10.1109/LRA.2024.3430712 | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present Sim-Grasp, a robust 6-DOF two-finger grasping
system that integrates advanced language models for enhanced object
manipulation in cluttered environments. We introduce the Sim-Grasp-Dataset,
which includes 1,550 objects across 500 scenarios with 7.9 million annotated
labels, and develop Sim-G... | [
{
"created": "Wed, 1 May 2024 20:08:51 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Jul 2024 22:12:11 GMT",
"version": "v2"
}
] | 2024-07-18 | [
[
"Li",
"Juncheng",
""
],
[
"Cappelleri",
"David J.",
""
]
] | In this paper, we present Sim-Grasp, a robust 6-DOF two-finger grasping system that integrates advanced language models for enhanced object manipulation in cluttered environments. We introduce the Sim-Grasp-Dataset, which includes 1,550 objects across 500 scenarios with 7.9 million annotated labels, and develop Sim-Gra... |
2211.03889 | Samarth Sinha | Samarth Sinha, Roman Shapovalov, Jeremy Reizenstein, Ignacio Rocco,
Natalia Neverova, Andrea Vedaldi, David Novotny | Common Pets in 3D: Dynamic New-View Synthesis of Real-Life Deformable
Categories | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Obtaining photorealistic reconstructions of objects from sparse views is
inherently ambiguous and can only be achieved by learning suitable
reconstruction priors. Earlier works on sparse rigid object reconstruction
successfully learned such priors from large datasets such as CO3D. In this
paper, we extend this approa... | [
{
"created": "Mon, 7 Nov 2022 22:42:42 GMT",
"version": "v1"
}
] | 2022-11-09 | [
[
"Sinha",
"Samarth",
""
],
[
"Shapovalov",
"Roman",
""
],
[
"Reizenstein",
"Jeremy",
""
],
[
"Rocco",
"Ignacio",
""
],
[
"Neverova",
"Natalia",
""
],
[
"Vedaldi",
"Andrea",
""
],
[
"Novotny",
"David",
""
]... | Obtaining photorealistic reconstructions of objects from sparse views is inherently ambiguous and can only be achieved by learning suitable reconstruction priors. Earlier works on sparse rigid object reconstruction successfully learned such priors from large datasets such as CO3D. In this paper, we extend this approach... |
1507.00598 | Yulong Zou Dr. | Yulong Zou, Jia Zhu, Liuqing Yang, Ying-Chang Liang, and Yu-Dong Yao | Securing Physical-Layer Communications for Cognitive Radio Networks | 15 pages in IEEE Communications Magazine, September 2015 | null | 10.1109/MCOM.2015.7263345 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article investigates the physical-layer security of cognitive radio (CR)
networks, which are vulnerable to various newly arising attacks targeting on
the weaknesses of CR communications and networking. We first review a range of
physical-layer attacks in CR networks, including the primary user emulation,
sensing... | [
{
"created": "Thu, 2 Jul 2015 14:19:22 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Zou",
"Yulong",
""
],
[
"Zhu",
"Jia",
""
],
[
"Yang",
"Liuqing",
""
],
[
"Liang",
"Ying-Chang",
""
],
[
"Yao",
"Yu-Dong",
""
]
] | This article investigates the physical-layer security of cognitive radio (CR) networks, which are vulnerable to various newly arising attacks targeting on the weaknesses of CR communications and networking. We first review a range of physical-layer attacks in CR networks, including the primary user emulation, sensing f... |
1303.3828 | Jo\~ao Em\'ilio Almeida | Jo\~ao Ribeiro, Jo\~ao Em\'ilio Almeida, Rosaldo J. F. Rossetti,
Ant\'onio Coelho, Ant\'onio Le\c{c}a Coelho | Using Serious Games to Train Evacuation Behaviour | CISTI 2012 - 7 Conferencia Ib\'erica de Sistemas y Tecnolog\'ias de
Informaci\'on, pp 771-776, Madrid, Spain. ISBN: 978-989-96247-6-4 | null | null | null | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Emergency evacuation plans and evacuation drills are mandatory in public
buildings in many countries. Their importance is considerable when it comes to
guarantee safety and protection during a crisis. However, sometimes
discrepancies arise between the goals of the plan and its outcomes, because
people find it hard to... | [
{
"created": "Fri, 15 Mar 2013 16:58:00 GMT",
"version": "v1"
}
] | 2013-03-18 | [
[
"Ribeiro",
"João",
""
],
[
"Almeida",
"João Emílio",
""
],
[
"Rossetti",
"Rosaldo J. F.",
""
],
[
"Coelho",
"António",
""
],
[
"Coelho",
"António Leça",
""
]
] | Emergency evacuation plans and evacuation drills are mandatory in public buildings in many countries. Their importance is considerable when it comes to guarantee safety and protection during a crisis. However, sometimes discrepancies arise between the goals of the plan and its outcomes, because people find it hard to t... |
2408.02373 | Sahra Ghalebikesabi | Sahra Ghalebikesabi, Eugene Bagdasaryan, Ren Yi, Itay Yona, Ilia
Shumailov, Aneesh Pappu, Chongyang Shi, Laura Weidinger, Robert Stanforth,
Leonard Berrada, Pushmeet Kohli, Po-Sen Huang, Borja Balle | Operationalizing Contextual Integrity in Privacy-Conscious Assistants | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Advanced AI assistants combine frontier LLMs and tool access to autonomously
perform complex tasks on behalf of users. While the helpfulness of such
assistants can increase dramatically with access to user information including
emails and documents, this raises privacy concerns about assistants sharing
inappropriate ... | [
{
"created": "Mon, 5 Aug 2024 10:53:51 GMT",
"version": "v1"
}
] | 2024-08-06 | [
[
"Ghalebikesabi",
"Sahra",
""
],
[
"Bagdasaryan",
"Eugene",
""
],
[
"Yi",
"Ren",
""
],
[
"Yona",
"Itay",
""
],
[
"Shumailov",
"Ilia",
""
],
[
"Pappu",
"Aneesh",
""
],
[
"Shi",
"Chongyang",
""
],
[
"W... | Advanced AI assistants combine frontier LLMs and tool access to autonomously perform complex tasks on behalf of users. While the helpfulness of such assistants can increase dramatically with access to user information including emails and documents, this raises privacy concerns about assistants sharing inappropriate in... |
2404.15440 | Jiahe Ling | Jiahe Ling, Corey B. Jackson | Exploring Convergence in Relation using Association Rules Mining: A Case
Study in Collaborative Knowledge Production | null | null | null | null | cs.HC stat.AP stat.ME | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This study delves into the pivotal role played by non-experts in knowledge
production on open collaboration platforms, with a particular focus on the
intricate process of tag development that culminates in the proposal of new
glitch classes. Leveraging the power of Association Rule Mining (ARM), this
research endeavo... | [
{
"created": "Tue, 23 Apr 2024 18:31:03 GMT",
"version": "v1"
},
{
"created": "Mon, 13 May 2024 15:02:06 GMT",
"version": "v2"
}
] | 2024-05-14 | [
[
"Ling",
"Jiahe",
""
],
[
"Jackson",
"Corey B.",
""
]
] | This study delves into the pivotal role played by non-experts in knowledge production on open collaboration platforms, with a particular focus on the intricate process of tag development that culminates in the proposal of new glitch classes. Leveraging the power of Association Rule Mining (ARM), this research endeavors... |
2203.12697 | Valentina Golendukhina | Valentina Golendukhina, Valentina Lenarduzzi, Michael Felderer | What is Software Quality for AI Engineers? Towards a Thinning of the Fog | 9 pages, 3 figures, accepted for CAIN22 Conference | null | null | null | cs.SE cs.AI | http://creativecommons.org/licenses/by/4.0/ | It is often overseen that AI-enabled systems are also software systems and
therefore rely on software quality assurance (SQA). Thus, the goal of this
study is to investigate the software quality assurance strategies adopted
during the development, integration, and maintenance of AI/ML components and
code. We conducte... | [
{
"created": "Wed, 23 Mar 2022 19:43:35 GMT",
"version": "v1"
}
] | 2022-03-25 | [
[
"Golendukhina",
"Valentina",
""
],
[
"Lenarduzzi",
"Valentina",
""
],
[
"Felderer",
"Michael",
""
]
] | It is often overseen that AI-enabled systems are also software systems and therefore rely on software quality assurance (SQA). Thus, the goal of this study is to investigate the software quality assurance strategies adopted during the development, integration, and maintenance of AI/ML components and code. We conducted ... |
2005.02580 | Darsen Lu | Darsen D. Lu, Mohan V. Dunga, Ali M. Niknejad, Chenming Hu, Fu-Xiang
Liang, Wei-Chen Hung, Jia-Wei Lee, Chun-Hsiang Hsu and Meng-Hsueh Chiang | Compact Device Models for FinFET and Beyond | Invited talk at the Asia-Pacific Workshop on Fundamentals and
Applications of Advanced Semiconductor Devices (AWAD), Kitakyushu, Japan,
July 2018 | null | null | null | cs.ET physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compact device models play a significant role in connecting device technology
and circuit design. BSIM-CMG and BSIM-IMG are industry standard compact models
suited for the FinFET and UTBB technologies, respectively. Its surface
potential based modeling framework and symmetry preserving properties make them
suitable f... | [
{
"created": "Wed, 6 May 2020 03:43:17 GMT",
"version": "v1"
}
] | 2020-05-07 | [
[
"Lu",
"Darsen D.",
""
],
[
"Dunga",
"Mohan V.",
""
],
[
"Niknejad",
"Ali M.",
""
],
[
"Hu",
"Chenming",
""
],
[
"Liang",
"Fu-Xiang",
""
],
[
"Hung",
"Wei-Chen",
""
],
[
"Lee",
"Jia-Wei",
""
],
[
"Hs... | Compact device models play a significant role in connecting device technology and circuit design. BSIM-CMG and BSIM-IMG are industry standard compact models suited for the FinFET and UTBB technologies, respectively. Its surface potential based modeling framework and symmetry preserving properties make them suitable for... |
2308.14837 | Tegan Wilson | Tegan Wilson, Daniel Amir, Nitika Saran, Robert Kleinberg, Vishal
Shrivastav, Hakim Weatherspoon | Breaking the VLB Barrier for Oblivious Reconfigurable Networks | 50 pages, 2 figures | null | null | null | cs.DS cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a landmark 1981 paper, Valiant and Brebner gave birth to the study of
oblivious routing and, simultaneously, introduced its most powerful and
ubiquitous method: Valiant load balancing (VLB). By routing messages through a
randomly sampled intermediate node, VLB lengthens routing paths by a factor of
two but gains t... | [
{
"created": "Mon, 28 Aug 2023 18:47:37 GMT",
"version": "v1"
},
{
"created": "Fri, 1 Dec 2023 18:53:30 GMT",
"version": "v2"
}
] | 2023-12-04 | [
[
"Wilson",
"Tegan",
""
],
[
"Amir",
"Daniel",
""
],
[
"Saran",
"Nitika",
""
],
[
"Kleinberg",
"Robert",
""
],
[
"Shrivastav",
"Vishal",
""
],
[
"Weatherspoon",
"Hakim",
""
]
] | In a landmark 1981 paper, Valiant and Brebner gave birth to the study of oblivious routing and, simultaneously, introduced its most powerful and ubiquitous method: Valiant load balancing (VLB). By routing messages through a randomly sampled intermediate node, VLB lengthens routing paths by a factor of two but gains the... |
2307.11897 | Akash Velu | Akash Velu, Skanda Vaidyanath, Dilip Arumugam | Hindsight-DICE: Stable Credit Assignment for Deep Reinforcement Learning | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Oftentimes, environments for sequential decision-making problems can be quite
sparse in the provision of evaluative feedback to guide reinforcement-learning
agents. In the extreme case, long trajectories of behavior are merely
punctuated with a single terminal feedback signal, leading to a significant
temporal delay ... | [
{
"created": "Fri, 21 Jul 2023 20:54:52 GMT",
"version": "v1"
},
{
"created": "Fri, 18 Aug 2023 18:35:02 GMT",
"version": "v2"
}
] | 2023-08-22 | [
[
"Velu",
"Akash",
""
],
[
"Vaidyanath",
"Skanda",
""
],
[
"Arumugam",
"Dilip",
""
]
] | Oftentimes, environments for sequential decision-making problems can be quite sparse in the provision of evaluative feedback to guide reinforcement-learning agents. In the extreme case, long trajectories of behavior are merely punctuated with a single terminal feedback signal, leading to a significant temporal delay be... |
1901.08455 | Li Yue | Li Yue and Zhao Weibin and Shang Lin | Really should we pruning after model be totally trained? Pruning based
on a small amount of training | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pre-training of models in pruning algorithms plays an important role in
pruning decision-making. We find that excessive pre-training is not necessary
for pruning algorithms. According to this idea, we propose a pruning
algorithm---Incremental pruning based on less training (IPLT). Compared with
the traditional prunin... | [
{
"created": "Thu, 24 Jan 2019 15:30:54 GMT",
"version": "v1"
}
] | 2019-01-25 | [
[
"Yue",
"Li",
""
],
[
"Weibin",
"Zhao",
""
],
[
"Lin",
"Shang",
""
]
] | Pre-training of models in pruning algorithms plays an important role in pruning decision-making. We find that excessive pre-training is not necessary for pruning algorithms. According to this idea, we propose a pruning algorithm---Incremental pruning based on less training (IPLT). Compared with the traditional pruning ... |
1905.08721 | Ben Day | Ezra Webb, Ben Day, Helena Andres-Terre and Pietro Li\'o | Factorised Neural Relational Inference for Multi-Interaction Systems | 4 page workshop paper accepted for presentation at the ICML 2019
Workshop on Learning and Reasoning with Graph-Structured Representations with
6 pages of supplementary materials and figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many complex natural and cultural phenomena are well modelled by systems of
simple interactions between particles. A number of architectures have been
developed to articulate this kind of structure, both implicitly and explicitly.
We consider an unsupervised explicit model, the NRI model, and make a series of
represe... | [
{
"created": "Tue, 21 May 2019 15:59:57 GMT",
"version": "v1"
}
] | 2019-05-22 | [
[
"Webb",
"Ezra",
""
],
[
"Day",
"Ben",
""
],
[
"Andres-Terre",
"Helena",
""
],
[
"Lió",
"Pietro",
""
]
] | Many complex natural and cultural phenomena are well modelled by systems of simple interactions between particles. A number of architectures have been developed to articulate this kind of structure, both implicitly and explicitly. We consider an unsupervised explicit model, the NRI model, and make a series of represent... |
2201.00727 | Thomas Wachtler | Malin Sandstr\"om, Mathew Abrams, Jan Bjaalie, Mona Hicks, David
Kennedy, Arvind Kumar, JB Poline, Prasun Roy, Paul Tiesinga, Thomas Wachtler,
Wojtek Goscinski | Recommendations for repositories and scientific gateways from a
neuroscience perspective | 10 pages, submitted to Scientific Data | null | null | null | cs.CY cs.DL q-bio.NC | http://creativecommons.org/licenses/by/4.0/ | Digital services such as repositories and science gateways have become key
resources for the neuroscience community, but users often have a hard time
orienting themselves in the service landscape to find the best fit for their
particular needs. INCF (International Neuroinformatics Coordinating Facility)
has developed... | [
{
"created": "Mon, 3 Jan 2022 16:01:26 GMT",
"version": "v1"
}
] | 2022-01-04 | [
[
"Sandström",
"Malin",
""
],
[
"Abrams",
"Mathew",
""
],
[
"Bjaalie",
"Jan",
""
],
[
"Hicks",
"Mona",
""
],
[
"Kennedy",
"David",
""
],
[
"Kumar",
"Arvind",
""
],
[
"Poline",
"JB",
""
],
[
"Roy",
... | Digital services such as repositories and science gateways have become key resources for the neuroscience community, but users often have a hard time orienting themselves in the service landscape to find the best fit for their particular needs. INCF (International Neuroinformatics Coordinating Facility) has developed a... |
1903.03929 | Satyananda Kashyap | Satyananda Kashyap, Ipek Oguz, Honghai Zhang, Milan Sonka | Automated Segmentation of Knee MRI Using Hierarchical Classifiers and
Just Enough Interaction Based Learning: Data from Osteoarthritis Initiative | KEYWORDS: Graph based segmentation; Just enough interaction;
LOGISMOS; Neighborhood approximation forests; Osteoarthritis; Random forest
classifier; knee MRI PMID: 28626842 PMCID: PMC5471813 | Med Image Comput Comput Assist Interv. 2016 Oct;9901:344-351. doi:
10.1007/978-3-319-46723-8_40. Epub 2016 Oct 2 | 10.1007/978-3-319-46723-8_40 | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a fully automated learning-based approach for segmenting knee
cartilage in the presence of osteoarthritis (OA). The algorithm employs a
hierarchical set of two random forest classifiers. The first is a neighborhood
approximation forest, the output probability map of which is utilized as a
feature set for t... | [
{
"created": "Sun, 10 Mar 2019 06:01:23 GMT",
"version": "v1"
}
] | 2019-03-12 | [
[
"Kashyap",
"Satyananda",
""
],
[
"Oguz",
"Ipek",
""
],
[
"Zhang",
"Honghai",
""
],
[
"Sonka",
"Milan",
""
]
] | We present a fully automated learning-based approach for segmenting knee cartilage in the presence of osteoarthritis (OA). The algorithm employs a hierarchical set of two random forest classifiers. The first is a neighborhood approximation forest, the output probability map of which is utilized as a feature set for the... |
1910.12634 | Anne Schreuder | Anne Schreuder, C.-H. Luke Ong | Polynomial Probabilistic Invariants and the Optional Stopping Theorem | 16 pages, 4 examples, submitted to TACAS 2020 | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present methods for the synthesis of polynomial invariants
for probabilistic transition systems. Our approach is based on martingale
theory. We construct invariants in the form of polynomials over program
variables, which give rise to martingales. These polynomials are program
invariants in the sense... | [
{
"created": "Fri, 25 Oct 2019 10:09:13 GMT",
"version": "v1"
}
] | 2019-10-29 | [
[
"Schreuder",
"Anne",
""
],
[
"Ong",
"C. -H. Luke",
""
]
] | In this paper we present methods for the synthesis of polynomial invariants for probabilistic transition systems. Our approach is based on martingale theory. We construct invariants in the form of polynomials over program variables, which give rise to martingales. These polynomials are program invariants in the sense t... |
1903.06482 | Shuaifeng Zhi | Shuaifeng Zhi, Michael Bloesch, Stefan Leutenegger, Andrew J. Davison | SceneCode: Monocular Dense Semantic Reconstruction using Learned Encoded
Scene Representations | To be published in Proceedings of the IEEE Conference on Computer
Vision and Pattern Recognition (CVPR 2019) | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Systems which incrementally create 3D semantic maps from image sequences must
store and update representations of both geometry and semantic entities.
However, while there has been much work on the correct formulation for
geometrical estimation, state-of-the-art systems usually rely on simple
semantic representations... | [
{
"created": "Fri, 15 Mar 2019 12:02:44 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Mar 2019 16:55:47 GMT",
"version": "v2"
}
] | 2019-03-19 | [
[
"Zhi",
"Shuaifeng",
""
],
[
"Bloesch",
"Michael",
""
],
[
"Leutenegger",
"Stefan",
""
],
[
"Davison",
"Andrew J.",
""
]
] | Systems which incrementally create 3D semantic maps from image sequences must store and update representations of both geometry and semantic entities. However, while there has been much work on the correct formulation for geometrical estimation, state-of-the-art systems usually rely on simple semantic representations w... |
2405.00451 | Yuxi Xie | Yuxi Xie, Anirudh Goyal, Wenyue Zheng, Min-Yen Kan, Timothy P.
Lillicrap, Kenji Kawaguchi, Michael Shieh | Monte Carlo Tree Search Boosts Reasoning via Iterative Preference
Learning | 10 pages, 4 figures, 4 tables (24 pages, 9 figures, 9 tables
including references and appendices) | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | We introduce an approach aimed at enhancing the reasoning capabilities of
Large Language Models (LLMs) through an iterative preference learning process
inspired by the successful strategy employed by AlphaZero. Our work leverages
Monte Carlo Tree Search (MCTS) to iteratively collect preference data,
utilizing its loo... | [
{
"created": "Wed, 1 May 2024 11:10:24 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Jun 2024 22:11:49 GMT",
"version": "v2"
}
] | 2024-06-19 | [
[
"Xie",
"Yuxi",
""
],
[
"Goyal",
"Anirudh",
""
],
[
"Zheng",
"Wenyue",
""
],
[
"Kan",
"Min-Yen",
""
],
[
"Lillicrap",
"Timothy P.",
""
],
[
"Kawaguchi",
"Kenji",
""
],
[
"Shieh",
"Michael",
""
]
] | We introduce an approach aimed at enhancing the reasoning capabilities of Large Language Models (LLMs) through an iterative preference learning process inspired by the successful strategy employed by AlphaZero. Our work leverages Monte Carlo Tree Search (MCTS) to iteratively collect preference data, utilizing its look-... |
1702.08098 | Mike Eichhorn | Mike Eichhorn, Ulrich Kremer | Opportunities to Parallelize Path Planning Algorithms for Autonomous
Underwater Vehicles | 7 pages, 9 figures, IEEE OCEANS, 2011 - Kona , 19-22 Sept. 2011 | null | 10.23919/OCEANS.2011.6107121 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper discusses opportunities to parallelize graph based path planning
algorithms in a time varying environment. Parallel architectures have become
commonplace, requiring algorithm to be parallelized for efficient execution. An
additional focal point of this paper is the inclusion of inaccuracies in path
plannin... | [
{
"created": "Sun, 26 Feb 2017 22:25:59 GMT",
"version": "v1"
}
] | 2020-08-07 | [
[
"Eichhorn",
"Mike",
""
],
[
"Kremer",
"Ulrich",
""
]
] | This paper discusses opportunities to parallelize graph based path planning algorithms in a time varying environment. Parallel architectures have become commonplace, requiring algorithm to be parallelized for efficient execution. An additional focal point of this paper is the inclusion of inaccuracies in path planning ... |
2307.11305 | Thong Hoang | Thong Hoang, Hoa Khanh Dam, Tingting Bi, Qinghua Lu, Zhenchang Xing,
Liming Zhu, Lam Duc Nguyen, Shiping Chen | Quantum Software Analytics: Opportunities and Challenges | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Quantum computing systems depend on the principles of quantum mechanics to
perform multiple challenging tasks more efficiently than their classical
counterparts. In classical software engineering, the software life cycle is
used to document and structure the processes of design, implementation, and
maintenance of sof... | [
{
"created": "Fri, 21 Jul 2023 02:24:31 GMT",
"version": "v1"
}
] | 2023-07-24 | [
[
"Hoang",
"Thong",
""
],
[
"Dam",
"Hoa Khanh",
""
],
[
"Bi",
"Tingting",
""
],
[
"Lu",
"Qinghua",
""
],
[
"Xing",
"Zhenchang",
""
],
[
"Zhu",
"Liming",
""
],
[
"Nguyen",
"Lam Duc",
""
],
[
"Chen",
... | Quantum computing systems depend on the principles of quantum mechanics to perform multiple challenging tasks more efficiently than their classical counterparts. In classical software engineering, the software life cycle is used to document and structure the processes of design, implementation, and maintenance of softw... |
1711.09050 | Peter Henderson | Peter Henderson, Koustuv Sinha, Nicolas Angelard-Gontier, Nan Rosemary
Ke, Genevieve Fried, Ryan Lowe, Joelle Pineau | Ethical Challenges in Data-Driven Dialogue Systems | In Submission to the AAAI/ACM conference on Artificial Intelligence,
Ethics, and Society | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The use of dialogue systems as a medium for human-machine interaction is an
increasingly prevalent paradigm. A growing number of dialogue systems use
conversation strategies that are learned from large datasets. There are well
documented instances where interactions with these system have resulted in
biased or even o... | [
{
"created": "Fri, 24 Nov 2017 17:14:34 GMT",
"version": "v1"
}
] | 2017-11-27 | [
[
"Henderson",
"Peter",
""
],
[
"Sinha",
"Koustuv",
""
],
[
"Angelard-Gontier",
"Nicolas",
""
],
[
"Ke",
"Nan Rosemary",
""
],
[
"Fried",
"Genevieve",
""
],
[
"Lowe",
"Ryan",
""
],
[
"Pineau",
"Joelle",
""
... | The use of dialogue systems as a medium for human-machine interaction is an increasingly prevalent paradigm. A growing number of dialogue systems use conversation strategies that are learned from large datasets. There are well documented instances where interactions with these system have resulted in biased or even off... |
1401.0998 | Olivier Hermant | Lisa Allali (LIX), Olivier Hermant (CRI, INRIA Paris-Rocquencourt) | Semantic A-translation and Super-consistency entail Classical Cut
Elimination | null | LPAR 19 - 19th Conference on Logic for Programming, Artificial
Intelligence, and Reasoning - 2013 8312 (2013) 407-422 | null | null | cs.LO math.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that if a theory R defined by a rewrite system is super-consistent,
the classical sequent calculus modulo R enjoys the cut elimination property,
which was an open question. For such theories it was already known that proofs
strongly normalize in natural deduction modulo R, and that cut elimination
holds in th... | [
{
"created": "Mon, 6 Jan 2014 07:10:21 GMT",
"version": "v1"
}
] | 2014-01-07 | [
[
"Allali",
"Lisa",
"",
"LIX"
],
[
"Hermant",
"Olivier",
"",
"CRI, INRIA Paris-Rocquencourt"
]
] | We show that if a theory R defined by a rewrite system is super-consistent, the classical sequent calculus modulo R enjoys the cut elimination property, which was an open question. For such theories it was already known that proofs strongly normalize in natural deduction modulo R, and that cut elimination holds in the ... |
2108.06280 | Jintang Li | Liang Chen, Jintang Li, Qibiao Peng, Yang Liu, Zibin Zheng and Carl
Yang | Understanding Structural Vulnerability in Graph Convolutional Networks | 7 pages, 5 figures; Published at IJCAI 2021 | null | null | null | cs.LG cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent studies have shown that Graph Convolutional Networks (GCNs) are
vulnerable to adversarial attacks on the graph structure. Although multiple
works have been proposed to improve their robustness against such structural
adversarial attacks, the reasons for the success of the attacks remain unclear.
In this work, ... | [
{
"created": "Fri, 13 Aug 2021 15:07:44 GMT",
"version": "v1"
},
{
"created": "Sat, 11 Sep 2021 02:45:52 GMT",
"version": "v2"
}
] | 2021-09-14 | [
[
"Chen",
"Liang",
""
],
[
"Li",
"Jintang",
""
],
[
"Peng",
"Qibiao",
""
],
[
"Liu",
"Yang",
""
],
[
"Zheng",
"Zibin",
""
],
[
"Yang",
"Carl",
""
]
] | Recent studies have shown that Graph Convolutional Networks (GCNs) are vulnerable to adversarial attacks on the graph structure. Although multiple works have been proposed to improve their robustness against such structural adversarial attacks, the reasons for the success of the attacks remain unclear. In this work, we... |
2205.01841 | Jinhao Jiang | Jinhao Jiang, Kun Zhou, Wayne Xin Zhao and Ji-Rong Wen | Great Truths are Always Simple: A Rather Simple Knowledge Encoder for
Enhancing the Commonsense Reasoning Capacity of Pre-Trained Models | 12 pages, NAACL-Findings-2022 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Commonsense reasoning in natural language is a desired ability of artificial
intelligent systems. For solving complex commonsense reasoning tasks, a typical
solution is to enhance pre-trained language models~(PTMs) with a
knowledge-aware graph neural network~(GNN) encoder that models a commonsense
knowledge graph~(CS... | [
{
"created": "Wed, 4 May 2022 01:27:36 GMT",
"version": "v1"
}
] | 2022-05-05 | [
[
"Jiang",
"Jinhao",
""
],
[
"Zhou",
"Kun",
""
],
[
"Zhao",
"Wayne Xin",
""
],
[
"Wen",
"Ji-Rong",
""
]
] | Commonsense reasoning in natural language is a desired ability of artificial intelligent systems. For solving complex commonsense reasoning tasks, a typical solution is to enhance pre-trained language models~(PTMs) with a knowledge-aware graph neural network~(GNN) encoder that models a commonsense knowledge graph~(CSKG... |
2209.03960 | Maximilian Kannapinn | Maximilian Kannapinn and Michael Sch\"afer | Endeavouring Intelligent Process Self-Control by Employing Digital Twin
Methodology: Proof-of-Concept Study for Cooking Applications | Accepted version of the manuscript published in CADFEM ANSYS
Simulation Conference 2019. Received a best paper award | null | null | null | cs.CE cs.SY eess.SY physics.bio-ph physics.flu-dyn | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This work demonstrates the use of the Digital Twin methodology to predict the
water concentration and temperature of chicken meat. It marks a milestone on
the path to autonomous cooking devices that do not only control device
temperatures but culinary food quality markers as well. A custom water
transport equation is... | [
{
"created": "Thu, 8 Sep 2022 10:29:11 GMT",
"version": "v1"
}
] | 2022-09-12 | [
[
"Kannapinn",
"Maximilian",
""
],
[
"Schäfer",
"Michael",
""
]
] | This work demonstrates the use of the Digital Twin methodology to predict the water concentration and temperature of chicken meat. It marks a milestone on the path to autonomous cooking devices that do not only control device temperatures but culinary food quality markers as well. A custom water transport equation is c... |
2201.05993 | Thaweesak Trongtirakul | Thaweesak Trongtirakul, Kamonnit Pusorn, Umpaporn Peerawanichkul | Computer Simulation-Based Learning: Student Self-Efficacy During
COVID-19 Outbreak | null | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Due to the COVID-19 as a pandemic, the government has forced the nationwide
shutdown of several activities, including educational activities. It has
resulted in gigantic migration of universities with education over the internet
serving as the educational platform. Hand-on-based learning becomes a new
challenge. This... | [
{
"created": "Sun, 16 Jan 2022 07:36:52 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Jan 2022 03:44:21 GMT",
"version": "v2"
},
{
"created": "Fri, 11 Feb 2022 14:19:49 GMT",
"version": "v3"
}
] | 2022-02-14 | [
[
"Trongtirakul",
"Thaweesak",
""
],
[
"Pusorn",
"Kamonnit",
""
],
[
"Peerawanichkul",
"Umpaporn",
""
]
] | Due to the COVID-19 as a pandemic, the government has forced the nationwide shutdown of several activities, including educational activities. It has resulted in gigantic migration of universities with education over the internet serving as the educational platform. Hand-on-based learning becomes a new challenge. This p... |
1304.3429 | Glenn Shafer | Glenn Shafer | Probability Judgement in Artificial Intelligence | Appears in Proceedings of the First Conference on Uncertainty in
Artificial Intelligence (UAI1985) | null | null | UAI-P-1985-PG-91-98 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper is concerned with two theories of probability judgment: the
Bayesian theory and the theory of belief functions. It illustrates these
theories with some simple examples and discusses some of the issues that arise
when we try to implement them in expert systems. The Bayesian theory is well
known; its main id... | [
{
"created": "Wed, 27 Mar 2013 19:56:37 GMT",
"version": "v1"
}
] | 2013-04-15 | [
[
"Shafer",
"Glenn",
""
]
] | This paper is concerned with two theories of probability judgment: the Bayesian theory and the theory of belief functions. It illustrates these theories with some simple examples and discusses some of the issues that arise when we try to implement them in expert systems. The Bayesian theory is well known; its main idea... |
2206.10885 | Daniele Baieri | Stefano Esposito, Daniele Baieri, Stefan Zellmann, Andr\'e Hinkenjann,
Emanuele Rodol\`a | KiloNeuS: A Versatile Neural Implicit Surface Representation for
Real-Time Rendering | 9 pages, 8 figures | null | null | null | cs.CV cs.GR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | NeRF-based techniques fit wide and deep multi-layer perceptrons (MLPs) to a
continuous radiance field that can be rendered from any unseen viewpoint.
However, the lack of surface and normals definition and high rendering times
limit their usage in typical computer graphics applications. Such limitations
have recently... | [
{
"created": "Wed, 22 Jun 2022 07:33:26 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Nov 2022 10:13:29 GMT",
"version": "v2"
}
] | 2022-11-22 | [
[
"Esposito",
"Stefano",
""
],
[
"Baieri",
"Daniele",
""
],
[
"Zellmann",
"Stefan",
""
],
[
"Hinkenjann",
"André",
""
],
[
"Rodolà",
"Emanuele",
""
]
] | NeRF-based techniques fit wide and deep multi-layer perceptrons (MLPs) to a continuous radiance field that can be rendered from any unseen viewpoint. However, the lack of surface and normals definition and high rendering times limit their usage in typical computer graphics applications. Such limitations have recently b... |
1606.00883 | Janine Viol | Janine Viol, Rebecca Bernsmann and Kai Riemer | Behavioural Dimensions for Discovering Knowledge Actor Roles Utilising
Enterprise Social Network Metrics | ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
Information Systems 2015 (arXiv:1605.01032) | null | null | ACIS/2015/68 | cs.CY cs.SI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The identification of distinct user roles is an important theme in social
media research. However, for Enterprise Social Networks (ESN), the use of
social media within organisations, research identifying such roles is still
lacking. Yet, understanding user roles, in particular regarding their knowledge
contributions ... | [
{
"created": "Sat, 28 May 2016 04:25:17 GMT",
"version": "v1"
}
] | 2016-06-06 | [
[
"Viol",
"Janine",
""
],
[
"Bernsmann",
"Rebecca",
""
],
[
"Riemer",
"Kai",
""
]
] | The identification of distinct user roles is an important theme in social media research. However, for Enterprise Social Networks (ESN), the use of social media within organisations, research identifying such roles is still lacking. Yet, understanding user roles, in particular regarding their knowledge contributions an... |
2308.09257 | Amr Elsayed Abdelfattah | Amr Elsayed, Tomas Cerny, Jorge Yero Salazar, Austin Lehman, Joshua
Hunter, Ashley Bickham and Davide Taibi | End-to-End Test Coverage Metrics in Microservice Systems: An Automated
Approach | This paper is accepted for publication at ESOCC 2023 | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Microservice architecture gains momentum by fueling systems with cloud-native
benefits, scalability, and decentralized evolution. However, new challenges
emerge for end-to-end (E2E) testing. Testers who see the decentralized system
through the user interface might assume their tests are comprehensive, covering
all mi... | [
{
"created": "Fri, 18 Aug 2023 02:30:19 GMT",
"version": "v1"
}
] | 2023-08-21 | [
[
"Elsayed",
"Amr",
""
],
[
"Cerny",
"Tomas",
""
],
[
"Salazar",
"Jorge Yero",
""
],
[
"Lehman",
"Austin",
""
],
[
"Hunter",
"Joshua",
""
],
[
"Bickham",
"Ashley",
""
],
[
"Taibi",
"Davide",
""
]
] | Microservice architecture gains momentum by fueling systems with cloud-native benefits, scalability, and decentralized evolution. However, new challenges emerge for end-to-end (E2E) testing. Testers who see the decentralized system through the user interface might assume their tests are comprehensive, covering all midd... |
1008.1653 | EPTCS | Markus Holzer, Sebastian Jakobi, Martin Kutrib | The Magic Number Problem for Subregular Language Families | In Proceedings DCFS 2010, arXiv:1008.1270 | EPTCS 31, 2010, pp. 110-119 | 10.4204/EPTCS.31.13 | null | cs.FL cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the magic number problem, that is, the question whether there
exists a minimal n-state nondeterministic finite automaton (NFA) whose
equivalent minimal deterministic finite automaton (DFA) has alpha states, for
all n and alpha satisfying n less or equal to alpha less or equal to exp(2,n).
A number alph... | [
{
"created": "Tue, 10 Aug 2010 08:33:28 GMT",
"version": "v1"
}
] | 2010-08-11 | [
[
"Holzer",
"Markus",
""
],
[
"Jakobi",
"Sebastian",
""
],
[
"Kutrib",
"Martin",
""
]
] | We investigate the magic number problem, that is, the question whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic finite automaton (DFA) has alpha states, for all n and alpha satisfying n less or equal to alpha less or equal to exp(2,n). A number alpha ... |
1008.5356 | Viswanath Nagarajan | Nikhil Bansal, Anupam Gupta, Jian Li, Julian Mestre, Viswanath
Nagarajan, Atri Rudra | When LP is the Cure for Your Matching Woes: Improved Bounds for
Stochastic Matchings | 26 pages, preliminary version appears in ESA 2010 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consider a random graph model where each possible edge $e$ is present
independently with some probability $p_e$. Given these probabilities, we want
to build a large/heavy matching in the randomly generated graph. However, the
only way we can find out whether an edge is present or not is to query it, and
if the edge i... | [
{
"created": "Tue, 31 Aug 2010 16:36:56 GMT",
"version": "v1"
}
] | 2010-09-01 | [
[
"Bansal",
"Nikhil",
""
],
[
"Gupta",
"Anupam",
""
],
[
"Li",
"Jian",
""
],
[
"Mestre",
"Julian",
""
],
[
"Nagarajan",
"Viswanath",
""
],
[
"Rudra",
"Atri",
""
]
] | Consider a random graph model where each possible edge $e$ is present independently with some probability $p_e$. Given these probabilities, we want to build a large/heavy matching in the randomly generated graph. However, the only way we can find out whether an edge is present or not is to query it, and if the edge is ... |
1701.02379 | Ali Dehghan | Ali Dehghan and Amir H. Banihashemi | On the Tanner Graph Cycle Distribution of Random LDPC, Random
Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles | To appear in IEEE Trans. Inform. Theory | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study the cycle distribution of random low-density
parity-check (LDPC) codes, randomly constructed protograph-based LDPC codes,
and random quasi-cyclic (QC) LDPC codes. We prove that for a random bipartite
graph, with a given (irregular) degree distribution, the distributions of
cycles of different ... | [
{
"created": "Mon, 9 Jan 2017 22:37:21 GMT",
"version": "v1"
},
{
"created": "Sat, 10 Feb 2018 23:00:21 GMT",
"version": "v2"
}
] | 2018-02-13 | [
[
"Dehghan",
"Ali",
""
],
[
"Banihashemi",
"Amir H.",
""
]
] | In this paper, we study the cycle distribution of random low-density parity-check (LDPC) codes, randomly constructed protograph-based LDPC codes, and random quasi-cyclic (QC) LDPC codes. We prove that for a random bipartite graph, with a given (irregular) degree distribution, the distributions of cycles of different le... |
2107.07999 | Han Lin | Krzysztof Choromanski, Han Lin, Haoxian Chen, Tianyi Zhang, Arijit
Sehanobish, Valerii Likhosherstov, Jack Parker-Holder, Tamas Sarlos, Adrian
Weller, Thomas Weingarten | From block-Toeplitz matrices to differential equations on graphs:
towards a general theory for scalable masked Transformers | 20 pages, 12 figures | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | In this paper we provide, to the best of our knowledge, the first
comprehensive approach for incorporating various masking mechanisms into
Transformers architectures in a scalable way. We show that recent results on
linear causal attention (Choromanski et al., 2021) and log-linear RPE-attention
(Luo et al., 2021) are... | [
{
"created": "Fri, 16 Jul 2021 16:39:10 GMT",
"version": "v1"
},
{
"created": "Sat, 29 Jan 2022 06:53:11 GMT",
"version": "v2"
},
{
"created": "Tue, 1 Feb 2022 04:18:04 GMT",
"version": "v3"
},
{
"created": "Wed, 1 Jun 2022 03:40:31 GMT",
"version": "v4"
},
{
"cre... | 2023-03-29 | [
[
"Choromanski",
"Krzysztof",
""
],
[
"Lin",
"Han",
""
],
[
"Chen",
"Haoxian",
""
],
[
"Zhang",
"Tianyi",
""
],
[
"Sehanobish",
"Arijit",
""
],
[
"Likhosherstov",
"Valerii",
""
],
[
"Parker-Holder",
"Jack",
"... | In this paper we provide, to the best of our knowledge, the first comprehensive approach for incorporating various masking mechanisms into Transformers architectures in a scalable way. We show that recent results on linear causal attention (Choromanski et al., 2021) and log-linear RPE-attention (Luo et al., 2021) are s... |
1405.4464 | Justin Shi | Justin Shi | Seeking the Principles of Sustainable Software Engineering | WSSSPE 2014 | null | null | null | cs.DC | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Like other engineering disciplines, software engineering should also have
principles to guide the construction of sustainable computer applications.
Tangible properties include a) unlimited scalability, b) maximal
reproducibility, and c) optimizable energy efficiency. In practice, we expect a
sustainable scientific a... | [
{
"created": "Sun, 18 May 2014 06:29:02 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Jul 2014 17:58:52 GMT",
"version": "v2"
},
{
"created": "Tue, 22 Jul 2014 03:32:48 GMT",
"version": "v3"
}
] | 2014-07-23 | [
[
"Shi",
"Justin",
""
]
] | Like other engineering disciplines, software engineering should also have principles to guide the construction of sustainable computer applications. Tangible properties include a) unlimited scalability, b) maximal reproducibility, and c) optimizable energy efficiency. In practice, we expect a sustainable scientific app... |
2206.07209 | Dimitrios Myrisiotis | Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios
Myrisiotis, A. Pavan, N. V. Vinodchandran | On Approximating Total Variation Distance | 20 pages, 1 figure | Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence (2023) Main Track. Pages 3479-3487 | 10.24963/ijcai.2023/387 | null | cs.DS cs.CC cs.DM | http://creativecommons.org/licenses/by/4.0/ | Total variation distance (TV distance) is a fundamental notion of distance
between probability distributions. In this work, we introduce and study the
problem of computing the TV distance of two product distributions over the
domain $\{0,1\}^n$. In particular, we establish the following results.
1. The problem of e... | [
{
"created": "Tue, 14 Jun 2022 23:33:30 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Aug 2023 03:33:31 GMT",
"version": "v2"
}
] | 2023-08-21 | [
[
"Bhattacharyya",
"Arnab",
""
],
[
"Gayen",
"Sutanu",
""
],
[
"Meel",
"Kuldeep S.",
""
],
[
"Myrisiotis",
"Dimitrios",
""
],
[
"Pavan",
"A.",
""
],
[
"Vinodchandran",
"N. V.",
""
]
] | Total variation distance (TV distance) is a fundamental notion of distance between probability distributions. In this work, we introduce and study the problem of computing the TV distance of two product distributions over the domain $\{0,1\}^n$. In particular, we establish the following results. 1. The problem of exact... |
2209.10528 | VinayKumar Chapala Mr | Vinay Kumar Chapala, S.M. Zafaruddin | Reconfigurable Intelligent Surface for Vehicular Communications: Exact
Performance Analysis with Phase Noise and Mobility | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent research provides an approximation on the performance for
reconfigurable intelligent surface (RIS) assisted systems over generalized
fading channels with phase noise resulting from imperfect phase compensation at
the RIS. In this paper, we developed exact analysis and upper bounds on the
performance of RIS-ass... | [
{
"created": "Wed, 21 Sep 2022 17:38:41 GMT",
"version": "v1"
}
] | 2022-09-22 | [
[
"Chapala",
"Vinay Kumar",
""
],
[
"Zafaruddin",
"S. M.",
""
]
] | Recent research provides an approximation on the performance for reconfigurable intelligent surface (RIS) assisted systems over generalized fading channels with phase noise resulting from imperfect phase compensation at the RIS. In this paper, we developed exact analysis and upper bounds on the performance of RIS-assis... |
2010.12663 | Nadezhda Chirkova | Nadezhda Chirkova, Sergey Troshin | A Simple Approach for Handling Out-of-Vocabulary Identifiers in Deep
Learning for Source Code | Published at the 2021 Annual Conference of the North American Chapter
of the Association for Computational Linguistics (NAACL 2021) | null | null | null | cs.SE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is an emerging interest in the application of natural language
processing models to source code processing tasks. One of the major problems in
applying deep learning to software engineering is that source code often
contains a lot of rare identifiers, resulting in huge vocabularies. We propose
a simple, yet eff... | [
{
"created": "Fri, 23 Oct 2020 20:52:46 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Apr 2021 15:28:30 GMT",
"version": "v2"
}
] | 2021-04-28 | [
[
"Chirkova",
"Nadezhda",
""
],
[
"Troshin",
"Sergey",
""
]
] | There is an emerging interest in the application of natural language processing models to source code processing tasks. One of the major problems in applying deep learning to software engineering is that source code often contains a lot of rare identifiers, resulting in huge vocabularies. We propose a simple, yet effec... |
1807.02839 | Anjan Dutta | Anjan Dutta, Pau Riba, Josep Llad\'os, Alicia Forn\'es | Hierarchical stochastic graphlet embedding for graph-based pattern
recognition | In Neural Computing and Applications (17 pages, 5 figures, 6 tables) | null | 10.1007/s00521-019-04642-7 | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite being very successful within the pattern recognition and machine
learning community, graph-based methods are often unusable because of the lack
of mathematical operations defined in graph domain. Graph embedding, which maps
graphs to a vectorial space, has been proposed as a way to tackle these
difficulties e... | [
{
"created": "Sun, 8 Jul 2018 15:33:22 GMT",
"version": "v1"
},
{
"created": "Sat, 4 Jan 2020 17:37:12 GMT",
"version": "v2"
}
] | 2020-01-07 | [
[
"Dutta",
"Anjan",
""
],
[
"Riba",
"Pau",
""
],
[
"Lladós",
"Josep",
""
],
[
"Fornés",
"Alicia",
""
]
] | Despite being very successful within the pattern recognition and machine learning community, graph-based methods are often unusable because of the lack of mathematical operations defined in graph domain. Graph embedding, which maps graphs to a vectorial space, has been proposed as a way to tackle these difficulties ena... |
2006.01026 | Antonios Antoniadis | Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev | Secretary and Online Matching Problems with Machine Learned Advice | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The classical analysis of online algorithms, due to its worst-case nature,
can be quite pessimistic when the input instance at hand is far from
worst-case. Often this is not an issue with machine learning approaches, which
shine in exploiting patterns in past inputs in order to predict the future.
However, such predi... | [
{
"created": "Mon, 1 Jun 2020 15:44:29 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Oct 2020 10:15:30 GMT",
"version": "v2"
}
] | 2020-10-22 | [
[
"Antoniadis",
"Antonios",
""
],
[
"Gouleakis",
"Themis",
""
],
[
"Kleer",
"Pieter",
""
],
[
"Kolev",
"Pavel",
""
]
] | The classical analysis of online algorithms, due to its worst-case nature, can be quite pessimistic when the input instance at hand is far from worst-case. Often this is not an issue with machine learning approaches, which shine in exploiting patterns in past inputs in order to predict the future. However, such predict... |
1104.1546 | David Naccache | Guillaume Claret, Micha\"el Mathieu, David Naccache, Guillaume Seguin | Physical Simulation of Inarticulate Robots | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this note we study the structure and the behavior of inarticulate robots.
We introduce a robot that moves by successive revolvings. The robot's structure
is analyzed, simulated and discussed in detail.
| [
{
"created": "Fri, 8 Apr 2011 11:16:59 GMT",
"version": "v1"
}
] | 2015-03-19 | [
[
"Claret",
"Guillaume",
""
],
[
"Mathieu",
"Michaël",
""
],
[
"Naccache",
"David",
""
],
[
"Seguin",
"Guillaume",
""
]
] | In this note we study the structure and the behavior of inarticulate robots. We introduce a robot that moves by successive revolvings. The robot's structure is analyzed, simulated and discussed in detail. |
2208.07272 | Scott Alfeld | Ara Vartanian, Will Rosenbaum, Scott Alfeld | Training-Time Attacks against k-Nearest Neighbors | null | null | null | null | cs.LG cs.CR | http://creativecommons.org/licenses/by/4.0/ | Nearest neighbor-based methods are commonly used for classification tasks and
as subroutines of other data-analysis methods. An attacker with the capability
of inserting their own data points into the training set can manipulate the
inferred nearest neighbor structure. We distill this goal to the task of
performing a... | [
{
"created": "Mon, 15 Aug 2022 15:31:03 GMT",
"version": "v1"
}
] | 2022-08-16 | [
[
"Vartanian",
"Ara",
""
],
[
"Rosenbaum",
"Will",
""
],
[
"Alfeld",
"Scott",
""
]
] | Nearest neighbor-based methods are commonly used for classification tasks and as subroutines of other data-analysis methods. An attacker with the capability of inserting their own data points into the training set can manipulate the inferred nearest neighbor structure. We distill this goal to the task of performing a t... |
2109.10443 | Nathan Ratliff | Karl Van Wyk, Mandy Xie, Anqi Li, Muhammad Asif Rana, Buck Babich,
Bryan Peele, Qian Wan, Iretiayo Akinola, Balakumar Sundaralingam, Dieter Fox,
Byron Boots, and Nathan D. Ratliff | Geometric Fabrics: Generalizing Classical Mechanics to Capture the
Physics of Behavior | null | null | null | null | cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Classical mechanical systems are central to controller design in energy
shaping methods of geometric control. However, their expressivity is limited by
position-only metrics and the intimate link between metric and geometry. Recent
work on Riemannian Motion Policies (RMPs) has shown that shedding these
restrictions r... | [
{
"created": "Tue, 21 Sep 2021 22:09:32 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Jan 2022 23:10:05 GMT",
"version": "v2"
}
] | 2022-01-20 | [
[
"Van Wyk",
"Karl",
""
],
[
"Xie",
"Mandy",
""
],
[
"Li",
"Anqi",
""
],
[
"Rana",
"Muhammad Asif",
""
],
[
"Babich",
"Buck",
""
],
[
"Peele",
"Bryan",
""
],
[
"Wan",
"Qian",
""
],
[
"Akinola",
"I... | Classical mechanical systems are central to controller design in energy shaping methods of geometric control. However, their expressivity is limited by position-only metrics and the intimate link between metric and geometry. Recent work on Riemannian Motion Policies (RMPs) has shown that shedding these restrictions res... |
2304.06165 | Jennifer Bertrand | Jennifer K Bertrand and Craig S Chapman | Dynamics of eye-hand coordination are flexibly preserved in eye-cursor
coordination during an online, digital, object interaction task | null | In Proceedings of the 2023 CHI Conference on Human Factors in
Computing Systems (CHI 23). Association for Computing Machinery, New York,
NY, USA, Article 517, 1-13 | 10.1145/3544548.3580866 | null | cs.HC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Do patterns of eye-hand coordination observed during real-world object
interactions apply to digital, screen-based object interactions? We adapted a
real-world object interaction task (physically transferring cups in sequence
about a tabletop) into a two-dimensional screen-based task
(dragging-and-dropping circles in... | [
{
"created": "Wed, 12 Apr 2023 21:28:44 GMT",
"version": "v1"
}
] | 2023-06-07 | [
[
"Bertrand",
"Jennifer K",
""
],
[
"Chapman",
"Craig S",
""
]
] | Do patterns of eye-hand coordination observed during real-world object interactions apply to digital, screen-based object interactions? We adapted a real-world object interaction task (physically transferring cups in sequence about a tabletop) into a two-dimensional screen-based task (dragging-and-dropping circles in s... |
2401.13498 | Houn Su Kim | Hounsu Kim, Soonbeom Choi, Juhan Nam | Expressive Acoustic Guitar Sound Synthesis with an Instrument-Specific
Input Representation and Diffusion Outpainting | Accepted to ICASSP 2024 | null | null | null | cs.SD cs.AI cs.LG eess.AS eess.SP | http://creativecommons.org/licenses/by/4.0/ | Synthesizing performing guitar sound is a highly challenging task due to the
polyphony and high variability in expression. Recently, deep generative models
have shown promising results in synthesizing expressive polyphonic instrument
sounds from music scores, often using a generic MIDI input. In this work, we
propose... | [
{
"created": "Wed, 24 Jan 2024 14:44:01 GMT",
"version": "v1"
}
] | 2024-01-25 | [
[
"Kim",
"Hounsu",
""
],
[
"Choi",
"Soonbeom",
""
],
[
"Nam",
"Juhan",
""
]
] | Synthesizing performing guitar sound is a highly challenging task due to the polyphony and high variability in expression. Recently, deep generative models have shown promising results in synthesizing expressive polyphonic instrument sounds from music scores, often using a generic MIDI input. In this work, we propose a... |
2402.08532 | Ching-Wei Chen | Jason Tang, Garrin McGoldrick, Marie Al-Ghossein, Ching-Wei Chen | Captions Are Worth a Thousand Words: Enhancing Product Retrieval with
Pretrained Image-to-Text Models | The 3rd International Workshop on Interactive and Scalable
Information Retrieval Methods for E-Commerce (ISIR-eCom 2024) Held in
conjunction with ACM WSDM - March 8th, 2024 | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | This paper explores the usage of multimodal image-to-text models to enhance
text-based item retrieval. We propose utilizing pre-trained image captioning
and tagging models, such as instructBLIP and CLIP, to generate text-based
product descriptions which are combined with existing text descriptions. Our
work is partic... | [
{
"created": "Tue, 13 Feb 2024 15:36:39 GMT",
"version": "v1"
}
] | 2024-02-14 | [
[
"Tang",
"Jason",
""
],
[
"McGoldrick",
"Garrin",
""
],
[
"Al-Ghossein",
"Marie",
""
],
[
"Chen",
"Ching-Wei",
""
]
] | This paper explores the usage of multimodal image-to-text models to enhance text-based item retrieval. We propose utilizing pre-trained image captioning and tagging models, such as instructBLIP and CLIP, to generate text-based product descriptions which are combined with existing text descriptions. Our work is particul... |
1912.11570 | Alex Lamb | Alex Lamb, Sherjil Ozair, Vikas Verma, David Ha | SketchTransfer: A Challenging New Task for Exploring Detail-Invariance
and the Abstractions Learned by Deep Networks | Accepted WACV 2020 | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep networks have achieved excellent results in perceptual tasks, yet their
ability to generalize to variations not seen during training has come under
increasing scrutiny. In this work we focus on their ability to have invariance
towards the presence or absence of details. For example, humans are able to
watch cart... | [
{
"created": "Wed, 25 Dec 2019 00:38:47 GMT",
"version": "v1"
}
] | 2019-12-30 | [
[
"Lamb",
"Alex",
""
],
[
"Ozair",
"Sherjil",
""
],
[
"Verma",
"Vikas",
""
],
[
"Ha",
"David",
""
]
] | Deep networks have achieved excellent results in perceptual tasks, yet their ability to generalize to variations not seen during training has come under increasing scrutiny. In this work we focus on their ability to have invariance towards the presence or absence of details. For example, humans are able to watch cartoo... |
2403.02635 | Ke Zhang | Ke Zhang, DanDan Zhu, Qiuhan Xu, Hao Zhou and Ce Zheng | PPS-QMIX: Periodically Parameter Sharing for Accelerating Convergence of
Multi-Agent Reinforcement Learning | 10 pages, 5 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Training for multi-agent reinforcement learning(MARL) is a time-consuming
process caused by distribution shift of each agent. One drawback is that
strategy of each agent in MARL is independent but actually in cooperation.
Thus, a vertical issue in multi-agent reinforcement learning is how to
efficiently accelerate tr... | [
{
"created": "Tue, 5 Mar 2024 03:59:01 GMT",
"version": "v1"
}
] | 2024-03-06 | [
[
"Zhang",
"Ke",
""
],
[
"Zhu",
"DanDan",
""
],
[
"Xu",
"Qiuhan",
""
],
[
"Zhou",
"Hao",
""
],
[
"Zheng",
"Ce",
""
]
] | Training for multi-agent reinforcement learning(MARL) is a time-consuming process caused by distribution shift of each agent. One drawback is that strategy of each agent in MARL is independent but actually in cooperation. Thus, a vertical issue in multi-agent reinforcement learning is how to efficiently accelerate trai... |
1101.4718 | Frank Nielsen | Marc Arnaudon and Frank Nielsen | On Approximating the Riemannian 1-Center | 23 pages | Computational Geometry 46.1 (2013): 93-104 | 10.1016/j.comgeo.2012.04.007 | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we generalize the simple Euclidean 1-center approximation
algorithm of Badoiu and Clarkson (2003) to Riemannian geometries and study
accordingly the convergence rate. We then show how to instantiate this generic
algorithm to two particular cases: (1) hyperbolic geometry, and (2) Riemannian
manifold of ... | [
{
"created": "Tue, 25 Jan 2011 04:35:23 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Feb 2012 08:27:12 GMT",
"version": "v2"
},
{
"created": "Wed, 18 Apr 2012 02:23:38 GMT",
"version": "v3"
}
] | 2021-04-29 | [
[
"Arnaudon",
"Marc",
""
],
[
"Nielsen",
"Frank",
""
]
] | In this paper, we generalize the simple Euclidean 1-center approximation algorithm of Badoiu and Clarkson (2003) to Riemannian geometries and study accordingly the convergence rate. We then show how to instantiate this generic algorithm to two particular cases: (1) hyperbolic geometry, and (2) Riemannian manifold of sy... |
2007.04364 | Anamaria Radoi | Andreea Birhala, Catalin Nicolae Ristea, Anamaria Radoi, Liviu
Cristian Dutu | Temporal aggregation of audio-visual modalities for emotion recognition | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Emotion recognition has a pivotal role in affective computing and in
human-computer interaction. The current technological developments lead to
increased possibilities of collecting data about the emotional state of a
person. In general, human perception regarding the emotion transmitted by a
subject is based on voca... | [
{
"created": "Wed, 8 Jul 2020 18:44:15 GMT",
"version": "v1"
}
] | 2020-07-10 | [
[
"Birhala",
"Andreea",
""
],
[
"Ristea",
"Catalin Nicolae",
""
],
[
"Radoi",
"Anamaria",
""
],
[
"Dutu",
"Liviu Cristian",
""
]
] | Emotion recognition has a pivotal role in affective computing and in human-computer interaction. The current technological developments lead to increased possibilities of collecting data about the emotional state of a person. In general, human perception regarding the emotion transmitted by a subject is based on vocal ... |
1811.05864 | Lemei Huang | Lemei Huang, Yu Guan, Xinggong Zhang, Zongming Guo | UtilCache: Effectively and Practicably Reducing Link Cost in
Information-Centric Network | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Minimizing total link cost in Information-Centric Network (ICN) by optimizing
content placement is challenging in both effectiveness and practicality. To
attain better performance, upstream link cost caused by a cache miss should be
considered in addition to content popularity. To make it more practicable, a
content ... | [
{
"created": "Wed, 14 Nov 2018 15:48:33 GMT",
"version": "v1"
}
] | 2018-11-15 | [
[
"Huang",
"Lemei",
""
],
[
"Guan",
"Yu",
""
],
[
"Zhang",
"Xinggong",
""
],
[
"Guo",
"Zongming",
""
]
] | Minimizing total link cost in Information-Centric Network (ICN) by optimizing content placement is challenging in both effectiveness and practicality. To attain better performance, upstream link cost caused by a cache miss should be considered in addition to content popularity. To make it more practicable, a content pl... |
1406.5917 | Mohamed Salah Gouider Dr | Abdelwaheb Ferchichi, Mohamed Salah Gouider | BSTree: an Incremental Indexing Structure for Similarity Search and Real
Time Monitoring of Data Streams | null | Future Information Technology Lecture Notes in Electrical
Engineering Volume 276, 2014, pp 185-190 | null | null | cs.DB | http://creativecommons.org/licenses/by/3.0/ | In this work, a new indexing technique of data streams called BSTree is
proposed. This technique uses the method of data discretization, SAX [4], to
reduce online the dimensionality of data streams. It draws on Btree to build
the index and finally uses an LRV (least Recently visited) pruning technique to
rid the inde... | [
{
"created": "Mon, 23 Jun 2014 14:21:13 GMT",
"version": "v1"
}
] | 2014-06-24 | [
[
"Ferchichi",
"Abdelwaheb",
""
],
[
"Gouider",
"Mohamed Salah",
""
]
] | In this work, a new indexing technique of data streams called BSTree is proposed. This technique uses the method of data discretization, SAX [4], to reduce online the dimensionality of data streams. It draws on Btree to build the index and finally uses an LRV (least Recently visited) pruning technique to rid the index ... |
2104.06509 | Seppo Sierla | Seppo Sierla, Ville Kyrki, Pekka Aarnio, Valeriy Vyatkin | Automatic Assembly Planning based on Digital Product Descriptions | null | Computers in Industry (2018) vol. 97, pp: 34-46 | 10.1016/j.compind.2018.01.013 | null | cs.RO cs.SE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This paper proposes a new concept in which a digital twin derived from a
digital product description will automatically perform assembly planning and
orchestrate the production resources in a manufacturing cell. Thus the
manufacturing cell has generic services with minimal assumptions about what
kind of product will ... | [
{
"created": "Thu, 25 Mar 2021 14:38:34 GMT",
"version": "v1"
}
] | 2021-04-15 | [
[
"Sierla",
"Seppo",
""
],
[
"Kyrki",
"Ville",
""
],
[
"Aarnio",
"Pekka",
""
],
[
"Vyatkin",
"Valeriy",
""
]
] | This paper proposes a new concept in which a digital twin derived from a digital product description will automatically perform assembly planning and orchestrate the production resources in a manufacturing cell. Thus the manufacturing cell has generic services with minimal assumptions about what kind of product will be... |
2103.11247 | Yosi Keller | Aviad Moreshet, Yosi Keller | Attention-Based Multimodal Image Matching | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an attention-based approach for multimodal image patch matching
using a Transformer encoder attending to the feature maps of a multiscale
Siamese CNN. Our encoder is shown to efficiently aggregate multiscale image
embeddings while emphasizing task-specific appearance-invariant image cues. We
also introduce... | [
{
"created": "Sat, 20 Mar 2021 21:14:24 GMT",
"version": "v1"
},
{
"created": "Sun, 24 Sep 2023 11:58:32 GMT",
"version": "v2"
}
] | 2023-09-26 | [
[
"Moreshet",
"Aviad",
""
],
[
"Keller",
"Yosi",
""
]
] | We propose an attention-based approach for multimodal image patch matching using a Transformer encoder attending to the feature maps of a multiscale Siamese CNN. Our encoder is shown to efficiently aggregate multiscale image embeddings while emphasizing task-specific appearance-invariant image cues. We also introduce a... |
2309.08196 | Tianxu Wu | Zhimeng Xin, Tianxu Wu, Shiming Chen, Yixiong Zou, Ling Shao, Xinge
You | ECEA: Extensible Co-Existing Attention for Few-Shot Object Detection | 12 pages, 7 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Few-shot object detection (FSOD) identifies objects from extremely few
annotated samples. Most existing FSOD methods, recently, apply the two-stage
learning paradigm, which transfers the knowledge learned from abundant base
classes to assist the few-shot detectors by learning the global features.
However, such existi... | [
{
"created": "Fri, 15 Sep 2023 06:55:43 GMT",
"version": "v1"
}
] | 2023-09-18 | [
[
"Xin",
"Zhimeng",
""
],
[
"Wu",
"Tianxu",
""
],
[
"Chen",
"Shiming",
""
],
[
"Zou",
"Yixiong",
""
],
[
"Shao",
"Ling",
""
],
[
"You",
"Xinge",
""
]
] | Few-shot object detection (FSOD) identifies objects from extremely few annotated samples. Most existing FSOD methods, recently, apply the two-stage learning paradigm, which transfers the knowledge learned from abundant base classes to assist the few-shot detectors by learning the global features. However, such existing... |
2303.14247 | Bruno Arcanjo Mr | Bruno Arcanjo, Bruno Ferrarini, Michael Milford, Klaus D.
McDonald-Maier and Shoaib Ehsan | A-MuSIC: An Adaptive Ensemble System For Visual Place Recognition In
Changing Environments | null | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual place recognition (VPR) is an essential component of robot navigation
and localization systems that allows them to identify a place using only image
data. VPR is challenging due to the significant changes in a place's appearance
under different illumination throughout the day, with seasonal weather and when
ob... | [
{
"created": "Fri, 24 Mar 2023 19:25:22 GMT",
"version": "v1"
}
] | 2023-03-28 | [
[
"Arcanjo",
"Bruno",
""
],
[
"Ferrarini",
"Bruno",
""
],
[
"Milford",
"Michael",
""
],
[
"McDonald-Maier",
"Klaus D.",
""
],
[
"Ehsan",
"Shoaib",
""
]
] | Visual place recognition (VPR) is an essential component of robot navigation and localization systems that allows them to identify a place using only image data. VPR is challenging due to the significant changes in a place's appearance under different illumination throughout the day, with seasonal weather and when obse... |
0806.1139 | Miguel Andres | Miguel E. Andres, Pedro D'Argenio, Peter van Rossum | Significant Diagnostic Counterexamples in Probabilistic Model Checking | null | null | null | null | cs.LO cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel technique for counterexample generation in
probabilistic model checking of Markov Chains and Markov Decision Processes.
(Finite) paths in counterexamples are grouped together in witnesses that are
likely to provide similar debugging information to the user. We list five
properties that wit... | [
{
"created": "Fri, 6 Jun 2008 13:09:49 GMT",
"version": "v1"
}
] | 2008-06-09 | [
[
"Andres",
"Miguel E.",
""
],
[
"D'Argenio",
"Pedro",
""
],
[
"van Rossum",
"Peter",
""
]
] | This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov Chains and Markov Decision Processes. (Finite) paths in counterexamples are grouped together in witnesses that are likely to provide similar debugging information to the user. We list five properties that witne... |
1807.01395 | Madhumita Sushil | Madhumita Sushil and Simon \v{S}uster and Kim Luyckx and Walter
Daelemans | Patient representation learning and interpretable evaluation using
clinical notes | Accepted manuscript at Journal of Biomedical Informatics | Journal of Biomedical Informatics Volume 84C (2018) pp. 103-113 | 10.1016/j.jbi.2018.06.016 | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We have three contributions in this work: 1. We explore the utility of a
stacked denoising autoencoder and a paragraph vector model to learn
task-independent dense patient representations directly from clinical notes. To
analyze if these representations are transferable across tasks, we evaluate
them in multiple supe... | [
{
"created": "Tue, 3 Jul 2018 23:20:49 GMT",
"version": "v1"
}
] | 2018-07-05 | [
[
"Sushil",
"Madhumita",
""
],
[
"Šuster",
"Simon",
""
],
[
"Luyckx",
"Kim",
""
],
[
"Daelemans",
"Walter",
""
]
] | We have three contributions in this work: 1. We explore the utility of a stacked denoising autoencoder and a paragraph vector model to learn task-independent dense patient representations directly from clinical notes. To analyze if these representations are transferable across tasks, we evaluate them in multiple superv... |
1803.07031 | Agisilaos Chartsias | Agisilaos Chartsias, Thomas Joyce, Giorgos Papanastasiou, Scott
Semple, Michelle Williams, David Newby, Rohan Dharmakumar, Sotirios A.
Tsaftaris | Factorised spatial representation learning: application in
semi-supervised myocardial segmentation | Accepted in MICCAI 2018 | International Conference on Medical Image Computing and Computer
Assisted Intervention (2018) pp. 490-498. Springer, Cham | 10.1007/978-3-030-00934-2_55 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The success and generalisation of deep learning algorithms heavily depend on
learning good feature representations. In medical imaging this entails
representing anatomical information, as well as properties related to the
specific imaging setting. Anatomical information is required to perform further
analysis, wherea... | [
{
"created": "Mon, 19 Mar 2018 16:44:00 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Nov 2018 14:37:12 GMT",
"version": "v2"
}
] | 2020-04-21 | [
[
"Chartsias",
"Agisilaos",
""
],
[
"Joyce",
"Thomas",
""
],
[
"Papanastasiou",
"Giorgos",
""
],
[
"Semple",
"Scott",
""
],
[
"Williams",
"Michelle",
""
],
[
"Newby",
"David",
""
],
[
"Dharmakumar",
"Rohan",
... | The success and generalisation of deep learning algorithms heavily depend on learning good feature representations. In medical imaging this entails representing anatomical information, as well as properties related to the specific imaging setting. Anatomical information is required to perform further analysis, whereas ... |
2101.02000 | Jialiang Zhang | Jialiang Zhang, Lixiang Lin, Jianke Zhu, Steven C.H. Hoi | Weakly-Supervised Multi-Face 3D Reconstruction | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | 3D face reconstruction plays a very important role in many real-world
multimedia applications, including digital entertainment, social media,
affection analysis, and person identification. The de-facto pipeline for
estimating the parametric face model from an image requires to firstly detect
the facial regions with l... | [
{
"created": "Wed, 6 Jan 2021 13:15:21 GMT",
"version": "v1"
}
] | 2021-01-07 | [
[
"Zhang",
"Jialiang",
""
],
[
"Lin",
"Lixiang",
""
],
[
"Zhu",
"Jianke",
""
],
[
"Hoi",
"Steven C. H.",
""
]
] | 3D face reconstruction plays a very important role in many real-world multimedia applications, including digital entertainment, social media, affection analysis, and person identification. The de-facto pipeline for estimating the parametric face model from an image requires to firstly detect the facial regions with lan... |
1605.02824 | Xiaowang Zhang | Zhihui Liu and Zhiyong Feng and Xiaowang Zhang and Xin Wang and
Guozheng Rao | RORS: Enhanced Rule-based OWL Reasoning on Spark | 12 pages | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rule-based OWL reasoning is to compute the deductive closure of an
ontology by applying RDF/RDFS and OWL entailment rules. The performance of the
rule-based OWL reasoning is often sensitive to the rule execution order. In
this paper, we present an approach to enhancing the performance of the
rule-based OWL reason... | [
{
"created": "Tue, 10 May 2016 02:27:09 GMT",
"version": "v1"
}
] | 2016-10-04 | [
[
"Liu",
"Zhihui",
""
],
[
"Feng",
"Zhiyong",
""
],
[
"Zhang",
"Xiaowang",
""
],
[
"Wang",
"Xin",
""
],
[
"Rao",
"Guozheng",
""
]
] | The rule-based OWL reasoning is to compute the deductive closure of an ontology by applying RDF/RDFS and OWL entailment rules. The performance of the rule-based OWL reasoning is often sensitive to the rule execution order. In this paper, we present an approach to enhancing the performance of the rule-based OWL reasonin... |
2402.11168 | Amit Dhurandhar | Amit Dhurandhar, Swagatam Haldar, Dennis Wei and Karthikeyan Natesan
Ramamurthy | Trust Regions for Explanations via Black-Box Probabilistic Certification | Accepted to ICML 2024 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Given the black box nature of machine learning models, a plethora of
explainability methods have been developed to decipher the factors behind
individual decisions. In this paper, we introduce a novel problem of black box
(probabilistic) explanation certification. We ask the question: Given a black
box model with onl... | [
{
"created": "Sat, 17 Feb 2024 02:26:14 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Feb 2024 00:05:25 GMT",
"version": "v2"
},
{
"created": "Wed, 5 Jun 2024 16:36:21 GMT",
"version": "v3"
}
] | 2024-06-06 | [
[
"Dhurandhar",
"Amit",
""
],
[
"Haldar",
"Swagatam",
""
],
[
"Wei",
"Dennis",
""
],
[
"Ramamurthy",
"Karthikeyan Natesan",
""
]
] | Given the black box nature of machine learning models, a plethora of explainability methods have been developed to decipher the factors behind individual decisions. In this paper, we introduce a novel problem of black box (probabilistic) explanation certification. We ask the question: Given a black box model with only ... |
2106.14060 | Mohammed El Hassouni | Zakariae Abbad, Ahmed Drissi El Maliani, Said Ouatik El Alaoui,
Mohammed El Hassouni | A Graph-based approach to derive the geodesic distance on Statistical
manifolds: Application to Multimedia Information Retrieval | null | null | 10.1109/WINCOM50532.2020.9272434 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we leverage the properties of non-Euclidean Geometry to define
the Geodesic distance (GD) on the space of statistical manifolds. The Geodesic
distance is a real and intuitive similarity measure that is a good alternative
to the purely statistical and extensively used Kullback-Leibler divergence
(KLD). ... | [
{
"created": "Sat, 26 Jun 2021 16:39:54 GMT",
"version": "v1"
}
] | 2021-06-29 | [
[
"Abbad",
"Zakariae",
""
],
[
"Maliani",
"Ahmed Drissi El",
""
],
[
"Alaoui",
"Said Ouatik El",
""
],
[
"Hassouni",
"Mohammed El",
""
]
] | In this paper, we leverage the properties of non-Euclidean Geometry to define the Geodesic distance (GD) on the space of statistical manifolds. The Geodesic distance is a real and intuitive similarity measure that is a good alternative to the purely statistical and extensively used Kullback-Leibler divergence (KLD). De... |
1810.04361 | Shrinu Kushagra | Shrinu Kushagra, Shai Ben-David, Ihab Ilyas | Semi-supervised clustering for de-duplication | null | Proceedings of the 22nd International Conference on Artificial
Intelligence and Statistics (AISTATS) 2019 | null | PMLR 89:1659-1667, 2019 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data de-duplication is the task of detecting multiple records that correspond
to the same real-world entity in a database. In this work, we view
de-duplication as a clustering problem where the goal is to put records
corresponding to the same physical entity in the same cluster and putting
records corresponding to di... | [
{
"created": "Wed, 10 Oct 2018 04:12:50 GMT",
"version": "v1"
}
] | 2020-05-27 | [
[
"Kushagra",
"Shrinu",
""
],
[
"Ben-David",
"Shai",
""
],
[
"Ilyas",
"Ihab",
""
]
] | Data de-duplication is the task of detecting multiple records that correspond to the same real-world entity in a database. In this work, we view de-duplication as a clustering problem where the goal is to put records corresponding to the same physical entity in the same cluster and putting records corresponding to diff... |
2310.14222 | Yong Du | Yong Du, Jiahui Zhan, Shengfeng He, Xinzhe Li, Junyu Dong, Sheng Chen,
and Ming-Hsuan Yang | One-for-All: Towards Universal Domain Translation with a Single StyleGAN | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel translation model, UniTranslator, for
transforming representations between visually distinct domains under conditions
of limited training data and significant visual differences. The main idea
behind our approach is leveraging the domain-neutral capabilities of CLIP as a
bridging mec... | [
{
"created": "Sun, 22 Oct 2023 08:02:55 GMT",
"version": "v1"
}
] | 2023-10-24 | [
[
"Du",
"Yong",
""
],
[
"Zhan",
"Jiahui",
""
],
[
"He",
"Shengfeng",
""
],
[
"Li",
"Xinzhe",
""
],
[
"Dong",
"Junyu",
""
],
[
"Chen",
"Sheng",
""
],
[
"Yang",
"Ming-Hsuan",
""
]
] | In this paper, we propose a novel translation model, UniTranslator, for transforming representations between visually distinct domains under conditions of limited training data and significant visual differences. The main idea behind our approach is leveraging the domain-neutral capabilities of CLIP as a bridging mecha... |
1404.1237 | Giulio Coluccia | Giulio Coluccia, Aline Roumy, Enrico Magli | Operational Rate-Distortion Performance of Single-source and Distributed
Compressed Sensing | To appear in IEEE Transactions on Communications | null | 10.1109/TCOMM.2014.2316176 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider correlated and distributed sources without cooperation at the
encoder. For these sources, we derive the best achievable performance in the
rate-distortion sense of any distributed compressed sensing scheme, under the
constraint of high--rate quantization. Moreover, under this model we derive a
closed--for... | [
{
"created": "Fri, 4 Apr 2014 12:45:13 GMT",
"version": "v1"
}
] | 2014-04-10 | [
[
"Coluccia",
"Giulio",
""
],
[
"Roumy",
"Aline",
""
],
[
"Magli",
"Enrico",
""
]
] | We consider correlated and distributed sources without cooperation at the encoder. For these sources, we derive the best achievable performance in the rate-distortion sense of any distributed compressed sensing scheme, under the constraint of high--rate quantization. Moreover, under this model we derive a closed--form ... |
1811.08116 | Hua Chai | Hua Chai | Traffic-aware Threshold Adjustment for NFV Scaling using DDPG | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current solutions mostly focus on how to predict traffic, rather than
observing traffic characteristics in a specific NFV scenario. So, most of them
use a uniform threshold to scale in/out. In real NFV scenario, each VNF may
serve the one or more flows, and the characteristics of these flows are
completely different,... | [
{
"created": "Tue, 20 Nov 2018 08:18:52 GMT",
"version": "v1"
}
] | 2018-11-21 | [
[
"Chai",
"Hua",
""
]
] | Current solutions mostly focus on how to predict traffic, rather than observing traffic characteristics in a specific NFV scenario. So, most of them use a uniform threshold to scale in/out. In real NFV scenario, each VNF may serve the one or more flows, and the characteristics of these flows are completely different, a... |
2304.09502 | Jeonghwan Kim | Jeonghwan Kim (1), Mi-Gyeong Gwon (1), Hyunwoo Park (1), Hyukmin Kwon
(2), Gi-Mun Um (2), Wonjun Kim (1) ((1) Konkuk University, (2) Electronics
and Telecommunications Research Institute) | Sampling is Matter: Point-guided 3D Human Mesh Reconstruction | Accepted by CVPR 2023 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a simple yet powerful method for 3D human mesh
reconstruction from a single RGB image. Most recently, the non-local
interactions of the whole mesh vertices have been effectively estimated in the
transformer while the relationship between body parts also has begun to be
handled via the graph model.... | [
{
"created": "Wed, 19 Apr 2023 08:45:26 GMT",
"version": "v1"
}
] | 2023-04-20 | [
[
"Kim",
"Jeonghwan",
""
],
[
"Gwon",
"Mi-Gyeong",
""
],
[
"Park",
"Hyunwoo",
""
],
[
"Kwon",
"Hyukmin",
""
],
[
"Um",
"Gi-Mun",
""
],
[
"Kim",
"Wonjun",
""
]
] | This paper presents a simple yet powerful method for 3D human mesh reconstruction from a single RGB image. Most recently, the non-local interactions of the whole mesh vertices have been effectively estimated in the transformer while the relationship between body parts also has begun to be handled via the graph model. E... |
2211.10688 | Marina Speranskaya | Marina Speranskaya, Sameh Methias, Benjamin Roth | ReInform: Selecting paths with reinforcement learning for contextualized
link prediction | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose to use reinforcement learning to inform transformer-based
contextualized link prediction models by providing paths that are most useful
for predicting the correct answer. This is in contrast to previous approaches,
that either used reinforcement learning (RL) to directly search for the answer,
or based the... | [
{
"created": "Sat, 19 Nov 2022 13:04:53 GMT",
"version": "v1"
},
{
"created": "Mon, 23 Jan 2023 11:29:44 GMT",
"version": "v2"
}
] | 2023-01-24 | [
[
"Speranskaya",
"Marina",
""
],
[
"Methias",
"Sameh",
""
],
[
"Roth",
"Benjamin",
""
]
] | We propose to use reinforcement learning to inform transformer-based contextualized link prediction models by providing paths that are most useful for predicting the correct answer. This is in contrast to previous approaches, that either used reinforcement learning (RL) to directly search for the answer, or based their... |
2002.00461 | Sarwan Ali | Asad Ullah, Sarwan Ali, Imdadullah Khan, Muhammad Asad Khan, Safiullah
Faizullah | Effect of Analysis Window and Feature Selection on Classification of
Hand Movements Using EMG Signal | Accepted to Intelligent Systems Conference (IntelliSys) 2020 | null | null | null | cs.CV eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Electromyography (EMG) signals have been successfully employed for driving
prosthetic limbs of a single or double degree of freedom. This principle works
by using the amplitude of the EMG signals to decide between one or two simpler
movements. This method underperforms as compare to the contemporary advances
done at ... | [
{
"created": "Sun, 2 Feb 2020 19:03:23 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Feb 2020 07:58:24 GMT",
"version": "v2"
},
{
"created": "Sun, 15 Mar 2020 23:07:48 GMT",
"version": "v3"
},
{
"created": "Tue, 11 Aug 2020 18:21:46 GMT",
"version": "v4"
}
] | 2020-08-13 | [
[
"Ullah",
"Asad",
""
],
[
"Ali",
"Sarwan",
""
],
[
"Khan",
"Imdadullah",
""
],
[
"Khan",
"Muhammad Asad",
""
],
[
"Faizullah",
"Safiullah",
""
]
] | Electromyography (EMG) signals have been successfully employed for driving prosthetic limbs of a single or double degree of freedom. This principle works by using the amplitude of the EMG signals to decide between one or two simpler movements. This method underperforms as compare to the contemporary advances done at th... |
2312.02409 | Yizhe Zhao | Yiqian Gan, Hao Xiao, Yizhe Zhao, Ethan Zhang, Zhe Huang, Xin Ye,
Lingting Ge | MGTR: Multi-Granular Transformer for Motion Prediction with LiDAR | Accepted to ICRA 2024 | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motion prediction has been an essential component of autonomous driving
systems since it handles highly uncertain and complex scenarios involving
moving agents of different types. In this paper, we propose a Multi-Granular
TRansformer (MGTR) framework, an encoder-decoder network that exploits context
features in diff... | [
{
"created": "Tue, 5 Dec 2023 00:48:31 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Feb 2024 19:56:54 GMT",
"version": "v2"
}
] | 2024-02-07 | [
[
"Gan",
"Yiqian",
""
],
[
"Xiao",
"Hao",
""
],
[
"Zhao",
"Yizhe",
""
],
[
"Zhang",
"Ethan",
""
],
[
"Huang",
"Zhe",
""
],
[
"Ye",
"Xin",
""
],
[
"Ge",
"Lingting",
""
]
] | Motion prediction has been an essential component of autonomous driving systems since it handles highly uncertain and complex scenarios involving moving agents of different types. In this paper, we propose a Multi-Granular TRansformer (MGTR) framework, an encoder-decoder network that exploits context features in differ... |
2205.02070 | Xian Wu | Xian Wu, Chen Wang, Hongbo Fu, Ariel Shamir, Song-Hai Zhang, Shi-Min
Hu | DeepPortraitDrawing: Generating Human Body Images from Freehand Sketches | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Researchers have explored various ways to generate realistic images from
freehand sketches, e.g., for objects and human faces. However, how to generate
realistic human body images from sketches is still a challenging problem. It
is, first because of the sensitivity to human shapes, second because of the
complexity of... | [
{
"created": "Wed, 4 May 2022 14:02:45 GMT",
"version": "v1"
},
{
"created": "Fri, 20 May 2022 17:00:19 GMT",
"version": "v2"
}
] | 2022-05-23 | [
[
"Wu",
"Xian",
""
],
[
"Wang",
"Chen",
""
],
[
"Fu",
"Hongbo",
""
],
[
"Shamir",
"Ariel",
""
],
[
"Zhang",
"Song-Hai",
""
],
[
"Hu",
"Shi-Min",
""
]
] | Researchers have explored various ways to generate realistic images from freehand sketches, e.g., for objects and human faces. However, how to generate realistic human body images from sketches is still a challenging problem. It is, first because of the sensitivity to human shapes, second because of the complexity of h... |
1912.07824 | Chao Li | Chao Li and Balaji Palanisamy | SilentDelivery: Practical Timed-delivery of Private Information using
Smart Contracts | This paper has been accepted by IEEE Transactions on Services
Computing | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes SilentDelivery, a secure, scalable and cost-efficient
protocol for implementing timed information delivery service in a decentralized
blockchain network. SilentDelivery employs a novel combination of threshold
secret sharing and decentralized smart contracts. The protocol maintains shares
of the d... | [
{
"created": "Tue, 17 Dec 2019 05:22:16 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Jul 2021 07:53:00 GMT",
"version": "v2"
}
] | 2021-07-20 | [
[
"Li",
"Chao",
""
],
[
"Palanisamy",
"Balaji",
""
]
] | This paper proposes SilentDelivery, a secure, scalable and cost-efficient protocol for implementing timed information delivery service in a decentralized blockchain network. SilentDelivery employs a novel combination of threshold secret sharing and decentralized smart contracts. The protocol maintains shares of the dec... |
2405.14507 | Chufan Shi | Chufan Shi, Cheng Yang, Xinyu Zhu, Jiahao Wang, Taiqiang Wu, Siheng
Li, Deng Cai, Yujiu Yang, Yu Meng | Unchosen Experts Can Contribute Too: Unleashing MoE Models' Power by
Self-Contrast | null | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Mixture-of-Experts (MoE) has emerged as a prominent architecture for scaling
model size while maintaining computational efficiency. In MoE, each token in
the input sequence activates a different subset of experts determined by a
routing mechanism. However, the unchosen experts in MoE models do not
contribute to the o... | [
{
"created": "Thu, 23 May 2024 12:45:29 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Shi",
"Chufan",
""
],
[
"Yang",
"Cheng",
""
],
[
"Zhu",
"Xinyu",
""
],
[
"Wang",
"Jiahao",
""
],
[
"Wu",
"Taiqiang",
""
],
[
"Li",
"Siheng",
""
],
[
"Cai",
"Deng",
""
],
[
"Yang",
"Yujiu",
... | Mixture-of-Experts (MoE) has emerged as a prominent architecture for scaling model size while maintaining computational efficiency. In MoE, each token in the input sequence activates a different subset of experts determined by a routing mechanism. However, the unchosen experts in MoE models do not contribute to the out... |
1709.04095 | Audrey Durand | Audrey Durand, Jean-Alexandre Beaumont, Christian Gagne, Michel Lemay,
Sebastien Paquet | Query Completion Using Bandits for Engines Aggregation | Presented at The 3rd Multidisciplinary Conference on Reinforcement
Learning and Decision Making (RLDM), June 11-14 (2017), University of
Michigan, USA | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Assisting users by suggesting completed queries as they type is a common
feature of search systems known as query auto-completion. A query
auto-completion engine may use prior signals and available information (e.g.,
user is anonymous, user has a history, user visited the site before the search
or not, etc.) in order... | [
{
"created": "Wed, 13 Sep 2017 00:44:09 GMT",
"version": "v1"
}
] | 2017-09-14 | [
[
"Durand",
"Audrey",
""
],
[
"Beaumont",
"Jean-Alexandre",
""
],
[
"Gagne",
"Christian",
""
],
[
"Lemay",
"Michel",
""
],
[
"Paquet",
"Sebastien",
""
]
] | Assisting users by suggesting completed queries as they type is a common feature of search systems known as query auto-completion. A query auto-completion engine may use prior signals and available information (e.g., user is anonymous, user has a history, user visited the site before the search or not, etc.) in order t... |
1911.02559 | Zhiqiang Shen | Zhiqiang Shen and Harsh Maheshwari and Weichen Yao and Marios Savvides | SCL: Towards Accurate Domain Adaptive Object Detection via Gradient
Detach Based Stacked Complementary Losses | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unsupervised domain adaptive object detection aims to learn a robust detector
in the domain shift circumstance, where the training (source) domain is
label-rich with bounding box annotations, while the testing (target) domain is
label-agnostic and the feature distributions between training and testing
domains are dis... | [
{
"created": "Wed, 6 Nov 2019 18:59:01 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Nov 2019 18:21:36 GMT",
"version": "v2"
},
{
"created": "Thu, 21 Nov 2019 05:43:14 GMT",
"version": "v3"
}
] | 2019-11-22 | [
[
"Shen",
"Zhiqiang",
""
],
[
"Maheshwari",
"Harsh",
""
],
[
"Yao",
"Weichen",
""
],
[
"Savvides",
"Marios",
""
]
] | Unsupervised domain adaptive object detection aims to learn a robust detector in the domain shift circumstance, where the training (source) domain is label-rich with bounding box annotations, while the testing (target) domain is label-agnostic and the feature distributions between training and testing domains are dissi... |
2308.05096 | Srivatsan Sridhar | Joachim Neu, Srivatsan Sridhar, Lei Yang, David Tse | Optimal Flexible Consensus and its Application to Ethereum | To be published at the IEEE Symposium on Security & Privacy 2024 | null | null | null | cs.DC cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Classic BFT consensus protocols guarantee safety and liveness for all clients
if fewer than one-third of replicas are faulty. However, in applications such
as high-value payments, some clients may want to prioritize safety over
liveness. Flexible consensus allows each client to opt for a higher safety
resilience, alb... | [
{
"created": "Wed, 9 Aug 2023 17:46:01 GMT",
"version": "v1"
},
{
"created": "Thu, 10 Aug 2023 02:28:14 GMT",
"version": "v2"
},
{
"created": "Sun, 3 Dec 2023 21:34:34 GMT",
"version": "v3"
}
] | 2023-12-05 | [
[
"Neu",
"Joachim",
""
],
[
"Sridhar",
"Srivatsan",
""
],
[
"Yang",
"Lei",
""
],
[
"Tse",
"David",
""
]
] | Classic BFT consensus protocols guarantee safety and liveness for all clients if fewer than one-third of replicas are faulty. However, in applications such as high-value payments, some clients may want to prioritize safety over liveness. Flexible consensus allows each client to opt for a higher safety resilience, albei... |
2303.03475 | Youngseo Kim | Youngseo Kim, Danushka Edirimanna, Michael Wilbur, Philip Pugliese,
Aron Laszka, Abhishek Dubey, Samitha Samaranayake | Rolling Horizon based Temporal Decomposition for the Offline Pickup and
Delivery Problem with Time Windows | null | null | null | null | cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The offline pickup and delivery problem with time windows (PDPTW) is a
classical combinatorial optimization problem in the transportation community,
which has proven to be very challenging computationally. Due to the complexity
of the problem, practical problem instances can be solved only via heuristics,
which trade... | [
{
"created": "Mon, 6 Mar 2023 20:07:05 GMT",
"version": "v1"
}
] | 2023-03-08 | [
[
"Kim",
"Youngseo",
""
],
[
"Edirimanna",
"Danushka",
""
],
[
"Wilbur",
"Michael",
""
],
[
"Pugliese",
"Philip",
""
],
[
"Laszka",
"Aron",
""
],
[
"Dubey",
"Abhishek",
""
],
[
"Samaranayake",
"Samitha",
""
... | The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very challenging computationally. Due to the complexity of the problem, practical problem instances can be solved only via heuristics, which trade-o... |
1302.3608 | Sylvie Thiebaux | Sylvie Thiebaux, Marie-Odile Cordier, Olivier Jehl, Jean-Paul Krivine | Supply Restoration in Power Distribution Systems - A Case Study in
Integrating Model-Based Diagnosis and Repair Planning | Appears in Proceedings of the Twelfth Conference on Uncertainty in
Artificial Intelligence (UAI1996) | null | null | UAI-P-1996-PG-525-532 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Integrating diagnosis and repair is particularly crucial when gaining
sufficient information to discriminate between several candidate diagnoses
requires carrying out some repair actions. A typical case is supply restoration
in a faulty power distribution system. This problem, which is a major concern
for electricity... | [
{
"created": "Wed, 13 Feb 2013 14:17:05 GMT",
"version": "v1"
}
] | 2013-02-18 | [
[
"Thiebaux",
"Sylvie",
""
],
[
"Cordier",
"Marie-Odile",
""
],
[
"Jehl",
"Olivier",
""
],
[
"Krivine",
"Jean-Paul",
""
]
] | Integrating diagnosis and repair is particularly crucial when gaining sufficient information to discriminate between several candidate diagnoses requires carrying out some repair actions. A typical case is supply restoration in a faulty power distribution system. This problem, which is a major concern for electricity d... |
1905.10784 | Ioan Marius Bilasco PhD | Romain Belmonte, Benjamin Allaert, Pierre Tirilly, Ioan Marius
Bilasco, Chaabane Djeraba, Nicu Sebe | Impact of facial landmark localization on facial expression recognition | null | null | 10.1109/TAFFC.2021.3124142 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although facial landmark localization (FLL) approaches are becoming
increasingly accurate for characterizing facial regions, one question remains
unanswered: what is the impact of these approaches on subsequent related tasks?
In this paper, the focus is put on facial expression recognition (FER), where
facial landmar... | [
{
"created": "Sun, 26 May 2019 10:50:46 GMT",
"version": "v1"
},
{
"created": "Sun, 20 Dec 2020 19:17:40 GMT",
"version": "v2"
},
{
"created": "Mon, 19 Jul 2021 07:11:14 GMT",
"version": "v3"
}
] | 2021-11-12 | [
[
"Belmonte",
"Romain",
""
],
[
"Allaert",
"Benjamin",
""
],
[
"Tirilly",
"Pierre",
""
],
[
"Bilasco",
"Ioan Marius",
""
],
[
"Djeraba",
"Chaabane",
""
],
[
"Sebe",
"Nicu",
""
]
] | Although facial landmark localization (FLL) approaches are becoming increasingly accurate for characterizing facial regions, one question remains unanswered: what is the impact of these approaches on subsequent related tasks? In this paper, the focus is put on facial expression recognition (FER), where facial landmarks... |
1812.00619 | Evgeniy Shishkin | Evgeniy Shishkin | Debugging Smart Contract's Business Logic Using Symbolic Model-Checking | 16 pages | null | null | null | cs.LO cs.CR cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Smart contracts are a special type of programs running inside a blockchain.
Immutable and transparent, they provide means to implement fault-tolerant and
censorship-resistant services. Unfortunately, its immutability causes a serious
challenge of ensuring that a business logic and implementation is correct
upfront, b... | [
{
"created": "Mon, 3 Dec 2018 09:25:22 GMT",
"version": "v1"
}
] | 2018-12-04 | [
[
"Shishkin",
"Evgeniy",
""
]
] | Smart contracts are a special type of programs running inside a blockchain. Immutable and transparent, they provide means to implement fault-tolerant and censorship-resistant services. Unfortunately, its immutability causes a serious challenge of ensuring that a business logic and implementation is correct upfront, bef... |
2309.08952 | Jiaan Wang | Jiaan Wang, Yunlong Liang, Zengkui Sun, Yuxuan Cao, Jiarong Xu,
Fandong Meng | Cross-Lingual Knowledge Editing in Large Language Models | Accepted to ACL 2024 main conference | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge editing aims to change language models' performance on several
special cases (i.e., editing scope) by infusing the corresponding expected
knowledge into them. With the recent advancements in large language models
(LLMs), knowledge editing has been shown as a promising technique to adapt LLMs
to new knowledg... | [
{
"created": "Sat, 16 Sep 2023 11:07:52 GMT",
"version": "v1"
},
{
"created": "Thu, 30 May 2024 13:49:47 GMT",
"version": "v2"
}
] | 2024-05-31 | [
[
"Wang",
"Jiaan",
""
],
[
"Liang",
"Yunlong",
""
],
[
"Sun",
"Zengkui",
""
],
[
"Cao",
"Yuxuan",
""
],
[
"Xu",
"Jiarong",
""
],
[
"Meng",
"Fandong",
""
]
] | Knowledge editing aims to change language models' performance on several special cases (i.e., editing scope) by infusing the corresponding expected knowledge into them. With the recent advancements in large language models (LLMs), knowledge editing has been shown as a promising technique to adapt LLMs to new knowledge ... |
2312.06662 | Agrim Gupta | Agrim Gupta, Lijun Yu, Kihyuk Sohn, Xiuye Gu, Meera Hahn, Li Fei-Fei,
Irfan Essa, Lu Jiang, Jos\'e Lezama | Photorealistic Video Generation with Diffusion Models | Project website https://walt-video-diffusion.github.io/ | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | We present W.A.L.T, a transformer-based approach for photorealistic video
generation via diffusion modeling. Our approach has two key design decisions.
First, we use a causal encoder to jointly compress images and videos within a
unified latent space, enabling training and generation across modalities.
Second, for me... | [
{
"created": "Mon, 11 Dec 2023 18:59:57 GMT",
"version": "v1"
}
] | 2023-12-12 | [
[
"Gupta",
"Agrim",
""
],
[
"Yu",
"Lijun",
""
],
[
"Sohn",
"Kihyuk",
""
],
[
"Gu",
"Xiuye",
""
],
[
"Hahn",
"Meera",
""
],
[
"Fei-Fei",
"Li",
""
],
[
"Essa",
"Irfan",
""
],
[
"Jiang",
"Lu",
""... | We present W.A.L.T, a transformer-based approach for photorealistic video generation via diffusion modeling. Our approach has two key design decisions. First, we use a causal encoder to jointly compress images and videos within a unified latent space, enabling training and generation across modalities. Second, for memo... |
1909.02629 | Ming-Hung Shih | Trong Duc Nguyen, Ming-Hung Shih, Sai Sree Parvathaneni, Bojian Xu,
Divesh Srivastava, Srikanta Tirthapura | Random Sampling for Group-By Queries | null | null | null | null | cs.DB cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Random sampling has been widely used in approximate query processing on large
databases, due to its potential to significantly reduce resource usage and
response times, at the cost of a small approximation error. We consider random
sampling for answering the ubiquitous class of group-by queries, which first
group dat... | [
{
"created": "Thu, 5 Sep 2019 20:52:42 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Sep 2019 16:15:22 GMT",
"version": "v2"
},
{
"created": "Thu, 12 Sep 2019 07:14:41 GMT",
"version": "v3"
}
] | 2019-09-13 | [
[
"Nguyen",
"Trong Duc",
""
],
[
"Shih",
"Ming-Hung",
""
],
[
"Parvathaneni",
"Sai Sree",
""
],
[
"Xu",
"Bojian",
""
],
[
"Srivastava",
"Divesh",
""
],
[
"Tirthapura",
"Srikanta",
""
]
] | Random sampling has been widely used in approximate query processing on large databases, due to its potential to significantly reduce resource usage and response times, at the cost of a small approximation error. We consider random sampling for answering the ubiquitous class of group-by queries, which first group data ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.