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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2406.11938 | Hayden Helm | Hayden Helm and Brandon Duderstadt and Youngser Park and Carey E.
Priebe | Tracking the perspectives of interacting language models | null | null | null | null | cs.AI cs.MA | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Large language models (LLMs) are capable of producing high quality
information at unprecedented rates. As these models continue to entrench
themselves in society, the content they produce will become increasingly
pervasive in databases that are, in turn, incorporated into the pre-training
data, fine-tuning data, retr... | [
{
"created": "Mon, 17 Jun 2024 17:20:16 GMT",
"version": "v1"
}
] | 2024-06-19 | [
[
"Helm",
"Hayden",
""
],
[
"Duderstadt",
"Brandon",
""
],
[
"Park",
"Youngser",
""
],
[
"Priebe",
"Carey E.",
""
]
] | Large language models (LLMs) are capable of producing high quality information at unprecedented rates. As these models continue to entrench themselves in society, the content they produce will become increasingly pervasive in databases that are, in turn, incorporated into the pre-training data, fine-tuning data, retrie... |
1907.03356 | Petr Ro\v{c}kai | Petr Ro\v{c}kai, Zuzana Baranov\'a, Jan Mr\'azek, Katar\'ina
Kejstov\'a, Ji\v{r}\'i Barnat | Reproducible Execution of POSIX Programs with DiOS | null | null | null | null | cs.OS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we describe DiOS, a lightweight model operating system which
can be used to execute programs that make use of POSIX APIs. Such executions
are fully reproducible: running the same program with the same inputs twice
will result in two exactly identical instruction traces, even if the program
uses threads... | [
{
"created": "Sun, 7 Jul 2019 22:26:02 GMT",
"version": "v1"
}
] | 2019-07-09 | [
[
"Ročkai",
"Petr",
""
],
[
"Baranová",
"Zuzana",
""
],
[
"Mrázek",
"Jan",
""
],
[
"Kejstová",
"Katarína",
""
],
[
"Barnat",
"Jiří",
""
]
] | In this paper, we describe DiOS, a lightweight model operating system which can be used to execute programs that make use of POSIX APIs. Such executions are fully reproducible: running the same program with the same inputs twice will result in two exactly identical instruction traces, even if the program uses threads f... |
2309.07382 | Hayate Iso | Yunshu Wu, Hayate Iso, Pouya Pezeshkpour, Nikita Bhutani, Estevam
Hruschka | Less is More for Long Document Summary Evaluation by LLMs | EACL (main) | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large Language Models (LLMs) have shown promising performance in summary
evaluation tasks, yet they face challenges such as high computational costs and
the Lost-in-the-Middle problem where important information in the middle of
long documents is often overlooked. To address these issues, this paper
introduces a nove... | [
{
"created": "Thu, 14 Sep 2023 01:59:15 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Jan 2024 18:23:37 GMT",
"version": "v2"
}
] | 2024-01-19 | [
[
"Wu",
"Yunshu",
""
],
[
"Iso",
"Hayate",
""
],
[
"Pezeshkpour",
"Pouya",
""
],
[
"Bhutani",
"Nikita",
""
],
[
"Hruschka",
"Estevam",
""
]
] | Large Language Models (LLMs) have shown promising performance in summary evaluation tasks, yet they face challenges such as high computational costs and the Lost-in-the-Middle problem where important information in the middle of long documents is often overlooked. To address these issues, this paper introduces a novel ... |
2403.08783 | Fatma Shalabi | Fatma Shalabi, Huy H. Nguyen, Hichem Felouat, Ching-Chun Chang, and
Isao Echizen | Image-Text Out-Of-Context Detection Using Synthetic Multimodal
Misinformation | 8 pages, 2 figures, conference | null | 10.1109/APSIPAASC58517.2023.10317336 | null | cs.CV cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Misinformation has become a major challenge in the era of increasing digital
information, requiring the development of effective detection methods. We have
investigated a novel approach to Out-Of-Context detection (OOCD) that uses
synthetic data generation. We created a dataset specifically designed for OOCD
and deve... | [
{
"created": "Mon, 29 Jan 2024 11:55:14 GMT",
"version": "v1"
}
] | 2024-03-15 | [
[
"Shalabi",
"Fatma",
""
],
[
"Nguyen",
"Huy H.",
""
],
[
"Felouat",
"Hichem",
""
],
[
"Chang",
"Ching-Chun",
""
],
[
"Echizen",
"Isao",
""
]
] | Misinformation has become a major challenge in the era of increasing digital information, requiring the development of effective detection methods. We have investigated a novel approach to Out-Of-Context detection (OOCD) that uses synthetic data generation. We created a dataset specifically designed for OOCD and develo... |
1111.3602 | Davide Schipani | Michele Elia, Davide Schipani | On the Rabin signature | General revision; new section on blind signatures | null | null | null | cs.CR cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Some Rabin signature schemes may be exposed to forgery; several variants are
here described to counter this vulnerability. Blind Rabin signatures are also
discussed.
| [
{
"created": "Thu, 10 Nov 2011 23:50:06 GMT",
"version": "v1"
},
{
"created": "Sat, 26 Nov 2011 17:04:16 GMT",
"version": "v2"
},
{
"created": "Sat, 17 Dec 2011 18:11:00 GMT",
"version": "v3"
}
] | 2011-12-20 | [
[
"Elia",
"Michele",
""
],
[
"Schipani",
"Davide",
""
]
] | Some Rabin signature schemes may be exposed to forgery; several variants are here described to counter this vulnerability. Blind Rabin signatures are also discussed. |
1203.5830 | Viet Hung Nguyen | Viet Hung Nguyen and Fabio Massacci | An Independent Validation of Vulnerability Discovery Models | This paper is to appear in ASIACCS'12 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Having a precise vulnerability discovery model (VDM) would provide a useful
quantitative insight to assess software security. Thus far, several models have
been proposed with some evidence supporting their goodness-of-fit.
In this work we describe an independent validation of the applicability of
six existing VDMs ... | [
{
"created": "Mon, 26 Mar 2012 22:14:15 GMT",
"version": "v1"
}
] | 2012-03-28 | [
[
"Nguyen",
"Viet Hung",
""
],
[
"Massacci",
"Fabio",
""
]
] | Having a precise vulnerability discovery model (VDM) would provide a useful quantitative insight to assess software security. Thus far, several models have been proposed with some evidence supporting their goodness-of-fit. In this work we describe an independent validation of the applicability of six existing VDMs in s... |
2008.12132 | Christina Uhl | Christina Uhl, Nadia Abou Nabout, Klaus Miller | How Much Ad Viewability is Enough? The Effect of Display Ad Viewability
on Advertising Effectiveness | null | null | null | null | cs.CY econ.GN q-fin.EC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A large share of all online display advertisements (ads) are never seen by a
human. For instance, an ad could appear below the page fold, where a user never
scrolls. Yet, an ad is essentially ineffective if it is not at least somewhat
viewable. Ad viewability - which refers to the pixel percentage-in-view and the
exp... | [
{
"created": "Wed, 26 Aug 2020 05:49:57 GMT",
"version": "v1"
}
] | 2020-08-28 | [
[
"Uhl",
"Christina",
""
],
[
"Nabout",
"Nadia Abou",
""
],
[
"Miller",
"Klaus",
""
]
] | A large share of all online display advertisements (ads) are never seen by a human. For instance, an ad could appear below the page fold, where a user never scrolls. Yet, an ad is essentially ineffective if it is not at least somewhat viewable. Ad viewability - which refers to the pixel percentage-in-view and the expos... |
1912.10847 | Preeti Sah | Preeti Sah and Ernest Fokou\'e | What do Asian Religions Have in Common? An Unsupervised Text Analytics
Exploration | 18 pages, 22 figures | null | null | null | cs.CL cs.LG stat.AP | http://creativecommons.org/licenses/by/4.0/ | The main source of various religious teachings is their sacred texts which
vary from religion to religion based on different factors like the geographical
location or time of the birth of a particular religion. Despite these
differences, there could be similarities between the sacred texts based on what
lessons it te... | [
{
"created": "Fri, 20 Dec 2019 18:28:29 GMT",
"version": "v1"
}
] | 2019-12-24 | [
[
"Sah",
"Preeti",
""
],
[
"Fokoué",
"Ernest",
""
]
] | The main source of various religious teachings is their sacred texts which vary from religion to religion based on different factors like the geographical location or time of the birth of a particular religion. Despite these differences, there could be similarities between the sacred texts based on what lessons it teac... |
1905.00784 | Aline Goeminne | Thomas Brihaye, V\'eronique Bruy\`ere, Aline Goeminne,
Jean-Fran\c{c}ois Raskin and Marie van den Bogaard | The Complexity of Subgame Perfect Equilibria in Quantitative
Reachability Games | null | Logical Methods in Computer Science, Volume 16, Issue 4 (November
5, 2020) lmcs:5966 | 10.23638/LMCS-16(4:8)2020 | null | cs.GT cs.LO | http://creativecommons.org/licenses/by/4.0/ | We study multiplayer quantitative reachability games played on a finite
directed graph, where the objective of each player is to reach his target set
of vertices as quickly as possible. Instead of the well-known notion of Nash
equilibrium (NE), we focus on the notion of subgame perfect equilibrium (SPE),
a refinement... | [
{
"created": "Thu, 2 May 2019 14:47:15 GMT",
"version": "v1"
},
{
"created": "Fri, 3 May 2019 13:19:51 GMT",
"version": "v2"
},
{
"created": "Mon, 8 Jul 2019 13:04:43 GMT",
"version": "v3"
},
{
"created": "Wed, 4 Dec 2019 10:55:43 GMT",
"version": "v4"
},
{
"creat... | 2023-06-22 | [
[
"Brihaye",
"Thomas",
""
],
[
"Bruyère",
"Véronique",
""
],
[
"Goeminne",
"Aline",
""
],
[
"Raskin",
"Jean-François",
""
],
[
"Bogaard",
"Marie van den",
""
]
] | We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible. Instead of the well-known notion of Nash equilibrium (NE), we focus on the notion of subgame perfect equilibrium (SPE), a refinement o... |
2204.07321 | Chuang Liu | Chuang Liu, Yibing Zhan, Jia Wu, Chang Li, Bo Du, Wenbin Hu, Tongliang
Liu, Dacheng Tao | Graph Pooling for Graph Neural Networks: Progress, Challenges, and
Opportunities | 11 pages, 2 figures. Accepted by IJCAI Survey Track 2023 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph neural networks have emerged as a leading architecture for many
graph-level tasks, such as graph classification and graph generation. As an
essential component of the architecture, graph pooling is indispensable for
obtaining a holistic graph-level representation of the whole graph. Although a
great variety of ... | [
{
"created": "Fri, 15 Apr 2022 04:02:06 GMT",
"version": "v1"
},
{
"created": "Thu, 22 Jun 2023 15:00:07 GMT",
"version": "v2"
}
] | 2023-06-23 | [
[
"Liu",
"Chuang",
""
],
[
"Zhan",
"Yibing",
""
],
[
"Wu",
"Jia",
""
],
[
"Li",
"Chang",
""
],
[
"Du",
"Bo",
""
],
[
"Hu",
"Wenbin",
""
],
[
"Liu",
"Tongliang",
""
],
[
"Tao",
"Dacheng",
""
... | Graph neural networks have emerged as a leading architecture for many graph-level tasks, such as graph classification and graph generation. As an essential component of the architecture, graph pooling is indispensable for obtaining a holistic graph-level representation of the whole graph. Although a great variety of me... |
1804.01422 | Jian Xu | Jian Xu, Chunheng Wang, Chengzuo Qi, Cunzhao Shi, and Baihua Xiao | Unsupervised Semantic-based Aggregation of Deep Convolutional Features | 10 pages. arXiv admin note: text overlap with arXiv:1705.01247 | null | 10.1109/TIP.2018.2867104 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a simple but effective semantic-based aggregation
(SBA) method. The proposed SBA utilizes the discriminative filters of deep
convolutional layers as semantic detectors. Moreover, we propose the effective
unsupervised strategy to select some semantic detectors to generate the
"probabilistic p... | [
{
"created": "Tue, 3 Apr 2018 07:43:05 GMT",
"version": "v1"
}
] | 2018-11-14 | [
[
"Xu",
"Jian",
""
],
[
"Wang",
"Chunheng",
""
],
[
"Qi",
"Chengzuo",
""
],
[
"Shi",
"Cunzhao",
""
],
[
"Xiao",
"Baihua",
""
]
] | In this paper, we propose a simple but effective semantic-based aggregation (SBA) method. The proposed SBA utilizes the discriminative filters of deep convolutional layers as semantic detectors. Moreover, we propose the effective unsupervised strategy to select some semantic detectors to generate the "probabilistic pro... |
2012.00508 | Rupert Mitchell | Rupert Mitchell, Jan Blumenkamp and Amanda Prorok | Gaussian Process Based Message Filtering for Robust Multi-Agent
Cooperation in the Presence of Adversarial Communication | null | null | null | null | cs.RO cs.AI cs.LG cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider the problem of providing robustness to adversarial
communication in multi-agent systems. Specifically, we propose a solution
towards robust cooperation, which enables the multi-agent system to maintain
high performance in the presence of anonymous non-cooperative agents that
communicate fau... | [
{
"created": "Tue, 1 Dec 2020 14:21:58 GMT",
"version": "v1"
}
] | 2020-12-02 | [
[
"Mitchell",
"Rupert",
""
],
[
"Blumenkamp",
"Jan",
""
],
[
"Prorok",
"Amanda",
""
]
] | In this paper, we consider the problem of providing robustness to adversarial communication in multi-agent systems. Specifically, we propose a solution towards robust cooperation, which enables the multi-agent system to maintain high performance in the presence of anonymous non-cooperative agents that communicate fault... |
1412.2620 | Gundram Leifert | G. Leifert, T. Strau{\ss}, T. Gr\"uning, R. Labahn (University of
Rostock) | Cells in Multidimensional Recurrent Neural Networks | null | Journal of Machine Learning Research 17 (2016) 1-37 | null | null | cs.AI cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The transcription of handwritten text on images is one task in machine
learning and one solution to solve it is using multi-dimensional recurrent
neural networks (MDRNN) with connectionist temporal classification (CTC). The
RNNs can contain special units, the long short-term memory (LSTM) cells. They
are able to lear... | [
{
"created": "Mon, 8 Dec 2014 15:47:45 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Feb 2016 12:26:37 GMT",
"version": "v2"
}
] | 2019-08-28 | [
[
"Leifert",
"G.",
"",
"University of\n Rostock"
],
[
"Strauß",
"T.",
"",
"University of\n Rostock"
],
[
"Grüning",
"T.",
"",
"University of\n Rostock"
],
[
"Labahn",
"R.",
"",
"University of\n Rostock"
]
] | The transcription of handwritten text on images is one task in machine learning and one solution to solve it is using multi-dimensional recurrent neural networks (MDRNN) with connectionist temporal classification (CTC). The RNNs can contain special units, the long short-term memory (LSTM) cells. They are able to learn ... |
2209.04687 | Lantian Li Mr. | Lantian Li and Di Wang and Dong Wang | Pay Attention to Hard Trials | null | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Performance of speaker recognition systems is evaluated on test trials.
Although as crucial as rulers for tailors, trials have not been carefully
treated so far, and most existing benchmarks compose trials by naive
cross-pairing. In this paper, we argue that the cross-pairing approach produces
overwhelming easy trial... | [
{
"created": "Sat, 10 Sep 2022 15:16:05 GMT",
"version": "v1"
}
] | 2022-09-13 | [
[
"Li",
"Lantian",
""
],
[
"Wang",
"Di",
""
],
[
"Wang",
"Dong",
""
]
] | Performance of speaker recognition systems is evaluated on test trials. Although as crucial as rulers for tailors, trials have not been carefully treated so far, and most existing benchmarks compose trials by naive cross-pairing. In this paper, we argue that the cross-pairing approach produces overwhelming easy trials,... |
1811.05013 | Ankesh Anand | Ankesh Anand, Eugene Belilovsky, Kyle Kastner, Hugo Larochelle, Aaron
Courville | Blindfold Baselines for Embodied QA | NIPS 2018 Visually-Grounded Interaction and Language (ViGilL)
Workshop | null | null | null | cs.CV cs.AI cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We explore blindfold (question-only) baselines for Embodied Question
Answering. The EmbodiedQA task requires an agent to answer a question by
intelligently navigating in a simulated environment, gathering necessary visual
information only through first-person vision before finally answering.
Consequently, a blindfold... | [
{
"created": "Mon, 12 Nov 2018 21:45:41 GMT",
"version": "v1"
}
] | 2018-11-14 | [
[
"Anand",
"Ankesh",
""
],
[
"Belilovsky",
"Eugene",
""
],
[
"Kastner",
"Kyle",
""
],
[
"Larochelle",
"Hugo",
""
],
[
"Courville",
"Aaron",
""
]
] | We explore blindfold (question-only) baselines for Embodied Question Answering. The EmbodiedQA task requires an agent to answer a question by intelligently navigating in a simulated environment, gathering necessary visual information only through first-person vision before finally answering. Consequently, a blindfold b... |
2408.02614 | Nour Khezemi | Nour Khezemi, Sikandar Ejaza, Naouel Moha, Yann-Ga\"el Gu\'eh\'eneuc | Comparison of Code Quality and Best Practices in IoT and non-IoT
Software | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Context: IoT systems, networks of connected devices powered by software,
require studying software quality for maintenance. Despite extensive studies on
non-IoT software quality, research on IoT software quality is lacking. It is
uncertain if IoT and non-IoT systems software are comparable, hindering the
confident ap... | [
{
"created": "Mon, 5 Aug 2024 16:39:04 GMT",
"version": "v1"
}
] | 2024-08-06 | [
[
"Khezemi",
"Nour",
""
],
[
"Ejaza",
"Sikandar",
""
],
[
"Moha",
"Naouel",
""
],
[
"Guéhéneuc",
"Yann-Gaël",
""
]
] | Context: IoT systems, networks of connected devices powered by software, require studying software quality for maintenance. Despite extensive studies on non-IoT software quality, research on IoT software quality is lacking. It is uncertain if IoT and non-IoT systems software are comparable, hindering the confident appl... |
2005.10876 | Marco Toldo | Marco Toldo, Andrea Maracani, Umberto Michieli and Pietro Zanuttigh | Unsupervised Domain Adaptation in Semantic Segmentation: a Review | 34 pages, 7 figures, 2 tables | null | null | null | cs.CV cs.LG eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The aim of this paper is to give an overview of the recent advancements in
the Unsupervised Domain Adaptation (UDA) of deep networks for semantic
segmentation. This task is attracting a wide interest, since semantic
segmentation models require a huge amount of labeled data and the lack of data
fitting specific requir... | [
{
"created": "Thu, 21 May 2020 20:10:38 GMT",
"version": "v1"
}
] | 2020-05-25 | [
[
"Toldo",
"Marco",
""
],
[
"Maracani",
"Andrea",
""
],
[
"Michieli",
"Umberto",
""
],
[
"Zanuttigh",
"Pietro",
""
]
] | The aim of this paper is to give an overview of the recent advancements in the Unsupervised Domain Adaptation (UDA) of deep networks for semantic segmentation. This task is attracting a wide interest, since semantic segmentation models require a huge amount of labeled data and the lack of data fitting specific requirem... |
2010.04887 | Forrest Davis | Forrest Davis and Marten van Schijndel | Discourse structure interacts with reference but not syntax in neural
language models | Proceedings of the 2020 Conference on Computational Natural Language
Learning (CoNLL 2020) | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Language models (LMs) trained on large quantities of text have been claimed
to acquire abstract linguistic representations. Our work tests the robustness
of these abstractions by focusing on the ability of LMs to learn interactions
between different linguistic representations. In particular, we utilized
stimuli from ... | [
{
"created": "Sat, 10 Oct 2020 03:14:00 GMT",
"version": "v1"
}
] | 2020-10-13 | [
[
"Davis",
"Forrest",
""
],
[
"van Schijndel",
"Marten",
""
]
] | Language models (LMs) trained on large quantities of text have been claimed to acquire abstract linguistic representations. Our work tests the robustness of these abstractions by focusing on the ability of LMs to learn interactions between different linguistic representations. In particular, we utilized stimuli from ps... |
2102.08327 | Federico Fusco | Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi,
Alberto Marchetti Spaccamela, Rebecca Reiffenh\"auser | Submodular Maximization subject to a Knapsack Constraint: Combinatorial
Algorithms with Near-optimal Adaptive Complexity | This version addresses a gap in the probabilistic analysis of the
approximation guarantees in the previous version of this work. We provide a
simple fix via a standard sampling routine while maintaining the same
approximation guarantees and complexity bounds. (formerly appeared as
arXiv:2007.05014v2 in error) | Proceedings of the 38th International Conference on Machine
Learning, PMLR 139:231-242, 2021 | null | null | cs.DS cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Submodular maximization is a classic algorithmic problem with multiple
applications in data mining and machine learning; there, the growing need to
deal with massive instances motivates the design of algorithms balancing the
quality of the solution with applicability. For the latter, an important
measure is the adapt... | [
{
"created": "Tue, 16 Feb 2021 18:15:51 GMT",
"version": "v1"
},
{
"created": "Fri, 20 Oct 2023 08:22:31 GMT",
"version": "v2"
}
] | 2024-02-20 | [
[
"Amanatidis",
"Georgios",
""
],
[
"Fusco",
"Federico",
""
],
[
"Lazos",
"Philip",
""
],
[
"Leonardi",
"Stefano",
""
],
[
"Spaccamela",
"Alberto Marchetti",
""
],
[
"Reiffenhäuser",
"Rebecca",
""
]
] | Submodular maximization is a classic algorithmic problem with multiple applications in data mining and machine learning; there, the growing need to deal with massive instances motivates the design of algorithms balancing the quality of the solution with applicability. For the latter, an important measure is the adaptiv... |
1612.06699 | Pierre Sermanet | Pierre Sermanet, Kelvin Xu, Sergey Levine | Unsupervised Perceptual Rewards for Imitation Learning | null | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reward function design and exploration time are arguably the biggest
obstacles to the deployment of reinforcement learning (RL) agents in the real
world. In many real-world tasks, designing a reward function takes considerable
hand engineering and often requires additional sensors to be installed just to
measure whet... | [
{
"created": "Tue, 20 Dec 2016 15:04:38 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Dec 2016 13:47:34 GMT",
"version": "v2"
},
{
"created": "Mon, 12 Jun 2017 21:38:17 GMT",
"version": "v3"
}
] | 2017-06-14 | [
[
"Sermanet",
"Pierre",
""
],
[
"Xu",
"Kelvin",
""
],
[
"Levine",
"Sergey",
""
]
] | Reward function design and exploration time are arguably the biggest obstacles to the deployment of reinforcement learning (RL) agents in the real world. In many real-world tasks, designing a reward function takes considerable hand engineering and often requires additional sensors to be installed just to measure whethe... |
1903.10670 | Xiaoxi Chelsy Xie | Xiaoxi Chelsy Xie, Isaac Johnson, Anne Gomez | Detecting and Gauging Impact on Wikipedia Page Views | null | null | 10.1145/3308560.3316751 | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Understanding how various external campaigns or events affect readership on
Wikipedia is important to efforts aimed at improving awareness and access to
its content. In this paper, we consider how to build time-series models aimed
at predicting page views on Wikipedia with the goal of detecting whether there
are sign... | [
{
"created": "Tue, 26 Mar 2019 04:27:20 GMT",
"version": "v1"
}
] | 2019-03-27 | [
[
"Xie",
"Xiaoxi Chelsy",
""
],
[
"Johnson",
"Isaac",
""
],
[
"Gomez",
"Anne",
""
]
] | Understanding how various external campaigns or events affect readership on Wikipedia is important to efforts aimed at improving awareness and access to its content. In this paper, we consider how to build time-series models aimed at predicting page views on Wikipedia with the goal of detecting whether there are signif... |
1210.6777 | Miguel Rodrigues | Miguel Rodrigues | Multiple-antenna fading coherent channels with arbitrary inputs:
Characterization and optimization of the reliable information transmission
rate | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the constrained capacity of multiple-antenna fading coherent
channels, where the receiver knows the channel state but the transmitter knows
only the channel distribution, driven by arbitrary equiprobable discrete inputs
in a regime of high signal-to-noise ratio (${\sf snr}$). In particular, we
capitali... | [
{
"created": "Thu, 25 Oct 2012 09:57:31 GMT",
"version": "v1"
}
] | 2012-10-26 | [
[
"Rodrigues",
"Miguel",
""
]
] | We investigate the constrained capacity of multiple-antenna fading coherent channels, where the receiver knows the channel state but the transmitter knows only the channel distribution, driven by arbitrary equiprobable discrete inputs in a regime of high signal-to-noise ratio (${\sf snr}$). In particular, we capitalize... |
2012.08640 | Gustau Camps-Valls | Jochem Verrelst, Juan Pablo Rivera, Anatoly Gitelson, Jesus Delegido,
Jos\'e Moreno, Gustau Camps-Valls | Spectral band selection for vegetation properties retrieval using
Gaussian processes regression | null | International Journal of Applied Earth Observation and
Geoinformation Volume 52, October 2016, Pages 554-567 | 10.1016/j.jag.2016.07.016 | null | cs.CV eess.IV stat.AP | http://creativecommons.org/licenses/by-nc-nd/4.0/ | With current and upcoming imaging spectrometers, automated band analysis
techniques are needed to enable efficient identification of most informative
bands to facilitate optimized processing of spectral data into estimates of
biophysical variables. This paper introduces an automated spectral band
analysis tool (BAT) ... | [
{
"created": "Mon, 7 Dec 2020 09:28:33 GMT",
"version": "v1"
}
] | 2020-12-17 | [
[
"Verrelst",
"Jochem",
""
],
[
"Rivera",
"Juan Pablo",
""
],
[
"Gitelson",
"Anatoly",
""
],
[
"Delegido",
"Jesus",
""
],
[
"Moreno",
"José",
""
],
[
"Camps-Valls",
"Gustau",
""
]
] | With current and upcoming imaging spectrometers, automated band analysis techniques are needed to enable efficient identification of most informative bands to facilitate optimized processing of spectral data into estimates of biophysical variables. This paper introduces an automated spectral band analysis tool (BAT) ba... |
2312.11444 | Graham Neubig | Syeda Nahida Akter, Zichun Yu, Aashiq Muhamed, Tianyue Ou, Alex
B\"auerle, \'Angel Alexander Cabrera, Krish Dholakia, Chenyan Xiong, Graham
Neubig | An In-depth Look at Gemini's Language Abilities | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recently released Google Gemini class of models are the first to
comprehensively report results that rival the OpenAI GPT series across a wide
variety of tasks. In this paper, we do an in-depth exploration of Gemini's
language abilities, making two contributions. First, we provide a third-party,
objective compari... | [
{
"created": "Mon, 18 Dec 2023 18:47:42 GMT",
"version": "v1"
},
{
"created": "Sun, 24 Dec 2023 12:25:10 GMT",
"version": "v2"
}
] | 2023-12-27 | [
[
"Akter",
"Syeda Nahida",
""
],
[
"Yu",
"Zichun",
""
],
[
"Muhamed",
"Aashiq",
""
],
[
"Ou",
"Tianyue",
""
],
[
"Bäuerle",
"Alex",
""
],
[
"Cabrera",
"Ángel Alexander",
""
],
[
"Dholakia",
"Krish",
""
],
... | The recently released Google Gemini class of models are the first to comprehensively report results that rival the OpenAI GPT series across a wide variety of tasks. In this paper, we do an in-depth exploration of Gemini's language abilities, making two contributions. First, we provide a third-party, objective compariso... |
2101.07390 | Vijay Vazirani | Vijay V. Vazirani | The General Graph Matching Game: Approximate Core | 10 pages | null | null | null | cs.GT econ.TH math.CO | http://creativecommons.org/licenses/by/4.0/ | The classic paper of Shapley and Shubik \cite{Shapley1971assignment}
characterized the core of the assignment game using ideas from matching theory
and LP-duality theory and their highly non-trivial interplay. Whereas the core
of this game is always non-empty, that of the general graph matching game can
be empty.
T... | [
{
"created": "Tue, 19 Jan 2021 00:53:22 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Jan 2021 05:10:16 GMT",
"version": "v2"
},
{
"created": "Mon, 26 Apr 2021 12:08:16 GMT",
"version": "v3"
},
{
"created": "Fri, 16 Jul 2021 17:55:03 GMT",
"version": "v4"
}
] | 2021-07-19 | [
[
"Vazirani",
"Vijay V.",
""
]
] | The classic paper of Shapley and Shubik \cite{Shapley1971assignment} characterized the core of the assignment game using ideas from matching theory and LP-duality theory and their highly non-trivial interplay. Whereas the core of this game is always non-empty, that of the general graph matching game can be empty. This ... |
1611.06605 | Haris Angelidakis | Haris Angelidakis, Yury Makarychev and Vsevolod Oparin | Algorithmic and Hardness Results for the Hub Labeling Problem | To appear in SODA17 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There has been significant success in designing highly efficient algorithms
for distance and shortest-path queries in recent years; many of the
state-of-the-art algorithms use the hub labeling framework. In this paper, we
study the approximability of the Hub Labeling problem. We prove a hardness of
$\Omega(\log n)$ f... | [
{
"created": "Sun, 20 Nov 2016 22:44:12 GMT",
"version": "v1"
}
] | 2016-11-22 | [
[
"Angelidakis",
"Haris",
""
],
[
"Makarychev",
"Yury",
""
],
[
"Oparin",
"Vsevolod",
""
]
] | There has been significant success in designing highly efficient algorithms for distance and shortest-path queries in recent years; many of the state-of-the-art algorithms use the hub labeling framework. In this paper, we study the approximability of the Hub Labeling problem. We prove a hardness of $\Omega(\log n)$ for... |
1204.0067 | Shuqing Zeng | Shuqing Zeng | Estimating Rigid Transformation Between Two Range Maps Using Expectation
Maximization Algorithm | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-sa/3.0/ | We address the problem of estimating a rigid transformation between two point
sets, which is a key module for target tracking system using Light Detection
And Ranging (LiDAR). A fast implementation of Expectation-maximization (EM)
algorithm is presented whose complexity is O(N) with $N$ the number of scan
points.
| [
{
"created": "Sat, 31 Mar 2012 03:20:02 GMT",
"version": "v1"
}
] | 2012-04-03 | [
[
"Zeng",
"Shuqing",
""
]
] | We address the problem of estimating a rigid transformation between two point sets, which is a key module for target tracking system using Light Detection And Ranging (LiDAR). A fast implementation of Expectation-maximization (EM) algorithm is presented whose complexity is O(N) with $N$ the number of scan points. |
2302.07072 | Mengxiao Zhang | Fengjuan Jia, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov | Differentially Private Diffusion Auction: The Single-unit Case | null | null | null | null | cs.GT | http://creativecommons.org/licenses/by/4.0/ | Diffusion auction refers to an emerging paradigm of online marketplace where
an auctioneer utilises a social network to attract potential buyers. Diffusion
auction poses significant privacy risks. From the auction outcome, it is
possible to infer hidden, and potentially sensitive, preferences of buyers. To
mitigate s... | [
{
"created": "Tue, 14 Feb 2023 14:35:45 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Feb 2023 15:08:16 GMT",
"version": "v2"
}
] | 2023-02-17 | [
[
"Jia",
"Fengjuan",
""
],
[
"Zhang",
"Mengxiao",
""
],
[
"Liu",
"Jiamou",
""
],
[
"Khoussainov",
"Bakh",
""
]
] | Diffusion auction refers to an emerging paradigm of online marketplace where an auctioneer utilises a social network to attract potential buyers. Diffusion auction poses significant privacy risks. From the auction outcome, it is possible to infer hidden, and potentially sensitive, preferences of buyers. To mitigate suc... |
2401.09854 | Samira Afzal | Samira Afzal, Narges Mehran, Zoha Azimi Ourimi, Farzad Tashtarian,
Hadi Amirpour, Radu Prodan, Christian Timmerer | A Survey on Energy Consumption and Environmental Impact of Video
Streaming | null | null | null | null | cs.MM | http://creativecommons.org/licenses/by/4.0/ | Climate change challenges require a notable decrease in worldwide greenhouse
gas (GHG) emissions across technology sectors. Digital technologies, especially
video streaming, accounting for most Internet traffic, make no exception. Video
streaming demand increases with remote working, multimedia communication
services... | [
{
"created": "Thu, 18 Jan 2024 10:10:25 GMT",
"version": "v1"
}
] | 2024-01-19 | [
[
"Afzal",
"Samira",
""
],
[
"Mehran",
"Narges",
""
],
[
"Ourimi",
"Zoha Azimi",
""
],
[
"Tashtarian",
"Farzad",
""
],
[
"Amirpour",
"Hadi",
""
],
[
"Prodan",
"Radu",
""
],
[
"Timmerer",
"Christian",
""
]
] | Climate change challenges require a notable decrease in worldwide greenhouse gas (GHG) emissions across technology sectors. Digital technologies, especially video streaming, accounting for most Internet traffic, make no exception. Video streaming demand increases with remote working, multimedia communication services (... |
1707.09700 | Yikang Li | Yikang Li, Wanli Ouyang, Bolei Zhou, Kun Wang, Xiaogang Wang | Scene Graph Generation from Objects, Phrases and Region Captions | accepted by ICCV 2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Object detection, scene graph generation and region captioning, which are
three scene understanding tasks at different semantic levels, are tied
together: scene graphs are generated on top of objects detected in an image
with their pairwise relationship predicted, while region captioning gives a
language description ... | [
{
"created": "Mon, 31 Jul 2017 02:40:19 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Sep 2017 05:05:29 GMT",
"version": "v2"
}
] | 2017-09-18 | [
[
"Li",
"Yikang",
""
],
[
"Ouyang",
"Wanli",
""
],
[
"Zhou",
"Bolei",
""
],
[
"Wang",
"Kun",
""
],
[
"Wang",
"Xiaogang",
""
]
] | Object detection, scene graph generation and region captioning, which are three scene understanding tasks at different semantic levels, are tied together: scene graphs are generated on top of objects detected in an image with their pairwise relationship predicted, while region captioning gives a language description of... |
1506.00307 | Emad Soroush | Emad Soroush, Magdalena Balazinska, Simon Krughoff, Andrew Connolly | Efficient Iterative Processing in the SciDB Parallel Array Engine | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many scientific data-intensive applications perform iterative computations on
array data. There exist multiple engines specialized for array processing.
These engines efficiently support various types of operations, but none
includes native support for iterative processing. In this paper, we develop a
model for itera... | [
{
"created": "Sun, 31 May 2015 23:37:58 GMT",
"version": "v1"
}
] | 2015-06-02 | [
[
"Soroush",
"Emad",
""
],
[
"Balazinska",
"Magdalena",
""
],
[
"Krughoff",
"Simon",
""
],
[
"Connolly",
"Andrew",
""
]
] | Many scientific data-intensive applications perform iterative computations on array data. There exist multiple engines specialized for array processing. These engines efficiently support various types of operations, but none includes native support for iterative processing. In this paper, we develop a model for iterati... |
1909.04189 | Sandeep Soni | Sandeep Soni, Kristina Lerman, Jacob Eisenstein | Follow the Leader: Documents on the Leading Edge of Semantic Change Get
More Citations | 25 pages, 3 figures, To appear in the Journal of the Association of
Information Sciences and Technology | null | null | null | cs.CL cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Diachronic word embeddings -- vector representations of words over time --
offer remarkable insights into the evolution of language and provide a tool for
quantifying sociocultural change from text documents. Prior work has used such
embeddings to identify shifts in the meaning of individual words. However,
simply kn... | [
{
"created": "Mon, 9 Sep 2019 22:43:02 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Oct 2020 19:41:11 GMT",
"version": "v2"
}
] | 2020-10-05 | [
[
"Soni",
"Sandeep",
""
],
[
"Lerman",
"Kristina",
""
],
[
"Eisenstein",
"Jacob",
""
]
] | Diachronic word embeddings -- vector representations of words over time -- offer remarkable insights into the evolution of language and provide a tool for quantifying sociocultural change from text documents. Prior work has used such embeddings to identify shifts in the meaning of individual words. However, simply know... |
1608.02676 | Krishna Kumar Singh | Krishna Kumar Singh and Yong Jae Lee | End-to-End Localization and Ranking for Relative Attributes | Appears in European Conference on Computer Vision (ECCV), 2016 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an end-to-end deep convolutional network to simultaneously
localize and rank relative visual attributes, given only weakly-supervised
pairwise image comparisons. Unlike previous methods, our network jointly learns
the attribute's features, localization, and ranker. The localization module of
our network di... | [
{
"created": "Tue, 9 Aug 2016 02:19:37 GMT",
"version": "v1"
}
] | 2016-08-10 | [
[
"Singh",
"Krishna Kumar",
""
],
[
"Lee",
"Yong Jae",
""
]
] | We propose an end-to-end deep convolutional network to simultaneously localize and rank relative visual attributes, given only weakly-supervised pairwise image comparisons. Unlike previous methods, our network jointly learns the attribute's features, localization, and ranker. The localization module of our network disc... |
2304.02146 | Ignavier Ng | Ignavier Ng, Biwei Huang, Kun Zhang | Structure Learning with Continuous Optimization: A Sober Look and Beyond | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates in which cases continuous optimization for directed
acyclic graph (DAG) structure learning can and cannot perform well and why this
happens, and suggests possible directions to make the search procedure more
reliable. Reisach et al. (2021) suggested that the remarkable performance of
several c... | [
{
"created": "Tue, 4 Apr 2023 22:10:40 GMT",
"version": "v1"
}
] | 2023-04-06 | [
[
"Ng",
"Ignavier",
""
],
[
"Huang",
"Biwei",
""
],
[
"Zhang",
"Kun",
""
]
] | This paper investigates in which cases continuous optimization for directed acyclic graph (DAG) structure learning can and cannot perform well and why this happens, and suggests possible directions to make the search procedure more reliable. Reisach et al. (2021) suggested that the remarkable performance of several con... |
2203.03466 | Greg Yang | Greg Yang, Edward J. Hu, Igor Babuschkin, Szymon Sidor, Xiaodong Liu,
David Farhi, Nick Ryder, Jakub Pachocki, Weizhu Chen, Jianfeng Gao | Tensor Programs V: Tuning Large Neural Networks via Zero-Shot
Hyperparameter Transfer | NeurIPS 2021 | null | null | null | cs.LG cond-mat.dis-nn cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hyperparameter (HP) tuning in deep learning is an expensive process,
prohibitively so for neural networks (NNs) with billions of parameters. We show
that, in the recently discovered Maximal Update Parametrization (muP), many
optimal HPs remain stable even as model size changes. This leads to a new HP
tuning paradigm ... | [
{
"created": "Mon, 7 Mar 2022 15:37:35 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Mar 2022 08:12:14 GMT",
"version": "v2"
}
] | 2022-03-29 | [
[
"Yang",
"Greg",
""
],
[
"Hu",
"Edward J.",
""
],
[
"Babuschkin",
"Igor",
""
],
[
"Sidor",
"Szymon",
""
],
[
"Liu",
"Xiaodong",
""
],
[
"Farhi",
"David",
""
],
[
"Ryder",
"Nick",
""
],
[
"Pachocki",
... | Hyperparameter (HP) tuning in deep learning is an expensive process, prohibitively so for neural networks (NNs) with billions of parameters. We show that, in the recently discovered Maximal Update Parametrization (muP), many optimal HPs remain stable even as model size changes. This leads to a new HP tuning paradigm we... |
2304.00946 | Xiang Wang | Xiang Wang, Shiwei Zhang, Zhiwu Qing, Changxin Gao, Yingya Zhang, Deli
Zhao, Nong Sang | MoLo: Motion-augmented Long-short Contrastive Learning for Few-shot
Action Recognition | Accepted by CVPR-2023. Code:
https://github.com/alibaba-mmai-research/MoLo | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current state-of-the-art approaches for few-shot action recognition achieve
promising performance by conducting frame-level matching on learned visual
features. However, they generally suffer from two limitations: i) the matching
procedure between local frames tends to be inaccurate due to the lack of
guidance to for... | [
{
"created": "Mon, 3 Apr 2023 13:09:39 GMT",
"version": "v1"
}
] | 2023-04-04 | [
[
"Wang",
"Xiang",
""
],
[
"Zhang",
"Shiwei",
""
],
[
"Qing",
"Zhiwu",
""
],
[
"Gao",
"Changxin",
""
],
[
"Zhang",
"Yingya",
""
],
[
"Zhao",
"Deli",
""
],
[
"Sang",
"Nong",
""
]
] | Current state-of-the-art approaches for few-shot action recognition achieve promising performance by conducting frame-level matching on learned visual features. However, they generally suffer from two limitations: i) the matching procedure between local frames tends to be inaccurate due to the lack of guidance to force... |
2205.11638 | Ahmed Abbas | Ahmed Abbas, Paul Swoboda | DOGE-Train: Discrete Optimization on GPU with End-to-end Training | AAAI 2024. Alert before printing: pg. 16-20 only contain per instance
results, can possibly be skipped | null | null | null | cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a fast, scalable, data-driven approach for solving relaxations of
0-1 integer linear programs. We use a combination of graph neural networks
(GNN) and the Lagrange decomposition based algorithm FastDOG (Abbas and Swoboda
2022b). We make the latter differentiable for end-to-end training and use GNNs
to pred... | [
{
"created": "Mon, 23 May 2022 21:09:41 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Dec 2023 20:55:19 GMT",
"version": "v2"
}
] | 2024-01-01 | [
[
"Abbas",
"Ahmed",
""
],
[
"Swoboda",
"Paul",
""
]
] | We present a fast, scalable, data-driven approach for solving relaxations of 0-1 integer linear programs. We use a combination of graph neural networks (GNN) and the Lagrange decomposition based algorithm FastDOG (Abbas and Swoboda 2022b). We make the latter differentiable for end-to-end training and use GNNs to predic... |
cs/0010027 | David Martinez | David Martinez and Eneko Agirre | One Sense per Collocation and Genre/Topic Variations | 9 pages | Proceedings of the Joint SIGDAT Conference on Empirical Methods in
Natural Language Processing and Very Large Corpora 2000 | null | null | cs.CL | null | This paper revisits the one sense per collocation hypothesis using
fine-grained sense distinctions and two different corpora. We show that the
hypothesis is weaker for fine-grained sense distinctions (70% vs. 99% reported
earlier on 2-way ambiguities). We also show that one sense per collocation does
hold across corp... | [
{
"created": "Tue, 17 Oct 2000 10:26:33 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Martinez",
"David",
""
],
[
"Agirre",
"Eneko",
""
]
] | This paper revisits the one sense per collocation hypothesis using fine-grained sense distinctions and two different corpora. We show that the hypothesis is weaker for fine-grained sense distinctions (70% vs. 99% reported earlier on 2-way ambiguities). We also show that one sense per collocation does hold across corpor... |
2004.14969 | Baoxu Shi | Baoxu Shi, Shan Li, Jaewon Yang, Mustafa Emre Kazdagli, Qi He | Learning to Ask Screening Questions for Job Postings | 10 pages, to appear in SIGIR2020 | null | null | null | cs.IR cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | At LinkedIn, we want to create economic opportunity for everyone in the
global workforce. A critical aspect of this goal is matching jobs with
qualified applicants. To improve hiring efficiency and reduce the need to
manually screening each applicant, we develop a new product where recruiters
can ask screening questi... | [
{
"created": "Thu, 30 Apr 2020 17:18:17 GMT",
"version": "v1"
}
] | 2020-05-01 | [
[
"Shi",
"Baoxu",
""
],
[
"Li",
"Shan",
""
],
[
"Yang",
"Jaewon",
""
],
[
"Kazdagli",
"Mustafa Emre",
""
],
[
"He",
"Qi",
""
]
] | At LinkedIn, we want to create economic opportunity for everyone in the global workforce. A critical aspect of this goal is matching jobs with qualified applicants. To improve hiring efficiency and reduce the need to manually screening each applicant, we develop a new product where recruiters can ask screening question... |
0711.3325 | EDA Publishing Association | Hsiharng Yang, Chung-Tze Lee | Miniaturized Fluorescence Excitation Platform with Optical Fiber for
Bio-Detection Chips | Submitted on behalf of TIMA Editions
(http://irevues.inist.fr/tima-editions) | Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006) | null | null | cs.OH | null | This paper presents a new research study on the platform fabrication of
fluorescence bio-detection chip with an optical fiber transmission. Anisotropic
wet etching on (100) silicon wafers to fabrication V-groove for optical fiber
alignment and micro-mirror were included. Combing with anodic bonding technique
to adher... | [
{
"created": "Wed, 21 Nov 2007 10:09:35 GMT",
"version": "v1"
}
] | 2007-11-29 | [
[
"Yang",
"Hsiharng",
""
],
[
"Lee",
"Chung-Tze",
""
]
] | This paper presents a new research study on the platform fabrication of fluorescence bio-detection chip with an optical fiber transmission. Anisotropic wet etching on (100) silicon wafers to fabrication V-groove for optical fiber alignment and micro-mirror were included. Combing with anodic bonding technique to adhere ... |
1804.00175 | Yi Li | Yi Li, Gu Wang, Xiangyang Ji, Yu Xiang, Dieter Fox | DeepIM: Deep Iterative Matching for 6D Pose Estimation | submitted to IJCV, update results on YCB_Video, add depth-based
results | null | 10.1007/s11263-019-01250-9 | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Estimating the 6D pose of objects from images is an important problem in
various applications such as robot manipulation and virtual reality. While
direct regression of images to object poses has limited accuracy, matching
rendered images of an object against the observed image can produce accurate
results. In this w... | [
{
"created": "Sat, 31 Mar 2018 14:02:25 GMT",
"version": "v1"
},
{
"created": "Wed, 25 Apr 2018 16:28:50 GMT",
"version": "v2"
},
{
"created": "Thu, 14 Mar 2019 13:25:49 GMT",
"version": "v3"
},
{
"created": "Wed, 2 Oct 2019 00:54:47 GMT",
"version": "v4"
}
] | 2019-10-03 | [
[
"Li",
"Yi",
""
],
[
"Wang",
"Gu",
""
],
[
"Ji",
"Xiangyang",
""
],
[
"Xiang",
"Yu",
""
],
[
"Fox",
"Dieter",
""
]
] | Estimating the 6D pose of objects from images is an important problem in various applications such as robot manipulation and virtual reality. While direct regression of images to object poses has limited accuracy, matching rendered images of an object against the observed image can produce accurate results. In this wor... |
2006.02610 | Xulei Yang | Balagopal Unnikrishnan, Pranshu Ranjan Singh, Xulei Yang, and Matthew
Chin Heng Chua | Semi-supervised and Unsupervised Methods for Heart Sounds Classification
in Restricted Data Environments | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automated heart sounds classification is a much-required diagnostic tool in
the view of increasing incidences of heart related diseases worldwide. In this
study, we conduct a comprehensive study of heart sounds classification by using
various supervised, semi-supervised and unsupervised approaches on the
PhysioNet/Ci... | [
{
"created": "Thu, 4 Jun 2020 02:07:35 GMT",
"version": "v1"
}
] | 2020-06-05 | [
[
"Unnikrishnan",
"Balagopal",
""
],
[
"Singh",
"Pranshu Ranjan",
""
],
[
"Yang",
"Xulei",
""
],
[
"Chua",
"Matthew Chin Heng",
""
]
] | Automated heart sounds classification is a much-required diagnostic tool in the view of increasing incidences of heart related diseases worldwide. In this study, we conduct a comprehensive study of heart sounds classification by using various supervised, semi-supervised and unsupervised approaches on the PhysioNet/CinC... |
1109.0660 | Albert Fannjiang | Albert Fannjiang and Wenjing Liao | Mismatch and resolution in compressive imaging | Figure 5 revised | null | 10.1117/12.892434 | null | cs.IT math.IT math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Highly coherent sensing matrices arise in discretization of continuum
problems such as radar and medical imaging when the grid spacing is below the
Rayleigh threshold as well as in using highly coherent, redundant dictionaries
as sparsifying operators. Algorithms (BOMP, BLOOMP) based on techniques of band
exclusion a... | [
{
"created": "Sat, 3 Sep 2011 23:58:02 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Sep 2011 22:23:52 GMT",
"version": "v2"
}
] | 2015-05-30 | [
[
"Fannjiang",
"Albert",
""
],
[
"Liao",
"Wenjing",
""
]
] | Highly coherent sensing matrices arise in discretization of continuum problems such as radar and medical imaging when the grid spacing is below the Rayleigh threshold as well as in using highly coherent, redundant dictionaries as sparsifying operators. Algorithms (BOMP, BLOOMP) based on techniques of band exclusion and... |
1905.10833 | Michal Dory | Michal Dory, Mohsen Ghaffari | Improved Distributed Approximations for Minimum-Weight
Two-Edge-Connected Spanning Subgraph | null | null | null | null | cs.DS cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The minimum-weight $2$-edge-connected spanning subgraph (2-ECSS) problem is a
natural generalization of the well-studied minimum-weight spanning tree (MST)
problem, and it has received considerable attention in the area of network
design. The latter problem asks for a minimum-weight subgraph with an edge
connectivity... | [
{
"created": "Sun, 26 May 2019 16:37:22 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Jun 2019 11:49:00 GMT",
"version": "v2"
}
] | 2019-06-04 | [
[
"Dory",
"Michal",
""
],
[
"Ghaffari",
"Mohsen",
""
]
] | The minimum-weight $2$-edge-connected spanning subgraph (2-ECSS) problem is a natural generalization of the well-studied minimum-weight spanning tree (MST) problem, and it has received considerable attention in the area of network design. The latter problem asks for a minimum-weight subgraph with an edge connectivity o... |
2308.06201 | Mohammad Eslami | Mohammad Eslami, Tiago Perez and Samuel Pagliarini | SALSy: Security-Aware Layout Synthesis | null | null | null | null | cs.CR cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Integrated Circuits (ICs) are the target of diverse attacks during their
lifetime. Fabrication-time attacks, such as the insertion of Hardware Trojans,
can give an adversary access to privileged data and/or the means to corrupt the
IC's internal computation. Post-fabrication attacks, where the end-user takes a
malici... | [
{
"created": "Fri, 11 Aug 2023 15:52:28 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Aug 2023 14:15:02 GMT",
"version": "v2"
}
] | 2023-08-22 | [
[
"Eslami",
"Mohammad",
""
],
[
"Perez",
"Tiago",
""
],
[
"Pagliarini",
"Samuel",
""
]
] | Integrated Circuits (ICs) are the target of diverse attacks during their lifetime. Fabrication-time attacks, such as the insertion of Hardware Trojans, can give an adversary access to privileged data and/or the means to corrupt the IC's internal computation. Post-fabrication attacks, where the end-user takes a maliciou... |
2309.06223 | Yanzuo Chen | Yanzuo Chen (1), Zhibo Liu (1), Yuanyuan Yuan (1), Sihang Hu (2),
Tianxiang Li (2), Shuai Wang (1) ((1) The Hong Kong University of Science and
Technology, (2) Huawei Technologies) | Unveiling Single-Bit-Flip Attacks on DNN Executables | Fix typo | null | null | null | cs.CR cs.AI | http://creativecommons.org/licenses/by/4.0/ | Recent research has shown that bit-flip attacks (BFAs) can manipulate deep
neural networks (DNNs) via DRAM Rowhammer exploitations. Existing attacks are
primarily launched over high-level DNN frameworks like PyTorch and flip bits in
model weight files. Nevertheless, DNNs are frequently compiled into low-level
executa... | [
{
"created": "Tue, 12 Sep 2023 13:42:20 GMT",
"version": "v1"
},
{
"created": "Sun, 8 Oct 2023 04:33:54 GMT",
"version": "v2"
}
] | 2023-10-10 | [
[
"Chen",
"Yanzuo",
""
],
[
"Liu",
"Zhibo",
""
],
[
"Yuan",
"Yuanyuan",
""
],
[
"Hu",
"Sihang",
""
],
[
"Li",
"Tianxiang",
""
],
[
"Wang",
"Shuai",
""
]
] | Recent research has shown that bit-flip attacks (BFAs) can manipulate deep neural networks (DNNs) via DRAM Rowhammer exploitations. Existing attacks are primarily launched over high-level DNN frameworks like PyTorch and flip bits in model weight files. Nevertheless, DNNs are frequently compiled into low-level executabl... |
2404.14610 | Christian Vogler | Paige DeVries, Nina Tran, Keith Delk, Melanie Miga, Richard Taulbee,
Pranav Pidathala, Abraham Glasser, Raja Kushlanagar and Christian Vogler | Sign Language-Based versus Touch-Based Input for Deaf Users with
Interactive Personal Assistants in Simulated Kitchen Environments | To appear in Extended Abstracts of the CHI Conference on Human
Factors in Computing Systems, CHI EA 2024, May 11-16, 2024, Honolulu, HI,
USA. ACM, New York, NY, USA, 9 pages. https://doi.org/10.1145/3613905.3651075 | null | 10.1145/3613905.3651075 | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this study, we assess the usability of interactive personal assistants
(IPAs), such as Amazon Alexa, in a simulated kitchen smart home environment,
with deaf and hard of hearing users. Participants engage in activities in a way
that causes their hands to get dirty. With these dirty hands, they are tasked
with two ... | [
{
"created": "Mon, 22 Apr 2024 22:17:35 GMT",
"version": "v1"
}
] | 2024-05-16 | [
[
"DeVries",
"Paige",
""
],
[
"Tran",
"Nina",
""
],
[
"Delk",
"Keith",
""
],
[
"Miga",
"Melanie",
""
],
[
"Taulbee",
"Richard",
""
],
[
"Pidathala",
"Pranav",
""
],
[
"Glasser",
"Abraham",
""
],
[
"Ku... | In this study, we assess the usability of interactive personal assistants (IPAs), such as Amazon Alexa, in a simulated kitchen smart home environment, with deaf and hard of hearing users. Participants engage in activities in a way that causes their hands to get dirty. With these dirty hands, they are tasked with two di... |
0811.0273 | Vinay Joseph | Vinod Sharma, Utpal Mukherji and Vinay Joseph | Efficient Energy Management Policies for Networks with Energy Harvesting
Sensor Nodes | Keywords: Optimal energy management policies, energy harvesting,
sensor networks, MAC protocols | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study sensor networks with energy harvesting nodes. The generated energy
at a node can be stored in a buffer. A sensor node periodically senses a random
field and generates a packet. These packets are stored in a queue and
transmitted using the energy available at that time at the node. For such
networks we develo... | [
{
"created": "Mon, 3 Nov 2008 12:05:01 GMT",
"version": "v1"
}
] | 2008-11-04 | [
[
"Sharma",
"Vinod",
""
],
[
"Mukherji",
"Utpal",
""
],
[
"Joseph",
"Vinay",
""
]
] | We study sensor networks with energy harvesting nodes. The generated energy at a node can be stored in a buffer. A sensor node periodically senses a random field and generates a packet. These packets are stored in a queue and transmitted using the energy available at that time at the node. For such networks we develop ... |
1801.08873 | Alexander Thomasian | Alexander Thomasian | Mirrored and Hybrid Disk Arrays: Organization, Scheduling, Reliability,
and Performance | null | null | null | null | cs.DC cs.OS cs.PF | http://creativecommons.org/licenses/by/4.0/ | Basic mirroring (BM) classified as RAID level 1 replicates data on two disks,
thus doubling disk access bandwidth for read requests. RAID1/0 is an array of
BM pairs with balanced loads due to striping. When a disk fails the read load
on its pair is doubled, which results in halving the maximum attainable
bandwidth. W... | [
{
"created": "Fri, 26 Jan 2018 15:59:51 GMT",
"version": "v1"
}
] | 2018-01-29 | [
[
"Thomasian",
"Alexander",
""
]
] | Basic mirroring (BM) classified as RAID level 1 replicates data on two disks, thus doubling disk access bandwidth for read requests. RAID1/0 is an array of BM pairs with balanced loads due to striping. When a disk fails the read load on its pair is doubled, which results in halving the maximum attainable bandwidth. We ... |
1304.5438 | EPTCS | Thomas Brihaye (University of Mons), Quentin Menet (University of
Mons) | Simple strategies for Banach-Mazur games and fairly correct systems | In Proceedings GandALF 2013, arXiv:1307.4162 | EPTCS 119, 2013, pp. 21-34 | 10.4204/EPTCS.119.5 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In 2006, Varacca and V\"olzer proved that on finite graphs, omega-regular
large sets coincide with omega-regular sets of probability 1, by using the
existence of positional strategies in the related Banach-Mazur games. Motivated
by this result, we try to understand relations between sets of probability 1
and various ... | [
{
"created": "Fri, 19 Apr 2013 14:53:04 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Jul 2013 04:12:09 GMT",
"version": "v2"
}
] | 2013-07-18 | [
[
"Brihaye",
"Thomas",
"",
"University of Mons"
],
[
"Menet",
"Quentin",
"",
"University of\n Mons"
]
] | In 2006, Varacca and V\"olzer proved that on finite graphs, omega-regular large sets coincide with omega-regular sets of probability 1, by using the existence of positional strategies in the related Banach-Mazur games. Motivated by this result, we try to understand relations between sets of probability 1 and various no... |
2207.05736 | Kai-En Lin | Kai-En Lin, Lin Yen-Chen, Wei-Sheng Lai, Tsung-Yi Lin, Yi-Chang Shih,
Ravi Ramamoorthi | Vision Transformer for NeRF-Based View Synthesis from a Single Input
Image | WACV 2023 Project website:
https://cseweb.ucsd.edu/~viscomp/projects/VisionNeRF/ | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although neural radiance fields (NeRF) have shown impressive advances for
novel view synthesis, most methods typically require multiple input images of
the same scene with accurate camera poses. In this work, we seek to
substantially reduce the inputs to a single unposed image. Existing approaches
condition on local ... | [
{
"created": "Tue, 12 Jul 2022 17:52:04 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Oct 2022 20:09:59 GMT",
"version": "v2"
}
] | 2022-10-17 | [
[
"Lin",
"Kai-En",
""
],
[
"Yen-Chen",
"Lin",
""
],
[
"Lai",
"Wei-Sheng",
""
],
[
"Lin",
"Tsung-Yi",
""
],
[
"Shih",
"Yi-Chang",
""
],
[
"Ramamoorthi",
"Ravi",
""
]
] | Although neural radiance fields (NeRF) have shown impressive advances for novel view synthesis, most methods typically require multiple input images of the same scene with accurate camera poses. In this work, we seek to substantially reduce the inputs to a single unposed image. Existing approaches condition on local im... |
2110.13953 | Mayank Agarwal | Mayank Agarwal, Mikhail Yurochkin, Yuekai Sun | On sensitivity of meta-learning to support data | Accepted at NeurIPS 2021 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Meta-learning algorithms are widely used for few-shot learning. For example,
image recognition systems that readily adapt to unseen classes after seeing
only a few labeled examples. Despite their success, we show that modern
meta-learning algorithms are extremely sensitive to the data used for
adaptation, i.e. suppor... | [
{
"created": "Tue, 26 Oct 2021 18:36:37 GMT",
"version": "v1"
}
] | 2021-10-28 | [
[
"Agarwal",
"Mayank",
""
],
[
"Yurochkin",
"Mikhail",
""
],
[
"Sun",
"Yuekai",
""
]
] | Meta-learning algorithms are widely used for few-shot learning. For example, image recognition systems that readily adapt to unseen classes after seeing only a few labeled examples. Despite their success, we show that modern meta-learning algorithms are extremely sensitive to the data used for adaptation, i.e. support ... |
2102.10684 | Ahmed Abdelali | Ahmed Abdelali, Sabit Hassan, Hamdy Mubarak, Kareem Darwish and Younes
Samih | Pre-Training BERT on Arabic Tweets: Practical Considerations | 6 pages, 5 figures | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Pretraining Bidirectional Encoder Representations from Transformers (BERT)
for downstream NLP tasks is a non-trival task. We pretrained 5 BERT models that
differ in the size of their training sets, mixture of formal and informal
Arabic, and linguistic preprocessing. All are intended to support Arabic
dialects and soc... | [
{
"created": "Sun, 21 Feb 2021 20:51:33 GMT",
"version": "v1"
}
] | 2021-02-23 | [
[
"Abdelali",
"Ahmed",
""
],
[
"Hassan",
"Sabit",
""
],
[
"Mubarak",
"Hamdy",
""
],
[
"Darwish",
"Kareem",
""
],
[
"Samih",
"Younes",
""
]
] | Pretraining Bidirectional Encoder Representations from Transformers (BERT) for downstream NLP tasks is a non-trival task. We pretrained 5 BERT models that differ in the size of their training sets, mixture of formal and informal Arabic, and linguistic preprocessing. All are intended to support Arabic dialects and socia... |
2112.07831 | Varsha Lohani | Varsha Lohani, Anjali Sharma, Yatindra Nath Singh | Optimal Slot Size under Various Bandwidth Distributions in the
Flexible-grid Optical Networks | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | Flexible grid Optical Networks are efficient mechanism to provide flexibility
in the optical spectrum utilization. For such networks, the slot width size as
specified by the ITU-T G.694.1 is 12.5 GHz. However, one should question if it
is the optimal grid size? In this paper, under different bandwidth distribution
sc... | [
{
"created": "Wed, 15 Dec 2021 01:59:35 GMT",
"version": "v1"
}
] | 2021-12-16 | [
[
"Lohani",
"Varsha",
""
],
[
"Sharma",
"Anjali",
""
],
[
"Singh",
"Yatindra Nath",
""
]
] | Flexible grid Optical Networks are efficient mechanism to provide flexibility in the optical spectrum utilization. For such networks, the slot width size as specified by the ITU-T G.694.1 is 12.5 GHz. However, one should question if it is the optimal grid size? In this paper, under different bandwidth distribution scen... |
2003.12869 | Chao Yang Mr. | Chao Yang, Ser-Nam Lim | One-Shot Domain Adaptation For Face Generation | Accepted to CVPR 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a framework capable of generating face images that
fall into the same distribution as that of a given one-shot example. We
leverage a pre-trained StyleGAN model that already learned the generic face
distribution. Given the one-shot target, we develop an iterative optimization
scheme that rap... | [
{
"created": "Sat, 28 Mar 2020 18:50:13 GMT",
"version": "v1"
}
] | 2020-03-31 | [
[
"Yang",
"Chao",
""
],
[
"Lim",
"Ser-Nam",
""
]
] | In this paper, we propose a framework capable of generating face images that fall into the same distribution as that of a given one-shot example. We leverage a pre-trained StyleGAN model that already learned the generic face distribution. Given the one-shot target, we develop an iterative optimization scheme that rapid... |
1211.6411 | Mohammed El-Dosuky | Mohammed El-Dosuky, Ahmed EL-Bassiouny, Taher Hamza and Magdy Rashad | New Heuristics for Interfacing Human Motor System using Brain Waves | null | null | null | null | cs.HC cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There are many new forms of interfacing human users to machines. We persevere
here electric mechanical form of interaction between human and machine. The
emergence of brain-computer interface allows mind-to-movement systems. The
story of the Pied Piper inspired us to devise some new heuristics for
interfacing human m... | [
{
"created": "Sat, 24 Nov 2012 01:21:25 GMT",
"version": "v1"
}
] | 2012-11-28 | [
[
"El-Dosuky",
"Mohammed",
""
],
[
"EL-Bassiouny",
"Ahmed",
""
],
[
"Hamza",
"Taher",
""
],
[
"Rashad",
"Magdy",
""
]
] | There are many new forms of interfacing human users to machines. We persevere here electric mechanical form of interaction between human and machine. The emergence of brain-computer interface allows mind-to-movement systems. The story of the Pied Piper inspired us to devise some new heuristics for interfacing human mot... |
2201.11464 | Christoph Matheja | Kevin Batz and Ira Fesefeldt and Marvin Jansen and Joost-Pieter Katoen
and Florian Ke{\ss}ler and Christoph Matheja and Thomas Noll | Foundations for Entailment Checking in Quantitative Separation Logic
(extended version) | Extended version of ESOP'22 paper | null | null | null | cs.LO cs.PL | http://creativecommons.org/licenses/by/4.0/ | Quantitative separation logic (QSL) is an extension of separation logic (SL)
for the verification of probabilistic pointer programs. In QSL, formulae
evaluate to real numbers instead of truth values, e.g., the probability of
memory-safe termination in a given symbolic heap. As with \SL, one of the key
problems when r... | [
{
"created": "Thu, 27 Jan 2022 12:07:06 GMT",
"version": "v1"
}
] | 2022-01-28 | [
[
"Batz",
"Kevin",
""
],
[
"Fesefeldt",
"Ira",
""
],
[
"Jansen",
"Marvin",
""
],
[
"Katoen",
"Joost-Pieter",
""
],
[
"Keßler",
"Florian",
""
],
[
"Matheja",
"Christoph",
""
],
[
"Noll",
"Thomas",
""
]
] | Quantitative separation logic (QSL) is an extension of separation logic (SL) for the verification of probabilistic pointer programs. In QSL, formulae evaluate to real numbers instead of truth values, e.g., the probability of memory-safe termination in a given symbolic heap. As with \SL, one of the key problems when rea... |
1612.03412 | Yochai Blau | Yochai Blau and Tomer Michaeli | Non-Redundant Spectral Dimensionality Reduction | null | European Conference on Machine Learning and Knowledge Discovery in
Databases (ECML PKDD), Part I, LNAI 10534, pp. 256-271, 2017 | 10.1007/978-3-319-71249-9_16 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spectral dimensionality reduction algorithms are widely used in numerous
domains, including for recognition, segmentation, tracking and visualization.
However, despite their popularity, these algorithms suffer from a major
limitation known as the "repeated Eigen-directions" phenomenon. That is, many
of the embedding ... | [
{
"created": "Sun, 11 Dec 2016 14:04:33 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Apr 2017 12:58:06 GMT",
"version": "v2"
}
] | 2018-01-03 | [
[
"Blau",
"Yochai",
""
],
[
"Michaeli",
"Tomer",
""
]
] | Spectral dimensionality reduction algorithms are widely used in numerous domains, including for recognition, segmentation, tracking and visualization. However, despite their popularity, these algorithms suffer from a major limitation known as the "repeated Eigen-directions" phenomenon. That is, many of the embedding co... |
2006.15313 | Swarup Chattopadhyay | Swarup Chattopadhyay, Debasis Ganguly | Community Structure aware Embedding of Nodes in a Network | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Detecting communities or the modular structure of real-life networks (e.g. a
social network or a product purchase network) is an important task because the
way a network functions is often determined by its communities. Traditional
approaches to community detection involve modularity-based algorithms, which
generally... | [
{
"created": "Sat, 27 Jun 2020 08:07:21 GMT",
"version": "v1"
}
] | 2020-06-30 | [
[
"Chattopadhyay",
"Swarup",
""
],
[
"Ganguly",
"Debasis",
""
]
] | Detecting communities or the modular structure of real-life networks (e.g. a social network or a product purchase network) is an important task because the way a network functions is often determined by its communities. Traditional approaches to community detection involve modularity-based algorithms, which generally s... |
2206.09485 | U\u{g}ur \c{C}o\u{g}alan | U\u{g}ur \c{C}o\u{g}alan, Mojtaba Bemana, Hans-Peter Seidel, Karol
Myszkowski | Video frame interpolation for high dynamic range sequences captured with
dual-exposure sensors | 13 pages, 10 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Video frame interpolation (VFI) enables many important applications that
might involve the temporal domain, such as slow motion playback, or the spatial
domain, such as stop motion sequences. We are focusing on the former task,
where one of the key challenges is handling high dynamic range (HDR) scenes in
the presenc... | [
{
"created": "Sun, 19 Jun 2022 20:29:34 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Feb 2023 10:09:22 GMT",
"version": "v2"
},
{
"created": "Wed, 31 May 2023 13:58:01 GMT",
"version": "v3"
}
] | 2023-06-01 | [
[
"Çoğalan",
"Uğur",
""
],
[
"Bemana",
"Mojtaba",
""
],
[
"Seidel",
"Hans-Peter",
""
],
[
"Myszkowski",
"Karol",
""
]
] | Video frame interpolation (VFI) enables many important applications that might involve the temporal domain, such as slow motion playback, or the spatial domain, such as stop motion sequences. We are focusing on the former task, where one of the key challenges is handling high dynamic range (HDR) scenes in the presence ... |
1505.01448 | Thomas Leibovici | Thomas Leibovici | Taking back control of HPC file systems with Robinhood Policy Engine | International Workshop on the Lustre Ecosystem: Challenges and
Opportunities, March 2015, Annapolis MD | null | null | null | cs.DC cs.OS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Today, the largest Lustre file systems store billions of entries. On such
systems, classic tools based on namespace scanning become unusable. Operations
such as managing file lifetime, scheduling data copies, and generating overall
filesystem statistics become painful as they require collecting, sorting and
aggregati... | [
{
"created": "Wed, 6 May 2015 18:14:56 GMT",
"version": "v1"
}
] | 2015-05-07 | [
[
"Leibovici",
"Thomas",
""
]
] | Today, the largest Lustre file systems store billions of entries. On such systems, classic tools based on namespace scanning become unusable. Operations such as managing file lifetime, scheduling data copies, and generating overall filesystem statistics become painful as they require collecting, sorting and aggregating... |
2004.01353 | Mihai Sima | Ash Luft, Mihai Sima, Michael McGuire | Hardware Trojan with Frequency Modulation | null | null | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The use of third-party IP cores in implementing applications in FPGAs has
given rise to the threat of malicious alterations through the insertion of
hardware Trojans. To address this threat, it is important to predict the way
hardware Trojans are built and to identify their weaknesses. This paper
describes a logic fa... | [
{
"created": "Fri, 3 Apr 2020 03:17:14 GMT",
"version": "v1"
}
] | 2020-04-06 | [
[
"Luft",
"Ash",
""
],
[
"Sima",
"Mihai",
""
],
[
"McGuire",
"Michael",
""
]
] | The use of third-party IP cores in implementing applications in FPGAs has given rise to the threat of malicious alterations through the insertion of hardware Trojans. To address this threat, it is important to predict the way hardware Trojans are built and to identify their weaknesses. This paper describes a logic fami... |
1807.04709 | Emma Pierson | Emma Pierson, Pang Wei Koh, Tatsunori Hashimoto, Daphne Koller, Jure
Leskovec, Nicholas Eriksson, Percy Liang | Inferring Multidimensional Rates of Aging from Cross-Sectional Data | Accepted at AISTATS 2019 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modeling how individuals evolve over time is a fundamental problem in the
natural and social sciences. However, existing datasets are often
cross-sectional with each individual observed only once, making it impossible
to apply traditional time-series methods. Motivated by the study of human
aging, we present an inter... | [
{
"created": "Thu, 12 Jul 2018 16:27:40 GMT",
"version": "v1"
},
{
"created": "Sun, 11 Nov 2018 21:38:56 GMT",
"version": "v2"
},
{
"created": "Tue, 5 Mar 2019 18:22:09 GMT",
"version": "v3"
}
] | 2019-03-06 | [
[
"Pierson",
"Emma",
""
],
[
"Koh",
"Pang Wei",
""
],
[
"Hashimoto",
"Tatsunori",
""
],
[
"Koller",
"Daphne",
""
],
[
"Leskovec",
"Jure",
""
],
[
"Eriksson",
"Nicholas",
""
],
[
"Liang",
"Percy",
""
]
] | Modeling how individuals evolve over time is a fundamental problem in the natural and social sciences. However, existing datasets are often cross-sectional with each individual observed only once, making it impossible to apply traditional time-series methods. Motivated by the study of human aging, we present an interpr... |
1206.1105 | Biao Xiang | Biao Xiang, Enhong Chen, Qi Liu, Hui Xiong | A Linear Circuit Model For Social Influence Analysis | arXiv admin note: substantial text overlap with arXiv:1205.6024 | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding the behaviors of information propagation is essential for the
effective exploitation of social influence in social networks. However, few
existing influence models are both tractable and efficient for describing the
information propagation process and quantitatively measuring social influence.
To this e... | [
{
"created": "Wed, 6 Jun 2012 01:58:41 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Sep 2012 05:28:53 GMT",
"version": "v2"
}
] | 2012-09-11 | [
[
"Xiang",
"Biao",
""
],
[
"Chen",
"Enhong",
""
],
[
"Liu",
"Qi",
""
],
[
"Xiong",
"Hui",
""
]
] | Understanding the behaviors of information propagation is essential for the effective exploitation of social influence in social networks. However, few existing influence models are both tractable and efficient for describing the information propagation process and quantitatively measuring social influence. To this end... |
1708.07878 | Rui Wang | Rui Wang, Martin Schw\"orer, Daniel Cremers | Stereo DSO: Large-Scale Direct Sparse Visual Odometry with Stereo
Cameras | ICCV 2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose Stereo Direct Sparse Odometry (Stereo DSO) as a novel method for
highly accurate real-time visual odometry estimation of large-scale
environments from stereo cameras. It jointly optimizes for all the model
parameters within the active window, including the intrinsic/extrinsic camera
parameters of all keyfr... | [
{
"created": "Fri, 25 Aug 2017 20:50:54 GMT",
"version": "v1"
}
] | 2017-08-29 | [
[
"Wang",
"Rui",
""
],
[
"Schwörer",
"Martin",
""
],
[
"Cremers",
"Daniel",
""
]
] | We propose Stereo Direct Sparse Odometry (Stereo DSO) as a novel method for highly accurate real-time visual odometry estimation of large-scale environments from stereo cameras. It jointly optimizes for all the model parameters within the active window, including the intrinsic/extrinsic camera parameters of all keyfram... |
1902.05176 | Ashis Banerjee | Behnoosh Parsa, Ekta U. Samani, Rose Hendrix, Cameron Devine, Shashi
M. Singh, Santosh Devasia, and Ashis G. Banerjee | Toward Ergonomic Risk Prediction via Segmentation of Indoor Object
Manipulation Actions Using Spatiotemporal Convolutional Networks | null | null | 10.1109/LRA.2019.2925305 | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automated real-time prediction of the ergonomic risks of manipulating objects
is a key unsolved challenge in developing effective human-robot collaboration
systems for logistics and manufacturing applications. We present a foundational
paradigm to address this challenge by formulating the problem as one of action
seg... | [
{
"created": "Thu, 14 Feb 2019 00:53:07 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Jun 2019 04:39:37 GMT",
"version": "v2"
}
] | 2019-06-27 | [
[
"Parsa",
"Behnoosh",
""
],
[
"Samani",
"Ekta U.",
""
],
[
"Hendrix",
"Rose",
""
],
[
"Devine",
"Cameron",
""
],
[
"Singh",
"Shashi M.",
""
],
[
"Devasia",
"Santosh",
""
],
[
"Banerjee",
"Ashis G.",
""
]
] | Automated real-time prediction of the ergonomic risks of manipulating objects is a key unsolved challenge in developing effective human-robot collaboration systems for logistics and manufacturing applications. We present a foundational paradigm to address this challenge by formulating the problem as one of action segme... |
2311.11638 | Chunming He | Chunming He, Chengyu Fang, Yulun Zhang, Tian Ye, Kai Li, Longxiang
Tang, Zhenhua Guo, Xiu Li, Sina Farsiu | Reti-Diff: Illumination Degradation Image Restoration with Retinex-based
Latent Diffusion Model | 20 pages, 11 figures, 11 tables | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Illumination degradation image restoration (IDIR) techniques aim to improve
the visibility of degraded images and mitigate the adverse effects of
deteriorated illumination. Among these algorithms, diffusion model (DM)-based
methods have shown promising performance but are often burdened by heavy
computational demands... | [
{
"created": "Mon, 20 Nov 2023 09:55:06 GMT",
"version": "v1"
},
{
"created": "Sat, 9 Mar 2024 07:59:41 GMT",
"version": "v2"
}
] | 2024-03-12 | [
[
"He",
"Chunming",
""
],
[
"Fang",
"Chengyu",
""
],
[
"Zhang",
"Yulun",
""
],
[
"Ye",
"Tian",
""
],
[
"Li",
"Kai",
""
],
[
"Tang",
"Longxiang",
""
],
[
"Guo",
"Zhenhua",
""
],
[
"Li",
"Xiu",
... | Illumination degradation image restoration (IDIR) techniques aim to improve the visibility of degraded images and mitigate the adverse effects of deteriorated illumination. Among these algorithms, diffusion model (DM)-based methods have shown promising performance but are often burdened by heavy computational demands a... |
1206.3599 | Siddhartha Banerjee | Siddhartha Banerjee, Aditya Gopalan, Abhik Kumar Das, Sanjay
Shakkottai | Epidemic Spreading with External Agents | null | null | 10.1109/TIT.2014.2316801 | null | cs.SI cs.IT cs.NI math.IT physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study epidemic spreading processes in large networks, when the spread is
assisted by a small number of external agents: infection sources with bounded
spreading power, but whose movement is unrestricted vis-\`a-vis the underlying
network topology. For networks which are `spatially constrained', we show that
the sp... | [
{
"created": "Fri, 15 Jun 2012 21:10:28 GMT",
"version": "v1"
},
{
"created": "Sun, 13 Apr 2014 04:20:15 GMT",
"version": "v2"
}
] | 2014-04-15 | [
[
"Banerjee",
"Siddhartha",
""
],
[
"Gopalan",
"Aditya",
""
],
[
"Das",
"Abhik Kumar",
""
],
[
"Shakkottai",
"Sanjay",
""
]
] | We study epidemic spreading processes in large networks, when the spread is assisted by a small number of external agents: infection sources with bounded spreading power, but whose movement is unrestricted vis-\`a-vis the underlying network topology. For networks which are `spatially constrained', we show that the spre... |
2109.07436 | Sriram Gopalakrishnan | Sriram Gopalakrishnan, Mudit Verma, Subbarao Kambhampati | Computing Policies That Account For The Effects Of Human Agent
Uncertainty During Execution In Markov Decision Processes | 7 page paper, 6 pages supplemental material | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When humans are given a policy to execute, there can be policy execution
errors and deviations in policy if there is uncertainty in identifying a state.
This can happen due to the human agent's cognitive limitations and/or
perceptual errors. So an algorithm that computes a policy for a human to
execute ought to consi... | [
{
"created": "Wed, 15 Sep 2021 17:10:46 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Sep 2021 21:24:20 GMT",
"version": "v2"
},
{
"created": "Thu, 3 Mar 2022 22:00:30 GMT",
"version": "v3"
}
] | 2022-03-07 | [
[
"Gopalakrishnan",
"Sriram",
""
],
[
"Verma",
"Mudit",
""
],
[
"Kambhampati",
"Subbarao",
""
]
] | When humans are given a policy to execute, there can be policy execution errors and deviations in policy if there is uncertainty in identifying a state. This can happen due to the human agent's cognitive limitations and/or perceptual errors. So an algorithm that computes a policy for a human to execute ought to conside... |
1904.12099 | Jiaqi Yang | Jiaqi Yang, Chen Zhao, Ke Xian, Angfan Zhu, Zhiguo Cao | Learning to Fuse Local Geometric Features for 3D Rigid Data Matching | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a simple yet very effective data-driven approach to fuse
both low-level and high-level local geometric features for 3D rigid data
matching. It is a common practice to generate distinctive geometric descriptors
by fusing low-level features from various viewpoints or subspaces, or enhance
geometric ... | [
{
"created": "Sat, 27 Apr 2019 03:23:21 GMT",
"version": "v1"
}
] | 2019-04-30 | [
[
"Yang",
"Jiaqi",
""
],
[
"Zhao",
"Chen",
""
],
[
"Xian",
"Ke",
""
],
[
"Zhu",
"Angfan",
""
],
[
"Cao",
"Zhiguo",
""
]
] | This paper presents a simple yet very effective data-driven approach to fuse both low-level and high-level local geometric features for 3D rigid data matching. It is a common practice to generate distinctive geometric descriptors by fusing low-level features from various viewpoints or subspaces, or enhance geometric fe... |
1803.04722 | Xiao Song | Xiao Song, Xu Zhao, Tianwei Lin | Face Spoofing Detection by Fusing Binocular Depth and Spatial Pyramid
Coding Micro-Texture Features | 5 pages, 2 figures, accepted by 2017 IEEE International Conference on
Image Processing (ICIP) | null | 10.1109/ICIP.2017.8296250 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robust features are of vital importance to face spoofing detection, because
various situations make feature space extremely complicated to partition. Thus
in this paper, two novel and robust features for anti-spoofing are proposed.
The first one is a binocular camera based depth feature called Template Face
Matched B... | [
{
"created": "Tue, 13 Mar 2018 10:49:45 GMT",
"version": "v1"
}
] | 2018-03-14 | [
[
"Song",
"Xiao",
""
],
[
"Zhao",
"Xu",
""
],
[
"Lin",
"Tianwei",
""
]
] | Robust features are of vital importance to face spoofing detection, because various situations make feature space extremely complicated to partition. Thus in this paper, two novel and robust features for anti-spoofing are proposed. The first one is a binocular camera based depth feature called Template Face Matched Bin... |
2304.02712 | Baidyanath Kundu | Baidyanath Kundu (1 and 2), Vassil Vassilev (1 and 2), Wim Lavrijsen
(3) ((1) European Council for Nuclear Research, (2) Princeton University
(US), (3) LBNL (US)) | Efficient and Accurate Automatic Python Bindings with cppyy & Cling | 7 pages, 3 figures, 1 table; submitted to ACAT 2022 proceedings | null | null | null | cs.PL | http://creativecommons.org/licenses/by/4.0/ | The simplicity of Python and the power of C++ force stark choices on a
scientific software stack. There have been multiple developments to mitigate
language boundaries by implementing language bindings, but the impedance
mismatch between the static nature of C++ and the dynamic one of Python hinders
their implementat... | [
{
"created": "Wed, 5 Apr 2023 19:12:05 GMT",
"version": "v1"
}
] | 2023-04-07 | [
[
"Kundu",
"Baidyanath",
"",
"1 and 2"
],
[
"Vassilev",
"Vassil",
"",
"1 and 2"
],
[
"Lavrijsen",
"Wim",
""
]
] | The simplicity of Python and the power of C++ force stark choices on a scientific software stack. There have been multiple developments to mitigate language boundaries by implementing language bindings, but the impedance mismatch between the static nature of C++ and the dynamic one of Python hinders their implementatio... |
1504.00854 | David Powers | David M. W. Powers | Evaluation Evaluation a Monte Carlo study | 5 pages, 14 Equations, 2 Figures, 1 Table, as submitted to European
Conference on Artificial Intelligence (shorter version published with 2
pages, 4 Equations, 0 Figures, 1 Table) | ECAI 2008, pp.843-844 | null | null | cs.AI cs.CL stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Over the last decade there has been increasing concern about the biases
embodied in traditional evaluation methods for Natural Language
Processing/Learning, particularly methods borrowed from Information Retrieval.
Without knowledge of the Bias and Prevalence of the contingency being tested,
or equivalently the expec... | [
{
"created": "Fri, 3 Apr 2015 14:46:29 GMT",
"version": "v1"
}
] | 2015-04-06 | [
[
"Powers",
"David M. W.",
""
]
] | Over the last decade there has been increasing concern about the biases embodied in traditional evaluation methods for Natural Language Processing/Learning, particularly methods borrowed from Information Retrieval. Without knowledge of the Bias and Prevalence of the contingency being tested, or equivalently the expecta... |
1405.7895 | Kemiha Mina melle | Mina Kemiha | Empirical mode decomposition and normalshrink tresholding for speech
denoising | 8 pages, 6 figures | IJIT Journal 3( 2), 2014, pp 27-35 | null | null | cs.IT cs.SY math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper a signal denoising scheme based on Empirical mode decomposition
(EMD) is presented. The denoising method is a fully data driven approach. Noisy
signal is decomposed adaptively into intrinsic oscillatory components called
Intrinsic mode functions (IMFs) using a decomposition algorithm called sifting
proc... | [
{
"created": "Thu, 8 May 2014 13:12:31 GMT",
"version": "v1"
}
] | 2014-06-02 | [
[
"Kemiha",
"Mina",
""
]
] | In this paper a signal denoising scheme based on Empirical mode decomposition (EMD) is presented. The denoising method is a fully data driven approach. Noisy signal is decomposed adaptively into intrinsic oscillatory components called Intrinsic mode functions (IMFs) using a decomposition algorithm called sifting proces... |
2002.03182 | Zafaryab Rasool | Zafaryab Rasool, Rui Zhou, Lu Chen, Chengfei Liu, Jiajie Xu | Index-based Solutions for Efficient Density Peak Clustering | null | null | null | null | cs.DB cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Density Peak Clustering (DPC), a popular density-based clustering approach,
has received considerable attention from the research community primarily due
to its simplicity and fewer-parameter requirement. However, the resultant
clusters obtained using DPC are influenced by the sensitive parameter $d_c$,
which depends... | [
{
"created": "Sat, 8 Feb 2020 15:22:37 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Jul 2020 02:08:44 GMT",
"version": "v2"
}
] | 2020-07-24 | [
[
"Rasool",
"Zafaryab",
""
],
[
"Zhou",
"Rui",
""
],
[
"Chen",
"Lu",
""
],
[
"Liu",
"Chengfei",
""
],
[
"Xu",
"Jiajie",
""
]
] | Density Peak Clustering (DPC), a popular density-based clustering approach, has received considerable attention from the research community primarily due to its simplicity and fewer-parameter requirement. However, the resultant clusters obtained using DPC are influenced by the sensitive parameter $d_c$, which depends o... |
1703.03315 | Stephane Devismes | St\'ephane Devismes, David Ilcinkas (LaBRI), Colette Johnen (LaBRI) | Self-Stabilizing Disconnected Components Detection and Rooted
Shortest-Path Tree Maintenance in Polynomial Steps | null | Discrete Mathematics and Theoretical Computer Science, DMTCS,
2017, ISS, pp.14 - 14 | null | null | cs.DC cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We deal with the problem of maintaining a shortest-path tree rooted at some
process r in a network that may be disconnected after topological changes. The
goal is then to maintain a shortest-path tree rooted at r in its connected
component, V\_r, and make all processes of other components detecting that r is
not part... | [
{
"created": "Thu, 9 Mar 2017 16:04:37 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Aug 2017 13:17:15 GMT",
"version": "v2"
},
{
"created": "Thu, 30 Nov 2017 13:31:28 GMT",
"version": "v3"
}
] | 2017-12-01 | [
[
"Devismes",
"Stéphane",
"",
"LaBRI"
],
[
"Ilcinkas",
"David",
"",
"LaBRI"
],
[
"Johnen",
"Colette",
"",
"LaBRI"
]
] | We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component, V\_r, and make all processes of other components detecting that r is not part o... |
0811.0419 | Xiaochuan Zhao | Xiaochuan Zhao (1), Tao Peng (1), Ming Yang (1) and Wenbo Wang (1)
((1) Beijing University of Posts and Telecommunications, Beijing, China) | Doppler Spread Estimation by Subspace Tracking for OFDM Systems | 5 pages, 3 figures, To appear in IEEE GLOBECOM'08 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes a novel maximum Doppler spread estimation algorithm for
OFDM systems with the comb-type pilot pattern. By tracking the drifting delay
subspace of the multipath channel, the time correlation function is measured at
a high accuracy, which accordingly improves the estimation accuracy of the
maximum D... | [
{
"created": "Tue, 4 Nov 2008 03:30:20 GMT",
"version": "v1"
}
] | 2008-11-05 | [
[
"Zhao",
"Xiaochuan",
"",
"Beijing University of Posts and Telecommunications, Beijing, China"
],
[
"Peng",
"Tao",
"",
"Beijing University of Posts and Telecommunications, Beijing, China"
],
[
"Yang",
"Ming",
"",
"Beijing University of Posts and Telecommunica... | This paper proposes a novel maximum Doppler spread estimation algorithm for OFDM systems with the comb-type pilot pattern. By tracking the drifting delay subspace of the multipath channel, the time correlation function is measured at a high accuracy, which accordingly improves the estimation accuracy of the maximum Dop... |
1003.5510 | Green Daily | Claude Castelluccia and Emiliano De Cristofaro and Aurelien Francillon
and Mohamed-Ali Kaafar | EphPub: Toward Robust Ephemeral Publishing | Proceedings of IEEE ICNP 2011 | null | null | null | cs.CR cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The increasing amount of personal and sensitive information disseminated over
the Internet prompts commensurately growing privacy concerns. Digital data
often lingers indefinitely and users lose its control. This motivates the
desire to restrict content availability to an expiration time set by the data
owner. This p... | [
{
"created": "Mon, 29 Mar 2010 12:00:08 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Oct 2010 12:21:14 GMT",
"version": "v2"
},
{
"created": "Tue, 18 Oct 2011 16:44:24 GMT",
"version": "v3"
}
] | 2015-03-13 | [
[
"Castelluccia",
"Claude",
""
],
[
"De Cristofaro",
"Emiliano",
""
],
[
"Francillon",
"Aurelien",
""
],
[
"Kaafar",
"Mohamed-Ali",
""
]
] | The increasing amount of personal and sensitive information disseminated over the Internet prompts commensurately growing privacy concerns. Digital data often lingers indefinitely and users lose its control. This motivates the desire to restrict content availability to an expiration time set by the data owner. This pap... |
2012.13523 | Xiaoming Chen | Xiaodan Shao, Xiaoming Chen, Yiyang Qiang, Caijun Zhong, Zhaoyang
Zhang | Feature-Aided Adaptive-Tuning Deep Learning for Massive Device Detection | To appear in IEEE Journal on Selected Areas in Communications
"Machine Learning in Communications and Networks" | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | With the increasing development of Internet of Things (IoT), the upcoming
sixth-generation (6G) wireless network is required to support grant-free random
access of a massive number of sporadic traffic devices. In particular, at the
beginning of each time slot, the base station (BS) performs joint activity
detection a... | [
{
"created": "Fri, 25 Dec 2020 06:15:12 GMT",
"version": "v1"
}
] | 2020-12-29 | [
[
"Shao",
"Xiaodan",
""
],
[
"Chen",
"Xiaoming",
""
],
[
"Qiang",
"Yiyang",
""
],
[
"Zhong",
"Caijun",
""
],
[
"Zhang",
"Zhaoyang",
""
]
] | With the increasing development of Internet of Things (IoT), the upcoming sixth-generation (6G) wireless network is required to support grant-free random access of a massive number of sporadic traffic devices. In particular, at the beginning of each time slot, the base station (BS) performs joint activity detection and... |
1906.04914 | Suraj Tripathi | Abhay Kumar, Nishant Jain, Suraj Tripathi, Chirag Singh | From Fully Supervised to Zero Shot Settings for Twitter Hashtag
Recommendation | Accepted in CICLing 2019 | null | null | null | cs.IR cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a comprehensive end-to-end pipeline for Twitter hashtags
recommendation system including data collection, supervised training setting
and zero shot training setting. In the supervised training setting, we have
proposed and compared the performance of various deep learning architectures,
namely Convolutiona... | [
{
"created": "Tue, 11 Jun 2019 17:38:28 GMT",
"version": "v1"
}
] | 2019-06-13 | [
[
"Kumar",
"Abhay",
""
],
[
"Jain",
"Nishant",
""
],
[
"Tripathi",
"Suraj",
""
],
[
"Singh",
"Chirag",
""
]
] | We propose a comprehensive end-to-end pipeline for Twitter hashtags recommendation system including data collection, supervised training setting and zero shot training setting. In the supervised training setting, we have proposed and compared the performance of various deep learning architectures, namely Convolutional ... |
1207.1550 | Yuanxin Wu | Yuanxin Wu and Xianfei Pan | Velocity/Position Integration Formula (I): Application to In-flight
Coarse Alignment | IEEE Trans. on Aerospace and Electronic Systems, in press | IEEE Transactions on Aerospace and Electronic Systems, vol. 49,
no. 2, pp. 1006-1023, 2013 | 10.1109/TAES.2013.6494395 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The in-flight alignment is a critical stage for airborne INS/GPS
applications. The alignment task is usually carried out by the Kalman filtering
technique that necessitates a good initial attitude to obtain satisfying
performance. Due to the airborne dynamics, the in-flight alignment is much
difficult than alignment ... | [
{
"created": "Fri, 6 Jul 2012 08:04:25 GMT",
"version": "v1"
}
] | 2013-04-10 | [
[
"Wu",
"Yuanxin",
""
],
[
"Pan",
"Xianfei",
""
]
] | The in-flight alignment is a critical stage for airborne INS/GPS applications. The alignment task is usually carried out by the Kalman filtering technique that necessitates a good initial attitude to obtain satisfying performance. Due to the airborne dynamics, the in-flight alignment is much difficult than alignment on... |
1707.03217 | Gregor Wiedemann | Gregor Wiedemann, Andreas Niekler | Document Retrieval for Large Scale Content Analysis using Contextualized
Dictionaries | https://hal.archives-ouvertes.fr/hal-01005879; Proceedings of
Terminology and Knowledge Engineering 2014 (TKE'14), Berlin | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a procedure to retrieve subsets of relevant documents
from large text collections for Content Analysis, e.g. in social sciences.
Document retrieval for this purpose needs to take account of the fact that
analysts often cannot describe their research objective with a small set of key
terms, especia... | [
{
"created": "Tue, 11 Jul 2017 11:00:44 GMT",
"version": "v1"
}
] | 2017-07-12 | [
[
"Wiedemann",
"Gregor",
""
],
[
"Niekler",
"Andreas",
""
]
] | This paper presents a procedure to retrieve subsets of relevant documents from large text collections for Content Analysis, e.g. in social sciences. Document retrieval for this purpose needs to take account of the fact that analysts often cannot describe their research objective with a small set of key terms, especiall... |
2102.05749 | Ond\v{r}ej C\'ifka | Ond\v{r}ej C\'ifka, Alexey Ozerov, Umut \c{S}im\c{s}ekli, Ga\"el
Richard | Self-Supervised VQ-VAE for One-Shot Music Style Transfer | ICASSP 2021. Website: https://adasp.telecom-paris.fr/s/ss-vq-vae | ICASSP 2021 - 2021 IEEE International Conference on Acoustics,
Speech and Signal Processing (2021) 96-100 | 10.1109/ICASSP39728.2021.9414235 | null | cs.SD cs.LG eess.AS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural style transfer, allowing to apply the artistic style of one image to
another, has become one of the most widely showcased computer vision
applications shortly after its introduction. In contrast, related tasks in the
music audio domain remained, until recently, largely untackled. While several
style conversion... | [
{
"created": "Wed, 10 Feb 2021 21:42:49 GMT",
"version": "v1"
},
{
"created": "Thu, 10 Jun 2021 15:15:22 GMT",
"version": "v2"
}
] | 2021-06-11 | [
[
"Cífka",
"Ondřej",
""
],
[
"Ozerov",
"Alexey",
""
],
[
"Şimşekli",
"Umut",
""
],
[
"Richard",
"Gaël",
""
]
] | Neural style transfer, allowing to apply the artistic style of one image to another, has become one of the most widely showcased computer vision applications shortly after its introduction. In contrast, related tasks in the music audio domain remained, until recently, largely untackled. While several style conversion m... |
2402.05764 | Basile Simon | Matt Shearer, Basile Simon, Cl\'ement Geiger | Datastringer: easy dataset monitoring for journalists | null | null | null | null | cs.CY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We created a software enabling journalists to define a set of criteria they
would like to see applied regularly to a constantly-updated dataset, sending
them an alert when these criteria are met, thus signaling them that there may
be a story to write. The main challenges were to keep the product scalable and
powerful... | [
{
"created": "Thu, 8 Feb 2024 15:49:58 GMT",
"version": "v1"
}
] | 2024-02-09 | [
[
"Shearer",
"Matt",
""
],
[
"Simon",
"Basile",
""
],
[
"Geiger",
"Clément",
""
]
] | We created a software enabling journalists to define a set of criteria they would like to see applied regularly to a constantly-updated dataset, sending them an alert when these criteria are met, thus signaling them that there may be a story to write. The main challenges were to keep the product scalable and powerful, ... |
1504.02264 | Wim Vanderbauwhede | Wim Vanderbauwhede | Model Coupling between the Weather Research and Forecasting Model and
the DPRI Large Eddy Simulator for Urban Flows on GPU-accelerated Multicore
Systems | This work was conducted during a research visit at the Disaster
Prevention Research Institute of Kyoto University, supported by an EPSRC
Overseas Travel Grant, EP/L026201/1 | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this report we present a novel approach to model coupling for
shared-memory multicore systems hosting OpenCL-compliant accelerators, which we
call The Glasgow Model Coupling Framework (GMCF). We discuss the implementation
of a prototype of GMCF and its application to coupling the Weather Research and
Forecasting M... | [
{
"created": "Thu, 9 Apr 2015 11:22:46 GMT",
"version": "v1"
}
] | 2015-04-10 | [
[
"Vanderbauwhede",
"Wim",
""
]
] | In this report we present a novel approach to model coupling for shared-memory multicore systems hosting OpenCL-compliant accelerators, which we call The Glasgow Model Coupling Framework (GMCF). We discuss the implementation of a prototype of GMCF and its application to coupling the Weather Research and Forecasting Mod... |
1408.6290 | Ichiroh Kanaya Dr. | Ichiroh Kanaya, Mayuko Kanazawa, Masataka Imura | Function + Action = Interaction | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by-nc-sa/3.0/ | This article presents the mathematical background of general interactive
systems. The first principle of designing a large system is to _divide and
conquer_, which implies that we could possibly reduce human error if we divided
a large system in smaller subsystems. Interactive systems are, however, often
composed of ... | [
{
"created": "Wed, 27 Aug 2014 01:23:44 GMT",
"version": "v1"
}
] | 2014-08-28 | [
[
"Kanaya",
"Ichiroh",
""
],
[
"Kanazawa",
"Mayuko",
""
],
[
"Imura",
"Masataka",
""
]
] | This article presents the mathematical background of general interactive systems. The first principle of designing a large system is to _divide and conquer_, which implies that we could possibly reduce human error if we divided a large system in smaller subsystems. Interactive systems are, however, often composed of ma... |
2403.01852 | Zhengyao Lv | Zhengyao Lv and Yuxiang Wei and Wangmeng Zuo and Kwan-Yee K. Wong | PLACE: Adaptive Layout-Semantic Fusion for Semantic Image Synthesis | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advancements in large-scale pre-trained text-to-image models have led
to remarkable progress in semantic image synthesis. Nevertheless, synthesizing
high-quality images with consistent semantics and layout remains a challenge.
In this paper, we propose the adaPtive LAyout-semantiC fusion modulE (PLACE)
that ha... | [
{
"created": "Mon, 4 Mar 2024 09:03:16 GMT",
"version": "v1"
}
] | 2024-03-05 | [
[
"Lv",
"Zhengyao",
""
],
[
"Wei",
"Yuxiang",
""
],
[
"Zuo",
"Wangmeng",
""
],
[
"Wong",
"Kwan-Yee K.",
""
]
] | Recent advancements in large-scale pre-trained text-to-image models have led to remarkable progress in semantic image synthesis. Nevertheless, synthesizing high-quality images with consistent semantics and layout remains a challenge. In this paper, we propose the adaPtive LAyout-semantiC fusion modulE (PLACE) that harn... |
1608.04999 | James Cheney | Weili Fu, Roly Perera, Paul Anderson, and James Cheney | $\mu$Puppet: A Declarative Subset of the Puppet Configuration Language | Full version of ECOOP 2017 conference paper | null | 10.4230/LIPIcs.ECOOP.2017.12 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Puppet is a popular declarative framework for specifying and managing complex
system configurations. The Puppet framework includes a domain-specific language
with several advanced features inspired by object-oriented programming,
including user-defined resource types, 'classes' with a form of inheritance,
and depende... | [
{
"created": "Wed, 17 Aug 2016 15:26:48 GMT",
"version": "v1"
},
{
"created": "Sun, 21 Aug 2016 20:17:32 GMT",
"version": "v2"
},
{
"created": "Thu, 26 Jan 2017 18:06:06 GMT",
"version": "v3"
},
{
"created": "Fri, 26 May 2017 10:13:55 GMT",
"version": "v4"
}
] | 2017-09-12 | [
[
"Fu",
"Weili",
""
],
[
"Perera",
"Roly",
""
],
[
"Anderson",
"Paul",
""
],
[
"Cheney",
"James",
""
]
] | Puppet is a popular declarative framework for specifying and managing complex system configurations. The Puppet framework includes a domain-specific language with several advanced features inspired by object-oriented programming, including user-defined resource types, 'classes' with a form of inheritance, and dependenc... |
cs/0406047 | Alexei Stadnik | G.A. Ososkov, S.G. Dmitrievskiy, A.V. Stadnik | Self-organizing neural networks in classification and image recognition | null | null | null | null | cs.CV cs.AI | null | Self-organizing neural networks are used for brick finding in OPERA
experiment. Self-organizing neural networks and wavelet analysis used for
recognition and extraction of car numbers from images.
| [
{
"created": "Thu, 24 Jun 2004 13:14:58 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Ososkov",
"G. A.",
""
],
[
"Dmitrievskiy",
"S. G.",
""
],
[
"Stadnik",
"A. V.",
""
]
] | Self-organizing neural networks are used for brick finding in OPERA experiment. Self-organizing neural networks and wavelet analysis used for recognition and extraction of car numbers from images. |
1310.0068 | Rosemary Renaut | Saeed Vatankhah, Vahid E Ardestani and Rosemary A Renaut | Automatic estimation of the regularization parameter in 2-D focusing
gravity inversion: an application to the Safo manganese mine in northwest of
Iran | null | J. Geophys. Eng. 11 (2014) 045001 | 10.1088/1742-2132/11/4/045001 | https://academic.oup.com/jge/article/11/4/045001/5113347 | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the use of Tikhonov regularization with the minimum support
stabilizer for underdetermined 2-D inversion of gravity data. This stabilizer
produces models with non-smooth properties which is useful for identifying
geologic structures with sharp boundaries. A very important aspect of using
Tikhonov regul... | [
{
"created": "Mon, 30 Sep 2013 21:43:25 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Jan 2014 00:49:06 GMT",
"version": "v2"
}
] | 2022-08-16 | [
[
"Vatankhah",
"Saeed",
""
],
[
"Ardestani",
"Vahid E",
""
],
[
"Renaut",
"Rosemary A",
""
]
] | We investigate the use of Tikhonov regularization with the minimum support stabilizer for underdetermined 2-D inversion of gravity data. This stabilizer produces models with non-smooth properties which is useful for identifying geologic structures with sharp boundaries. A very important aspect of using Tikhonov regular... |
2404.04270 | Yassaman Ebrahimzadeh Maboud | Yassaman Ebrahimzadeh Maboud, Muhammad Adnan, Divya Mahajan, Prashant
J. Nair | Accelerating Recommender Model Training by Dynamically Skipping Stale
Embeddings | null | null | null | null | cs.IR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Training recommendation models pose significant challenges regarding resource
utilization and performance. Prior research has proposed an approach that
categorizes embeddings into popular and non-popular classes to reduce the
training time for recommendation models. We observe that, even among the
popular embeddings,... | [
{
"created": "Fri, 22 Mar 2024 00:29:06 GMT",
"version": "v1"
}
] | 2024-04-09 | [
[
"Maboud",
"Yassaman Ebrahimzadeh",
""
],
[
"Adnan",
"Muhammad",
""
],
[
"Mahajan",
"Divya",
""
],
[
"Nair",
"Prashant J.",
""
]
] | Training recommendation models pose significant challenges regarding resource utilization and performance. Prior research has proposed an approach that categorizes embeddings into popular and non-popular classes to reduce the training time for recommendation models. We observe that, even among the popular embeddings, c... |
2312.12253 | Demircan Tas | Demircan Tas, Rohit Priyadarshi Sanatani | Geo-located Aspect Based Sentiment Analysis (ABSA) for Crowdsourced
Evaluation of Urban Environments | Created for 6.8610, Quantitative Methods for Natural Language
Processing at MIT Fall 2022. 5 pages, 4 figures | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Sentiment analysis methods are rapidly being adopted by the field of Urban
Design and Planning, for the crowdsourced evaluation of urban environments.
However, most models used within this domain are able to identify positive or
negative sentiment associated with a textual appraisal as a whole, without
inferring info... | [
{
"created": "Tue, 19 Dec 2023 15:37:27 GMT",
"version": "v1"
}
] | 2023-12-20 | [
[
"Tas",
"Demircan",
""
],
[
"Sanatani",
"Rohit Priyadarshi",
""
]
] | Sentiment analysis methods are rapidly being adopted by the field of Urban Design and Planning, for the crowdsourced evaluation of urban environments. However, most models used within this domain are able to identify positive or negative sentiment associated with a textual appraisal as a whole, without inferring inform... |
2202.07178 | Yuanxiong Guo | Rui Hu, Yanmin Gong and Yuanxiong Guo | Federated Learning with Sparsified Model Perturbation: Improving
Accuracy under Client-Level Differential Privacy | null | null | null | null | cs.LG cs.CR | http://creativecommons.org/licenses/by/4.0/ | Federated learning (FL) that enables edge devices to collaboratively learn a
shared model while keeping their training data locally has received great
attention recently and can protect privacy in comparison with the traditional
centralized learning paradigm. However, sensitive information about the
training data can... | [
{
"created": "Tue, 15 Feb 2022 04:05:42 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Nov 2022 20:15:26 GMT",
"version": "v2"
}
] | 2022-11-17 | [
[
"Hu",
"Rui",
""
],
[
"Gong",
"Yanmin",
""
],
[
"Guo",
"Yuanxiong",
""
]
] | Federated learning (FL) that enables edge devices to collaboratively learn a shared model while keeping their training data locally has received great attention recently and can protect privacy in comparison with the traditional centralized learning paradigm. However, sensitive information about the training data can s... |
2407.20731 | Yi Ju | Yi Ju, Mingshuai Li, Adalberto Perez, Laura Bellentani, Niclas
Jansson, Stefano Markidis, Philipp Schlatter, Erwin Laure | In-Situ Techniques on GPU-Accelerated Data-Intensive Applications | null | null | 10.1109/e-science58273.2023.10254865 | null | cs.PF cs.CE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The computational power of High-Performance Computing (HPC) systems is
constantly increasing, however, their input/output (IO) performance grows
relatively slowly, and their storage capacity is also limited. This unbalance
presents significant challenges for applications such as Molecular Dynamics
(MD) and Computatio... | [
{
"created": "Tue, 30 Jul 2024 11:03:00 GMT",
"version": "v1"
}
] | 2024-07-31 | [
[
"Ju",
"Yi",
""
],
[
"Li",
"Mingshuai",
""
],
[
"Perez",
"Adalberto",
""
],
[
"Bellentani",
"Laura",
""
],
[
"Jansson",
"Niclas",
""
],
[
"Markidis",
"Stefano",
""
],
[
"Schlatter",
"Philipp",
""
],
[
... | The computational power of High-Performance Computing (HPC) systems is constantly increasing, however, their input/output (IO) performance grows relatively slowly, and their storage capacity is also limited. This unbalance presents significant challenges for applications such as Molecular Dynamics (MD) and Computationa... |
2006.09264 | Rob Geada | Rob Geada, Dennis Prangle, Andrew Stephen McGough | Bonsai-Net: One-Shot Neural Architecture Search via Differentiable
Pruners | Accepted to CVPR-NAS 2020.
https://github.com/RobGeada/bonsai-net-lite | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One-shot Neural Architecture Search (NAS) aims to minimize the computational
expense of discovering state-of-the-art models. However, in the past year
attention has been drawn to the comparable performance of naive random search
across the same search spaces used by leading NAS algorithms. To address this,
we explore... | [
{
"created": "Fri, 12 Jun 2020 14:44:00 GMT",
"version": "v1"
},
{
"created": "Sun, 9 May 2021 18:03:44 GMT",
"version": "v2"
},
{
"created": "Fri, 4 Jun 2021 15:40:29 GMT",
"version": "v3"
}
] | 2021-06-07 | [
[
"Geada",
"Rob",
""
],
[
"Prangle",
"Dennis",
""
],
[
"McGough",
"Andrew Stephen",
""
]
] | One-shot Neural Architecture Search (NAS) aims to minimize the computational expense of discovering state-of-the-art models. However, in the past year attention has been drawn to the comparable performance of naive random search across the same search spaces used by leading NAS algorithms. To address this, we explore t... |
1908.10159 | Philip Bille | Philip Bille and Inge Li G{\o}rtz and Frederik Rye Skjoldjensen | Partial Sums on the Ultra-Wide Word RAM | Extended abstract appeared at TAMC 2020 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the classic partial sums problem on the ultra-wide word RAM model
of computation. This model extends the classic $w$-bit word RAM model with
special ultrawords of length $w^2$ bits that support standard arithmetic and
boolean operation and scattered memory access operations that can access $w$
(non-contig... | [
{
"created": "Tue, 27 Aug 2019 12:33:32 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Sep 2020 12:09:37 GMT",
"version": "v2"
}
] | 2020-10-01 | [
[
"Bille",
"Philip",
""
],
[
"Gørtz",
"Inge Li",
""
],
[
"Skjoldjensen",
"Frederik Rye",
""
]
] | We consider the classic partial sums problem on the ultra-wide word RAM model of computation. This model extends the classic $w$-bit word RAM model with special ultrawords of length $w^2$ bits that support standard arithmetic and boolean operation and scattered memory access operations that can access $w$ (non-contiguo... |
2406.14882 | Issey Sukeda | Issey Sukeda, Risa Kishikawa, Satoshi Kodera | 70B-parameter large language models in Japanese medical
question-answering | 7 pages, 2 figures, 4 Tables | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Since the rise of large language models (LLMs), the domain adaptation has
been one of the hot topics in various domains. Many medical LLMs trained with
English medical dataset have made public recently. However, Japanese LLMs in
medical domain still lack its research. Here we utilize multiple 70B-parameter
LLMs for t... | [
{
"created": "Fri, 21 Jun 2024 06:04:10 GMT",
"version": "v1"
}
] | 2024-06-24 | [
[
"Sukeda",
"Issey",
""
],
[
"Kishikawa",
"Risa",
""
],
[
"Kodera",
"Satoshi",
""
]
] | Since the rise of large language models (LLMs), the domain adaptation has been one of the hot topics in various domains. Many medical LLMs trained with English medical dataset have made public recently. However, Japanese LLMs in medical domain still lack its research. Here we utilize multiple 70B-parameter LLMs for the... |
2210.11111 | Henrique Donancio | Henrique Don\^ancio and Laurent Vercouter and Harald Roclawski | The Pump Scheduling Problem: A Real-World Scenario for Reinforcement
Learning | null | null | null | null | cs.LG cs.AI cs.SY eess.SY | http://creativecommons.org/licenses/by-sa/4.0/ | Deep Reinforcement Learning (DRL) has achieved remarkable success in
scenarios such as games and has emerged as a potential solution for control
tasks. That is due to its ability to leverage scalability and handle complex
dynamics. However, few works have targeted environments grounded in real-world
settings. Indeed,... | [
{
"created": "Thu, 20 Oct 2022 09:16:03 GMT",
"version": "v1"
}
] | 2022-10-21 | [
[
"Donâncio",
"Henrique",
""
],
[
"Vercouter",
"Laurent",
""
],
[
"Roclawski",
"Harald",
""
]
] | Deep Reinforcement Learning (DRL) has achieved remarkable success in scenarios such as games and has emerged as a potential solution for control tasks. That is due to its ability to leverage scalability and handle complex dynamics. However, few works have targeted environments grounded in real-world settings. Indeed, r... |
1804.02608 | Tauhid Zaman | Fanyu Que, Krishnan Rajagopalan, Tauhid Zaman | Penetrating a Social Network: The Follow-back Problem | 38 pages, 14 figures | null | null | null | cs.SI physics.soc-ph stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern threats have emerged from the prevalence of social networks. Hostile
actors, such as extremist groups or foreign governments, utilize these networks
to run propaganda campaigns with different aims. For extremists, these
campaigns are designed for recruiting new members or inciting violence. For
foreign governm... | [
{
"created": "Sun, 8 Apr 2018 00:58:51 GMT",
"version": "v1"
}
] | 2018-04-10 | [
[
"Que",
"Fanyu",
""
],
[
"Rajagopalan",
"Krishnan",
""
],
[
"Zaman",
"Tauhid",
""
]
] | Modern threats have emerged from the prevalence of social networks. Hostile actors, such as extremist groups or foreign governments, utilize these networks to run propaganda campaigns with different aims. For extremists, these campaigns are designed for recruiting new members or inciting violence. For foreign governmen... |
1403.5022 | Jason Williams | Jason L. Williams | An efficient, variational approximation of the best fitting
multi-Bernoulli filter | Accepted, IEEE Transactions on Signal Processing,
http://dx.doi.org/10.1109/TSP.2014.2370946 | IEEE Transactions on Signal Processing, vol 63, no 1, pp 258-273,
January 2015 | 10.1109/TSP.2014.2370946 | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The joint probabilistic data association (JPDA) filter is a popular tracking
methodology for problems involving well-spaced targets, but it is rarely
applied in problems with closely-spaced targets due to its complexity in these
cases, and due to the well-known phenomenon of coalescence. This paper
addresses these di... | [
{
"created": "Thu, 20 Mar 2014 01:57:53 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Nov 2014 00:42:44 GMT",
"version": "v2"
}
] | 2014-12-16 | [
[
"Williams",
"Jason L.",
""
]
] | The joint probabilistic data association (JPDA) filter is a popular tracking methodology for problems involving well-spaced targets, but it is rarely applied in problems with closely-spaced targets due to its complexity in these cases, and due to the well-known phenomenon of coalescence. This paper addresses these diff... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.