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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1903.10092 | Arya D. McCarthy | Arya D. McCarthy, Tongfei Chen, Seth Ebner | An Exact No Free Lunch Theorem for Community Detection | null | Complex Networks and Their Applications VIII. COMPLEX NETWORKS
2019. Studies in Computational Intelligence, vol 881 | 10.1007/978-3-030-36687-2_15 | null | cs.SI cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A precondition for a No Free Lunch theorem is evaluation with a loss function
which does not assume a priori superiority of some outputs over others. A
previous result for community detection by Peel et al. (2017) relies on a
mismatch between the loss function and the problem domain. The loss function
computes an exp... | [
{
"created": "Mon, 25 Mar 2019 01:03:28 GMT",
"version": "v1"
}
] | 2020-05-22 | [
[
"McCarthy",
"Arya D.",
""
],
[
"Chen",
"Tongfei",
""
],
[
"Ebner",
"Seth",
""
]
] | A precondition for a No Free Lunch theorem is evaluation with a loss function which does not assume a priori superiority of some outputs over others. A previous result for community detection by Peel et al. (2017) relies on a mismatch between the loss function and the problem domain. The loss function computes an expec... |
2407.21220 | Camilo Andr\'es Mart\'inez Mej\'ia | C. A. Mart\'inez-Mej\'ia, J. Solano, J. Breier, D. Bucko, X. Hou | DeepBaR: Fault Backdoor Attack on Deep Neural Network Layers | null | null | null | null | cs.LG cs.CR cs.CV | http://creativecommons.org/licenses/by/4.0/ | Machine Learning using neural networks has received prominent attention
recently because of its success in solving a wide variety of computational
tasks, in particular in the field of computer vision. However, several works
have drawn attention to potential security risks involved with the training and
implementation... | [
{
"created": "Tue, 30 Jul 2024 22:14:47 GMT",
"version": "v1"
}
] | 2024-08-01 | [
[
"Martínez-Mejía",
"C. A.",
""
],
[
"Solano",
"J.",
""
],
[
"Breier",
"J.",
""
],
[
"Bucko",
"D.",
""
],
[
"Hou",
"X.",
""
]
] | Machine Learning using neural networks has received prominent attention recently because of its success in solving a wide variety of computational tasks, in particular in the field of computer vision. However, several works have drawn attention to potential security risks involved with the training and implementation o... |
2311.03608 | Burkhard Schipper | Gaia Belardinelli, Burkhard C. Schipper | Implicit Knowledge in Unawareness Structures | 46 pages. arXiv admin note: substantial text overlap with
arXiv:2307.05041 author note: This is the full version of the
arXiv:2307.05041 | null | null | null | cs.LO cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Awareness structures by Fagin and Halpern (1988) (FH) feature a syntactic
awareness correspondence and accessibility relations modeling implicit
knowledge. They are a flexible model of unawareness, and best interpreted from
a outside modeler's perspective. Unawareness structures by Heifetz, Meier, and
Schipper (2006,... | [
{
"created": "Mon, 6 Nov 2023 23:26:21 GMT",
"version": "v1"
},
{
"created": "Fri, 17 May 2024 17:57:22 GMT",
"version": "v2"
}
] | 2024-05-21 | [
[
"Belardinelli",
"Gaia",
""
],
[
"Schipper",
"Burkhard C.",
""
]
] | Awareness structures by Fagin and Halpern (1988) (FH) feature a syntactic awareness correspondence and accessibility relations modeling implicit knowledge. They are a flexible model of unawareness, and best interpreted from a outside modeler's perspective. Unawareness structures by Heifetz, Meier, and Schipper (2006, 2... |
1910.06079 | Tomek Korbak | Tomasz Korbak and Julian Zubek and {\L}ukasz Kuci\'nski and Piotr
Mi{\l}o\'s and Joanna R\k{a}czaszek-Leonardi | Developmentally motivated emergence of compositional communication via
template transfer | Accepted for NeurIPS 2019 workshop Emergent Communication: Towards
Natural Language | null | null | null | cs.LG cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper explores a novel approach to achieving emergent compositional
communication in multi-agent systems. We propose a training regime implementing
template transfer, the idea of carrying over learned biases across contexts. In
our method, a sender-receiver pair is first trained with disentangled loss
functions ... | [
{
"created": "Fri, 4 Oct 2019 16:04:53 GMT",
"version": "v1"
}
] | 2019-10-15 | [
[
"Korbak",
"Tomasz",
""
],
[
"Zubek",
"Julian",
""
],
[
"Kuciński",
"Łukasz",
""
],
[
"Miłoś",
"Piotr",
""
],
[
"Rączaszek-Leonardi",
"Joanna",
""
]
] | This paper explores a novel approach to achieving emergent compositional communication in multi-agent systems. We propose a training regime implementing template transfer, the idea of carrying over learned biases across contexts. In our method, a sender-receiver pair is first trained with disentangled loss functions an... |
1903.00153 | J\'er\'emy Dubut | Juraj Kol\v{c}\'ak, Ichiro Hasuo, J\'er\'emy Dubut, Shin-ya Katsumata,
David Sprunger and Akihisa Yamada | Relational Differential Dynamic Logic | null | null | null | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | In the field of quality assurance of hybrid systems (that combine continuous
physical dynamics and discrete digital control), Platzer's differential dynamic
logic (dL) is widely recognized as a deductive verification method with solid
mathematical foundations and sophisticated tool support. Motivated by
benchmarks pr... | [
{
"created": "Fri, 1 Mar 2019 04:42:35 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Mar 2020 07:01:31 GMT",
"version": "v2"
}
] | 2020-03-13 | [
[
"Kolčák",
"Juraj",
""
],
[
"Hasuo",
"Ichiro",
""
],
[
"Dubut",
"Jérémy",
""
],
[
"Katsumata",
"Shin-ya",
""
],
[
"Sprunger",
"David",
""
],
[
"Yamada",
"Akihisa",
""
]
] | In the field of quality assurance of hybrid systems (that combine continuous physical dynamics and discrete digital control), Platzer's differential dynamic logic (dL) is widely recognized as a deductive verification method with solid mathematical foundations and sophisticated tool support. Motivated by benchmarks prov... |
2210.00715 | Chahat Singh | Chahat Deep Singh, Riya Kumari, Cornelia Ferm\"uller, Nitin J. Sanket,
Yiannis Aloimonos | WorldGen: A Large Scale Generative Simulator | null | Under review in ICRA 2023 | null | null | cs.CV cs.RO | http://creativecommons.org/licenses/by/4.0/ | In the era of deep learning, data is the critical determining factor in the
performance of neural network models. Generating large datasets suffers from
various difficulties such as scalability, cost efficiency and photorealism. To
avoid expensive and strenuous dataset collection and annotations, researchers
have inc... | [
{
"created": "Mon, 3 Oct 2022 05:07:42 GMT",
"version": "v1"
}
] | 2022-10-04 | [
[
"Singh",
"Chahat Deep",
""
],
[
"Kumari",
"Riya",
""
],
[
"Fermüller",
"Cornelia",
""
],
[
"Sanket",
"Nitin J.",
""
],
[
"Aloimonos",
"Yiannis",
""
]
] | In the era of deep learning, data is the critical determining factor in the performance of neural network models. Generating large datasets suffers from various difficulties such as scalability, cost efficiency and photorealism. To avoid expensive and strenuous dataset collection and annotations, researchers have incli... |
2106.15965 | Michael Yuhas | Michael Yuhas, Yeli Feng, Daniel Jun Xian Ng, Zahra Rahiminasab,
Arvind Easwaran | Embedded out-of-distribution detection on an autonomous robot platform | 6 pages, 8 figures | Yuhas, M., Feng, Y., Ng, D. J. X., Rahiminasab, Z., & Easwaran, A.
(2021, May). Embedded out-of-distribution detection on an autonomous robot
platform. In Proceedings of the Workshop on Design Automation for CPS and IoT
(pp. 13-18) | 10.1145/3445034.3460509 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning (ML) is actively finding its way into modern cyber-physical
systems (CPS), many of which are safety-critical real-time systems. It is well
known that ML outputs are not reliable when testing data are novel with regards
to model training and validation data, i.e., out-of-distribution (OOD) test
data. ... | [
{
"created": "Wed, 30 Jun 2021 10:25:19 GMT",
"version": "v1"
}
] | 2021-07-01 | [
[
"Yuhas",
"Michael",
""
],
[
"Feng",
"Yeli",
""
],
[
"Ng",
"Daniel Jun Xian",
""
],
[
"Rahiminasab",
"Zahra",
""
],
[
"Easwaran",
"Arvind",
""
]
] | Machine learning (ML) is actively finding its way into modern cyber-physical systems (CPS), many of which are safety-critical real-time systems. It is well known that ML outputs are not reliable when testing data are novel with regards to model training and validation data, i.e., out-of-distribution (OOD) test data. We... |
1908.10870 | Shuo Zhang | Jason Shuo Zhang, Chenhao Tan, and Qin Lv | Intergroup Contact in the Wild: Characterizing Language Differences
between Intergroup and Single-group Members in NBA-related Discussion Forums | ACM Conference on Computer-Supported Cooperative Work and Social
Computing (CSCW), 2019 | null | 10.1145/3359295 | null | cs.CY cs.HC cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Intergroup contact has long been considered as an effective strategy to
reduce prejudice between groups. However, recent studies suggest that exposure
to opposing groups in online platforms can exacerbate polarization. To further
understand the behavior of individuals who actively engage in intergroup
contact in prac... | [
{
"created": "Wed, 28 Aug 2019 18:00:03 GMT",
"version": "v1"
}
] | 2019-08-30 | [
[
"Zhang",
"Jason Shuo",
""
],
[
"Tan",
"Chenhao",
""
],
[
"Lv",
"Qin",
""
]
] | Intergroup contact has long been considered as an effective strategy to reduce prejudice between groups. However, recent studies suggest that exposure to opposing groups in online platforms can exacerbate polarization. To further understand the behavior of individuals who actively engage in intergroup contact in practi... |
2009.09351 | Benjamin Plaut | Ashish Goel and Benjamin Plaut | Counteracting Inequality in Markets via Convex Pricing | Accepted to WINE 2020 | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study market mechanisms for allocating divisible goods to competing agents
with quasilinear utilities. For \emph{linear} pricing (i.e., the cost of a good
is proportional to the quantity purchased), the First Welfare Theorem states
that Walrasian equilibria maximize the sum of agent valuations. This ensures
effici... | [
{
"created": "Sun, 20 Sep 2020 05:10:01 GMT",
"version": "v1"
}
] | 2020-09-22 | [
[
"Goel",
"Ashish",
""
],
[
"Plaut",
"Benjamin",
""
]
] | We study market mechanisms for allocating divisible goods to competing agents with quasilinear utilities. For \emph{linear} pricing (i.e., the cost of a good is proportional to the quantity purchased), the First Welfare Theorem states that Walrasian equilibria maximize the sum of agent valuations. This ensures efficien... |
1903.01372 | Andrea Tassi | Ioannis Mavromatis, Andrea Tassi, Robert J. Piechocki, Andrew Nix | Efficient Millimeter-Wave Infrastructure Placement for City-Scale ITS | To appear in IEEE VTC-Spring 2019 | null | 10.1109/VTCSpring.2019.8746518 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Millimeter Waves (mmWaves) will play a pivotal role in the next-generation of
Intelligent Transportation Systems (ITSs). However, in deep urban environments,
sensitivity to blockages creates the need for more sophisticated network
planning. In this paper, we present an agile strategy for deploying road-side
nodes in ... | [
{
"created": "Mon, 4 Mar 2019 17:13:13 GMT",
"version": "v1"
}
] | 2022-09-05 | [
[
"Mavromatis",
"Ioannis",
""
],
[
"Tassi",
"Andrea",
""
],
[
"Piechocki",
"Robert J.",
""
],
[
"Nix",
"Andrew",
""
]
] | Millimeter Waves (mmWaves) will play a pivotal role in the next-generation of Intelligent Transportation Systems (ITSs). However, in deep urban environments, sensitivity to blockages creates the need for more sophisticated network planning. In this paper, we present an agile strategy for deploying road-side nodes in a ... |
1508.01340 | Marc Boull\'e | Marc Boull\'e | Universal Approximation of Edge Density in Large Graphs | null | null | null | null | cs.SI cs.DB stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a novel way to summarize the structure of large
graphs, based on non-parametric estimation of edge density in directed
multigraphs. Following coclustering approach, we use a clustering of the
vertices, with a piecewise constant estimation of the density of the edges
across the clusters, and ... | [
{
"created": "Thu, 6 Aug 2015 09:40:28 GMT",
"version": "v1"
}
] | 2015-08-07 | [
[
"Boullé",
"Marc",
""
]
] | In this paper, we present a novel way to summarize the structure of large graphs, based on non-parametric estimation of edge density in directed multigraphs. Following coclustering approach, we use a clustering of the vertices, with a piecewise constant estimation of the density of the edges across the clusters, and ad... |
1608.06794 | Thomas Kober | Thomas Kober, Julie Weeds, Jeremy Reffin and David Weir | Improving Sparse Word Representations with Distributional Inference for
Semantic Composition | To appear at EMNLP 2016 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributional models are derived from co-occurrences in a corpus, where only
a small proportion of all possible plausible co-occurrences will be observed.
This results in a very sparse vector space, requiring a mechanism for inferring
missing knowledge. Most methods face this challenge in ways that render the
result... | [
{
"created": "Wed, 24 Aug 2016 12:38:45 GMT",
"version": "v1"
}
] | 2016-08-25 | [
[
"Kober",
"Thomas",
""
],
[
"Weeds",
"Julie",
""
],
[
"Reffin",
"Jeremy",
""
],
[
"Weir",
"David",
""
]
] | Distributional models are derived from co-occurrences in a corpus, where only a small proportion of all possible plausible co-occurrences will be observed. This results in a very sparse vector space, requiring a mechanism for inferring missing knowledge. Most methods face this challenge in ways that render the resultin... |
1802.03821 | Ibrahim Riza Hallac | Betul Karakus, Ibrahim Riza Hallac, Galip Aydin | Distributed Readability Analysis Of Turkish Elementary School Textbooks | Proceedings of International Conference on Information Technology and
Computer Science July 11-12, 2015, ISBN:9788193137307 | null | null | null | cs.DC cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The readability assessment deals with estimating the level of difficulty in
reading texts.Many readability tests, which do not indicate execution
efficiency, have been applied on specific texts to measure the reading grade
level in science textbooks. In this paper, we analyze the content covered in
elementary school ... | [
{
"created": "Sun, 11 Feb 2018 21:18:45 GMT",
"version": "v1"
}
] | 2018-02-13 | [
[
"Karakus",
"Betul",
""
],
[
"Hallac",
"Ibrahim Riza",
""
],
[
"Aydin",
"Galip",
""
]
] | The readability assessment deals with estimating the level of difficulty in reading texts.Many readability tests, which do not indicate execution efficiency, have been applied on specific texts to measure the reading grade level in science textbooks. In this paper, we analyze the content covered in elementary school Tu... |
2110.13363 | Bicheng Ying | Bicheng Ying, Kun Yuan, Yiming Chen, Hanbin Hu, Pan Pan, Wotao Yin | Exponential Graph is Provably Efficient for Decentralized Deep Training | null | null | null | null | cs.LG math.OC | http://creativecommons.org/licenses/by/4.0/ | Decentralized SGD is an emerging training method for deep learning known for
its much less (thus faster) communication per iteration, which relaxes the
averaging step in parallel SGD to inexact averaging. The less exact the
averaging is, however, the more the total iterations the training needs to
take. Therefore, th... | [
{
"created": "Tue, 26 Oct 2021 02:33:39 GMT",
"version": "v1"
}
] | 2021-10-27 | [
[
"Ying",
"Bicheng",
""
],
[
"Yuan",
"Kun",
""
],
[
"Chen",
"Yiming",
""
],
[
"Hu",
"Hanbin",
""
],
[
"Pan",
"Pan",
""
],
[
"Yin",
"Wotao",
""
]
] | Decentralized SGD is an emerging training method for deep learning known for its much less (thus faster) communication per iteration, which relaxes the averaging step in parallel SGD to inexact averaging. The less exact the averaging is, however, the more the total iterations the training needs to take. Therefore, the ... |
1109.6494 | Yolande Vieceli | Emmanuelle Darles (XLIM), Beno\^it Crespin (XLIM), Djamchid
Ghazanfarpour (XLIM), Jean-Christophe Gonzato (INRIA Bordeaux - Sud-Ouest,
LaBRI) | A Survey of Ocean Simulation and Rendering Techniques in Computer
Graphics | null | Computer Graphics Forum 30, 1 (2011) 43-60 | 10.1111/j.1467-8659.2010.01828.x | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a survey of ocean simulation and rendering methods in
computer graphics. To model and animate the ocean's surface, these methods
mainly rely on two main approaches: on the one hand, those which approximate
ocean dynamics with parametric, spectral or hybrid models and use empirical
laws from oceano... | [
{
"created": "Thu, 29 Sep 2011 11:50:29 GMT",
"version": "v1"
}
] | 2011-09-30 | [
[
"Darles",
"Emmanuelle",
"",
"XLIM"
],
[
"Crespin",
"Benoît",
"",
"XLIM"
],
[
"Ghazanfarpour",
"Djamchid",
"",
"XLIM"
],
[
"Gonzato",
"Jean-Christophe",
"",
"INRIA Bordeaux - Sud-Ouest,\n LaBRI"
]
] | This paper presents a survey of ocean simulation and rendering methods in computer graphics. To model and animate the ocean's surface, these methods mainly rely on two main approaches: on the one hand, those which approximate ocean dynamics with parametric, spectral or hybrid models and use empirical laws from oceanogr... |
2311.18769 | Lei Xin | Lei Xin, George Chiu, Shreyas Sundaram | Online Change Points Detection for Linear Dynamical Systems with Finite
Sample Guarantees | 11 pages, 3 figures | null | null | null | cs.LG cs.SY eess.SY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of online change point detection is to detect abrupt changes in
properties of time series, ideally as soon as possible after those changes
occur. Existing work on online change point detection either assumes i.i.d
data, focuses on asymptotic analysis, does not present theoretical guarantees
on the trade-o... | [
{
"created": "Thu, 30 Nov 2023 18:08:16 GMT",
"version": "v1"
}
] | 2023-12-01 | [
[
"Xin",
"Lei",
""
],
[
"Chiu",
"George",
""
],
[
"Sundaram",
"Shreyas",
""
]
] | The problem of online change point detection is to detect abrupt changes in properties of time series, ideally as soon as possible after those changes occur. Existing work on online change point detection either assumes i.i.d data, focuses on asymptotic analysis, does not present theoretical guarantees on the trade-off... |
1108.2237 | Lalitha Sankar | Lalitha Sankar, Soummya Kar, Ravi Tandon, H. Vincent Poor | Competitive Privacy in the Smart Grid: An Information-theoretic Approach | Accepted for publication and presentation at the IEEE SmartGridComm
2011 | null | 10.1109/SmartGridComm.2011.6102322 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Advances in sensing and communication capabilities as well as power industry
deregulation are driving the need for distributed state estimation in the smart
grid at the level of the regional transmission organizations (RTOs). This leads
to a new competitive privacy problem amongst the RTOs since there is a tension
be... | [
{
"created": "Wed, 10 Aug 2011 18:19:55 GMT",
"version": "v1"
}
] | 2016-11-18 | [
[
"Sankar",
"Lalitha",
""
],
[
"Kar",
"Soummya",
""
],
[
"Tandon",
"Ravi",
""
],
[
"Poor",
"H. Vincent",
""
]
] | Advances in sensing and communication capabilities as well as power industry deregulation are driving the need for distributed state estimation in the smart grid at the level of the regional transmission organizations (RTOs). This leads to a new competitive privacy problem amongst the RTOs since there is a tension betw... |
2305.19240 | Ulyana Piterbarg | Ulyana Piterbarg, Lerrel Pinto, Rob Fergus | NetHack is Hard to Hack | NeurIPS 2023 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural policy learning methods have achieved remarkable results in various
control problems, ranging from Atari games to simulated locomotion. However,
these methods struggle in long-horizon tasks, especially in open-ended
environments with multi-modal observations, such as the popular dungeon-crawler
game, NetHack. ... | [
{
"created": "Tue, 30 May 2023 17:30:17 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Oct 2023 14:23:33 GMT",
"version": "v2"
}
] | 2023-10-31 | [
[
"Piterbarg",
"Ulyana",
""
],
[
"Pinto",
"Lerrel",
""
],
[
"Fergus",
"Rob",
""
]
] | Neural policy learning methods have achieved remarkable results in various control problems, ranging from Atari games to simulated locomotion. However, these methods struggle in long-horizon tasks, especially in open-ended environments with multi-modal observations, such as the popular dungeon-crawler game, NetHack. In... |
2111.04887 | Andrej (Andy) Brodnik | Andrej Brodnik, Andrew Csizmadia, Gerald Futschek, Lidija Kralj,
Violetta Lonati, Peter Micheuz, Mattia Monga | Programming for All: Understanding the Nature of Programs | null | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computer programs are part of our daily life, we use them, we provide them
with data, they support our decisions, they help us remember, they control
machines, etc. Programs are made by people, but in most cases we are not their
authors, so we have to decide if we can trust them. Programs enable computers
and compute... | [
{
"created": "Tue, 9 Nov 2021 00:14:49 GMT",
"version": "v1"
},
{
"created": "Sat, 4 Dec 2021 17:42:35 GMT",
"version": "v2"
}
] | 2021-12-07 | [
[
"Brodnik",
"Andrej",
""
],
[
"Csizmadia",
"Andrew",
""
],
[
"Futschek",
"Gerald",
""
],
[
"Kralj",
"Lidija",
""
],
[
"Lonati",
"Violetta",
""
],
[
"Micheuz",
"Peter",
""
],
[
"Monga",
"Mattia",
""
]
] | Computer programs are part of our daily life, we use them, we provide them with data, they support our decisions, they help us remember, they control machines, etc. Programs are made by people, but in most cases we are not their authors, so we have to decide if we can trust them. Programs enable computers and computer-... |
cs/0607109 | Marko Samer | Marko Samer and Stefan Szeider | Complexity and Applications of Edge-Induced Vertex-Cuts | 17 pages, 5 figures, 2 tables | null | null | null | cs.DM cs.CC | null | Motivated by hypergraph decomposition algorithms, we introduce the notion of
edge-induced vertex-cuts and compare it with the well-known notions of
edge-cuts and vertex-cuts. We investigate the complexity of computing minimum
edge-induced vertex-cuts and demonstrate the usefulness of our notion by
applications in net... | [
{
"created": "Tue, 25 Jul 2006 16:17:22 GMT",
"version": "v1"
},
{
"created": "Mon, 31 Jul 2006 09:23:22 GMT",
"version": "v2"
}
] | 2007-05-23 | [
[
"Samer",
"Marko",
""
],
[
"Szeider",
"Stefan",
""
]
] | Motivated by hypergraph decomposition algorithms, we introduce the notion of edge-induced vertex-cuts and compare it with the well-known notions of edge-cuts and vertex-cuts. We investigate the complexity of computing minimum edge-induced vertex-cuts and demonstrate the usefulness of our notion by applications in netwo... |
1508.06583 | Avery Miller | Kokouvi Hounkanli, Avery Miller, Andrzej Pelc | Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consensus is one of the fundamental tasks studied in distributed computing.
Processors have input values from some set $V$ and they have to decide the same
value from this set. If all processors have the same input value, then they
must all decide this value. We study the task of consensus in a Multiple Access
Channe... | [
{
"created": "Wed, 26 Aug 2015 17:42:44 GMT",
"version": "v1"
}
] | 2015-08-27 | [
[
"Hounkanli",
"Kokouvi",
""
],
[
"Miller",
"Avery",
""
],
[
"Pelc",
"Andrzej",
""
]
] | Consensus is one of the fundamental tasks studied in distributed computing. Processors have input values from some set $V$ and they have to decide the same value from this set. If all processors have the same input value, then they must all decide this value. We study the task of consensus in a Multiple Access Channel ... |
2209.11390 | Zheng Shi | Zheng Shi, Hong Wang, Yaru Fu, Guanghua Yang, Shaodan Ma, and Xinrong
Ye | Outage Performance and Optimal Design of MIMO-NOMA Enhanced Small Cell
Networks With Imperfect Channel-State Information | null | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | This paper focuses on boosting the performance of small cell networks (SCNs)
by integrating multiple-input multiple-output (MIMO) and non-orthogonal
multiple access (NOMA) in consideration of imperfect channel-state information
(CSI). The estimation error and the spatial randomness of base stations (BSs)
are characte... | [
{
"created": "Fri, 23 Sep 2022 03:54:06 GMT",
"version": "v1"
}
] | 2022-09-26 | [
[
"Shi",
"Zheng",
""
],
[
"Wang",
"Hong",
""
],
[
"Fu",
"Yaru",
""
],
[
"Yang",
"Guanghua",
""
],
[
"Ma",
"Shaodan",
""
],
[
"Ye",
"Xinrong",
""
]
] | This paper focuses on boosting the performance of small cell networks (SCNs) by integrating multiple-input multiple-output (MIMO) and non-orthogonal multiple access (NOMA) in consideration of imperfect channel-state information (CSI). The estimation error and the spatial randomness of base stations (BSs) are characteri... |
2104.08038 | Ekta Prashnani | Ekta Prashnani, Orazio Gallo, Joohwan Kim, Josef Spjut, Pradeep Sen,
Iuri Frosio | Noise-Aware Video Saliency Prediction | 10 pages, 3 figures, 7 tables | British Machine Vision Conference (BMVC) 2021 | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We tackle the problem of predicting saliency maps for videos of dynamic
scenes. We note that the accuracy of the maps reconstructed from the gaze data
of a fixed number of observers varies with the frame, as it depends on the
content of the scene. This issue is particularly pressing when a limited number
of observers... | [
{
"created": "Fri, 16 Apr 2021 11:32:46 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Nov 2021 05:38:36 GMT",
"version": "v2"
}
] | 2021-11-23 | [
[
"Prashnani",
"Ekta",
""
],
[
"Gallo",
"Orazio",
""
],
[
"Kim",
"Joohwan",
""
],
[
"Spjut",
"Josef",
""
],
[
"Sen",
"Pradeep",
""
],
[
"Frosio",
"Iuri",
""
]
] | We tackle the problem of predicting saliency maps for videos of dynamic scenes. We note that the accuracy of the maps reconstructed from the gaze data of a fixed number of observers varies with the frame, as it depends on the content of the scene. This issue is particularly pressing when a limited number of observers a... |
2210.11475 | Zineb Garroussi Dr | Zineb Garroussi, Abdoul Wassi Badirou, Mathieu D'amours, Andr\'e
Girard, Brunilde Sans\`o | On the economic viability of solar energy when upgrading cellular
networks | 25 pages, 12 figures, 51 references, journal paper to ieee
transaciton green communications and networks | null | null | null | cs.CE cs.NI math.OC | http://creativecommons.org/licenses/by/4.0/ | The massive increase of data traffic, the widespread proliferation of
wireless applications and the full-scale deployment of 5G and the IoT, imply a
steep increase in cellular networks energy use, resulting in a significant
carbon footprint. This paper presents a comprehensive model to show the
interaction between th... | [
{
"created": "Mon, 17 Oct 2022 20:36:34 GMT",
"version": "v1"
}
] | 2022-10-24 | [
[
"Garroussi",
"Zineb",
""
],
[
"Badirou",
"Abdoul Wassi",
""
],
[
"D'amours",
"Mathieu",
""
],
[
"Girard",
"André",
""
],
[
"Sansò",
"Brunilde",
""
]
] | The massive increase of data traffic, the widespread proliferation of wireless applications and the full-scale deployment of 5G and the IoT, imply a steep increase in cellular networks energy use, resulting in a significant carbon footprint. This paper presents a comprehensive model to show the interaction between the ... |
2203.16784 | Dohwan Ko | Dohwan Ko, Joonmyung Choi, Juyeon Ko, Shinyeong Noh, Kyoung-Woon On,
Eun-Sol Kim, Hyunwoo J. Kim | Video-Text Representation Learning via Differentiable Weak Temporal
Alignment | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning generic joint representations for video and text by a supervised
method requires a prohibitively substantial amount of manually annotated video
datasets. As a practical alternative, a large-scale but uncurated and narrated
video dataset, HowTo100M, has recently been introduced. But it is still
challenging to... | [
{
"created": "Thu, 31 Mar 2022 04:13:16 GMT",
"version": "v1"
}
] | 2022-04-01 | [
[
"Ko",
"Dohwan",
""
],
[
"Choi",
"Joonmyung",
""
],
[
"Ko",
"Juyeon",
""
],
[
"Noh",
"Shinyeong",
""
],
[
"On",
"Kyoung-Woon",
""
],
[
"Kim",
"Eun-Sol",
""
],
[
"Kim",
"Hyunwoo J.",
""
]
] | Learning generic joint representations for video and text by a supervised method requires a prohibitively substantial amount of manually annotated video datasets. As a practical alternative, a large-scale but uncurated and narrated video dataset, HowTo100M, has recently been introduced. But it is still challenging to l... |
2306.07684 | Jiangtao Zhang | Jiangtao Zhang, Shunyu Liu, Jie Song, Tongtian Zhu, Zhengqi Xu, Mingli
Song | Lookaround Optimizer: $k$ steps around, 1 step average | Accepted to NeurIPS 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Weight Average (WA) is an active research topic due to its simplicity in
ensembling deep networks and the effectiveness in promoting generalization.
Existing weight average approaches, however, are often carried out along only
one training trajectory in a post-hoc manner (i.e., the weights are averaged
after the enti... | [
{
"created": "Tue, 13 Jun 2023 10:55:20 GMT",
"version": "v1"
},
{
"created": "Sun, 8 Oct 2023 06:41:12 GMT",
"version": "v2"
},
{
"created": "Thu, 2 Nov 2023 15:24:29 GMT",
"version": "v3"
}
] | 2023-11-03 | [
[
"Zhang",
"Jiangtao",
""
],
[
"Liu",
"Shunyu",
""
],
[
"Song",
"Jie",
""
],
[
"Zhu",
"Tongtian",
""
],
[
"Xu",
"Zhengqi",
""
],
[
"Song",
"Mingli",
""
]
] | Weight Average (WA) is an active research topic due to its simplicity in ensembling deep networks and the effectiveness in promoting generalization. Existing weight average approaches, however, are often carried out along only one training trajectory in a post-hoc manner (i.e., the weights are averaged after the entire... |
2305.13286 | Rochelle Choenni | Rochelle Choenni, Dan Garrette, Ekaterina Shutova | How do languages influence each other? Studying cross-lingual data
sharing during LM fine-tuning | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multilingual large language models (MLLMs) are jointly trained on data from
many different languages such that representation of individual languages can
benefit from other languages' data. Impressive performance on zero-shot
cross-lingual transfer shows that these models are capable of exploiting data
from other lan... | [
{
"created": "Mon, 22 May 2023 17:47:41 GMT",
"version": "v1"
},
{
"created": "Tue, 21 May 2024 11:47:13 GMT",
"version": "v2"
}
] | 2024-05-22 | [
[
"Choenni",
"Rochelle",
""
],
[
"Garrette",
"Dan",
""
],
[
"Shutova",
"Ekaterina",
""
]
] | Multilingual large language models (MLLMs) are jointly trained on data from many different languages such that representation of individual languages can benefit from other languages' data. Impressive performance on zero-shot cross-lingual transfer shows that these models are capable of exploiting data from other langu... |
1708.05905 | Lesandro Ponciano | Lesandro Ponciano and Pedro Barbosa and Francisco Brasileiro and
Andrey Brito and Nazareno Andrade | Designing for Pragmatists and Fundamentalists: Privacy Concerns and
Attitudes on the Internet of Things | XVI Brazilian Symposium on Human Factors in Computing Systems
(IHC'17), October 23-27, 2017, Joinville, SC, Brazil | In Proceedings of IHC 2017. ACM, US, Article 21, 10 pages (2017) | 10.1145/3160504.3160545 | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Internet of Things (IoT) systems have aroused enthusiasm and concerns.
Enthusiasm comes from their utilities in people daily life, and concerns may be
associated with privacy issues. By using two IoT systems as case-studies, we
examine users' privacy beliefs, concerns and attitudes. We focus on four major
dimensions:... | [
{
"created": "Sat, 19 Aug 2017 22:15:58 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Jan 2018 16:05:41 GMT",
"version": "v2"
},
{
"created": "Tue, 30 Jul 2019 15:07:58 GMT",
"version": "v3"
}
] | 2019-07-31 | [
[
"Ponciano",
"Lesandro",
""
],
[
"Barbosa",
"Pedro",
""
],
[
"Brasileiro",
"Francisco",
""
],
[
"Brito",
"Andrey",
""
],
[
"Andrade",
"Nazareno",
""
]
] | Internet of Things (IoT) systems have aroused enthusiasm and concerns. Enthusiasm comes from their utilities in people daily life, and concerns may be associated with privacy issues. By using two IoT systems as case-studies, we examine users' privacy beliefs, concerns and attitudes. We focus on four major dimensions: t... |
2101.02434 | Michael Gundall | Michael Gundall, Christopher Huber, Sergiy Melnyk | Integration of IEEE 802.1AS-based Time Synchronization in IEEE 802.11 as
an Enabler for Novel Industrial Use Cases | arXiv admin note: text overlap with arXiv:2011.06313 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Industry 4.0 introduces new use cases, with more and more mobile devices
appearing in the industrial landscape. These applications require both new
technologies and smooth integration into existing brownfield deployments.
Emerging mobile use cases can be divided into optional mobile and mandatory
mobile, where the fi... | [
{
"created": "Thu, 7 Jan 2021 08:54:43 GMT",
"version": "v1"
}
] | 2021-01-08 | [
[
"Gundall",
"Michael",
""
],
[
"Huber",
"Christopher",
""
],
[
"Melnyk",
"Sergiy",
""
]
] | Industry 4.0 introduces new use cases, with more and more mobile devices appearing in the industrial landscape. These applications require both new technologies and smooth integration into existing brownfield deployments. Emerging mobile use cases can be divided into optional mobile and mandatory mobile, where the firs... |
1906.05413 | Joshua Robinson | Joshua Robinson, Suvrit Sra, Stefanie Jegelka | Flexible Modeling of Diversity with Strongly Log-Concave Distributions | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Strongly log-concave (SLC) distributions are a rich class of discrete
probability distributions over subsets of some ground set. They are strictly
more general than strongly Rayleigh (SR) distributions such as the well-known
determinantal point process. While SR distributions offer elegant models of
diversity, they l... | [
{
"created": "Wed, 12 Jun 2019 22:44:17 GMT",
"version": "v1"
}
] | 2019-06-14 | [
[
"Robinson",
"Joshua",
""
],
[
"Sra",
"Suvrit",
""
],
[
"Jegelka",
"Stefanie",
""
]
] | Strongly log-concave (SLC) distributions are a rich class of discrete probability distributions over subsets of some ground set. They are strictly more general than strongly Rayleigh (SR) distributions such as the well-known determinantal point process. While SR distributions offer elegant models of diversity, they lac... |
2103.11525 | Gordon Watts | Gordon Watts | hep_tables: Heterogeneous Array Programming for HEP | 10 pages, 5 figures, submission for vCHEP 2021 | null | 10.1051/epjconf/202125103061 | null | cs.DB physics.data-an | http://creativecommons.org/licenses/by/4.0/ | Array operations are one of the most concise ways of expressing common
filtering and simple aggregation operations that is the hallmark of the first
step of a particle physics analysis: selection, filtering, basic vector
operations, and filling histograms. The High Luminosity run of the Large Hadron
Collider (HL-LHC)... | [
{
"created": "Mon, 22 Mar 2021 00:49:45 GMT",
"version": "v1"
}
] | 2021-09-08 | [
[
"Watts",
"Gordon",
""
]
] | Array operations are one of the most concise ways of expressing common filtering and simple aggregation operations that is the hallmark of the first step of a particle physics analysis: selection, filtering, basic vector operations, and filling histograms. The High Luminosity run of the Large Hadron Collider (HL-LHC), ... |
1510.01871 | Peter Van Den Besselaar | Peter van den Besselaar and Ulf Sandstrom | Does Quantity Make a Difference? The importance of publishing many
papers | Presented at ISSI 2015, Istanbul | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Do highly productive researchers have significantly higher probability to
produce top cited papers? Or does the increased productivity in science only
result in a sea of irrelevant papers as a perverse effect of competition and
the increased use of indicators for research evaluation and accountability
focus? We use a... | [
{
"created": "Wed, 7 Oct 2015 09:39:50 GMT",
"version": "v1"
}
] | 2015-10-08 | [
[
"Besselaar",
"Peter van den",
""
],
[
"Sandstrom",
"Ulf",
""
]
] | Do highly productive researchers have significantly higher probability to produce top cited papers? Or does the increased productivity in science only result in a sea of irrelevant papers as a perverse effect of competition and the increased use of indicators for research evaluation and accountability focus? We use a S... |
1504.04244 | Pedro Henrique Juliano Nardelli | Pedro H. J. Nardelli, Hirley Alves, Carlos H. M. de Lima, Matti
Latva-aho | Throughput Maximization in Multi-Hop Wireless Networks under Secrecy
Constraint | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper analyzes the throughput of industrial communication networks under
a secrecy constraint. The proposed scenario is composed by sensors that measure
some relevant information of the plant that is first processed by aggregator
node and then sent to the control unit. The sensor measurements, their
communicatio... | [
{
"created": "Thu, 16 Apr 2015 14:12:54 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Dec 2015 11:16:23 GMT",
"version": "v2"
}
] | 2015-12-18 | [
[
"Nardelli",
"Pedro H. J.",
""
],
[
"Alves",
"Hirley",
""
],
[
"de Lima",
"Carlos H. M.",
""
],
[
"Latva-aho",
"Matti",
""
]
] | This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node and then sent to the control unit. The sensor measurements, their communication ... |
1910.11117 | Shubham Dokania | Shubham Dokania, Vasudev Singh | Graph Representation learning for Audio & Music genre Classification | null | null | null | null | cs.SD cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Music genre is arguably one of the most important and discriminative
information for music and audio content. Visual representation based approaches
have been explored on spectrograms for music genre classification. However,
lack of quality data and augmentation techniques makes it difficult to employ
deep learning t... | [
{
"created": "Wed, 23 Oct 2019 13:59:23 GMT",
"version": "v1"
}
] | 2019-10-25 | [
[
"Dokania",
"Shubham",
""
],
[
"Singh",
"Vasudev",
""
]
] | Music genre is arguably one of the most important and discriminative information for music and audio content. Visual representation based approaches have been explored on spectrograms for music genre classification. However, lack of quality data and augmentation techniques makes it difficult to employ deep learning tec... |
1811.12161 | Robert Kent | Christian Neuss and Robert E. Kent | Conceptual Analysis of Resource Meta-information | 17 pages, 3 figures, 8 tables, Third International World Wide Web
(WWW) Conference 1995. arXiv admin note: text overlap with arXiv:1810.07232 | Computer Networks and ISDN Systems 27(6): 973-984 (1995) | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It's ease of use and the availability of browsers for various platforms have
paved the way for the enormous popularity that the World Wide Web currently
enjoys. In the near future, by providing not only easy access to information,
but also means for conducting business transactions, the Web could form the
base techno... | [
{
"created": "Mon, 22 Oct 2018 21:33:03 GMT",
"version": "v1"
}
] | 2018-11-30 | [
[
"Neuss",
"Christian",
""
],
[
"Kent",
"Robert E.",
""
]
] | It's ease of use and the availability of browsers for various platforms have paved the way for the enormous popularity that the World Wide Web currently enjoys. In the near future, by providing not only easy access to information, but also means for conducting business transactions, the Web could form the base technolo... |
1906.04982 | \'Etienne Andr\'e | \'Etienne Andr\'e, Beno\^it Delahaye and Paulin Fournier | Consistency in Parametric Interval Probabilistic Timed Automata | This is the author version of the manuscript of the same name
published in the Journal of Logical and Algebraic Methods in Programming.
This work is partially supported by the ANR national research program PACS
(ANR-14-CE28-0002) | null | 10.1016/j.jlamp.2019.04.007 | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new abstract formalism for probabilistic timed systems,
Parametric Interval Probabilistic Timed Automata, based on an extension of
Parametric Timed Automata and Interval Markov Chains. In this context, we
consider the consistency problem that amounts to deciding whether a given
specification admits at le... | [
{
"created": "Wed, 12 Jun 2019 07:40:35 GMT",
"version": "v1"
}
] | 2019-06-13 | [
[
"André",
"Étienne",
""
],
[
"Delahaye",
"Benoît",
""
],
[
"Fournier",
"Paulin",
""
]
] | We propose a new abstract formalism for probabilistic timed systems, Parametric Interval Probabilistic Timed Automata, based on an extension of Parametric Timed Automata and Interval Markov Chains. In this context, we consider the consistency problem that amounts to deciding whether a given specification admits at leas... |
cs/0611076 | Ying Jun Zhang Ph.D. | Soung Chang Liew and Ying Jun Zhang | Proportional Fairness in Multi-channel Multi-rate Wireless Networks-Part
II: The Case of Time-Varying Channels | null | null | null | null | cs.PF cs.IT cs.NI math.IT | null | This is Part II of a two-part paper series that studies the use of the
proportional fairness (PF) utility function as the basis for capacity
allocation and scheduling in multi-channel multi-rate wireless networks. The
contributions of Part II are twofold. (i) First, we extend the problem
formulation, theoretical resu... | [
{
"created": "Thu, 16 Nov 2006 03:14:40 GMT",
"version": "v1"
},
{
"created": "Sat, 23 Feb 2008 04:23:32 GMT",
"version": "v2"
}
] | 2008-02-23 | [
[
"Liew",
"Soung Chang",
""
],
[
"Zhang",
"Ying Jun",
""
]
] | This is Part II of a two-part paper series that studies the use of the proportional fairness (PF) utility function as the basis for capacity allocation and scheduling in multi-channel multi-rate wireless networks. The contributions of Part II are twofold. (i) First, we extend the problem formulation, theoretical result... |
2009.09279 | Mohamed Wiem Mkaouer | Eman Abdullah AlOmar, Mohamed Wiem Mkaouer, Ali Ouni | Toward the Automatic Classification of Self-Affirmed Refactoring | null | null | null | null | cs.SE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The concept of Self-Affirmed Refactoring (SAR) was introduced to explore how
developers document their refactoring activities in commit messages, i.e.,
developers' explicit documentation of refactoring operations intentionally
introduced during a code change. In our previous study, we have manually
identified refacto... | [
{
"created": "Sat, 19 Sep 2020 18:35:21 GMT",
"version": "v1"
}
] | 2020-09-22 | [
[
"AlOmar",
"Eman Abdullah",
""
],
[
"Mkaouer",
"Mohamed Wiem",
""
],
[
"Ouni",
"Ali",
""
]
] | The concept of Self-Affirmed Refactoring (SAR) was introduced to explore how developers document their refactoring activities in commit messages, i.e., developers' explicit documentation of refactoring operations intentionally introduced during a code change. In our previous study, we have manually identified refactori... |
1711.07684 | Mukul Bhutani | Mukul Bhutani and Bamdev Mishra | A two-dimensional decomposition approach for matrix completion through
gossip | Appeared in the Emergent Communication Workshop at NIPS 2017 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Factoring a matrix into two low rank matrices is at the heart of many
problems. The problem of matrix completion especially uses it to decompose a
sparse matrix into two non sparse, low rank matrices which can then be used to
predict unknown entries of the original matrix. We present a scalable and
decentralized appr... | [
{
"created": "Tue, 21 Nov 2017 09:21:13 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Jan 2018 12:41:33 GMT",
"version": "v2"
}
] | 2018-01-12 | [
[
"Bhutani",
"Mukul",
""
],
[
"Mishra",
"Bamdev",
""
]
] | Factoring a matrix into two low rank matrices is at the heart of many problems. The problem of matrix completion especially uses it to decompose a sparse matrix into two non sparse, low rank matrices which can then be used to predict unknown entries of the original matrix. We present a scalable and decentralized approa... |
2007.14672 | Muzammal Naseer | Muzammal Naseer, Salman Khan, Munawar Hayat, Fahad Shahbaz Khan, Fatih
Porikli | Stylized Adversarial Defense | IEEE Transactions on Pattern Analysis and Machine Intelligence
(TPAMI) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Convolution Neural Networks (CNNs) can easily be fooled by subtle,
imperceptible changes to the input images. To address this vulnerability,
adversarial training creates perturbation patterns and includes them in the
training set to robustify the model. In contrast to existing adversarial
training methods that o... | [
{
"created": "Wed, 29 Jul 2020 08:38:10 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Sep 2022 14:37:43 GMT",
"version": "v2"
}
] | 2022-09-19 | [
[
"Naseer",
"Muzammal",
""
],
[
"Khan",
"Salman",
""
],
[
"Hayat",
"Munawar",
""
],
[
"Khan",
"Fahad Shahbaz",
""
],
[
"Porikli",
"Fatih",
""
]
] | Deep Convolution Neural Networks (CNNs) can easily be fooled by subtle, imperceptible changes to the input images. To address this vulnerability, adversarial training creates perturbation patterns and includes them in the training set to robustify the model. In contrast to existing adversarial training methods that onl... |
1912.11673 | Wensheng Gan | Wensheng Gan, Jerry Chun-Wei Lin, Jiexiong Zhang and Philip S. Yu | Utility Mining Across Multi-Sequences with Individualized Thresholds | Accepted by ACM Trans. on Data Science, 29 pages, 6 figures | ACM Transactions on Data Science, 2020 | 10.1145/3362070 | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Utility-oriented pattern mining has become an emerging topic since it can
reveal high-utility patterns (e.g., itemsets, rules, sequences) from different
types of data, which provides more information than the traditional
frequent/confident-based pattern mining models. The utilities of various items
are not exactly eq... | [
{
"created": "Wed, 25 Dec 2019 14:06:02 GMT",
"version": "v1"
}
] | 2021-04-01 | [
[
"Gan",
"Wensheng",
""
],
[
"Lin",
"Jerry Chun-Wei",
""
],
[
"Zhang",
"Jiexiong",
""
],
[
"Yu",
"Philip S.",
""
]
] | Utility-oriented pattern mining has become an emerging topic since it can reveal high-utility patterns (e.g., itemsets, rules, sequences) from different types of data, which provides more information than the traditional frequent/confident-based pattern mining models. The utilities of various items are not exactly equa... |
2204.08069 | Huili Chen | Huili Chen, Jie Ding, Eric Tramel, Shuang Wu, Anit Kumar Sahu, Salman
Avestimehr, Tao Zhang | Self-Aware Personalized Federated Learning | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the context of personalized federated learning (FL), the critical
challenge is to balance local model improvement and global model tuning when
the personal and global objectives may not be exactly aligned. Inspired by
Bayesian hierarchical models, we develop a self-aware personalized FL method
where each client ca... | [
{
"created": "Sun, 17 Apr 2022 19:02:25 GMT",
"version": "v1"
}
] | 2022-04-19 | [
[
"Chen",
"Huili",
""
],
[
"Ding",
"Jie",
""
],
[
"Tramel",
"Eric",
""
],
[
"Wu",
"Shuang",
""
],
[
"Sahu",
"Anit Kumar",
""
],
[
"Avestimehr",
"Salman",
""
],
[
"Zhang",
"Tao",
""
]
] | In the context of personalized federated learning (FL), the critical challenge is to balance local model improvement and global model tuning when the personal and global objectives may not be exactly aligned. Inspired by Bayesian hierarchical models, we develop a self-aware personalized FL method where each client can ... |
1611.09030 | Samin Aref | Samin Aref, Andrew J. Mason, and Mark C. Wilson | A modelling and computational study of the frustration index in signed
networks | 25 pages, 4 figures, 6 tables Old title: An exact method for
computing the frustration index in signed networks using binary programming.
The current authors have published a book chapter under the title "Computing
the Line Index of Balance Using Integer Programming Optimisation" that can be
found in ArXiv:1710... | null | null | null | cs.SI math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computing the frustration index of a signed graph is a key step toward
solving problems in many fields including social networks, political science,
physics, chemistry, and biology. The frustration index determines the distance
of a network from a state of total structural balance. Although the definition
of the frus... | [
{
"created": "Mon, 28 Nov 2016 09:10:06 GMT",
"version": "v1"
},
{
"created": "Fri, 26 May 2017 06:54:54 GMT",
"version": "v2"
},
{
"created": "Thu, 3 May 2018 12:18:03 GMT",
"version": "v3"
},
{
"created": "Mon, 26 Aug 2019 17:48:48 GMT",
"version": "v4"
}
] | 2019-08-27 | [
[
"Aref",
"Samin",
""
],
[
"Mason",
"Andrew J.",
""
],
[
"Wilson",
"Mark C.",
""
]
] | Computing the frustration index of a signed graph is a key step toward solving problems in many fields including social networks, political science, physics, chemistry, and biology. The frustration index determines the distance of a network from a state of total structural balance. Although the definition of the frustr... |
2307.02784 | Seyoung Ahn | Seyoung Ahn, Soohyeong Kim, Yongseok Kwon, Joohan Park, Jiseung Youn,
Sunghyun Cho | On the Spatial-Wideband Effects in Millimeter-Wave Cell-Free Massive
MIMO | null | null | null | null | cs.IT cs.NI eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we investigate the spatial-wideband effects in cell-free
massive MIMO (CF-mMIMO) systems in mmWave bands. The utilization of mmWave
frequencies brings challenges such as signal attenuation and the need for
denser networks like ultra-dense networks (UDN) to maintain communication
performance. CF-mMIMO i... | [
{
"created": "Thu, 6 Jul 2023 05:22:37 GMT",
"version": "v1"
}
] | 2023-07-07 | [
[
"Ahn",
"Seyoung",
""
],
[
"Kim",
"Soohyeong",
""
],
[
"Kwon",
"Yongseok",
""
],
[
"Park",
"Joohan",
""
],
[
"Youn",
"Jiseung",
""
],
[
"Cho",
"Sunghyun",
""
]
] | In this paper, we investigate the spatial-wideband effects in cell-free massive MIMO (CF-mMIMO) systems in mmWave bands. The utilization of mmWave frequencies brings challenges such as signal attenuation and the need for denser networks like ultra-dense networks (UDN) to maintain communication performance. CF-mMIMO is ... |
2204.09188 | Nirmal Shende | Nirmal V. Shende and Aaron B. Wagner | Functional Covering of Point Processes | null | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | We introduce a new distortion measure for point processes called
functional-covering distortion. It is inspired by intensity theory and is
related to both the covering of point processes and logarithmic loss
distortion. We obtain the distortion-rate function with feedforward under this
distortion measure for a large ... | [
{
"created": "Wed, 20 Apr 2022 02:30:18 GMT",
"version": "v1"
}
] | 2022-04-21 | [
[
"Shende",
"Nirmal V.",
""
],
[
"Wagner",
"Aaron B.",
""
]
] | We introduce a new distortion measure for point processes called functional-covering distortion. It is inspired by intensity theory and is related to both the covering of point processes and logarithmic loss distortion. We obtain the distortion-rate function with feedforward under this distortion measure for a large cl... |
2002.02701 | Henry Wilde | Henry Wilde, Vincent Knight, Jonathan Gillard | A novel initialisation based on hospital-resident assignment for the
k-modes algorithm | 23 pages, 11 figures (31 panels) | null | null | null | cs.LG cs.GT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a new way of selecting an initial solution for the
k-modes algorithm that allows for a notion of mathematical fairness and a
leverage of the data that the common initialisations from literature do not.
The method, which utilises the Hospital-Resident Assignment Problem to find the
set of initial c... | [
{
"created": "Fri, 7 Feb 2020 10:20:49 GMT",
"version": "v1"
}
] | 2020-02-10 | [
[
"Wilde",
"Henry",
""
],
[
"Knight",
"Vincent",
""
],
[
"Gillard",
"Jonathan",
""
]
] | This paper presents a new way of selecting an initial solution for the k-modes algorithm that allows for a notion of mathematical fairness and a leverage of the data that the common initialisations from literature do not. The method, which utilises the Hospital-Resident Assignment Problem to find the set of initial clu... |
2111.10090 | Huashan Chen | Huashan Chen, Richard B. Garcia-Lebron, Zheyuan Sun, Jin-Hee Cho, and
Shouhuai Xu | Quantifying Cybersecurity Effectiveness of Software Diversity | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The deployment of monoculture software stacks can cause a devastating damage
even by a single exploit against a single vulnerability. Inspired by the
resilience benefit of biological diversity, the concept of software diversity
has been proposed in the security domain. Although it is intuitive that
software diversity... | [
{
"created": "Fri, 19 Nov 2021 08:28:27 GMT",
"version": "v1"
}
] | 2021-11-22 | [
[
"Chen",
"Huashan",
""
],
[
"Garcia-Lebron",
"Richard B.",
""
],
[
"Sun",
"Zheyuan",
""
],
[
"Cho",
"Jin-Hee",
""
],
[
"Xu",
"Shouhuai",
""
]
] | The deployment of monoculture software stacks can cause a devastating damage even by a single exploit against a single vulnerability. Inspired by the resilience benefit of biological diversity, the concept of software diversity has been proposed in the security domain. Although it is intuitive that software diversity m... |
2302.14306 | Srikanth Malla | Srikanth Malla, Yi-Ting Chen | CLR-GAM: Contrastive Point Cloud Learning with Guided Augmentation and
Feature Mapping | null | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Point cloud data plays an essential role in robotics and self-driving
applications. Yet, annotating point cloud data is time-consuming and nontrivial
while they enable learning discriminative 3D representations that empower
downstream tasks, such as classification and segmentation. Recently,
contrastive learning-base... | [
{
"created": "Tue, 28 Feb 2023 04:38:52 GMT",
"version": "v1"
}
] | 2023-03-01 | [
[
"Malla",
"Srikanth",
""
],
[
"Chen",
"Yi-Ting",
""
]
] | Point cloud data plays an essential role in robotics and self-driving applications. Yet, annotating point cloud data is time-consuming and nontrivial while they enable learning discriminative 3D representations that empower downstream tasks, such as classification and segmentation. Recently, contrastive learning-based ... |
2309.05477 | Tim Bakker | Tim Bakker, Herke van Hoof, Max Welling | Learning Objective-Specific Active Learning Strategies with Attentive
Neural Processes | Accepted at ECML 2023 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pool-based active learning (AL) is a promising technology for increasing
data-efficiency of machine learning models. However, surveys show that
performance of recent AL methods is very sensitive to the choice of dataset and
training setting, making them unsuitable for general application. In order to
tackle this prob... | [
{
"created": "Mon, 11 Sep 2023 14:16:37 GMT",
"version": "v1"
}
] | 2023-09-12 | [
[
"Bakker",
"Tim",
""
],
[
"van Hoof",
"Herke",
""
],
[
"Welling",
"Max",
""
]
] | Pool-based active learning (AL) is a promising technology for increasing data-efficiency of machine learning models. However, surveys show that performance of recent AL methods is very sensitive to the choice of dataset and training setting, making them unsuitable for general application. In order to tackle this proble... |
1808.08349 | Aron Laszka | Aron Laszka, Waseem Abbas, Yevgeniy Vorobeychik, and Xenofon
Koutsoukos | Detection and Mitigation of Attacks on Transportation Networks as a
Multi-Stage Security Game | null | null | null | null | cs.CR cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, state-of-the-art traffic-control devices have evolved from
standalone hardware to networked smart devices. Smart traffic control enables
operators to decrease traffic congestion and environmental impact by acquiring
real-time traffic data and changing traffic signals from fixed to adaptive
schedules.... | [
{
"created": "Sat, 25 Aug 2018 03:19:20 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Aug 2019 18:03:48 GMT",
"version": "v2"
}
] | 2019-08-06 | [
[
"Laszka",
"Aron",
""
],
[
"Abbas",
"Waseem",
""
],
[
"Vorobeychik",
"Yevgeniy",
""
],
[
"Koutsoukos",
"Xenofon",
""
]
] | In recent years, state-of-the-art traffic-control devices have evolved from standalone hardware to networked smart devices. Smart traffic control enables operators to decrease traffic congestion and environmental impact by acquiring real-time traffic data and changing traffic signals from fixed to adaptive schedules. H... |
1402.5029 | Nicolas Emilio Bordenabe | Nicol\'as E. Bordenabe, Konstantinos Chatzikokolakis, Catuscia
Palamidessi | Optimal Geo-Indistinguishable Mechanisms for Location Privacy | 13 pages | null | 10.1145/2660267.2660345 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the geo-indistinguishability approach to location privacy, and
the trade-off with respect to utility. We show that, given a desired degree of
geo-indistinguishability, it is possible to construct a mechanism that
minimizes the service quality loss, using linear programming techniques. In
addition we show ... | [
{
"created": "Thu, 20 Feb 2014 15:21:42 GMT",
"version": "v1"
},
{
"created": "Sat, 16 Aug 2014 18:43:33 GMT",
"version": "v2"
},
{
"created": "Sun, 24 Aug 2014 22:11:45 GMT",
"version": "v3"
}
] | 2014-08-26 | [
[
"Bordenabe",
"Nicolás E.",
""
],
[
"Chatzikokolakis",
"Konstantinos",
""
],
[
"Palamidessi",
"Catuscia",
""
]
] | We consider the geo-indistinguishability approach to location privacy, and the trade-off with respect to utility. We show that, given a desired degree of geo-indistinguishability, it is possible to construct a mechanism that minimizes the service quality loss, using linear programming techniques. In addition we show th... |
2308.06657 | Sidong Feng | Sidong Feng, Haochuan Lu, Ting Xiong, Yuetang Deng, Chunyang Chen | Towards Efficient Record and Replay: A Case Study in WeChat | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | WeChat, a widely-used messenger app boasting over 1 billion monthly active
users, requires effective app quality assurance for its complex features.
Record-and-replay tools are crucial in achieving this goal. Despite the
extensive development of these tools, the impact of waiting time between replay
events has been l... | [
{
"created": "Sun, 13 Aug 2023 01:02:00 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Aug 2023 09:14:35 GMT",
"version": "v2"
}
] | 2023-08-28 | [
[
"Feng",
"Sidong",
""
],
[
"Lu",
"Haochuan",
""
],
[
"Xiong",
"Ting",
""
],
[
"Deng",
"Yuetang",
""
],
[
"Chen",
"Chunyang",
""
]
] | WeChat, a widely-used messenger app boasting over 1 billion monthly active users, requires effective app quality assurance for its complex features. Record-and-replay tools are crucial in achieving this goal. Despite the extensive development of these tools, the impact of waiting time between replay events has been lar... |
2402.12930 | Nils Philipp Walter | Sascha Xu, Nils Philipp Walter, Janis Kalofolias, Jilles Vreeken | Learning Exceptional Subgroups by End-to-End Maximizing KL-divergence | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Finding and describing sub-populations that are exceptional regarding a
target property has important applications in many scientific disciplines, from
identifying disadvantaged demographic groups in census data to finding
conductive molecules within gold nanoparticles. Current approaches to finding
such subgroups re... | [
{
"created": "Tue, 20 Feb 2024 11:29:57 GMT",
"version": "v1"
}
] | 2024-02-21 | [
[
"Xu",
"Sascha",
""
],
[
"Walter",
"Nils Philipp",
""
],
[
"Kalofolias",
"Janis",
""
],
[
"Vreeken",
"Jilles",
""
]
] | Finding and describing sub-populations that are exceptional regarding a target property has important applications in many scientific disciplines, from identifying disadvantaged demographic groups in census data to finding conductive molecules within gold nanoparticles. Current approaches to finding such subgroups requ... |
cs/0703045 | Mehmet Ak\c{c}akaya | Mehmet Ak\c{c}akaya and Vahid Tarokh | Performance Bounds on Sparse Representations Using Redundant Frames | 8 pages, 1 figure, Submitted to IEEE Transactions on Signal
Processing | null | null | null | cs.IT math.IT | null | We consider approximations of signals by the elements of a frame in a complex
vector space of dimension $N$ and formulate both the noiseless and the noisy
sparse representation problems. The noiseless representation problem is to find
sparse representations of a signal $\mathbf{r}$ given that such representations
exi... | [
{
"created": "Fri, 9 Mar 2007 19:28:10 GMT",
"version": "v1"
}
] | 2007-07-13 | [
[
"Akçakaya",
"Mehmet",
""
],
[
"Tarokh",
"Vahid",
""
]
] | We consider approximations of signals by the elements of a frame in a complex vector space of dimension $N$ and formulate both the noiseless and the noisy sparse representation problems. The noiseless representation problem is to find sparse representations of a signal $\mathbf{r}$ given that such representations exist... |
2301.13642 | Navdeep Kumar | Navdeep Kumar, Kfir Levy, Kaixin Wang, Shie Mannor | An Efficient Solution to s-Rectangular Robust Markov Decision Processes | arXiv admin note: substantial text overlap with arXiv:2205.14327 | null | null | null | cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an efficient robust value iteration for \texttt{s}-rectangular
robust Markov Decision Processes (MDPs) with a time complexity comparable to
standard (non-robust) MDPs which is significantly faster than any existing
method. We do so by deriving the optimal robust Bellman operator in concrete
forms using our... | [
{
"created": "Tue, 31 Jan 2023 13:54:23 GMT",
"version": "v1"
}
] | 2023-02-01 | [
[
"Kumar",
"Navdeep",
""
],
[
"Levy",
"Kfir",
""
],
[
"Wang",
"Kaixin",
""
],
[
"Mannor",
"Shie",
""
]
] | We present an efficient robust value iteration for \texttt{s}-rectangular robust Markov Decision Processes (MDPs) with a time complexity comparable to standard (non-robust) MDPs which is significantly faster than any existing method. We do so by deriving the optimal robust Bellman operator in concrete forms using our $... |
1312.5434 | Xiaochuan Zhao | Xiaochuan Zhao and Ali H. Sayed | Asynchronous Adaptation and Learning over Networks --- Part I: Modeling
and Stability Analysis | 40 pages, 6 figures | null | null | null | cs.SY cs.IT cs.LG math.IT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work and the supporting Parts II [2] and III [3], we provide a rather
detailed analysis of the stability and performance of asynchronous strategies
for solving distributed optimization and adaptation problems over networks. We
examine asynchronous networks that are subject to fairly general sources of
uncerta... | [
{
"created": "Thu, 19 Dec 2013 08:29:57 GMT",
"version": "v1"
},
{
"created": "Sun, 27 Jul 2014 01:00:16 GMT",
"version": "v2"
},
{
"created": "Tue, 16 Dec 2014 08:16:46 GMT",
"version": "v3"
}
] | 2014-12-17 | [
[
"Zhao",
"Xiaochuan",
""
],
[
"Sayed",
"Ali H.",
""
]
] | In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We examine asynchronous networks that are subject to fairly general sources of uncertain... |
2007.02758 | Omar Sharif | Eftekhar Hossain, Omar Sharif and Mohammed Moshiul Hoque | Sentiment Polarity Detection on Bengali Book Reviews Using Multinomial
Naive Bayes | 12 pages, ICACIE 2020, Will be published by Advances in Intelligent
Systems and Computing (AISC) series of Springer | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Recently, sentiment polarity detection has increased attention to NLP
researchers due to the massive availability of customer's opinions or reviews
in the online platform. Due to the continued expansion of e-commerce sites, the
rate of purchase of various products, including books, are growing enormously
among the pe... | [
{
"created": "Mon, 6 Jul 2020 13:58:51 GMT",
"version": "v1"
}
] | 2020-07-07 | [
[
"Hossain",
"Eftekhar",
""
],
[
"Sharif",
"Omar",
""
],
[
"Hoque",
"Mohammed Moshiul",
""
]
] | Recently, sentiment polarity detection has increased attention to NLP researchers due to the massive availability of customer's opinions or reviews in the online platform. Due to the continued expansion of e-commerce sites, the rate of purchase of various products, including books, are growing enormously among the peop... |
2008.05782 | Volodymyr Leno | V. Leno, A. Augusto, M. Dumas, M. La Rosa, F. Maggi, A. Polyvyanyy | Identifying candidate routines for Robotic Process Automation from
unsegmented UI logs | International Conference on Process Mining 2020 | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robotic Process Automation (RPA) is a technology to develop software bots
that automate repetitive sequences of interactions between users and software
applications (a.k.a. routines). To take full advantage of this technology,
organizations need to identify and to scope their routines. This is a
challenging endeavor ... | [
{
"created": "Thu, 13 Aug 2020 09:58:40 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Aug 2020 01:16:10 GMT",
"version": "v2"
}
] | 2020-08-28 | [
[
"Leno",
"V.",
""
],
[
"Augusto",
"A.",
""
],
[
"Dumas",
"M.",
""
],
[
"La Rosa",
"M.",
""
],
[
"Maggi",
"F.",
""
],
[
"Polyvyanyy",
"A.",
""
]
] | Robotic Process Automation (RPA) is a technology to develop software bots that automate repetitive sequences of interactions between users and software applications (a.k.a. routines). To take full advantage of this technology, organizations need to identify and to scope their routines. This is a challenging endeavor in... |
1708.07808 | Cagdas Ulas | Cagdas Ulas, Christine Preibisch, Jonathan Sperl, Thomas Pyka,
Jayashree Kalpathy-Cramer, Bjoern Menze | Accelerated Reconstruction of Perfusion-Weighted MRI Enforcing Jointly
Local and Nonlocal Spatio-temporal Constraints | Submission to IEEE Transactions on Medical Imaging (August 2017) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Perfusion-weighted magnetic resonance imaging (MRI) is an imaging technique
that allows one to measure tissue perfusion in an organ of interest through the
injection of an intravascular paramagnetic contrast agent (CA). Due to a
preference for high temporal and spatial resolution in many applications, this
modality c... | [
{
"created": "Fri, 25 Aug 2017 16:52:04 GMT",
"version": "v1"
}
] | 2017-08-28 | [
[
"Ulas",
"Cagdas",
""
],
[
"Preibisch",
"Christine",
""
],
[
"Sperl",
"Jonathan",
""
],
[
"Pyka",
"Thomas",
""
],
[
"Kalpathy-Cramer",
"Jayashree",
""
],
[
"Menze",
"Bjoern",
""
]
] | Perfusion-weighted magnetic resonance imaging (MRI) is an imaging technique that allows one to measure tissue perfusion in an organ of interest through the injection of an intravascular paramagnetic contrast agent (CA). Due to a preference for high temporal and spatial resolution in many applications, this modality cou... |
1906.02729 | Nilesh Kulkarni | Nilesh Kulkarni, Ishan Misra, Shubham Tulsiani, Abhinav Gupta | 3D-RelNet: Joint Object and Relational Network for 3D Prediction | Project page: https://nileshkulkarni.github.io/relative3d/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an approach to predict the 3D shape and pose for the objects
present in a scene. Existing learning based methods that pursue this goal make
independent predictions per object, and do not leverage the relationships
amongst them. We argue that reasoning about these relationships is crucial, and
present an ap... | [
{
"created": "Thu, 6 Jun 2019 17:50:48 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Aug 2019 17:49:01 GMT",
"version": "v2"
},
{
"created": "Thu, 5 Mar 2020 04:10:25 GMT",
"version": "v3"
}
] | 2020-03-06 | [
[
"Kulkarni",
"Nilesh",
""
],
[
"Misra",
"Ishan",
""
],
[
"Tulsiani",
"Shubham",
""
],
[
"Gupta",
"Abhinav",
""
]
] | We propose an approach to predict the 3D shape and pose for the objects present in a scene. Existing learning based methods that pursue this goal make independent predictions per object, and do not leverage the relationships amongst them. We argue that reasoning about these relationships is crucial, and present an appr... |
2312.10600 | Yixin Zhang | Yixin Zhang, Shen Zhao, Hanxue Gu, Maciej A. Mazurowski | How to Efficiently Annotate Images for Best-Performing Deep Learning
Based Segmentation Models: An Empirical Study with Weak and Noisy Annotations
and Segment Anything Model | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Deep neural networks (DNNs) have been deployed for many image segmentation
tasks and achieved outstanding performance. However, preparing a dataset for
training segmentation DNNs is laborious and costly since typically pixel-level
annotations are provided for each object of interest. To alleviate this issue,
one can ... | [
{
"created": "Sun, 17 Dec 2023 04:26:42 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Dec 2023 22:53:23 GMT",
"version": "v2"
}
] | 2023-12-22 | [
[
"Zhang",
"Yixin",
""
],
[
"Zhao",
"Shen",
""
],
[
"Gu",
"Hanxue",
""
],
[
"Mazurowski",
"Maciej A.",
""
]
] | Deep neural networks (DNNs) have been deployed for many image segmentation tasks and achieved outstanding performance. However, preparing a dataset for training segmentation DNNs is laborious and costly since typically pixel-level annotations are provided for each object of interest. To alleviate this issue, one can pr... |
2209.08235 | Xindi Wang | Jinjing Wang, Xindi Wang | Technical Report for Trend Prediction Based Intelligent UAV Trajectory
Planning for Large-scale Dynamic Scenarios | null | null | null | null | cs.NI | http://creativecommons.org/publicdomain/zero/1.0/ | The unmanned aerial vehicle (UAV)-enabled communication technology is
regarded as an efficient and effective solution for some special application
scenarios where existing terrestrial infrastructures are overloaded to provide
reliable services. To maximize the utility of the UAV-enabled system while
meeting the QoS a... | [
{
"created": "Sat, 17 Sep 2022 03:46:23 GMT",
"version": "v1"
}
] | 2022-09-20 | [
[
"Wang",
"Jinjing",
""
],
[
"Wang",
"Xindi",
""
]
] | The unmanned aerial vehicle (UAV)-enabled communication technology is regarded as an efficient and effective solution for some special application scenarios where existing terrestrial infrastructures are overloaded to provide reliable services. To maximize the utility of the UAV-enabled system while meeting the QoS and... |
1709.02557 | EPTCS | Lucas E. R. Fernandes (1), Vinicius Custodio (1), Gleifer V. Alves
(1), Michael Fisher (2) ((1) UTFPR, Ponta Grossa, Parana, Brazil, (2)
University of Liverpool, Liverpool, United Kingdom) | A Rational Agent Controlling an Autonomous Vehicle: Implementation and
Formal Verification | In Proceedings FVAV 2017, arXiv:1709.02126 | EPTCS 257, 2017, pp. 35-42 | 10.4204/EPTCS.257.5 | null | cs.LO cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The development and deployment of Autonomous Vehicles (AVs) on our roads is
not only realistic in the near future but can also bring significant benefits.
In particular, it can potentially solve several problems relating to vehicles
and traffic, for instance: (i) possible reduction of traffic congestion, with
the con... | [
{
"created": "Fri, 8 Sep 2017 06:35:30 GMT",
"version": "v1"
}
] | 2017-09-11 | [
[
"Fernandes",
"Lucas E. R.",
""
],
[
"Custodio",
"Vinicius",
""
],
[
"Alves",
"Gleifer V.",
""
],
[
"Fisher",
"Michael",
""
]
] | The development and deployment of Autonomous Vehicles (AVs) on our roads is not only realistic in the near future but can also bring significant benefits. In particular, it can potentially solve several problems relating to vehicles and traffic, for instance: (i) possible reduction of traffic congestion, with the conse... |
2009.03268 | Teng Liu | Hong Shu, Teng Liu, Xingyu Mu, Dongpu Cao | Driving Tasks Transfer in Deep Reinforcement Learning for
Decision-making of Autonomous Vehicles | 10 pages 12 figures | null | null | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge transfer is a promising concept to achieve real-time
decision-making for autonomous vehicles. This paper constructs a transfer deep
reinforcement learning framework to transform the driving tasks in
inter-section environments. The driving missions at the un-signalized
intersection are cast into a left turn,... | [
{
"created": "Mon, 7 Sep 2020 17:34:01 GMT",
"version": "v1"
},
{
"created": "Sat, 10 Oct 2020 14:16:31 GMT",
"version": "v2"
}
] | 2020-10-13 | [
[
"Shu",
"Hong",
""
],
[
"Liu",
"Teng",
""
],
[
"Mu",
"Xingyu",
""
],
[
"Cao",
"Dongpu",
""
]
] | Knowledge transfer is a promising concept to achieve real-time decision-making for autonomous vehicles. This paper constructs a transfer deep reinforcement learning framework to transform the driving tasks in inter-section environments. The driving missions at the un-signalized intersection are cast into a left turn, r... |
1102.4241 | Petros Zimourtopoulos E | Nikolitsa Yannopoulou, Petros Zimourtopoulos | Support of Interactive 3D/4D Presentations by the Very First Ever Made
Virtual Laboratories of Antennas | Inadequately justified rejection (with reviewers' grades: [4, 4, 3,
4] + [4, 4, 4, 4] + [2, 4, 4, 4] out of 3 x [5, 5, 5, 5]) from publication to
the Proceedings of 21st International Conference Radioelektronika 2011, April
19-20, Brno, Czech Republic - No changes in the paper since [v1] Mon, 21 Feb
2011 14:52:... | FunkTechnikPlus # Journal, Issue 3 - Year 1, 31 January 2014, v1,
7-18, otoiser ftp#j | null | null | cs.OH physics.comp-ph | http://creativecommons.org/licenses/by/3.0/ | Based on the experience we have gained so far, as independent reviewers of
Radioengineering journal, we thought that may be proved useful to publicly
share with the interested author, especially the young one, some practical
implementations of our ideas for the interactive representation of data using
3D/4D movement ... | [
{
"created": "Mon, 21 Feb 2011 14:52:34 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Mar 2011 17:45:27 GMT",
"version": "v2"
},
{
"created": "Wed, 17 Oct 2012 09:18:07 GMT",
"version": "v3"
}
] | 2015-06-03 | [
[
"Yannopoulou",
"Nikolitsa",
""
],
[
"Zimourtopoulos",
"Petros",
""
]
] | Based on the experience we have gained so far, as independent reviewers of Radioengineering journal, we thought that may be proved useful to publicly share with the interested author, especially the young one, some practical implementations of our ideas for the interactive representation of data using 3D/4D movement an... |
2104.06820 | Utkarsh Ojha | Utkarsh Ojha, Yijun Li, Jingwan Lu, Alexei A. Efros, Yong Jae Lee, Eli
Shechtman, Richard Zhang | Few-shot Image Generation via Cross-domain Correspondence | CVPR 2021 | null | null | null | cs.CV cs.GR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Training generative models, such as GANs, on a target domain containing
limited examples (e.g., 10) can easily result in overfitting. In this work, we
seek to utilize a large source domain for pretraining and transfer the
diversity information from source to target. We propose to preserve the
relative similarities an... | [
{
"created": "Tue, 13 Apr 2021 17:59:35 GMT",
"version": "v1"
}
] | 2021-04-15 | [
[
"Ojha",
"Utkarsh",
""
],
[
"Li",
"Yijun",
""
],
[
"Lu",
"Jingwan",
""
],
[
"Efros",
"Alexei A.",
""
],
[
"Lee",
"Yong Jae",
""
],
[
"Shechtman",
"Eli",
""
],
[
"Zhang",
"Richard",
""
]
] | Training generative models, such as GANs, on a target domain containing limited examples (e.g., 10) can easily result in overfitting. In this work, we seek to utilize a large source domain for pretraining and transfer the diversity information from source to target. We propose to preserve the relative similarities and ... |
2305.12173 | Simon Jeanteur | Simon Jeanteur, Laura Kov\'acs, Matteo Maffei and Michael Rawson | CryptoVampire: Automated Reasoning for the Complete Symbolic Attacker
Cryptographic Model | null | null | null | null | cs.CR cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cryptographic protocols are hard to design and prove correct, as witnessed by
the ever-growing list of attacks even on protocol standards. Symbolic models of
cryptography enable automated formal security proofs of such protocols against
an idealized model, which abstracts away from the algebraic properties of
cryptog... | [
{
"created": "Sat, 20 May 2023 11:26:51 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Apr 2024 14:45:53 GMT",
"version": "v2"
}
] | 2024-04-08 | [
[
"Jeanteur",
"Simon",
""
],
[
"Kovács",
"Laura",
""
],
[
"Maffei",
"Matteo",
""
],
[
"Rawson",
"Michael",
""
]
] | Cryptographic protocols are hard to design and prove correct, as witnessed by the ever-growing list of attacks even on protocol standards. Symbolic models of cryptography enable automated formal security proofs of such protocols against an idealized model, which abstracts away from the algebraic properties of cryptogra... |
2212.10166 | Jade Ma\"i Cock | Jade Ma\"i Cock, Muhammad Bilal, Richard Davis, Mirko Marras, Tanja
K\"aser | Protected Attributes Tell Us Who, Behavior Tells Us How: A Comparison of
Demographic and Behavioral Oversampling for Fair Student Success Modeling | Accepted as a full paper at LAK 2023: The 13th International Learning
Analytics and Knowledge Conference, 13-17 of March 2023, Arlington | null | 10.1145/3576050.3576149 | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Algorithms deployed in education can shape the learning experience and
success of a student. It is therefore important to understand whether and how
such algorithms might create inequalities or amplify existing biases. In this
paper, we analyze the fairness of models which use behavioral data to identify
at-risk stud... | [
{
"created": "Tue, 20 Dec 2022 11:09:11 GMT",
"version": "v1"
}
] | 2022-12-21 | [
[
"Cock",
"Jade Maï",
""
],
[
"Bilal",
"Muhammad",
""
],
[
"Davis",
"Richard",
""
],
[
"Marras",
"Mirko",
""
],
[
"Käser",
"Tanja",
""
]
] | Algorithms deployed in education can shape the learning experience and success of a student. It is therefore important to understand whether and how such algorithms might create inequalities or amplify existing biases. In this paper, we analyze the fairness of models which use behavioral data to identify at-risk studen... |
1812.04293 | Hien Truong | Kumar Sharad, Giorgia Azzurra Marson, Hien Thi Thu Truong, Ghassan
Karame | On the Security of Randomized Defenses Against Adversarial Samples | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Deep Learning has been shown to be particularly vulnerable to adversarial
samples. To combat adversarial strategies, numerous defensive techniques have
been proposed. Among these, a promising approach is to use randomness in order
to make the classification process unpredictable and presumably harder for the
adversar... | [
{
"created": "Tue, 11 Dec 2018 09:34:29 GMT",
"version": "v1"
},
{
"created": "Wed, 8 May 2019 13:14:29 GMT",
"version": "v2"
},
{
"created": "Wed, 11 Mar 2020 15:49:38 GMT",
"version": "v3"
},
{
"created": "Mon, 16 Mar 2020 22:03:45 GMT",
"version": "v4"
}
] | 2020-03-18 | [
[
"Sharad",
"Kumar",
""
],
[
"Marson",
"Giorgia Azzurra",
""
],
[
"Truong",
"Hien Thi Thu",
""
],
[
"Karame",
"Ghassan",
""
]
] | Deep Learning has been shown to be particularly vulnerable to adversarial samples. To combat adversarial strategies, numerous defensive techniques have been proposed. Among these, a promising approach is to use randomness in order to make the classification process unpredictable and presumably harder for the adversary ... |
1606.06047 | Harmeet Singh | Harmeet Singh | Contravening Esotery: Cryptanalysis of Knapsack Cipher using Genetic
Algorithms | http://www.ijcaonline.org/archives/volume140/number6/24599-2016909333, 2016 | null | null | null | cs.CR cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cryptanalysis of knapsack cipher is a fascinating problem which has eluded
the computing fraternity for decades. However, in most of the cases either the
time complexity of the proposed algorithm is colossal or an insufficient number
of samples have been taken for verification. The present work proposes a
Genetic Alg... | [
{
"created": "Mon, 20 Jun 2016 10:04:05 GMT",
"version": "v1"
}
] | 2016-06-21 | [
[
"Singh",
"Harmeet",
""
]
] | Cryptanalysis of knapsack cipher is a fascinating problem which has eluded the computing fraternity for decades. However, in most of the cases either the time complexity of the proposed algorithm is colossal or an insufficient number of samples have been taken for verification. The present work proposes a Genetic Algor... |
2205.12520 | Weijun Gao | Chong Han, Weijun Gao, Nan Yang, and Josep M. Jornet | Molecular Absorption Effect: A Double-edged Sword of Terahertz
Communications | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Communications in the terahertz band (THz) (0.1--10~THz) have been regarded
as a promising technology for future 6G and beyond wireless systems, to
overcome the challenges of evergrowing wireless data traffic and crowded
spectrum. As the frequency increases from the microwave band to the THz band,
new spectrum featur... | [
{
"created": "Wed, 25 May 2022 06:20:58 GMT",
"version": "v1"
}
] | 2022-05-26 | [
[
"Han",
"Chong",
""
],
[
"Gao",
"Weijun",
""
],
[
"Yang",
"Nan",
""
],
[
"Jornet",
"Josep M.",
""
]
] | Communications in the terahertz band (THz) (0.1--10~THz) have been regarded as a promising technology for future 6G and beyond wireless systems, to overcome the challenges of evergrowing wireless data traffic and crowded spectrum. As the frequency increases from the microwave band to the THz band, new spectrum features... |
1803.02489 | Vahid Ahmadi | Vahid Ahmadi | Deforestation Prediction Using Neural Networks and Satellite Imagery in
a Spatial Information System | null | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deforestation, as one of the challenging environmental problems in the world,
has been recorded the most serious threat to environmental diversity and one of
the main components of land-use change. In this paper, we investigate spatial
distribution of deforestation using artificial neural networks and satellite
image... | [
{
"created": "Wed, 7 Mar 2018 00:35:02 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Dec 2018 23:59:45 GMT",
"version": "v2"
}
] | 2018-12-27 | [
[
"Ahmadi",
"Vahid",
""
]
] | Deforestation, as one of the challenging environmental problems in the world, has been recorded the most serious threat to environmental diversity and one of the main components of land-use change. In this paper, we investigate spatial distribution of deforestation using artificial neural networks and satellite imagery... |
2308.16185 | Antonio Loquercio | Andrea Bajcsy, Antonio Loquercio, Ashish Kumar, Jitendra Malik | Learning Vision-based Pursuit-Evasion Robot Policies | Includes Supplementary. Project webpage at
https://abajcsy.github.io/vision-based-pursuit/ | null | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by/4.0/ | Learning strategic robot behavior -- like that required in pursuit-evasion
interactions -- under real-world constraints is extremely challenging. It
requires exploiting the dynamics of the interaction, and planning through both
physical state and latent intent uncertainty. In this paper, we transform this
intractable... | [
{
"created": "Wed, 30 Aug 2023 17:59:05 GMT",
"version": "v1"
}
] | 2023-08-31 | [
[
"Bajcsy",
"Andrea",
""
],
[
"Loquercio",
"Antonio",
""
],
[
"Kumar",
"Ashish",
""
],
[
"Malik",
"Jitendra",
""
]
] | Learning strategic robot behavior -- like that required in pursuit-evasion interactions -- under real-world constraints is extremely challenging. It requires exploiting the dynamics of the interaction, and planning through both physical state and latent intent uncertainty. In this paper, we transform this intractable p... |
1807.04181 | Martin Wilhelm | Martin Wilhelm | On error representation in exact-decisions number types | null | null | null | null | cs.CG cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accuracy-driven computation is a strategy widely used in exact-decisions
number types for robust geometric algorithms. This work provides an overview on
the usage of error bounds in accuracy-driven computation, compares different
approaches on the representation and computation of these error bounds and
points out so... | [
{
"created": "Wed, 11 Jul 2018 15:01:39 GMT",
"version": "v1"
}
] | 2018-07-12 | [
[
"Wilhelm",
"Martin",
""
]
] | Accuracy-driven computation is a strategy widely used in exact-decisions number types for robust geometric algorithms. This work provides an overview on the usage of error bounds in accuracy-driven computation, compares different approaches on the representation and computation of these error bounds and points out some... |
1809.00066 | Yova Kementchedjhieva | Yova Kementchedjhieva and Adam Lopez | Indicatements that character language models learn English
morpho-syntactic units and regularities | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Character language models have access to surface morphological patterns, but
it is not clear whether or how they learn abstract morphological regularities.
We instrument a character language model with several probes, finding that it
can develop a specific unit to identify word boundaries and, by extension,
morpheme ... | [
{
"created": "Fri, 31 Aug 2018 21:27:54 GMT",
"version": "v1"
}
] | 2018-09-05 | [
[
"Kementchedjhieva",
"Yova",
""
],
[
"Lopez",
"Adam",
""
]
] | Character language models have access to surface morphological patterns, but it is not clear whether or how they learn abstract morphological regularities. We instrument a character language model with several probes, finding that it can develop a specific unit to identify word boundaries and, by extension, morpheme bo... |
2106.00014 | Mircea Andrecut Dr | M. Andrecut | Diffusion Self-Organizing Map on the Hypersphere | 10 pages, 4 figures | null | null | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We discuss a diffusion based implementation of the self-organizing map on the
unit hypersphere. We show that this approach can be efficiently implemented
using just linear algebra methods, we give a python numpy implementation, and
we illustrate the approach using the well known MNIST dataset.
| [
{
"created": "Mon, 31 May 2021 16:27:50 GMT",
"version": "v1"
}
] | 2021-06-02 | [
[
"Andrecut",
"M.",
""
]
] | We discuss a diffusion based implementation of the self-organizing map on the unit hypersphere. We show that this approach can be efficiently implemented using just linear algebra methods, we give a python numpy implementation, and we illustrate the approach using the well known MNIST dataset. |
cs/0703006 | Jingchao Chen | Jing-Chao Chen | XORSAT: An Efficient Algorithm for the DIMACS 32-bit Parity Problem | null | null | null | null | cs.DS | null | The DIMACS 32-bit parity problem is a satisfiability (SAT) problem hard to
solve. So far, EqSatz by Li is the only solver which can solve this problem.
However, This solver is very slow. It is reported that it spent 11855 seconds
to solve a par32-5 instance on a Maxintosh G3 300 MHz. The paper introduces a
new solver... | [
{
"created": "Fri, 2 Mar 2007 01:38:16 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Chen",
"Jing-Chao",
""
]
] | The DIMACS 32-bit parity problem is a satisfiability (SAT) problem hard to solve. So far, EqSatz by Li is the only solver which can solve this problem. However, This solver is very slow. It is reported that it spent 11855 seconds to solve a par32-5 instance on a Maxintosh G3 300 MHz. The paper introduces a new solver, ... |
1912.04042 | John Duchi | Hilal Asi and John Duchi and Omid Javidbakht | Element Level Differential Privacy: The Right Granularity of Privacy | 34 pages, 5 figures | null | null | null | cs.LG cs.CR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Differential Privacy (DP) provides strong guarantees on the risk of
compromising a user's data in statistical learning applications, though these
strong protections make learning challenging and may be too stringent for some
use cases. To address this, we propose element level differential privacy,
which extends diff... | [
{
"created": "Thu, 5 Dec 2019 23:05:54 GMT",
"version": "v1"
}
] | 2019-12-10 | [
[
"Asi",
"Hilal",
""
],
[
"Duchi",
"John",
""
],
[
"Javidbakht",
"Omid",
""
]
] | Differential Privacy (DP) provides strong guarantees on the risk of compromising a user's data in statistical learning applications, though these strong protections make learning challenging and may be too stringent for some use cases. To address this, we propose element level differential privacy, which extends differ... |
2407.02336 | Adrian Rebmann | Adrian Rebmann, Timotheus Kampik, Carl Corea, Han van der Aa | Mining Constraints from Reference Process Models for Detecting
Best-Practice Violations in Event Log | Preprint submitted to Information Systems | null | null | null | cs.SE cs.DB | http://creativecommons.org/licenses/by/4.0/ | Detecting undesired process behavior is one of the main tasks of process
mining and various conformance-checking techniques have been developed to this
end. These techniques typically require a normative process model as input,
specifically designed for the processes to be analyzed. Such models are rarely
available, ... | [
{
"created": "Tue, 2 Jul 2024 15:05:37 GMT",
"version": "v1"
}
] | 2024-07-03 | [
[
"Rebmann",
"Adrian",
""
],
[
"Kampik",
"Timotheus",
""
],
[
"Corea",
"Carl",
""
],
[
"van der Aa",
"Han",
""
]
] | Detecting undesired process behavior is one of the main tasks of process mining and various conformance-checking techniques have been developed to this end. These techniques typically require a normative process model as input, specifically designed for the processes to be analyzed. Such models are rarely available, th... |
2306.17172 | Bashir Sadiq Mr | Bashir Olaniyi Sadiq, Muhammed Yusuf Abiodun, Sikiru Olayinka
Zakariyya, and Mohammed Dahiru Buhari | FANET Experiment: Real-Time Surveillance Applications Connected to Image
Processing System | KIU Journal of Science, Engineering and Technology (2023) | null | 10.59568/KJSET-2023-2-1-02 | null | cs.CV | http://creativecommons.org/publicdomain/zero/1.0/ | The major goal of this paper is to use image enhancement techniques for
enhancing and extracting data in FANET applications to improve the efficiency
of surveillance. The proposed conceptual system design can improve the
likelihood of FANET operations in oil pipeline surveillance, and sports and
media coverage with t... | [
{
"created": "Thu, 15 Jun 2023 10:14:44 GMT",
"version": "v1"
}
] | 2023-07-03 | [
[
"Sadiq",
"Bashir Olaniyi",
""
],
[
"Abiodun",
"Muhammed Yusuf",
""
],
[
"Zakariyya",
"Sikiru Olayinka",
""
],
[
"Buhari",
"Mohammed Dahiru",
""
]
] | The major goal of this paper is to use image enhancement techniques for enhancing and extracting data in FANET applications to improve the efficiency of surveillance. The proposed conceptual system design can improve the likelihood of FANET operations in oil pipeline surveillance, and sports and media coverage with the... |
1701.02795 | Zeshan Hussain | Hardie Cate and Zeshan Hussain | Bidirectional American Sign Language to English Translation | 7 pages | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We outline a bidirectional translation system that converts sentences from
American Sign Language (ASL) to English, and vice versa. To perform machine
translation between ASL and English, we utilize a generative approach.
Specifically, we employ an adjustment to the IBM word-alignment model 1 (IBM
WAM1), where we def... | [
{
"created": "Tue, 10 Jan 2017 21:45:56 GMT",
"version": "v1"
}
] | 2017-01-12 | [
[
"Cate",
"Hardie",
""
],
[
"Hussain",
"Zeshan",
""
]
] | We outline a bidirectional translation system that converts sentences from American Sign Language (ASL) to English, and vice versa. To perform machine translation between ASL and English, we utilize a generative approach. Specifically, we employ an adjustment to the IBM word-alignment model 1 (IBM WAM1), where we defin... |
1707.07548 | Yinghao Huang | Yinghao Huang, Federica Bogo, Christoph Lassner, Angjoo Kanazawa,
Peter V. Gehler, Ijaz Akhter, Michael J. Black | Towards Accurate Markerless Human Shape and Pose Estimation over Time | 10 pages, 6 figures, 5 tables, published in 3DV-2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing marker-less motion capture methods often assume known backgrounds,
static cameras, and sequence specific motion priors, which narrows its
application scenarios. Here we propose a fully automatic method that given
multi-view video, estimates 3D human motion and body shape. We take recent
SMPLify \cite{bogo201... | [
{
"created": "Mon, 24 Jul 2017 13:31:37 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Jul 2017 19:28:39 GMT",
"version": "v2"
},
{
"created": "Mon, 18 Dec 2017 09:57:36 GMT",
"version": "v3"
},
{
"created": "Wed, 20 Dec 2017 13:07:03 GMT",
"version": "v4"
},
{
"c... | 2018-05-01 | [
[
"Huang",
"Yinghao",
""
],
[
"Bogo",
"Federica",
""
],
[
"Lassner",
"Christoph",
""
],
[
"Kanazawa",
"Angjoo",
""
],
[
"Gehler",
"Peter V.",
""
],
[
"Akhter",
"Ijaz",
""
],
[
"Black",
"Michael J.",
""
]
] | Existing marker-less motion capture methods often assume known backgrounds, static cameras, and sequence specific motion priors, which narrows its application scenarios. Here we propose a fully automatic method that given multi-view video, estimates 3D human motion and body shape. We take recent SMPLify \cite{bogo2016k... |
1102.2969 | Gook-Pil Roh | Gook-Pil Roh, Seung-won Hwang, and Byoung-Kee Yi | Efficient and scalable geometric hashing method for searching protein 3D
structures | 9 pages, 1 figures | null | null | null | cs.DB q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the structural databases continue to expand, efficient methods are
required to search similar structures of the query structure from the database.
There are many previous works about comparing protein 3D structures and
scanning the database with a query structure. However, they generally have
limitations on practi... | [
{
"created": "Tue, 15 Feb 2011 05:37:34 GMT",
"version": "v1"
}
] | 2011-02-16 | [
[
"Roh",
"Gook-Pil",
""
],
[
"Hwang",
"Seung-won",
""
],
[
"Yi",
"Byoung-Kee",
""
]
] | As the structural databases continue to expand, efficient methods are required to search similar structures of the query structure from the database. There are many previous works about comparing protein 3D structures and scanning the database with a query structure. However, they generally have limitations on practica... |
2402.06892 | Masanari Kimura | Masanari Kimura | Understanding Test-Time Augmentation | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Test-Time Augmentation (TTA) is a very powerful heuristic that takes
advantage of data augmentation during testing to produce averaged output.
Despite the experimental effectiveness of TTA, there is insufficient discussion
of its theoretical aspects. In this paper, we aim to give theoretical
guarantees for TTA and cl... | [
{
"created": "Sat, 10 Feb 2024 06:49:08 GMT",
"version": "v1"
}
] | 2024-02-13 | [
[
"Kimura",
"Masanari",
""
]
] | Test-Time Augmentation (TTA) is a very powerful heuristic that takes advantage of data augmentation during testing to produce averaged output. Despite the experimental effectiveness of TTA, there is insufficient discussion of its theoretical aspects. In this paper, we aim to give theoretical guarantees for TTA and clar... |
2203.16942 | Xu Chen | Weiqi Shao and Xu Chen and Long Xia and Jiashu Zhao and Dawei Yin | Sequential Recommendation with User Evolving Preference Decomposition | sequential recommendation | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | Modeling user sequential behaviors has recently attracted increasing
attention in the recommendation domain. Existing methods mostly assume coherent
preference in the same sequence. However, user personalities are volatile and
easily changed, and there can be multiple mixed preferences underlying user
behaviors. To s... | [
{
"created": "Thu, 31 Mar 2022 10:57:59 GMT",
"version": "v1"
}
] | 2022-04-01 | [
[
"Shao",
"Weiqi",
""
],
[
"Chen",
"Xu",
""
],
[
"Xia",
"Long",
""
],
[
"Zhao",
"Jiashu",
""
],
[
"Yin",
"Dawei",
""
]
] | Modeling user sequential behaviors has recently attracted increasing attention in the recommendation domain. Existing methods mostly assume coherent preference in the same sequence. However, user personalities are volatile and easily changed, and there can be multiple mixed preferences underlying user behaviors. To sol... |
1710.03960 | Gabriel Nivasch | David Eppstein, Sariel Har-Peled and Gabriel Nivasch | Grid peeling and the affine curve-shortening flow | 18 pages, 11 figures. A preliminary version appeared in ALENEX 2018 | Experimental Mathematics 29 (3): 306-316, 2020 | 10.1080/10586458.2018.1466379 | null | cs.CG math.DG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we study an experimentally-observed connection between two
seemingly unrelated processes, one from computational geometry and the other
from differential geometry. The first one (which we call "grid peeling") is the
convex-layer decomposition of subsets $G\subset \mathbb Z^2$ of the integer
grid, previo... | [
{
"created": "Wed, 11 Oct 2017 08:37:39 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Jan 2018 11:24:55 GMT",
"version": "v2"
}
] | 2020-08-14 | [
[
"Eppstein",
"David",
""
],
[
"Har-Peled",
"Sariel",
""
],
[
"Nivasch",
"Gabriel",
""
]
] | In this paper we study an experimentally-observed connection between two seemingly unrelated processes, one from computational geometry and the other from differential geometry. The first one (which we call "grid peeling") is the convex-layer decomposition of subsets $G\subset \mathbb Z^2$ of the integer grid, previous... |
2302.05832 | Tim Whitaker | Tim Whitaker, Darrell Whitley | Sparse Mutation Decompositions: Fine Tuning Deep Neural Networks with
Subspace Evolution | 8 Pages, 3 Figures | null | null | null | cs.NE cs.LG | http://creativecommons.org/licenses/by/4.0/ | Neuroevolution is a promising area of research that combines evolutionary
algorithms with neural networks. A popular subclass of neuroevolutionary
methods, called evolution strategies, relies on dense noise perturbations to
mutate networks, which can be sample inefficient and challenging for large
models with million... | [
{
"created": "Sun, 12 Feb 2023 01:27:26 GMT",
"version": "v1"
}
] | 2023-02-14 | [
[
"Whitaker",
"Tim",
""
],
[
"Whitley",
"Darrell",
""
]
] | Neuroevolution is a promising area of research that combines evolutionary algorithms with neural networks. A popular subclass of neuroevolutionary methods, called evolution strategies, relies on dense noise perturbations to mutate networks, which can be sample inefficient and challenging for large models with millions ... |
1010.2733 | Talbot Hugues | Camille Couprie (LIGM), Leo Grady, Hugues Talbot (LIGM), Laurent
Najman (LIGM) | Combinatorial Continuous Maximal Flows | 26 pages | SIAM Journal on Imaging Sciences 4 (2011) 905-930 | 10.1137/100799186 | null | cs.CV math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Maximum flow (and minimum cut) algorithms have had a strong impact on
computer vision. In particular, graph cuts algorithms provide a mechanism for
the discrete optimization of an energy functional which has been used in a
variety of applications such as image segmentation, stereo, image stitching and
texture synthes... | [
{
"created": "Wed, 13 Oct 2010 19:08:02 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Dec 2011 07:26:41 GMT",
"version": "v2"
}
] | 2011-12-30 | [
[
"Couprie",
"Camille",
"",
"LIGM"
],
[
"Grady",
"Leo",
"",
"LIGM"
],
[
"Talbot",
"Hugues",
"",
"LIGM"
],
[
"Najman",
"Laurent",
"",
"LIGM"
]
] | Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as image segmentation, stereo, image stitching and texture synthesis... |
2207.08426 | Ryann Sim Wei Jian | Georgios Piliouras, Lillian Ratliff, Ryann Sim, Stratis Skoulakis | Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum
Extensive Form Games | To appear in SAGT 2022 | null | null | null | cs.GT cs.LG cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The study of learning in games has thus far focused primarily on normal form
games. In contrast, our understanding of learning in extensive form games
(EFGs) and particularly in EFGs with many agents lags far behind, despite them
being closer in nature to many real world applications. We consider the natural
class of... | [
{
"created": "Mon, 18 Jul 2022 08:21:39 GMT",
"version": "v1"
}
] | 2022-07-19 | [
[
"Piliouras",
"Georgios",
""
],
[
"Ratliff",
"Lillian",
""
],
[
"Sim",
"Ryann",
""
],
[
"Skoulakis",
"Stratis",
""
]
] | The study of learning in games has thus far focused primarily on normal form games. In contrast, our understanding of learning in extensive form games (EFGs) and particularly in EFGs with many agents lags far behind, despite them being closer in nature to many real world applications. We consider the natural class of N... |
1905.09211 | Berkan Demirel | Berkan Demirel, Omer Ozdil, Yunus Emre Esin, Safak Ozturk | Segmentation-Aware Hyperspectral Image Classification | To appear at International Geoscience and Remote Sensing Symposium
(IGARSS) 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose an unified hyperspectral image classification
method which takes three-dimensional hyperspectral data cube as an input and
produces a classification map. In the proposed method, a deep neural network
which uses spectral and spatial information together with residual connections,
and pixel af... | [
{
"created": "Wed, 22 May 2019 16:03:01 GMT",
"version": "v1"
}
] | 2019-05-23 | [
[
"Demirel",
"Berkan",
""
],
[
"Ozdil",
"Omer",
""
],
[
"Esin",
"Yunus Emre",
""
],
[
"Ozturk",
"Safak",
""
]
] | In this paper, we propose an unified hyperspectral image classification method which takes three-dimensional hyperspectral data cube as an input and produces a classification map. In the proposed method, a deep neural network which uses spectral and spatial information together with residual connections, and pixel affi... |
1501.01202 | Christopher Mattern | Christopher Mattern | On Probability Estimation by Exponential Smoothing | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Probability estimation is essential for every statistical data compression
algorithm. In practice probability estimation should be adaptive, recent
observations should receive a higher weight than older observations. We present
a probability estimation method based on exponential smoothing that satisfies
this require... | [
{
"created": "Tue, 6 Jan 2015 15:31:53 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Jan 2015 11:53:51 GMT",
"version": "v2"
}
] | 2015-01-12 | [
[
"Mattern",
"Christopher",
""
]
] | Probability estimation is essential for every statistical data compression algorithm. In practice probability estimation should be adaptive, recent observations should receive a higher weight than older observations. We present a probability estimation method based on exponential smoothing that satisfies this requireme... |
2106.14699 | Johan \"Ofverstedt | Johan \"Ofverstedt, Joakim Lindblad, Nata\v{s}a Sladoje | Fast computation of mutual information in the frequency domain with
applications to global multimodal image alignment | 7 pages, 4 figures, 2 tables. The article is under consideration at
Pattern Recognition Letters | Pattern Recognition Letters, Vol. 159, pp. 196-203, 2022 | 10.1016/j.patrec.2022.05.022 | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multimodal image alignment is the process of finding spatial correspondences
between images formed by different imaging techniques or under different
conditions, to facilitate heterogeneous data fusion and correlative analysis.
The information-theoretic concept of mutual information (MI) is widely used as
a similarit... | [
{
"created": "Mon, 28 Jun 2021 13:27:05 GMT",
"version": "v1"
}
] | 2022-07-01 | [
[
"Öfverstedt",
"Johan",
""
],
[
"Lindblad",
"Joakim",
""
],
[
"Sladoje",
"Nataša",
""
]
] | Multimodal image alignment is the process of finding spatial correspondences between images formed by different imaging techniques or under different conditions, to facilitate heterogeneous data fusion and correlative analysis. The information-theoretic concept of mutual information (MI) is widely used as a similarity ... |
1910.10853 | Chunlei Liu | Chunlei Liu, Wenrui Ding, Xin Xia, Baochang Zhang, Jiaxin Gu,
Jianzhuang Liu, Rongrong Ji, David Doermann | Circulant Binary Convolutional Networks: Enhancing the Performance of
1-bit DCNNs with Circulant Back Propagation | Published in CVPR2019 | ]Proceedings of the IEEE Conference on Computer Vision and Pattern
Recognition. 2019: 2691-2699 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rapidly decreasing computation and memory cost has recently driven the
success of many applications in the field of deep learning. Practical
applications of deep learning in resource-limited hardware, such as embedded
devices and smart phones, however, remain challenging. For binary convolutional
networks, the re... | [
{
"created": "Thu, 24 Oct 2019 00:24:30 GMT",
"version": "v1"
}
] | 2019-10-25 | [
[
"Liu",
"Chunlei",
""
],
[
"Ding",
"Wenrui",
""
],
[
"Xia",
"Xin",
""
],
[
"Zhang",
"Baochang",
""
],
[
"Gu",
"Jiaxin",
""
],
[
"Liu",
"Jianzhuang",
""
],
[
"Ji",
"Rongrong",
""
],
[
"Doermann",
... | The rapidly decreasing computation and memory cost has recently driven the success of many applications in the field of deep learning. Practical applications of deep learning in resource-limited hardware, such as embedded devices and smart phones, however, remain challenging. For binary convolutional networks, the reas... |
2302.03088 | Laura Stegner | David Porfirio, Laura Stegner, Maya Cakmak, Allison Saupp\'e, Aws
Albarghouthi, Bilge Mutlu | Sketching Robot Programs On the Fly | Accepted at HRI '23, March 13-16, 2023, Stockholm, Sweden | null | 10.1145/3568162.3576991 | null | cs.RO cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Service robots for personal use in the home and the workplace require
end-user development solutions for swiftly scripting robot tasks as the need
arises. Many existing solutions preserve ease, efficiency, and convenience
through simple programming interfaces or by restricting task complexity. Others
facilitate metic... | [
{
"created": "Mon, 6 Feb 2023 19:44:05 GMT",
"version": "v1"
}
] | 2023-02-08 | [
[
"Porfirio",
"David",
""
],
[
"Stegner",
"Laura",
""
],
[
"Cakmak",
"Maya",
""
],
[
"Sauppé",
"Allison",
""
],
[
"Albarghouthi",
"Aws",
""
],
[
"Mutlu",
"Bilge",
""
]
] | Service robots for personal use in the home and the workplace require end-user development solutions for swiftly scripting robot tasks as the need arises. Many existing solutions preserve ease, efficiency, and convenience through simple programming interfaces or by restricting task complexity. Others facilitate meticul... |
2112.05340 | Alex Tamkin | Ananya Karthik, Mike Wu, Noah Goodman, Alex Tamkin | Tradeoffs Between Contrastive and Supervised Learning: An Empirical
Study | NeurIPS 2021 Workshop: Self-Supervised Learning - Theory and Practice | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Contrastive learning has made considerable progress in computer vision,
outperforming supervised pretraining on a range of downstream datasets.
However, is contrastive learning the better choice in all situations? We
demonstrate two cases where it is not. First, under sufficiently small
pretraining budgets, supervise... | [
{
"created": "Fri, 10 Dec 2021 05:19:32 GMT",
"version": "v1"
}
] | 2021-12-13 | [
[
"Karthik",
"Ananya",
""
],
[
"Wu",
"Mike",
""
],
[
"Goodman",
"Noah",
""
],
[
"Tamkin",
"Alex",
""
]
] | Contrastive learning has made considerable progress in computer vision, outperforming supervised pretraining on a range of downstream datasets. However, is contrastive learning the better choice in all situations? We demonstrate two cases where it is not. First, under sufficiently small pretraining budgets, supervised ... |
1404.4887 | Christian Schulz | Yaroslav Akhremtsev, Peter Sanders, Christian Schulz | (Semi-)External Algorithms for Graph Partitioning and Clustering | null | null | null | null | cs.DS cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we develop semi-external and external memory algorithms for
graph partitioning and clustering problems. Graph partitioning and clustering
are key tools for processing and analyzing large complex networks. We address
both problems in the (semi-)external model by adapting the size-constrained
label propa... | [
{
"created": "Fri, 18 Apr 2014 20:58:21 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Sep 2014 21:38:12 GMT",
"version": "v2"
}
] | 2014-09-24 | [
[
"Akhremtsev",
"Yaroslav",
""
],
[
"Sanders",
"Peter",
""
],
[
"Schulz",
"Christian",
""
]
] | In this paper, we develop semi-external and external memory algorithms for graph partitioning and clustering problems. Graph partitioning and clustering are key tools for processing and analyzing large complex networks. We address both problems in the (semi-)external model by adapting the size-constrained label propaga... |
1103.3190 | Johnny Karout | Johnny Karout, Erik Agrell, Krzysztof Szczerba and Magnus Karlsson | Designing Power-Efficient Modulation Formats for Noncoherent Optical
Systems | Submitted to Globecom 2011 | Proc. Global Communications Conference (GlobeCom), Houston, TX,
Dec. 2011 (best paper award) | 10.1109/GLOCOM.2011.6133546 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We optimize modulation formats for the additive white Gaussian noise channel
with a nonnegative input constraint, also known as the intensity-modulated
direct detection channel, with and without confining them to a lattice
structure. Our optimization criteria are the average electrical and optical
power. The nonnegat... | [
{
"created": "Sat, 12 Mar 2011 00:17:35 GMT",
"version": "v1"
}
] | 2015-03-19 | [
[
"Karout",
"Johnny",
""
],
[
"Agrell",
"Erik",
""
],
[
"Szczerba",
"Krzysztof",
""
],
[
"Karlsson",
"Magnus",
""
]
] | We optimize modulation formats for the additive white Gaussian noise channel with a nonnegative input constraint, also known as the intensity-modulated direct detection channel, with and without confining them to a lattice structure. Our optimization criteria are the average electrical and optical power. The nonnegativ... |
2111.02997 | Shangtong Zhang | Shangtong Zhang, Remi Tachet, Romain Laroche | Global Optimality and Finite Sample Analysis of Softmax Off-Policy Actor
Critic under State Distribution Mismatch | Journal of Machine Learning Research 2022 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we establish the global optimality and convergence rate of an
off-policy actor critic algorithm in the tabular setting without using density
ratio to correct the discrepancy between the state distribution of the behavior
policy and that of the target policy. Our work goes beyond existing works on
the o... | [
{
"created": "Thu, 4 Nov 2021 16:48:45 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Oct 2022 13:05:59 GMT",
"version": "v2"
},
{
"created": "Mon, 24 Oct 2022 17:52:33 GMT",
"version": "v3"
}
] | 2022-10-25 | [
[
"Zhang",
"Shangtong",
""
],
[
"Tachet",
"Remi",
""
],
[
"Laroche",
"Romain",
""
]
] | In this paper, we establish the global optimality and convergence rate of an off-policy actor critic algorithm in the tabular setting without using density ratio to correct the discrepancy between the state distribution of the behavior policy and that of the target policy. Our work goes beyond existing works on the opt... |
1802.02288 | Xiaoling Hu | Caijun Zhong, Xiaoling Hu, Xiaoming Chen, Derrick Wing Kwan Ng and
Zhaoyang Zhang | Spatial Modulation Assisted Multi-Antenna Non-Orthogonal Multiple Access | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-antenna non-orthogonal multiple access (NOMA) is a promising technique
to significantly improve the spectral efficiency and support massive access,
which has received considerable interests from academic and industry. This
article first briefly introduces the basic idea of conventional multi-antenna
NOMA techni... | [
{
"created": "Wed, 7 Feb 2018 02:21:40 GMT",
"version": "v1"
}
] | 2018-02-08 | [
[
"Zhong",
"Caijun",
""
],
[
"Hu",
"Xiaoling",
""
],
[
"Chen",
"Xiaoming",
""
],
[
"Ng",
"Derrick Wing Kwan",
""
],
[
"Zhang",
"Zhaoyang",
""
]
] | Multi-antenna non-orthogonal multiple access (NOMA) is a promising technique to significantly improve the spectral efficiency and support massive access, which has received considerable interests from academic and industry. This article first briefly introduces the basic idea of conventional multi-antenna NOMA techniqu... |
2212.01618 | Xin Kang | Huilin Wang, Xin Kang, Tieyan Li, Zhongding Lei, Cheng-Kang Chu, and
Haiguang Wang | An Overview of Trust Standards for Communication Networks and Future
Digital World | 7 pages, 3 figures, Magazine paper under review | null | null | null | cs.IT cs.CR math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the development of Information and Communication Technologies, trust has
been applied more and more in various scenarios. At the same time, different
organizations have published a series of trust frameworks to support the
implementation of trust. There are also academic paper discussing about these
trust standa... | [
{
"created": "Sat, 3 Dec 2022 13:51:37 GMT",
"version": "v1"
}
] | 2022-12-06 | [
[
"Wang",
"Huilin",
""
],
[
"Kang",
"Xin",
""
],
[
"Li",
"Tieyan",
""
],
[
"Lei",
"Zhongding",
""
],
[
"Chu",
"Cheng-Kang",
""
],
[
"Wang",
"Haiguang",
""
]
] | With the development of Information and Communication Technologies, trust has been applied more and more in various scenarios. At the same time, different organizations have published a series of trust frameworks to support the implementation of trust. There are also academic paper discussing about these trust standard... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.