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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2203.11191 | Matthieu Paul | Matthieu Paul, Martin Danelljan, Christoph Mayer, and Luc Van Gool | Robust Visual Tracking by Segmentation | Accepted at ECCV 2022. Code and trained models are available at:
https://github.com/visionml/pytracking | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Estimating the target extent poses a fundamental challenge in visual object
tracking. Typically, trackers are box-centric and fully rely on a bounding box
to define the target in the scene. In practice, objects often have complex
shapes and are not aligned with the image axis. In these cases, bounding boxes
do not pr... | [
{
"created": "Mon, 21 Mar 2022 17:59:19 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Jul 2022 15:59:52 GMT",
"version": "v2"
}
] | 2022-07-21 | [
[
"Paul",
"Matthieu",
""
],
[
"Danelljan",
"Martin",
""
],
[
"Mayer",
"Christoph",
""
],
[
"Van Gool",
"Luc",
""
]
] | Estimating the target extent poses a fundamental challenge in visual object tracking. Typically, trackers are box-centric and fully rely on a bounding box to define the target in the scene. In practice, objects often have complex shapes and are not aligned with the image axis. In these cases, bounding boxes do not prov... |
1511.03415 | Bernd Flemisch | Oliver Sander, Timo Koch, Natalie Schr\"oder, Bernd Flemisch | The Dune FoamGrid implementation for surface and network grids | null | Archive of Numerical Software Vol 5 No 1 2017 | 10.11588/ans.2017.1.28490 | null | cs.MS cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present FoamGrid, a new implementation of the DUNE grid interface.
FoamGrid implements one- and two-dimensional grids in a physical space of
arbitrary dimension, which allows for grids for curved domains. Even more, the
grids are not expected to have a manifold structure, i.e., more than two
elements can share a c... | [
{
"created": "Wed, 11 Nov 2015 08:23:46 GMT",
"version": "v1"
}
] | 2020-05-01 | [
[
"Sander",
"Oliver",
""
],
[
"Koch",
"Timo",
""
],
[
"Schröder",
"Natalie",
""
],
[
"Flemisch",
"Bernd",
""
]
] | We present FoamGrid, a new implementation of the DUNE grid interface. FoamGrid implements one- and two-dimensional grids in a physical space of arbitrary dimension, which allows for grids for curved domains. Even more, the grids are not expected to have a manifold structure, i.e., more than two elements can share a com... |
2404.09765 | Ashish Devadas Nair | Ashish Devadas Nair, Julien Kindle, Plamen Levchev, Davide Scaramuzza | Hilti SLAM Challenge 2023: Benchmarking Single + Multi-session SLAM
across Sensor Constellations in Construction | null | null | 10.1109/LRA.2024.3421791 | null | cs.RO eess.IV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Simultaneous Localization and Mapping systems are a key enabler for
positioning in both handheld and robotic applications. The Hilti SLAM
Challenges organized over the past years have been successful at benchmarking
some of the world's best SLAM Systems with high accuracy. However, more
capabilities of these systems ... | [
{
"created": "Mon, 15 Apr 2024 13:07:40 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Jul 2024 15:09:22 GMT",
"version": "v2"
}
] | 2024-07-31 | [
[
"Nair",
"Ashish Devadas",
""
],
[
"Kindle",
"Julien",
""
],
[
"Levchev",
"Plamen",
""
],
[
"Scaramuzza",
"Davide",
""
]
] | Simultaneous Localization and Mapping systems are a key enabler for positioning in both handheld and robotic applications. The Hilti SLAM Challenges organized over the past years have been successful at benchmarking some of the world's best SLAM Systems with high accuracy. However, more capabilities of these systems ar... |
cs/0510075 | Mustafa Cenk Gursoy | Mustafa Cenk Gursoy, Sergio Verdu, H. Vincent Poor | On-Off Frequency-Shift-Keying for Wideband Fading Channels | To appear in the EURASIP Journal on Wireless Communications and
Networking | null | null | null | cs.IT math.IT | null | M-ary On-Off Frequency-Shift-Keying (OOFSK) is a digital modulation format in
which M-ary FSK signaling is overlaid on On/Off keying. This paper investigates
the potential of this modulation format in the context of wideband fading
channels. First it is assumed that the receiver uses energy detection for the
receptio... | [
{
"created": "Mon, 24 Oct 2005 19:50:59 GMT",
"version": "v1"
}
] | 2007-07-13 | [
[
"Gursoy",
"Mustafa Cenk",
""
],
[
"Verdu",
"Sergio",
""
],
[
"Poor",
"H. Vincent",
""
]
] | M-ary On-Off Frequency-Shift-Keying (OOFSK) is a digital modulation format in which M-ary FSK signaling is overlaid on On/Off keying. This paper investigates the potential of this modulation format in the context of wideband fading channels. First it is assumed that the receiver uses energy detection for the reception ... |
2007.15109 | Pasquale Antonante | Pasquale Antonante, Vasileios Tzoumas, Heng Yang, Luca Carlone | Outlier-Robust Estimation: Hardness, Minimally Tuned Algorithms, and
Applications | null | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nonlinear estimation in robotics and vision is typically plagued with
outliers due to wrong data association, or to incorrect detections from signal
processing and machine learning methods. This paper introduces two unifying
formulations for outlier-robust estimation, Generalized Maximum Consensus
(G-MC) and Generali... | [
{
"created": "Wed, 29 Jul 2020 21:06:13 GMT",
"version": "v1"
},
{
"created": "Fri, 29 Jan 2021 20:57:54 GMT",
"version": "v2"
},
{
"created": "Fri, 2 Jul 2021 16:19:31 GMT",
"version": "v3"
}
] | 2021-07-05 | [
[
"Antonante",
"Pasquale",
""
],
[
"Tzoumas",
"Vasileios",
""
],
[
"Yang",
"Heng",
""
],
[
"Carlone",
"Luca",
""
]
] | Nonlinear estimation in robotics and vision is typically plagued with outliers due to wrong data association, or to incorrect detections from signal processing and machine learning methods. This paper introduces two unifying formulations for outlier-robust estimation, Generalized Maximum Consensus (G-MC) and Generalize... |
2308.02562 | Prateek Mittal | Prateek Mittal, Puneet Goyal, Joohi Chauhan | Food Classification using Joint Representation of Visual and Textual
Data | Updated results and discussions to be posted and some sections needed
to be expanded | null | null | null | cs.CV cs.AI cs.CY cs.LG | http://creativecommons.org/licenses/by/4.0/ | Food classification is an important task in health care. In this work, we
propose a multimodal classification framework that uses the modified version of
EfficientNet with the Mish activation function for image classification, and
the traditional BERT transformer-based network is used for text classification.
The pro... | [
{
"created": "Thu, 3 Aug 2023 04:03:46 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Aug 2023 11:47:05 GMT",
"version": "v2"
}
] | 2023-08-31 | [
[
"Mittal",
"Prateek",
""
],
[
"Goyal",
"Puneet",
""
],
[
"Chauhan",
"Joohi",
""
]
] | Food classification is an important task in health care. In this work, we propose a multimodal classification framework that uses the modified version of EfficientNet with the Mish activation function for image classification, and the traditional BERT transformer-based network is used for text classification. The propo... |
2302.01094 | Deng Weijian | Weijian Deng, Yumin Suh, Stephen Gould, Liang Zheng | Confidence and Dispersity Speak: Characterising Prediction Matrix for
Unsupervised Accuracy Estimation | This version is not fully edited and will be updated soon | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work aims to assess how well a model performs under distribution shifts
without using labels. While recent methods study prediction confidence, this
work reports prediction dispersity is another informative cue. Confidence
reflects whether the individual prediction is certain; dispersity indicates how
the overal... | [
{
"created": "Thu, 2 Feb 2023 13:30:48 GMT",
"version": "v1"
}
] | 2023-02-03 | [
[
"Deng",
"Weijian",
""
],
[
"Suh",
"Yumin",
""
],
[
"Gould",
"Stephen",
""
],
[
"Zheng",
"Liang",
""
]
] | This work aims to assess how well a model performs under distribution shifts without using labels. While recent methods study prediction confidence, this work reports prediction dispersity is another informative cue. Confidence reflects whether the individual prediction is certain; dispersity indicates how the overall ... |
2210.03372 | Yuanhao Ban | Yuanhao Ban, Yinpeng Dong | Pre-trained Adversarial Perturbations | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Self-supervised pre-training has drawn increasing attention in recent years
due to its superior performance on numerous downstream tasks after fine-tuning.
However, it is well-known that deep learning models lack the robustness to
adversarial examples, which can also invoke security issues to pre-trained
models, desp... | [
{
"created": "Fri, 7 Oct 2022 07:28:03 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Oct 2022 12:37:24 GMT",
"version": "v2"
}
] | 2022-10-17 | [
[
"Ban",
"Yuanhao",
""
],
[
"Dong",
"Yinpeng",
""
]
] | Self-supervised pre-training has drawn increasing attention in recent years due to its superior performance on numerous downstream tasks after fine-tuning. However, it is well-known that deep learning models lack the robustness to adversarial examples, which can also invoke security issues to pre-trained models, despit... |
2105.04593 | Lening Li | Lening Li and Jie Fu | Policy Synthesis for Metric Interval Temporal Logic with Probabilistic
Distributions | 7 pages, 2 figures, submitted to The 60th IEEE conference on Decision
and Control | null | null | null | cs.FL | http://creativecommons.org/licenses/by/4.0/ | Metric Temporal Logic can express temporally evolving properties with
time-critical constraints or time-triggered constraints for real-time systems.
This paper extends the Metric Interval Temporal Logic with a distribution
eventuality operator to express time-sensitive missions for a system
interacting with a dynamic... | [
{
"created": "Mon, 10 May 2021 18:17:12 GMT",
"version": "v1"
}
] | 2021-05-12 | [
[
"Li",
"Lening",
""
],
[
"Fu",
"Jie",
""
]
] | Metric Temporal Logic can express temporally evolving properties with time-critical constraints or time-triggered constraints for real-time systems. This paper extends the Metric Interval Temporal Logic with a distribution eventuality operator to express time-sensitive missions for a system interacting with a dynamic, ... |
1207.1701 | Sugata Sanyal | Preetida Vinayakray-Jani, Sugata Sanyal | Security Architecture for Cluster based Ad Hoc Networks | 5 pages, 6 figures | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile Ad hoc Networks (MANETs) are subject to various kinds of attacks.
Deploying security mechanisms is difficult due to inherent properties of ad hoc
networks, such as the high dynamics of their topology, restricted bandwidth,
and limited resources in end device. With such dynamicity in connectivity and
limited re... | [
{
"created": "Fri, 6 Jul 2012 18:25:32 GMT",
"version": "v1"
}
] | 2012-07-09 | [
[
"Vinayakray-Jani",
"Preetida",
""
],
[
"Sanyal",
"Sugata",
""
]
] | Mobile Ad hoc Networks (MANETs) are subject to various kinds of attacks. Deploying security mechanisms is difficult due to inherent properties of ad hoc networks, such as the high dynamics of their topology, restricted bandwidth, and limited resources in end device. With such dynamicity in connectivity and limited reso... |
1405.7601 | Nicola Cufaro Petroni | Nicola Cufaro Petroni | Entropy and its discontents: A note on definitions | 18 pages, 7 figures; minor modifications required by referees; 1
reference and Acknowledgements added | Entropy (2014), 16, 4044-4059 | 10.3390/e16074044 | null | cs.IT math.IT physics.comp-ph physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The routine definitions of both entropy, and differential entropy show
inconsistencies that make them not reciprocally coherent. We propose a few
possible modifications of these quantities so that 1) they no longer show
incongruities, 2) they go one into the other in a suitable limit as the result
of a renormalizatio... | [
{
"created": "Thu, 29 May 2014 16:14:26 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Aug 2014 10:13:27 GMT",
"version": "v2"
}
] | 2014-08-08 | [
[
"Petroni",
"Nicola Cufaro",
""
]
] | The routine definitions of both entropy, and differential entropy show inconsistencies that make them not reciprocally coherent. We propose a few possible modifications of these quantities so that 1) they no longer show incongruities, 2) they go one into the other in a suitable limit as the result of a renormalization.... |
2209.01232 | Wenya Wang | Wenya Wang, Vivek Srikumar, Hanna Hajishirzi, Noah A. Smith | Elaboration-Generating Commonsense Question Answering at Scale | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In question answering requiring common sense, language models (e.g., GPT-3)
have been used to generate text expressing background knowledge that helps
improve performance. Yet the cost of working with such models is very high; in
this work, we finetune smaller language models to generate useful intermediate
context, ... | [
{
"created": "Fri, 2 Sep 2022 18:32:09 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Jul 2023 21:43:36 GMT",
"version": "v2"
}
] | 2023-07-18 | [
[
"Wang",
"Wenya",
""
],
[
"Srikumar",
"Vivek",
""
],
[
"Hajishirzi",
"Hanna",
""
],
[
"Smith",
"Noah A.",
""
]
] | In question answering requiring common sense, language models (e.g., GPT-3) have been used to generate text expressing background knowledge that helps improve performance. Yet the cost of working with such models is very high; in this work, we finetune smaller language models to generate useful intermediate context, re... |
2305.14489 | Nghia T. Le | Nghia T. Le, Alan Ritter | Are Large Language Models Robust Coreference Resolvers? | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | Recent work on extending coreference resolution across domains and languages
relies on annotated data in both the target domain and language. At the same
time, pre-trained large language models (LMs) have been reported to exhibit
strong zero- and few-shot learning abilities across a wide range of NLP tasks.
However, ... | [
{
"created": "Tue, 23 May 2023 19:38:28 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Nov 2023 04:51:27 GMT",
"version": "v2"
}
] | 2023-11-16 | [
[
"Le",
"Nghia T.",
""
],
[
"Ritter",
"Alan",
""
]
] | Recent work on extending coreference resolution across domains and languages relies on annotated data in both the target domain and language. At the same time, pre-trained large language models (LMs) have been reported to exhibit strong zero- and few-shot learning abilities across a wide range of NLP tasks. However, pr... |
2211.01768 | L Siddharth Mr | Guangtong Li, L Siddharth, Jianxi Luo | Embedding Knowledge Graph of Patent Metadata to Measure Knowledge
Proximity | null | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | Knowledge proximity refers to the strength of association between any two
entities in a structural form that embodies certain aspects of a knowledge
base. In this work, we operationalize knowledge proximity within the context of
the US Patent Database (knowledge base) using a knowledge graph (structural
form) named P... | [
{
"created": "Thu, 3 Nov 2022 12:48:25 GMT",
"version": "v1"
},
{
"created": "Sun, 11 Dec 2022 06:47:50 GMT",
"version": "v2"
}
] | 2022-12-13 | [
[
"Li",
"Guangtong",
""
],
[
"Siddharth",
"L",
""
],
[
"Luo",
"Jianxi",
""
]
] | Knowledge proximity refers to the strength of association between any two entities in a structural form that embodies certain aspects of a knowledge base. In this work, we operationalize knowledge proximity within the context of the US Patent Database (knowledge base) using a knowledge graph (structural form) named Pat... |
1104.3810 | Juha K\"arkk\"ainen | Juha K\"arkk\"ainen and Simon J. Puglisi | Fixed Block Compression Boosting in FM-Indexes | null | null | null | null | cs.DS cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A compressed full-text self-index occupies space close to that of the
compressed text and simultaneously allows fast pattern matching and random
access to the underlying text. Among the best compressed self-indexes, in
theory and in practice, are several members of the FM-index family. In this
paper, we describe new ... | [
{
"created": "Tue, 19 Apr 2011 17:26:46 GMT",
"version": "v1"
}
] | 2011-04-20 | [
[
"Kärkkäinen",
"Juha",
""
],
[
"Puglisi",
"Simon J.",
""
]
] | A compressed full-text self-index occupies space close to that of the compressed text and simultaneously allows fast pattern matching and random access to the underlying text. Among the best compressed self-indexes, in theory and in practice, are several members of the FM-index family. In this paper, we describe new FM... |
2405.04441 | Paola Soto | Paola Soto, Miguel Camelo, Danny De Vleeschauwer, Yorick De Bock, Nina
Slamnik-Krije\v{s}torac, Chia-Yu Chang, Natalia Gaviria, Erik Mannens, Juan
F. Botero, Steven Latr\'e | Designing, Developing, and Validating Network Intelligence for Scaling
in Service-Based Architectures based on Deep Reinforcement Learning | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Automating network processes without human intervention is crucial for the
complex 6G environment. This requires zero-touch management and orchestration,
the integration of Network Intelligence (NI) into the network architecture, and
the efficient lifecycle management of intelligent functions. Reinforcement
Learning ... | [
{
"created": "Tue, 7 May 2024 16:05:06 GMT",
"version": "v1"
}
] | 2024-05-08 | [
[
"Soto",
"Paola",
""
],
[
"Camelo",
"Miguel",
""
],
[
"De Vleeschauwer",
"Danny",
""
],
[
"De Bock",
"Yorick",
""
],
[
"Slamnik-Kriještorac",
"Nina",
""
],
[
"Chang",
"Chia-Yu",
""
],
[
"Gaviria",
"Natalia",
... | Automating network processes without human intervention is crucial for the complex 6G environment. This requires zero-touch management and orchestration, the integration of Network Intelligence (NI) into the network architecture, and the efficient lifecycle management of intelligent functions. Reinforcement Learning (R... |
2402.01667 | Rolin Gabriel RASOANAIVO | R\^olin Gabriel Rasoanaivo (IRIT, UT Capitole), Pascale Zarat\'e
(IRIT, UT Capitole, IRIT-ADRIA) | Students' accommodation allocation: A Multicriteria Decision Support
System | null | SADIO electronic journal of informatics and operations research,
2023, 22 (3) | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The social life of students at university has an impact on their educational
success. The allocation of accommodation is part of this aspect. This article
presents our proposal to improve students' allocation accommodation. We aim to
support university administrative departments for the selection of students for
hous... | [
{
"created": "Mon, 15 Jan 2024 14:52:17 GMT",
"version": "v1"
}
] | 2024-02-06 | [
[
"Rasoanaivo",
"Rôlin Gabriel",
"",
"IRIT, UT Capitole"
],
[
"Zaraté",
"Pascale",
"",
"IRIT, UT Capitole, IRIT-ADRIA"
]
] | The social life of students at university has an impact on their educational success. The allocation of accommodation is part of this aspect. This article presents our proposal to improve students' allocation accommodation. We aim to support university administrative departments for the selection of students for housin... |
1809.07256 | Romain Hennequin | Romain Hennequin and Jimena Royo-Letelier and Manuel Moussallam | Audio Based Disambiguation Of Music Genre Tags | published in ISMIR 2018 | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | In this paper, we propose to infer music genre embeddings from audio datasets
carrying semantic information about genres. We show that such embeddings can be
used for disambiguating genre tags (identification of different labels for the
same genre, tag translation from a tag system to another, inference of
hierarchic... | [
{
"created": "Wed, 19 Sep 2018 15:49:12 GMT",
"version": "v1"
}
] | 2018-09-20 | [
[
"Hennequin",
"Romain",
""
],
[
"Royo-Letelier",
"Jimena",
""
],
[
"Moussallam",
"Manuel",
""
]
] | In this paper, we propose to infer music genre embeddings from audio datasets carrying semantic information about genres. We show that such embeddings can be used for disambiguating genre tags (identification of different labels for the same genre, tag translation from a tag system to another, inference of hierarchical... |
1912.13139 | Yuwen Huang | Yuwen Huang, Yuan Liu and Fangjiong Chen | NOMA-Aided Mobile Edge Computing via User Cooperation | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Exploiting the idle computation resources of mobile devices in mobile edge
computing (MEC) system can achieve both channel diversity and computing
diversity as mobile devices can offload their computation tasks to nearby
mobile devices in addition to MEC server embedded access point (AP). In this
paper, we propose a ... | [
{
"created": "Tue, 31 Dec 2019 01:51:32 GMT",
"version": "v1"
}
] | 2020-01-01 | [
[
"Huang",
"Yuwen",
""
],
[
"Liu",
"Yuan",
""
],
[
"Chen",
"Fangjiong",
""
]
] | Exploiting the idle computation resources of mobile devices in mobile edge computing (MEC) system can achieve both channel diversity and computing diversity as mobile devices can offload their computation tasks to nearby mobile devices in addition to MEC server embedded access point (AP). In this paper, we propose a no... |
1910.12336 | Patrick Schwab | Patrick Schwab, Walter Karlen | CXPlain: Causal Explanations for Model Interpretation under Uncertainty | To appear in Advances in Neural Information Processing Systems 2019 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Feature importance estimates that inform users about the degree to which
given inputs influence the output of a predictive model are crucial for
understanding, validating, and interpreting machine-learning models. However,
providing fast and accurate estimates of feature importance for
high-dimensional data, and quan... | [
{
"created": "Sun, 27 Oct 2019 19:59:18 GMT",
"version": "v1"
}
] | 2019-10-29 | [
[
"Schwab",
"Patrick",
""
],
[
"Karlen",
"Walter",
""
]
] | Feature importance estimates that inform users about the degree to which given inputs influence the output of a predictive model are crucial for understanding, validating, and interpreting machine-learning models. However, providing fast and accurate estimates of feature importance for high-dimensional data, and quanti... |
1212.3162 | Aaron Gerow | Aaron Gerow and Khurshid Ahmad | Diachronic Variation in Grammatical Relations | null | Proceedings of the 24th International Conference on Computational
Linguistics (COLING 2012), Mumbai, India | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a method of finding and analyzing shifts in grammatical relations
found in diachronic corpora. Inspired by the econometric technique of measuring
return and volatility instead of relative frequencies, we propose them as a way
to better characterize changes in grammatical patterns like nominalization,
modif... | [
{
"created": "Thu, 13 Dec 2012 13:00:55 GMT",
"version": "v1"
}
] | 2012-12-14 | [
[
"Gerow",
"Aaron",
""
],
[
"Ahmad",
"Khurshid",
""
]
] | We present a method of finding and analyzing shifts in grammatical relations found in diachronic corpora. Inspired by the econometric technique of measuring return and volatility instead of relative frequencies, we propose them as a way to better characterize changes in grammatical patterns like nominalization, modific... |
1409.5166 | Hu Qin | Hu Qin, Zizhen Zhang, Yubin Xie, Andrew Lim | A Tabu Search Algorithm for the Multi-period Inspector Scheduling
Problem | null | null | null | null | cs.AI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a multi-period inspector scheduling problem (MPISP),
which is a new variant of the multi-trip vehicle routing problem with time
windows (VRPTW). In the MPISP, each inspector is scheduled to perform a route
in a given multi-period planning horizon. At the end of each period, each
inspector is not... | [
{
"created": "Wed, 17 Sep 2014 23:29:46 GMT",
"version": "v1"
}
] | 2014-09-19 | [
[
"Qin",
"Hu",
""
],
[
"Zhang",
"Zizhen",
""
],
[
"Xie",
"Yubin",
""
],
[
"Lim",
"Andrew",
""
]
] | This paper introduces a multi-period inspector scheduling problem (MPISP), which is a new variant of the multi-trip vehicle routing problem with time windows (VRPTW). In the MPISP, each inspector is scheduled to perform a route in a given multi-period planning horizon. At the end of each period, each inspector is not r... |
1512.05256 | Naveen Sivadasan Dr | Kanigalpula Samanvi and Naveen Sivadasan | Subgraph Similarity Search in Large Graphs | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the major challenges in applications related to social networks,
computational biology, collaboration networks etc., is to efficiently search
for similar patterns in their underlying graphs. These graphs are typically
noisy and contain thousands of vertices and millions of edges. In many cases,
the graphs are ... | [
{
"created": "Wed, 16 Dec 2015 17:22:40 GMT",
"version": "v1"
}
] | 2015-12-17 | [
[
"Samanvi",
"Kanigalpula",
""
],
[
"Sivadasan",
"Naveen",
""
]
] | One of the major challenges in applications related to social networks, computational biology, collaboration networks etc., is to efficiently search for similar patterns in their underlying graphs. These graphs are typically noisy and contain thousands of vertices and millions of edges. In many cases, the graphs are un... |
2008.10932 | Kathrin Hanauer | Kathrin Hanauer, Christian Schulz, Jonathan Trummer | O'Reach: Even Faster Reachability in Large Graphs | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most fundamental problems in computer science is the reachability
problem: Given a directed graph and two vertices s and t, can s reach t via a
path? We revisit existing techniques and combine them with new approaches to
support a large portion of reachability queries in constant time using a
linear-sized ... | [
{
"created": "Tue, 25 Aug 2020 10:34:55 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Feb 2021 17:58:31 GMT",
"version": "v2"
}
] | 2021-02-02 | [
[
"Hanauer",
"Kathrin",
""
],
[
"Schulz",
"Christian",
""
],
[
"Trummer",
"Jonathan",
""
]
] | One of the most fundamental problems in computer science is the reachability problem: Given a directed graph and two vertices s and t, can s reach t via a path? We revisit existing techniques and combine them with new approaches to support a large portion of reachability queries in constant time using a linear-sized re... |
1509.01706 | Jing Zhang | Jing Zhang and Ioannis Ch. Paschalidis | An Improved Composite Hypothesis Test for Markov Models with
Applications in Network Anomaly Detection | 6 pages, 6 figures; final version for CDC 2015 | null | null | null | cs.IT cs.SY math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work has proposed the use of a composite hypothesis Hoeffding test for
statistical anomaly detection. Setting an appropriate threshold for the test
given a desired false alarm probability involves approximating the false alarm
probability. To that end, a large deviations asymptotic is typically used
which, how... | [
{
"created": "Sat, 5 Sep 2015 15:03:12 GMT",
"version": "v1"
},
{
"created": "Sat, 19 Mar 2016 18:22:29 GMT",
"version": "v2"
},
{
"created": "Fri, 16 Sep 2016 18:14:09 GMT",
"version": "v3"
}
] | 2016-09-19 | [
[
"Zhang",
"Jing",
""
],
[
"Paschalidis",
"Ioannis Ch.",
""
]
] | Recent work has proposed the use of a composite hypothesis Hoeffding test for statistical anomaly detection. Setting an appropriate threshold for the test given a desired false alarm probability involves approximating the false alarm probability. To that end, a large deviations asymptotic is typically used which, howev... |
2405.06201 | Hao Lu | Jiyao Wang, Hao Lu, Ange Wang, Xiao Yang, Yingcong Chen, Dengbo He,
Kaishun Wu | PhysMLE: Generalizable and Priors-Inclusive Multi-task Remote
Physiological Measurement | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Remote photoplethysmography (rPPG) has been widely applied to measure heart
rate from face videos. To increase the generalizability of the algorithms,
domain generalization (DG) attracted increasing attention in rPPG. However,
when rPPG is extended to simultaneously measure more vital signs (e.g.,
respiration and blo... | [
{
"created": "Fri, 10 May 2024 02:36:54 GMT",
"version": "v1"
}
] | 2024-05-13 | [
[
"Wang",
"Jiyao",
""
],
[
"Lu",
"Hao",
""
],
[
"Wang",
"Ange",
""
],
[
"Yang",
"Xiao",
""
],
[
"Chen",
"Yingcong",
""
],
[
"He",
"Dengbo",
""
],
[
"Wu",
"Kaishun",
""
]
] | Remote photoplethysmography (rPPG) has been widely applied to measure heart rate from face videos. To increase the generalizability of the algorithms, domain generalization (DG) attracted increasing attention in rPPG. However, when rPPG is extended to simultaneously measure more vital signs (e.g., respiration and blood... |
1910.09589 | Vassilis N. Ioannidis | Vassilis N. Ioannidis, Dimitris Berberidis, Georgios B. Giannakis | GraphSAC: Detecting anomalies in large-scale graphs | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A graph-based sampling and consensus (GraphSAC) approach is introduced to
effectively detect anomalous nodes in large-scale graphs. Existing approaches
rely on connectivity and attributes of all nodes to assign an anomaly score per
node. However, nodal attributes and network links might be compromised by
adversaries,... | [
{
"created": "Mon, 21 Oct 2019 18:30:03 GMT",
"version": "v1"
}
] | 2019-10-23 | [
[
"Ioannidis",
"Vassilis N.",
""
],
[
"Berberidis",
"Dimitris",
""
],
[
"Giannakis",
"Georgios B.",
""
]
] | A graph-based sampling and consensus (GraphSAC) approach is introduced to effectively detect anomalous nodes in large-scale graphs. Existing approaches rely on connectivity and attributes of all nodes to assign an anomaly score per node. However, nodal attributes and network links might be compromised by adversaries, r... |
1909.05163 | Ziqi Wang | Ziqi Wang, Jiahui Li, Seyran Khademi, Jan van Gemert | Attention-Aware Age-Agnostic Visual Place Recognition | Presented at ICCV WORKSHOP ON E-HERITAGE 2019, Seoul, South Korea | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A cross-domain visual place recognition (VPR) task is proposed in this work,
i.e., matching images of the same architectures depicted in different domains.
VPR is commonly treated as an image retrieval task, where a query image from an
unknown location is matched with relevant instances from geo-tagged gallery
databa... | [
{
"created": "Wed, 11 Sep 2019 16:04:42 GMT",
"version": "v1"
}
] | 2019-09-12 | [
[
"Wang",
"Ziqi",
""
],
[
"Li",
"Jiahui",
""
],
[
"Khademi",
"Seyran",
""
],
[
"van Gemert",
"Jan",
""
]
] | A cross-domain visual place recognition (VPR) task is proposed in this work, i.e., matching images of the same architectures depicted in different domains. VPR is commonly treated as an image retrieval task, where a query image from an unknown location is matched with relevant instances from geo-tagged gallery database... |
1201.3307 | Erwan Le Martelot | Erwan Le Martelot and Chris Hankin | Multi-scale Community Detection using Stability Optimisation within
Greedy Algorithms | This paper is an extension of the paper named "Multi-scale Community
Detection using Stability as Optimisation Criterion in a Greedy Algorithm" by
the same authors published in Proc. of the 2011 Int. Conf. on Knowledge
Discovery and Information Retrieval (KDIR 2011), SciTePress, 2011, 216-225 | null | null | null | cs.DS cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many real systems can be represented as networks whose analysis can be very
informative regarding the original system's organisation. In the past decade
community detection received a lot of attention and is now an active field of
research. Recently stability was introduced as a new measure for partition
quality. Thi... | [
{
"created": "Mon, 16 Jan 2012 16:25:09 GMT",
"version": "v1"
}
] | 2015-03-20 | [
[
"Martelot",
"Erwan Le",
""
],
[
"Hankin",
"Chris",
""
]
] | Many real systems can be represented as networks whose analysis can be very informative regarding the original system's organisation. In the past decade community detection received a lot of attention and is now an active field of research. Recently stability was introduced as a new measure for partition quality. This ... |
2308.10548 | Qiqi Gu | Qiqi Gu and Wei Ke | Typing Composable Coroutines | null | null | null | null | cs.PL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Coroutine, as a powerful programming construct, is widely used in
asynchronous applications to replace thread-based programming or the callback
hell. Using coroutines makes code more readable and maintainable, for its
ability to transfer control while keeping the literal scope. However, reasoning
about coroutine beha... | [
{
"created": "Mon, 21 Aug 2023 08:04:07 GMT",
"version": "v1"
}
] | 2024-05-17 | [
[
"Gu",
"Qiqi",
""
],
[
"Ke",
"Wei",
""
]
] | Coroutine, as a powerful programming construct, is widely used in asynchronous applications to replace thread-based programming or the callback hell. Using coroutines makes code more readable and maintainable, for its ability to transfer control while keeping the literal scope. However, reasoning about coroutine behavi... |
2212.01215 | Xu Chen | Qingze Fang and Zhiwei Zhai and Shuai Yu and Qiong Wu and Xiaowen Gong
and Xu Chen | Olive Branch Learning: A Topology-Aware Federated Learning Framework for
Space-Air-Ground Integrated Network | accepted by IEEE Transactions on Wireless Communications, Dec. 2022 | null | null | null | cs.NI cs.AI cs.DC cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The space-air-ground integrated network (SAGIN), one of the key technologies
for next-generation mobile communication systems, can facilitate data
transmission for users all over the world, especially in some remote areas
where vast amounts of informative data are collected by Internet of remote
things (IoRT) devices... | [
{
"created": "Fri, 2 Dec 2022 14:51:42 GMT",
"version": "v1"
}
] | 2022-12-05 | [
[
"Fang",
"Qingze",
""
],
[
"Zhai",
"Zhiwei",
""
],
[
"Yu",
"Shuai",
""
],
[
"Wu",
"Qiong",
""
],
[
"Gong",
"Xiaowen",
""
],
[
"Chen",
"Xu",
""
]
] | The space-air-ground integrated network (SAGIN), one of the key technologies for next-generation mobile communication systems, can facilitate data transmission for users all over the world, especially in some remote areas where vast amounts of informative data are collected by Internet of remote things (IoRT) devices t... |
2405.09273 | Jo\~ao Vitor Pamplona | Jan Pablo Burgard and Jo\~ao Vitor Pamplona | Fair Generalized Linear Mixed Models | 25 pages, 12 figures. arXiv admin note: text overlap with
arXiv:2405.06433 | null | null | null | cs.LG math.OC | http://creativecommons.org/licenses/by/4.0/ | When using machine learning for automated prediction, it is important to
account for fairness in the prediction. Fairness in machine learning aims to
ensure that biases in the data and model inaccuracies do not lead to
discriminatory decisions. E.g., predictions from fair machine learning models
should not discrimina... | [
{
"created": "Wed, 15 May 2024 11:42:41 GMT",
"version": "v1"
},
{
"created": "Wed, 22 May 2024 06:08:03 GMT",
"version": "v2"
}
] | 2024-05-24 | [
[
"Burgard",
"Jan Pablo",
""
],
[
"Pamplona",
"João Vitor",
""
]
] | When using machine learning for automated prediction, it is important to account for fairness in the prediction. Fairness in machine learning aims to ensure that biases in the data and model inaccuracies do not lead to discriminatory decisions. E.g., predictions from fair machine learning models should not discriminate... |
2008.11695 | Vignesh Prasad | Vignesh Prasad, Ruth Stock-Homburg, Jan Peters | Advances in Human-Robot Handshaking | Accepted at The 12th International Conference on Social Robotics
(ICSR 2020) 12 Pages, 1 Figure | null | 10.1007/978-3-030-62056-1_40 | null | cs.RO cs.HC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The use of social, anthropomorphic robots to support humans in various
industries has been on the rise. During Human-Robot Interaction (HRI),
physically interactive non-verbal behaviour is key for more natural
interactions. Handshaking is one such natural interaction used commonly in many
social contexts. It is one o... | [
{
"created": "Wed, 26 Aug 2020 17:35:06 GMT",
"version": "v1"
}
] | 2020-11-20 | [
[
"Prasad",
"Vignesh",
""
],
[
"Stock-Homburg",
"Ruth",
""
],
[
"Peters",
"Jan",
""
]
] | The use of social, anthropomorphic robots to support humans in various industries has been on the rise. During Human-Robot Interaction (HRI), physically interactive non-verbal behaviour is key for more natural interactions. Handshaking is one such natural interaction used commonly in many social contexts. It is one of ... |
2406.13201 | Yicong Li | Yicong Li, Yu Yang, Jiannong Cao, Shuaiqi Liu, Haoran Tang, Guandong
Xu | Toward Structure Fairness in Dynamic Graph Embedding: A Trend-aware Dual
Debiasing Approach | null | null | null | null | cs.LG cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent studies successfully learned static graph embeddings that are
structurally fair by preventing the effectiveness disparity of high- and
low-degree vertex groups in downstream graph mining tasks. However, achieving
structure fairness in dynamic graph embedding remains an open problem.
Neglecting degree changes i... | [
{
"created": "Wed, 19 Jun 2024 04:20:12 GMT",
"version": "v1"
}
] | 2024-06-21 | [
[
"Li",
"Yicong",
""
],
[
"Yang",
"Yu",
""
],
[
"Cao",
"Jiannong",
""
],
[
"Liu",
"Shuaiqi",
""
],
[
"Tang",
"Haoran",
""
],
[
"Xu",
"Guandong",
""
]
] | Recent studies successfully learned static graph embeddings that are structurally fair by preventing the effectiveness disparity of high- and low-degree vertex groups in downstream graph mining tasks. However, achieving structure fairness in dynamic graph embedding remains an open problem. Neglecting degree changes in ... |
2008.07669 | Albert Gu | Albert Gu, Tri Dao, Stefano Ermon, Atri Rudra, Christopher Re | HiPPO: Recurrent Memory with Optimal Polynomial Projections | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A central problem in learning from sequential data is representing cumulative
history in an incremental fashion as more data is processed. We introduce a
general framework (HiPPO) for the online compression of continuous signals and
discrete time series by projection onto polynomial bases. Given a measure that
specif... | [
{
"created": "Mon, 17 Aug 2020 23:39:33 GMT",
"version": "v1"
},
{
"created": "Fri, 23 Oct 2020 02:48:03 GMT",
"version": "v2"
}
] | 2020-10-26 | [
[
"Gu",
"Albert",
""
],
[
"Dao",
"Tri",
""
],
[
"Ermon",
"Stefano",
""
],
[
"Rudra",
"Atri",
""
],
[
"Re",
"Christopher",
""
]
] | A central problem in learning from sequential data is representing cumulative history in an incremental fashion as more data is processed. We introduce a general framework (HiPPO) for the online compression of continuous signals and discrete time series by projection onto polynomial bases. Given a measure that specifie... |
2206.06232 | Maksym Andriushchenko | Maksym Andriushchenko, Nicolas Flammarion | Towards Understanding Sharpness-Aware Minimization | The camera-ready version (accepted at ICML 2022) | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sharpness-Aware Minimization (SAM) is a recent training method that relies on
worst-case weight perturbations which significantly improves generalization in
various settings. We argue that the existing justifications for the success of
SAM which are based on a PAC-Bayes generalization bound and the idea of
convergenc... | [
{
"created": "Mon, 13 Jun 2022 15:07:32 GMT",
"version": "v1"
}
] | 2022-06-14 | [
[
"Andriushchenko",
"Maksym",
""
],
[
"Flammarion",
"Nicolas",
""
]
] | Sharpness-Aware Minimization (SAM) is a recent training method that relies on worst-case weight perturbations which significantly improves generalization in various settings. We argue that the existing justifications for the success of SAM which are based on a PAC-Bayes generalization bound and the idea of convergence ... |
2107.07703 | Otmar Ertl | Otmar Ertl | Estimation from Partially Sampled Distributed Traces | null | null | null | null | cs.DS cs.DC stat.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sampling is often a necessary evil to reduce the processing and storage costs
of distributed tracing. In this work, we describe a scalable and adaptive
sampling approach that can preserve events of interest better than the widely
used head-based sampling approach. Sampling rates can be chosen individually
and indepen... | [
{
"created": "Fri, 16 Jul 2021 04:41:24 GMT",
"version": "v1"
}
] | 2021-07-19 | [
[
"Ertl",
"Otmar",
""
]
] | Sampling is often a necessary evil to reduce the processing and storage costs of distributed tracing. In this work, we describe a scalable and adaptive sampling approach that can preserve events of interest better than the widely used head-based sampling approach. Sampling rates can be chosen individually and independe... |
2306.14850 | Till Fluschnik | Eva Michelle Deltl, Till Fluschnik, Robert Bredereck | Algorithmics of Egalitarian versus Equitable Sequences of Committees | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the election of sequences of committees, where in each of $\tau$
levels (e.g. modeling points in time) a committee consisting of $k$ candidates
from a common set of $m$ candidates is selected. For each level, each of $n$
agents (voters) may nominate one candidate whose selection would satisfy her.
We are int... | [
{
"created": "Mon, 26 Jun 2023 17:02:18 GMT",
"version": "v1"
}
] | 2023-06-27 | [
[
"Deltl",
"Eva Michelle",
""
],
[
"Fluschnik",
"Till",
""
],
[
"Bredereck",
"Robert",
""
]
] | We study the election of sequences of committees, where in each of $\tau$ levels (e.g. modeling points in time) a committee consisting of $k$ candidates from a common set of $m$ candidates is selected. For each level, each of $n$ agents (voters) may nominate one candidate whose selection would satisfy her. We are inter... |
cs/0408037 | Joergen Villadsen | J{\o}rgen Villadsen | Multi-dimensional Type Theory: Rules, Categories, and Combinators for
Syntax and Semantics | 20 pages | null | null | null | cs.CL cs.AI cs.LO | null | We investigate the possibility of modelling the syntax and semantics of
natural language by constraints, or rules, imposed by the multi-dimensional
type theory Nabla. The only multiplicity we explicitly consider is two, namely
one dimension for the syntax and one dimension for the semantics, but the
general perspecti... | [
{
"created": "Sun, 15 Aug 2004 08:51:19 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Villadsen",
"Jørgen",
""
]
] | We investigate the possibility of modelling the syntax and semantics of natural language by constraints, or rules, imposed by the multi-dimensional type theory Nabla. The only multiplicity we explicitly consider is two, namely one dimension for the syntax and one dimension for the semantics, but the general perspective... |
1801.02745 | Jo\~ao Ribeiro | Mahdi Cheraghchi and Jo\~ao Ribeiro | Structural Results and Improved Upper Bounds on the Capacity of the
Discrete-Time Poisson Channel | 28 pages, 3 figures. Added an appendix and made small edits
throughout the paper. A preliminary version of this paper appears in the
Proceedings of the IEEE International Symposium on Information Theory, 2018 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | New capacity upper bounds are presented for the discrete-time Poisson channel
with no dark current and an average-power constraint. These bounds are a simple
consequence of techniques developed for the seemingly unrelated problem of
upper bounding the capacity of binary deletion and repetition channels.
Previously, t... | [
{
"created": "Tue, 9 Jan 2018 01:43:19 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Jan 2018 02:52:38 GMT",
"version": "v2"
},
{
"created": "Thu, 18 Jan 2018 18:32:03 GMT",
"version": "v3"
},
{
"created": "Thu, 8 Mar 2018 17:23:33 GMT",
"version": "v4"
},
{
"cre... | 2018-07-23 | [
[
"Cheraghchi",
"Mahdi",
""
],
[
"Ribeiro",
"João",
""
]
] | New capacity upper bounds are presented for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the... |
1604.05492 | Geoffroy Fouquier | Guillaume Pitel, Geoffroy Fouquier, Emmanuel Marchand and Abdul
Mouhamadsultane | Count-Min Tree Sketch: Approximate counting for NLP | submitted to the second International Symposium on Web Algorithms
(iSwag'2016). arXiv admin note: text overlap with arXiv:1502.04885, In the
proceedings of the Second International Symposium on Web Algorithms (iSWAG
2016), June 9-10, 2016, Deauville, Normandy, France | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Count-Min Sketch is a widely adopted structure for approximate event
counting in large scale processing. In a previous work we improved the original
version of the Count-Min-Sketch (CMS) with conservative update using
approximate counters instead of linear counters. These structures are
computationaly efficient a... | [
{
"created": "Tue, 19 Apr 2016 09:51:34 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Apr 2016 09:44:51 GMT",
"version": "v2"
},
{
"created": "Wed, 15 Jun 2016 06:15:34 GMT",
"version": "v3"
}
] | 2016-06-16 | [
[
"Pitel",
"Guillaume",
""
],
[
"Fouquier",
"Geoffroy",
""
],
[
"Marchand",
"Emmanuel",
""
],
[
"Mouhamadsultane",
"Abdul",
""
]
] | The Count-Min Sketch is a widely adopted structure for approximate event counting in large scale processing. In a previous work we improved the original version of the Count-Min-Sketch (CMS) with conservative update using approximate counters instead of linear counters. These structures are computationaly efficient and... |
2211.09571 | Martin Bullinger | Felix Brandt and Martin Bullinger and Ana\"elle Wilczynski | Reaching Individually Stable Coalition Structures | A preliminary version of this article appeared in the Proceedings of
the 35th AAAI Conference on Artificial Intelligence (2021) | null | null | null | cs.GT | http://creativecommons.org/licenses/by/4.0/ | The formal study of coalition formation in multi-agent systems is typically
realized in the framework of hedonic games, which originate from economic
theory. The main focus of this branch of research has been on the existence and
the computational complexity of deciding the existence of coalition structures
that sati... | [
{
"created": "Thu, 17 Nov 2022 14:55:29 GMT",
"version": "v1"
}
] | 2022-11-18 | [
[
"Brandt",
"Felix",
""
],
[
"Bullinger",
"Martin",
""
],
[
"Wilczynski",
"Anaëlle",
""
]
] | The formal study of coalition formation in multi-agent systems is typically realized in the framework of hedonic games, which originate from economic theory. The main focus of this branch of research has been on the existence and the computational complexity of deciding the existence of coalition structures that satisf... |
1107.5397 | Dr. Md. Headayetullah PhD | Md.Headayetullah, G.K. Pradhan, Sanjay Biswas, B. Puthal | Proposed Information Sharing Security Approach for Security Personnels,
Vertical Integration, Semantic Interoperability Architecture and Framework
for Digital Government | 20 pages | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper mainly depicts the conceptual overview of vertical integration,
semantic interoperability architecture such as Educational Sector Architectural
Framework (ESAF) for New Zealand government and different interoperability
framework solution for digital government. In this paper, we try to develop a
secure inf... | [
{
"created": "Wed, 27 Jul 2011 06:48:48 GMT",
"version": "v1"
}
] | 2015-03-12 | [
[
"Headayetullah",
"Md.",
""
],
[
"Pradhan",
"G. K.",
""
],
[
"Biswas",
"Sanjay",
""
],
[
"Puthal",
"B.",
""
]
] | This paper mainly depicts the conceptual overview of vertical integration, semantic interoperability architecture such as Educational Sector Architectural Framework (ESAF) for New Zealand government and different interoperability framework solution for digital government. In this paper, we try to develop a secure infor... |
2001.02632 | Amin Sakzad | Amin Sakzad, Ron Steinfeld | Comments on "Physical-layer cryptography through massive MIMO" | arXiv admin note: substantial text overlap with arXiv:1507.08015 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present two attacks on two different versions of physical layer
cryptography schemes based on massive multiple-input multiple-output (MIMO).
Both cryptosystems employ a singular value decomposition (SVD) precoding
technique. For the first one, we show that the eavesdropper (who knows its own
channel and the channe... | [
{
"created": "Tue, 7 Jan 2020 09:55:40 GMT",
"version": "v1"
}
] | 2020-01-09 | [
[
"Sakzad",
"Amin",
""
],
[
"Steinfeld",
"Ron",
""
]
] | We present two attacks on two different versions of physical layer cryptography schemes based on massive multiple-input multiple-output (MIMO). Both cryptosystems employ a singular value decomposition (SVD) precoding technique. For the first one, we show that the eavesdropper (who knows its own channel and the channel ... |
1901.10681 | Marc Ru{\ss}wurm | Marc Ru{\ss}wurm, Nicolas Courty, R\'emi Emonet, S\'ebastien
Lef\`evre, Devis Tuia, Romain Tavenard | End-to-End Learned Early Classification of Time Series for In-Season
Crop Type Mapping | accepted for publication in ISPRS Journal of Photogrammetry and
Remote Sensing | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Remote sensing satellites capture the cyclic dynamics of our Planet in
regular time intervals recorded in satellite time series data. End-to-end
trained deep learning models use this time series data to make predictions at a
large scale, for instance, to produce up-to-date crop cover maps. Most time
series classifica... | [
{
"created": "Wed, 30 Jan 2019 05:51:41 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Dec 2022 20:52:14 GMT",
"version": "v2"
}
] | 2022-12-23 | [
[
"Rußwurm",
"Marc",
""
],
[
"Courty",
"Nicolas",
""
],
[
"Emonet",
"Rémi",
""
],
[
"Lefèvre",
"Sébastien",
""
],
[
"Tuia",
"Devis",
""
],
[
"Tavenard",
"Romain",
""
]
] | Remote sensing satellites capture the cyclic dynamics of our Planet in regular time intervals recorded in satellite time series data. End-to-end trained deep learning models use this time series data to make predictions at a large scale, for instance, to produce up-to-date crop cover maps. Most time series classificati... |
2206.13732 | Chuanfu Shen | Chuanfu Shen, Shiqi Yu, Jilong Wang, George Q. Huang and Liang Wang | A Comprehensive Survey on Deep Gait Recognition: Algorithms, Datasets
and Challenges | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Gait recognition aims to identify a person at a distance, serving as a
promising solution for long-distance and less-cooperation pedestrian
recognition. Recently, significant advancements in gait recognition have
achieved inspiring success in many challenging scenarios by utilizing deep
learning techniques. Against t... | [
{
"created": "Tue, 28 Jun 2022 03:36:12 GMT",
"version": "v1"
},
{
"created": "Sat, 5 Aug 2023 06:03:55 GMT",
"version": "v2"
}
] | 2023-08-08 | [
[
"Shen",
"Chuanfu",
""
],
[
"Yu",
"Shiqi",
""
],
[
"Wang",
"Jilong",
""
],
[
"Huang",
"George Q.",
""
],
[
"Wang",
"Liang",
""
]
] | Gait recognition aims to identify a person at a distance, serving as a promising solution for long-distance and less-cooperation pedestrian recognition. Recently, significant advancements in gait recognition have achieved inspiring success in many challenging scenarios by utilizing deep learning techniques. Against the... |
2108.02941 | Vukosi Marivate | Harm de Wet, Vukosi Marivate | Is it Fake? News Disinformation Detection on South African News Websites | 6 pages, Accepted and to be published in AFRICON 2021 | null | null | null | cs.CL cs.CY cs.LG | http://creativecommons.org/licenses/by/4.0/ | Disinformation through fake news is an ongoing problem in our society and has
become easily spread through social media. The most cost and time effective way
to filter these large amounts of data is to use a combination of human and
technical interventions to identify it. From a technical perspective, Natural
Languag... | [
{
"created": "Fri, 6 Aug 2021 04:54:03 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Aug 2021 17:23:05 GMT",
"version": "v2"
}
] | 2021-08-10 | [
[
"de Wet",
"Harm",
""
],
[
"Marivate",
"Vukosi",
""
]
] | Disinformation through fake news is an ongoing problem in our society and has become easily spread through social media. The most cost and time effective way to filter these large amounts of data is to use a combination of human and technical interventions to identify it. From a technical perspective, Natural Language ... |
0906.4012 | Man-On Pun | Man-On Pun, Kyeong Jin Kim, Ronald Iltis and H. Vincent Poor | Reduced-Feedback Opportunistic Scheduling and Beamforming with GMD for
MIMO-OFDMA | Proc. Asilomar Conference on Signals, Systems, and Computers, Pacific
Grove, CA, Nov. 2008 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Opportunistic scheduling and beamforming schemes have been proposed
previously by the authors for reduced-feedback MIMO-OFDMA downlink systems
where the MIMO channel of each subcarrier is decomposed into layered spatial
subchannels. It has been demonstrated that significant feedback reduction can
be achieved by retur... | [
{
"created": "Mon, 22 Jun 2009 14:28:14 GMT",
"version": "v1"
}
] | 2009-06-23 | [
[
"Pun",
"Man-On",
""
],
[
"Kim",
"Kyeong Jin",
""
],
[
"Iltis",
"Ronald",
""
],
[
"Poor",
"H. Vincent",
""
]
] | Opportunistic scheduling and beamforming schemes have been proposed previously by the authors for reduced-feedback MIMO-OFDMA downlink systems where the MIMO channel of each subcarrier is decomposed into layered spatial subchannels. It has been demonstrated that significant feedback reduction can be achieved by returni... |
2104.10814 | Paulo Rezeck | Paulo Rezeck, Renato M. Assuncao and Luiz Chaimowicz | Flocking-Segregative Swarming Behaviors using Gibbs Random Fields | 7 pages, 11 figures, accepted by ICRA 2021 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel approach that allows a swarm of heterogeneous
robots to produce simultaneously segregative and flocking behaviors using only
local sensing. These behaviors have been widely studied in swarm robotics and
their combination allows the execution of several complex tasks, ranging from
surveilla... | [
{
"created": "Thu, 22 Apr 2021 01:12:10 GMT",
"version": "v1"
}
] | 2021-04-23 | [
[
"Rezeck",
"Paulo",
""
],
[
"Assuncao",
"Renato M.",
""
],
[
"Chaimowicz",
"Luiz",
""
]
] | This paper presents a novel approach that allows a swarm of heterogeneous robots to produce simultaneously segregative and flocking behaviors using only local sensing. These behaviors have been widely studied in swarm robotics and their combination allows the execution of several complex tasks, ranging from surveillanc... |
2207.09847 | Sunayana Rane | Sunayana Rane, Mira L. Nencheva, Zeyu Wang, Casey Lew-Williams, Olga
Russakovsky, Thomas L. Griffiths | Predicting Word Learning in Children from the Performance of Computer
Vision Systems | CogSci 2023 | null | null | null | cs.CL cs.AI cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | For human children as well as machine learning systems, a key challenge in
learning a word is linking the word to the visual phenomena it describes. We
explore this aspect of word learning by using the performance of computer
vision systems as a proxy for the difficulty of learning a word from visual
cues. We show th... | [
{
"created": "Thu, 7 Jul 2022 22:49:32 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Oct 2022 13:40:11 GMT",
"version": "v2"
},
{
"created": "Sat, 9 Sep 2023 08:33:37 GMT",
"version": "v3"
}
] | 2023-09-12 | [
[
"Rane",
"Sunayana",
""
],
[
"Nencheva",
"Mira L.",
""
],
[
"Wang",
"Zeyu",
""
],
[
"Lew-Williams",
"Casey",
""
],
[
"Russakovsky",
"Olga",
""
],
[
"Griffiths",
"Thomas L.",
""
]
] | For human children as well as machine learning systems, a key challenge in learning a word is linking the word to the visual phenomena it describes. We explore this aspect of word learning by using the performance of computer vision systems as a proxy for the difficulty of learning a word from visual cues. We show that... |
2305.04615 | Junkai Zhang Dr. | Junkai Zhang, Tharmalingam Ratnarajah | Performance Analysis of In-Band-Full-Duplex Multi-Cell Wideband IAB
Networks | null | in IEEE Access, vol. 12, pp. 47024-47040, April 2024 | 10.1109/ACCESS.2024.3382719 | null | cs.IT eess.SP math.IT | http://creativecommons.org/licenses/by/4.0/ | This paper analyzes the performance of the 3rd Generation Partnership Project
(3GPP)-inspired multi-cell wideband single-hop backhaul
millimeter-wave-in-band-full-duplex (IBFD)-integrated access and backhaul (IAB)
networks by using stochastic geometry. We model the wired-connected Next
Generation NodeBs (gNBs) as the... | [
{
"created": "Mon, 8 May 2023 10:47:32 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Mar 2024 08:20:56 GMT",
"version": "v2"
}
] | 2024-04-08 | [
[
"Zhang",
"Junkai",
""
],
[
"Ratnarajah",
"Tharmalingam",
""
]
] | This paper analyzes the performance of the 3rd Generation Partnership Project (3GPP)-inspired multi-cell wideband single-hop backhaul millimeter-wave-in-band-full-duplex (IBFD)-integrated access and backhaul (IAB) networks by using stochastic geometry. We model the wired-connected Next Generation NodeBs (gNBs) as the M... |
2405.19009 | Jihao Liu | Jihao Liu, Jinliang Zheng, Boxiao Liu, Yu Liu, Hongsheng Li | Enhancing Vision-Language Model with Unmasked Token Alignment | Accepted by TMLR; Code and models are available at
https://github.com/jihaonew/UTA | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Contrastive pre-training on image-text pairs, exemplified by CLIP, becomes a
standard technique for learning multi-modal visual-language representations.
Although CLIP has demonstrated remarkable performance, training it from scratch
on noisy web-scale datasets is computationally demanding. On the other hand,
mask-th... | [
{
"created": "Wed, 29 May 2024 11:48:17 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Jun 2024 14:29:41 GMT",
"version": "v2"
}
] | 2024-06-17 | [
[
"Liu",
"Jihao",
""
],
[
"Zheng",
"Jinliang",
""
],
[
"Liu",
"Boxiao",
""
],
[
"Liu",
"Yu",
""
],
[
"Li",
"Hongsheng",
""
]
] | Contrastive pre-training on image-text pairs, exemplified by CLIP, becomes a standard technique for learning multi-modal visual-language representations. Although CLIP has demonstrated remarkable performance, training it from scratch on noisy web-scale datasets is computationally demanding. On the other hand, mask-then... |
1602.08128 | Zhenhao Ge | Zhenhao Ge, Sudhendu R. Sharma, Mark J. T. Smith | PCA Method for Automated Detection of Mispronounced Words | SPIE Defense, Security, and Sensing | null | 10.1117/12.884155 | null | cs.SD cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a method for detecting mispronunciations with the aim of
improving Computer Assisted Language Learning (CALL) tools used by foreign
language learners. The algorithm is based on Principle Component Analysis
(PCA). It is hierarchical with each successive step refining the estimate to
classify the te... | [
{
"created": "Thu, 25 Feb 2016 21:48:56 GMT",
"version": "v1"
}
] | 2016-02-29 | [
[
"Ge",
"Zhenhao",
""
],
[
"Sharma",
"Sudhendu R.",
""
],
[
"Smith",
"Mark J. T.",
""
]
] | This paper presents a method for detecting mispronunciations with the aim of improving Computer Assisted Language Learning (CALL) tools used by foreign language learners. The algorithm is based on Principle Component Analysis (PCA). It is hierarchical with each successive step refining the estimate to classify the test... |
2307.10822 | Wei Cong | Wei Cong, Yang Cong, Jiahua Dong, Gan Sun, Henghui Ding | Gradient-Semantic Compensation for Incremental Semantic Segmentation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Incremental semantic segmentation aims to continually learn the segmentation
of new coming classes without accessing the training data of previously learned
classes. However, most current methods fail to address catastrophic forgetting
and background shift since they 1) treat all previous classes equally without
cons... | [
{
"created": "Thu, 20 Jul 2023 12:32:25 GMT",
"version": "v1"
}
] | 2023-07-21 | [
[
"Cong",
"Wei",
""
],
[
"Cong",
"Yang",
""
],
[
"Dong",
"Jiahua",
""
],
[
"Sun",
"Gan",
""
],
[
"Ding",
"Henghui",
""
]
] | Incremental semantic segmentation aims to continually learn the segmentation of new coming classes without accessing the training data of previously learned classes. However, most current methods fail to address catastrophic forgetting and background shift since they 1) treat all previous classes equally without consid... |
2403.17597 | Luke Joel Dr | Luke Oluwaseye Joel and Sawyerr A. Babatunde and Adewumi O. Aderemi | An Exact Solution for Allocating Car Parking Spaces on Campus | An International Multidiscinary Conference on Research, Development
and Practices in Science, Technology, Education, Arts, Management & the
Social Science (iSTEAMS). Conference Centre, University of Ibandan, Nigeria.
30 May - 01 June 2013 | null | null | null | cs.CE math.OC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | All over the world, especially in the university environment, planning
managers and traffic engineers are constantly faced with the problem of
inadequate allocation of car parking spaces to demanded users. Users could
either prefer reserved parking spaces to unreserved parking spaces or vice
versa. This makes the cam... | [
{
"created": "Tue, 26 Mar 2024 11:08:48 GMT",
"version": "v1"
}
] | 2024-03-27 | [
[
"Joel",
"Luke Oluwaseye",
""
],
[
"Babatunde",
"Sawyerr A.",
""
],
[
"Aderemi",
"Adewumi O.",
""
]
] | All over the world, especially in the university environment, planning managers and traffic engineers are constantly faced with the problem of inadequate allocation of car parking spaces to demanded users. Users could either prefer reserved parking spaces to unreserved parking spaces or vice versa. This makes the campu... |
1111.0706 | Gwendal Simon | Herve Kerivin, Jimmy Leblet, Gwendal Simon and Fen Zhou | Maximum Bounded Rooted-Tree Packing Problem | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a graph and a root, the Maximum Bounded Rooted-Tree Packing (MBRTP)
problem aims at finding K rooted-trees that span the largest subset of
vertices, when each vertex has a limited outdegree. This problem is motivated
by peer-to-peer streaming overlays in under-provisioned systems. We prove that
the MBRTP proble... | [
{
"created": "Thu, 3 Nov 2011 01:16:09 GMT",
"version": "v1"
}
] | 2011-11-04 | [
[
"Kerivin",
"Herve",
""
],
[
"Leblet",
"Jimmy",
""
],
[
"Simon",
"Gwendal",
""
],
[
"Zhou",
"Fen",
""
]
] | Given a graph and a root, the Maximum Bounded Rooted-Tree Packing (MBRTP) problem aims at finding K rooted-trees that span the largest subset of vertices, when each vertex has a limited outdegree. This problem is motivated by peer-to-peer streaming overlays in under-provisioned systems. We prove that the MBRTP problem ... |
2301.09175 | Tuan Manh Lai | Tuan Manh Lai, Heng Ji | Ensemble Transfer Learning for Multilingual Coreference Resolution | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Entity coreference resolution is an important research problem with many
applications, including information extraction and question answering.
Coreference resolution for English has been studied extensively. However, there
is relatively little work for other languages. A problem that frequently occurs
when working w... | [
{
"created": "Sun, 22 Jan 2023 18:22:55 GMT",
"version": "v1"
}
] | 2023-01-24 | [
[
"Lai",
"Tuan Manh",
""
],
[
"Ji",
"Heng",
""
]
] | Entity coreference resolution is an important research problem with many applications, including information extraction and question answering. Coreference resolution for English has been studied extensively. However, there is relatively little work for other languages. A problem that frequently occurs when working wit... |
2104.01791 | Saikat Dutta | Sourya Dipta Das, Ayan Basak, Saikat Dutta | A Heuristic-driven Uncertainty based Ensemble Framework for Fake News
Detection in Tweets and News Articles | Accepted to Neurocomputing | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The significance of social media has increased manifold in the past few
decades as it helps people from even the most remote corners of the world to
stay connected. With the advent of technology, digital media has become more
relevant and widely used than ever before and along with this, there has been a
resurgence i... | [
{
"created": "Mon, 5 Apr 2021 06:35:30 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Dec 2021 18:10:04 GMT",
"version": "v2"
}
] | 2021-12-14 | [
[
"Das",
"Sourya Dipta",
""
],
[
"Basak",
"Ayan",
""
],
[
"Dutta",
"Saikat",
""
]
] | The significance of social media has increased manifold in the past few decades as it helps people from even the most remote corners of the world to stay connected. With the advent of technology, digital media has become more relevant and widely used than ever before and along with this, there has been a resurgence in ... |
2403.10220 | Xinli Hao | Xinli Hao, Yile Chen, Chen Yang, Zhihui Du, Chaohong Ma, Chao Wu,
Xiaofeng Meng | From Chaos to Clarity: Time Series Anomaly Detection in Astronomical
Observations | accepted by ICDE 2024 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the development of astronomical facilities, large-scale time series data
observed by these facilities is being collected. Analyzing anomalies in these
astronomical observations is crucial for uncovering potential celestial events
and physical phenomena, thus advancing the scientific research process.
However, ex... | [
{
"created": "Fri, 15 Mar 2024 11:39:12 GMT",
"version": "v1"
}
] | 2024-03-18 | [
[
"Hao",
"Xinli",
""
],
[
"Chen",
"Yile",
""
],
[
"Yang",
"Chen",
""
],
[
"Du",
"Zhihui",
""
],
[
"Ma",
"Chaohong",
""
],
[
"Wu",
"Chao",
""
],
[
"Meng",
"Xiaofeng",
""
]
] | With the development of astronomical facilities, large-scale time series data observed by these facilities is being collected. Analyzing anomalies in these astronomical observations is crucial for uncovering potential celestial events and physical phenomena, thus advancing the scientific research process. However, exis... |
2008.08071 | Lunjia Hu | Lunjia Hu, Omer Reingold | Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers | 29 pages, 2 figures. Published in AISTATS 2021. More details in the
proof of Claim 14 | null | null | null | cs.DS cs.LG math.ST stat.ML stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of robustly estimating the mean of a $d$-dimensional
distribution given $N$ examples, where most coordinates of every example may be
missing and $\varepsilon N$ examples may be arbitrarily corrupted. Assuming
each coordinate appears in a constant factor more than $\varepsilon N$
examples, we show... | [
{
"created": "Tue, 18 Aug 2020 17:53:34 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Aug 2020 07:50:25 GMT",
"version": "v2"
},
{
"created": "Tue, 2 Mar 2021 01:13:12 GMT",
"version": "v3"
},
{
"created": "Sat, 6 Mar 2021 19:39:54 GMT",
"version": "v4"
},
{
"cre... | 2021-05-04 | [
[
"Hu",
"Lunjia",
""
],
[
"Reingold",
"Omer",
""
]
] | We study the problem of robustly estimating the mean of a $d$-dimensional distribution given $N$ examples, where most coordinates of every example may be missing and $\varepsilon N$ examples may be arbitrarily corrupted. Assuming each coordinate appears in a constant factor more than $\varepsilon N$ examples, we show a... |
1811.11611 | Joakim Johnander | Joakim Johnander, Martin Danelljan, Emil Brissman, Fahad Shahbaz Khan,
Michael Felsberg | A Generative Appearance Model for End-to-end Video Object Segmentation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the fundamental challenges in video object segmentation is to find an
effective representation of the target and background appearance. The best
performing approaches resort to extensive fine-tuning of a convolutional neural
network for this purpose. Besides being prohibitively expensive, this strategy
cannot ... | [
{
"created": "Wed, 28 Nov 2018 15:11:43 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Dec 2018 13:50:46 GMT",
"version": "v2"
}
] | 2018-12-10 | [
[
"Johnander",
"Joakim",
""
],
[
"Danelljan",
"Martin",
""
],
[
"Brissman",
"Emil",
""
],
[
"Khan",
"Fahad Shahbaz",
""
],
[
"Felsberg",
"Michael",
""
]
] | One of the fundamental challenges in video object segmentation is to find an effective representation of the target and background appearance. The best performing approaches resort to extensive fine-tuning of a convolutional neural network for this purpose. Besides being prohibitively expensive, this strategy cannot be... |
2307.01548 | Hussam Ghanem | Hussam Ghanem (ICB), Massinissa Atmani (ICB), Christophe Cruz (ICB) | Knowledge Graph for NLG in the context of conversational agents | null | French Regional Conference on Complex Systems (FRCCS 2023), May
2023, Le Havre, France | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The use of knowledge graphs (KGs) enhances the accuracy and comprehensiveness
of the responses provided by a conversational agent. While generating answers
during conversations consists in generating text from these KGs, it is still
regarded as a challenging task that has gained significant attention in recent
years.... | [
{
"created": "Tue, 4 Jul 2023 08:03:33 GMT",
"version": "v1"
}
] | 2023-07-06 | [
[
"Ghanem",
"Hussam",
"",
"ICB"
],
[
"Atmani",
"Massinissa",
"",
"ICB"
],
[
"Cruz",
"Christophe",
"",
"ICB"
]
] | The use of knowledge graphs (KGs) enhances the accuracy and comprehensiveness of the responses provided by a conversational agent. While generating answers during conversations consists in generating text from these KGs, it is still regarded as a challenging task that has gained significant attention in recent years. I... |
2407.13479 | Matthijs Ebbens | Matthijs Ebbens, Francis Lazarus | Computing the second and third systoles of a combinatorial surface | 29 pages, 6 figures | null | null | null | cs.CG math.GT | http://creativecommons.org/licenses/by/4.0/ | Given a weighted, undirected graph $G$ cellularly embedded on a topological
surface $S$, we describe algorithms to compute the second shortest and third
shortest closed walks of $G$ that are homotopically non-trivial in $S$. Our
algorithms run in $O(n^2\log n)$ time for the second shortest walk and in
$O(n^3)$ time f... | [
{
"created": "Thu, 18 Jul 2024 12:57:19 GMT",
"version": "v1"
}
] | 2024-07-19 | [
[
"Ebbens",
"Matthijs",
""
],
[
"Lazarus",
"Francis",
""
]
] | Given a weighted, undirected graph $G$ cellularly embedded on a topological surface $S$, we describe algorithms to compute the second shortest and third shortest closed walks of $G$ that are homotopically non-trivial in $S$. Our algorithms run in $O(n^2\log n)$ time for the second shortest walk and in $O(n^3)$ time for... |
2012.14359 | Mehul Bhatt | Jakob Suchan and Mehul Bhatt and Srikrishna Varadarajan | Commonsense Visual Sensemaking for Autonomous Driving: On Generalised
Neurosymbolic Online Abduction Integrating Vision and Semantics | This is a preprint / review version of an accepted contribution to be
published as part of the Artificial Intelligence Journal (AIJ).? The article
is an extended version of an IJCAI 2019 publication [74, arXiv:1906.00107] | null | null | null | cs.AI cs.CV cs.LG cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We demonstrate the need and potential of systematically integrated vision and
semantics solutions for visual sensemaking in the backdrop of autonomous
driving. A general neurosymbolic method for online visual sensemaking using
answer set programming (ASP) is systematically formalised and fully
implemented. The method... | [
{
"created": "Mon, 28 Dec 2020 16:55:19 GMT",
"version": "v1"
}
] | 2020-12-29 | [
[
"Suchan",
"Jakob",
""
],
[
"Bhatt",
"Mehul",
""
],
[
"Varadarajan",
"Srikrishna",
""
]
] | We demonstrate the need and potential of systematically integrated vision and semantics solutions for visual sensemaking in the backdrop of autonomous driving. A general neurosymbolic method for online visual sensemaking using answer set programming (ASP) is systematically formalised and fully implemented. The method i... |
2003.04761 | Gleison Brito | Gleison Brito and Marco Tulio Valente | REST vs GraphQL: A Controlled Experiment | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | GraphQL is a novel query language for implementing service-based software
architectures. The language is gaining momentum and it is now used by major
software companies, such as Facebook and GitHub. However, we still lack
empirical evidence on the real gains achieved by GraphQL, particularly in terms
of the effort re... | [
{
"created": "Tue, 10 Mar 2020 14:17:39 GMT",
"version": "v1"
}
] | 2020-03-11 | [
[
"Brito",
"Gleison",
""
],
[
"Valente",
"Marco Tulio",
""
]
] | GraphQL is a novel query language for implementing service-based software architectures. The language is gaining momentum and it is now used by major software companies, such as Facebook and GitHub. However, we still lack empirical evidence on the real gains achieved by GraphQL, particularly in terms of the effort requ... |
1809.06367 | Eugene Belilovsky | Edouard Oyallon (CVN, GALEN), Sergey Zagoruyko (ENPC, LIGM), Gabriel
Huang (DIRO, MILA), Nikos Komodakis (ENPC, CSD-UOC, LIGM), Simon
Lacoste-Julien (DIRO, MILA), Matthew Blaschko (ESAT), Eugene Belilovsky
(DIRO, MILA) | Scattering Networks for Hybrid Representation Learning | arXiv admin note: substantial text overlap with arXiv:1703.08961 | IEEE Transactions on Pattern Analysis and Machine Intelligence,
Institute of Electrical and Electronics Engineers, 2018, pp.11 | 10.1109/TPAMI.2018.2855738 | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scattering networks are a class of designed Convolutional Neural Networks
(CNNs) with fixed weights. We argue they can serve as generic representations
for modelling images. In particular, by working in scattering space, we achieve
competitive results both for supervised and unsupervised learning tasks, while
making ... | [
{
"created": "Mon, 17 Sep 2018 06:27:40 GMT",
"version": "v1"
}
] | 2018-09-19 | [
[
"Oyallon",
"Edouard",
"",
"CVN, GALEN"
],
[
"Zagoruyko",
"Sergey",
"",
"ENPC, LIGM"
],
[
"Huang",
"Gabriel",
"",
"DIRO, MILA"
],
[
"Komodakis",
"Nikos",
"",
"ENPC, CSD-UOC, LIGM"
],
[
"Lacoste-Julien",
"Simon",
"",
"DI... | Scattering networks are a class of designed Convolutional Neural Networks (CNNs) with fixed weights. We argue they can serve as generic representations for modelling images. In particular, by working in scattering space, we achieve competitive results both for supervised and unsupervised learning tasks, while making pr... |
2205.08247 | Joao Monteiro | Joao Monteiro, Mohamed Osama Ahmed, Hossein Hajimirsadeghi, Greg Mori | Monotonicity Regularization: Improved Penalties and Novel Applications
to Disentangled Representation Learning and Robust Classification | Accepted to UAI 2022 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We study settings where gradient penalties are used alongside risk
minimization with the goal of obtaining predictors satisfying different notions
of monotonicity. Specifically, we present two sets of contributions. In the
first part of the paper, we show that different choices of penalties define the
regions of the ... | [
{
"created": "Tue, 17 May 2022 11:42:45 GMT",
"version": "v1"
}
] | 2022-05-18 | [
[
"Monteiro",
"Joao",
""
],
[
"Ahmed",
"Mohamed Osama",
""
],
[
"Hajimirsadeghi",
"Hossein",
""
],
[
"Mori",
"Greg",
""
]
] | We study settings where gradient penalties are used alongside risk minimization with the goal of obtaining predictors satisfying different notions of monotonicity. Specifically, we present two sets of contributions. In the first part of the paper, we show that different choices of penalties define the regions of the in... |
1909.04242 | Guanhua Zhang | Guanhua Zhang, Bing Bai, Junqi Zhang, Kun Bai, Conghui Zhu, Tiejun
Zhao | Mitigating Annotation Artifacts in Natural Language Inference Datasets
to Improve Cross-dataset Generalization Ability | null | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Natural language inference (NLI) aims at predicting the relationship between
a given pair of premise and hypothesis. However, several works have found that
there widely exists a bias pattern called annotation artifacts in NLI datasets,
making it possible to identify the label only by looking at the hypothesis.
This i... | [
{
"created": "Tue, 10 Sep 2019 02:35:34 GMT",
"version": "v1"
},
{
"created": "Sat, 5 Oct 2019 14:40:31 GMT",
"version": "v2"
}
] | 2019-10-08 | [
[
"Zhang",
"Guanhua",
""
],
[
"Bai",
"Bing",
""
],
[
"Zhang",
"Junqi",
""
],
[
"Bai",
"Kun",
""
],
[
"Zhu",
"Conghui",
""
],
[
"Zhao",
"Tiejun",
""
]
] | Natural language inference (NLI) aims at predicting the relationship between a given pair of premise and hypothesis. However, several works have found that there widely exists a bias pattern called annotation artifacts in NLI datasets, making it possible to identify the label only by looking at the hypothesis. This irr... |
1807.10543 | Neslihan Suzen | Neslihan Suzen, Alexander Gorban, Jeremy Levesley and Evgeny Mirkes | Automatic Short Answer Grading and Feedback Using Text Mining Methods | 27 pages; added questions for section 6; correction of typos | Procedia Computer Science 169 (2020), 726-743 | 10.1016/j.procs.2020.02.171 | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Automatic grading is not a new approach but the need to adapt the latest
technology to automatic grading has become very important. As the technology
has rapidly became more powerful on scoring exams and essays, especially from
the 1990s onwards, partially or wholly automated grading systems using
computational metho... | [
{
"created": "Fri, 27 Jul 2018 12:00:21 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Jun 2019 17:21:46 GMT",
"version": "v2"
},
{
"created": "Thu, 19 Dec 2019 20:48:35 GMT",
"version": "v3"
}
] | 2020-04-20 | [
[
"Suzen",
"Neslihan",
""
],
[
"Gorban",
"Alexander",
""
],
[
"Levesley",
"Jeremy",
""
],
[
"Mirkes",
"Evgeny",
""
]
] | Automatic grading is not a new approach but the need to adapt the latest technology to automatic grading has become very important. As the technology has rapidly became more powerful on scoring exams and essays, especially from the 1990s onwards, partially or wholly automated grading systems using computational methods... |
1301.7345 | Anirban Ghatak | Anirban Ghatak | Codes on Lattices for Random SAF Routing | 17 pages, 1 figure; some typos corrected, a table of numerical data
added | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a construction of constant weight codes based on the unique
decomposition of elements in lattices is presented. The conditions for unique
primary decomposition and unique irreducible decomposition in lattices are
discussed and connections with the decomposition of ideals in Noetherian
commutative rings... | [
{
"created": "Wed, 30 Jan 2013 20:10:25 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Apr 2013 05:13:54 GMT",
"version": "v2"
}
] | 2013-04-30 | [
[
"Ghatak",
"Anirban",
""
]
] | In this paper, a construction of constant weight codes based on the unique decomposition of elements in lattices is presented. The conditions for unique primary decomposition and unique irreducible decomposition in lattices are discussed and connections with the decomposition of ideals in Noetherian commutative rings e... |
2306.04841 | Ha Thanh Nguyen | Thi-Hai-Yen Vuong, Ha-Thanh Nguyen, Quang-Huy Nguyen, Le-Minh Nguyen,
and Xuan-Hieu Phan | Improving Vietnamese Legal Question--Answering System based on Automatic
Data Enrichment | JURISIN 2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Question answering (QA) in law is a challenging problem because legal
documents are much more complicated than normal texts in terms of terminology,
structure, and temporal and logical relationships. It is even more difficult to
perform legal QA for low-resource languages like Vietnamese where labeled data
are rare a... | [
{
"created": "Thu, 8 Jun 2023 00:24:29 GMT",
"version": "v1"
}
] | 2023-06-09 | [
[
"Vuong",
"Thi-Hai-Yen",
""
],
[
"Nguyen",
"Ha-Thanh",
""
],
[
"Nguyen",
"Quang-Huy",
""
],
[
"Nguyen",
"Le-Minh",
""
],
[
"Phan",
"Xuan-Hieu",
""
]
] | Question answering (QA) in law is a challenging problem because legal documents are much more complicated than normal texts in terms of terminology, structure, and temporal and logical relationships. It is even more difficult to perform legal QA for low-resource languages like Vietnamese where labeled data are rare and... |
0712.2630 | Juan J. Merelo Pr. | Nestor Zorzano, Daniel Merino, J.L.J. Laredo, J.P. Sevilla, Pablo
Garcia, J.J. Merelo | Evolving XSLT stylesheets | First draft, preparing for WCCI 2008 | null | null | null | cs.NE cs.PL | null | This paper introduces a procedure based on genetic programming to evolve XSLT
programs (usually called stylesheets or logicsheets). XSLT is a general
purpose, document-oriented functional language, generally used to transform XML
documents (or, in general, solve any problem that can be coded as an XML
document). The ... | [
{
"created": "Mon, 17 Dec 2007 19:59:42 GMT",
"version": "v1"
}
] | 2007-12-18 | [
[
"Zorzano",
"Nestor",
""
],
[
"Merino",
"Daniel",
""
],
[
"Laredo",
"J. L. J.",
""
],
[
"Sevilla",
"J. P.",
""
],
[
"Garcia",
"Pablo",
""
],
[
"Merelo",
"J. J.",
""
]
] | This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented functional language, generally used to transform XML documents (or, in general, solve any problem that can be coded as an XML document). The pr... |
1012.4113 | Nadeem Javaid | Khaled Dridi, Nadeem Javaid, Karim Djouani, Boubaker Daachi | Performance Study of IEEE802.11e QoS in EDCF-Contention-based Static and
Dynamic Scenarios | 4 Pages | 2nd IEEE International Conference on Electronics, Circuits, and
Systems (ICECS)2009, Tunis | 10.1109/ICECS.2009.5410754 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we carry-out a study of the Quality of Service (QoS) mechanism
in IEEE802.11e Enhanced Distribution Coordination Function (EDCF) and how it is
achieved by providing traffics with different priorities. It can perform the
access to the radio channel or just simply it can considerably be declined
subseque... | [
{
"created": "Sat, 18 Dec 2010 19:38:58 GMT",
"version": "v1"
}
] | 2016-11-18 | [
[
"Dridi",
"Khaled",
""
],
[
"Javaid",
"Nadeem",
""
],
[
"Djouani",
"Karim",
""
],
[
"Daachi",
"Boubaker",
""
]
] | In this paper, we carry-out a study of the Quality of Service (QoS) mechanism in IEEE802.11e Enhanced Distribution Coordination Function (EDCF) and how it is achieved by providing traffics with different priorities. It can perform the access to the radio channel or just simply it can considerably be declined subsequent... |
1406.2631 | Mo Ghorbanzadeh | Mo Ghorbanzadeh, Ahmed Abdelhadi, Charles Clancy | A Utility Proportional Fairness Resource Allocation in Spectrally
Radar-Coexistent Cellular Networks | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spectrum sharing is an elegant solution to addressing the scarcity of the
bandwidth for wireless communications systems. This research studies the
feasibility of sharing the spectrum between sectorized cellular systems and
stationary radars interfering with certain sectors of the communications
infrastructure. It als... | [
{
"created": "Mon, 9 Jun 2014 19:08:46 GMT",
"version": "v1"
}
] | 2014-06-11 | [
[
"Ghorbanzadeh",
"Mo",
""
],
[
"Abdelhadi",
"Ahmed",
""
],
[
"Clancy",
"Charles",
""
]
] | Spectrum sharing is an elegant solution to addressing the scarcity of the bandwidth for wireless communications systems. This research studies the feasibility of sharing the spectrum between sectorized cellular systems and stationary radars interfering with certain sectors of the communications infrastructure. It also ... |
1203.4844 | Ernest Kurniawan | Ernest Kurniawan, Andrea Goldsmith, and Stefano Rini | Practical Coding Schemes for Cognitive Overlay Radios | Patent pending | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop practical coding schemes for the cognitive overlay radios as
modeled by the cognitive interference channel, a variation of the classical two
user interference channel where one of the transmitters has knowledge of both
messages. Inspired by information theoretical results, we develop a coding
strategy for ... | [
{
"created": "Wed, 21 Mar 2012 21:39:24 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Jun 2012 23:42:45 GMT",
"version": "v2"
}
] | 2012-06-12 | [
[
"Kurniawan",
"Ernest",
""
],
[
"Goldsmith",
"Andrea",
""
],
[
"Rini",
"Stefano",
""
]
] | We develop practical coding schemes for the cognitive overlay radios as modeled by the cognitive interference channel, a variation of the classical two user interference channel where one of the transmitters has knowledge of both messages. Inspired by information theoretical results, we develop a coding strategy for ea... |
2004.02220 | Mohammad Reza Zarrabi | Mohammad Reza Zarrabi, Nasrollah Moghaddam Charkari | Query-points visibility constraint minimum link paths in simple polygons | null | Fundamenta Informaticae, Volume 182, Issue 3 (November 18, 2021)
fi:8386 | 10.3233/FI-2021-2075 | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the query version of constrained minimum link paths between two
points inside a simple polygon $P$ with $n$ vertices such that there is at
least one point on the path, visible from a query point. The method is based on
partitioning $P$ into a number of faces of equal link distance from a point,
called a link... | [
{
"created": "Sun, 5 Apr 2020 14:47:17 GMT",
"version": "v1"
},
{
"created": "Tue, 5 May 2020 12:51:25 GMT",
"version": "v2"
},
{
"created": "Sun, 5 Jul 2020 09:14:27 GMT",
"version": "v3"
},
{
"created": "Mon, 25 Jan 2021 16:30:45 GMT",
"version": "v4"
},
{
"crea... | 2023-06-22 | [
[
"Zarrabi",
"Mohammad Reza",
""
],
[
"Charkari",
"Nasrollah Moghaddam",
""
]
] | We study the query version of constrained minimum link paths between two points inside a simple polygon $P$ with $n$ vertices such that there is at least one point on the path, visible from a query point. The method is based on partitioning $P$ into a number of faces of equal link distance from a point, called a link-b... |
1911.00852 | Masoud Mansoury | Masoud Mansoury, Himan Abdollahpouri, Joris Rombouts, Mykola
Pechenizkiy | The Relationship between the Consistency of Users' Ratings and
Recommendation Calibration | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fairness in recommender systems has recently received attention from
researchers. Unfair recommendations have negative impact on the effectiveness
of recommender systems as it may degrade users' satisfaction, loyalty, and at
worst, it can lead to or perpetuate undesirable social dynamics. One of the
factors that may ... | [
{
"created": "Sun, 3 Nov 2019 08:10:33 GMT",
"version": "v1"
}
] | 2019-11-05 | [
[
"Mansoury",
"Masoud",
""
],
[
"Abdollahpouri",
"Himan",
""
],
[
"Rombouts",
"Joris",
""
],
[
"Pechenizkiy",
"Mykola",
""
]
] | Fairness in recommender systems has recently received attention from researchers. Unfair recommendations have negative impact on the effectiveness of recommender systems as it may degrade users' satisfaction, loyalty, and at worst, it can lead to or perpetuate undesirable social dynamics. One of the factors that may im... |
2112.08726 | Peter West | Ximing Lu, Sean Welleck, Peter West, Liwei Jiang, Jungo Kasai, Daniel
Khashabi, Ronan Le Bras, Lianhui Qin, Youngjae Yu, Rowan Zellers, Noah A.
Smith, Yejin Choi | NeuroLogic A*esque Decoding: Constrained Text Generation with Lookahead
Heuristics | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | The dominant paradigm for neural text generation is left-to-right decoding
from autoregressive language models. Constrained or controllable generation
under complex lexical constraints, however, requires foresight to plan ahead
feasible future paths.
Drawing inspiration from the A* search algorithm, we propose Neur... | [
{
"created": "Thu, 16 Dec 2021 09:22:54 GMT",
"version": "v1"
}
] | 2021-12-17 | [
[
"Lu",
"Ximing",
""
],
[
"Welleck",
"Sean",
""
],
[
"West",
"Peter",
""
],
[
"Jiang",
"Liwei",
""
],
[
"Kasai",
"Jungo",
""
],
[
"Khashabi",
"Daniel",
""
],
[
"Bras",
"Ronan Le",
""
],
[
"Qin",
"... | The dominant paradigm for neural text generation is left-to-right decoding from autoregressive language models. Constrained or controllable generation under complex lexical constraints, however, requires foresight to plan ahead feasible future paths. Drawing inspiration from the A* search algorithm, we propose NeuroLog... |
1412.0315 | Guy Van den Broeck | Guy Van den Broeck and Mathias Niepert | Lifted Probabilistic Inference for Asymmetric Graphical Models | To appear in Proceedings of AAAI-2015 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Lifted probabilistic inference algorithms have been successfully applied to a
large number of symmetric graphical models. Unfortunately, the majority of
real-world graphical models is asymmetric. This is even the case for relational
representations when evidence is given. Therefore, more recent work in the
community ... | [
{
"created": "Mon, 1 Dec 2014 00:40:33 GMT",
"version": "v1"
}
] | 2014-12-02 | [
[
"Broeck",
"Guy Van den",
""
],
[
"Niepert",
"Mathias",
""
]
] | Lifted probabilistic inference algorithms have been successfully applied to a large number of symmetric graphical models. Unfortunately, the majority of real-world graphical models is asymmetric. This is even the case for relational representations when evidence is given. Therefore, more recent work in the community mo... |
1611.07629 | EPTCS | Grigory Fedyukovich (UW), Rastislav Bod\'ik (UW) | Approaching Symbolic Parallelization by Synthesis of Recurrence
Decompositions | In Proceedings SYNT 2016, arXiv:1611.07178 | EPTCS 229, 2016, pp. 55-66 | 10.4204/EPTCS.229.6 | null | cs.PL cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present GraSSP, a novel approach to perform automated parallelization
relying on recent advances in formal verification and synthesis. GraSSP
augments an existing sequential program with an additional functionality to
decompose data dependencies in loop iterations, to compute partial results, and
to compose them t... | [
{
"created": "Wed, 23 Nov 2016 03:28:09 GMT",
"version": "v1"
}
] | 2016-11-24 | [
[
"Fedyukovich",
"Grigory",
"",
"UW"
],
[
"Bodík",
"Rastislav",
"",
"UW"
]
] | We present GraSSP, a novel approach to perform automated parallelization relying on recent advances in formal verification and synthesis. GraSSP augments an existing sequential program with an additional functionality to decompose data dependencies in loop iterations, to compute partial results, and to compose them tog... |
2004.10024 | Haitian Zheng | Haitian Zheng, Haofu Liao, Lele Chen, Wei Xiong, Tianlang Chen, Jiebo
Luo | Example-Guided Image Synthesis across Arbitrary Scenes using Masked
Spatial-Channel Attention and Self-Supervision | 24 pages. arXiv admin note: substantial text overlap with
arXiv:1911.12362 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Example-guided image synthesis has recently been attempted to synthesize an
image from a semantic label map and an exemplary image. In the task, the
additional exemplar image provides the style guidance that controls the
appearance of the synthesized output. Despite the controllability advantage,
the existing models ... | [
{
"created": "Sat, 18 Apr 2020 18:17:40 GMT",
"version": "v1"
}
] | 2020-04-22 | [
[
"Zheng",
"Haitian",
""
],
[
"Liao",
"Haofu",
""
],
[
"Chen",
"Lele",
""
],
[
"Xiong",
"Wei",
""
],
[
"Chen",
"Tianlang",
""
],
[
"Luo",
"Jiebo",
""
]
] | Example-guided image synthesis has recently been attempted to synthesize an image from a semantic label map and an exemplary image. In the task, the additional exemplar image provides the style guidance that controls the appearance of the synthesized output. Despite the controllability advantage, the existing models ar... |
cs/0109014 | Janet van der Linden | Janet van der Linden (The Open University) | Assigning Satisfaction Values to Constraints: An Algorithm to Solve
Dynamic Meta-Constraints | 11 pages. Proceedings ERCIM WG on Constraints (Prague, June 2001) | null | null | null | cs.PL cs.AI | null | The model of Dynamic Meta-Constraints has special activity constraints which
can activate other constraints. It also has meta-constraints which range over
other constraints. An algorithm is presented in which constraints can be
assigned one of five different satisfaction values, which leads to the
assignment of domai... | [
{
"created": "Thu, 13 Sep 2001 11:03:18 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"van der Linden",
"Janet",
"",
"The Open University"
]
] | The model of Dynamic Meta-Constraints has special activity constraints which can activate other constraints. It also has meta-constraints which range over other constraints. An algorithm is presented in which constraints can be assigned one of five different satisfaction values, which leads to the assignment of domain ... |
1911.08217 | Huizhou Li | Chao Yang, Huizhou Li, Fangting Lin, Bin Jiang, Hao Zhao | Constrained R-CNN: A general image manipulation detection model | Accepted to IEEE International Conference on Multimedia and Expo
(ICME2020) | null | null | null | cs.CV cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, deep learning-based models have exhibited remarkable performance
for image manipulation detection. However, most of them suffer from poor
universality of handcrafted or predetermined features. Meanwhile, they only
focus on manipulation localization and overlook manipulation classification. To
address these ... | [
{
"created": "Tue, 19 Nov 2019 12:12:20 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Nov 2019 12:14:58 GMT",
"version": "v2"
},
{
"created": "Sun, 15 Mar 2020 11:01:38 GMT",
"version": "v3"
}
] | 2020-03-17 | [
[
"Yang",
"Chao",
""
],
[
"Li",
"Huizhou",
""
],
[
"Lin",
"Fangting",
""
],
[
"Jiang",
"Bin",
""
],
[
"Zhao",
"Hao",
""
]
] | Recently, deep learning-based models have exhibited remarkable performance for image manipulation detection. However, most of them suffer from poor universality of handcrafted or predetermined features. Meanwhile, they only focus on manipulation localization and overlook manipulation classification. To address these is... |
1810.04329 | Muhammad Hilman | Muhammad H. Hilman and Maria A. Rodriguez and Rajkumar Buyya | Task Runtime Prediction in Scientific Workflows Using an Online
Incremental Learning Approach | Accepted for presentation at main conference track of 11th IEEE/ACM
International Conference on Utility and Cloud Computing | null | 10.1109/UCC.2018.00018 | null | cs.DC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many algorithms in workflow scheduling and resource provisioning rely on the
performance estimation of tasks to produce a scheduling plan. A profiler that
is capable of modeling the execution of tasks and predicting their runtime
accurately, therefore, becomes an essential part of any Workflow Management
System (WMS)... | [
{
"created": "Wed, 10 Oct 2018 01:59:08 GMT",
"version": "v1"
}
] | 2019-03-01 | [
[
"Hilman",
"Muhammad H.",
""
],
[
"Rodriguez",
"Maria A.",
""
],
[
"Buyya",
"Rajkumar",
""
]
] | Many algorithms in workflow scheduling and resource provisioning rely on the performance estimation of tasks to produce a scheduling plan. A profiler that is capable of modeling the execution of tasks and predicting their runtime accurately, therefore, becomes an essential part of any Workflow Management System (WMS). ... |
2211.15944 | Samuel Kessler | Samuel Kessler, Mateusz Ostaszewski, Micha{\l} Bortkiewicz, Mateusz
\.Zarski, Maciej Wo{\l}czyk, Jack Parker-Holder, Stephen J. Roberts and Piotr
Mi{\l}o\'s | The Effectiveness of World Models for Continual Reinforcement Learning | Accepted at CoLLAs 2023, 21 pages, 15 figures | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | World models power some of the most efficient reinforcement learning
algorithms. In this work, we showcase that they can be harnessed for continual
learning - a situation when the agent faces changing environments. World models
typically employ a replay buffer for training, which can be naturally extended
to continua... | [
{
"created": "Tue, 29 Nov 2022 05:56:51 GMT",
"version": "v1"
},
{
"created": "Wed, 12 Jul 2023 22:46:47 GMT",
"version": "v2"
}
] | 2023-07-14 | [
[
"Kessler",
"Samuel",
""
],
[
"Ostaszewski",
"Mateusz",
""
],
[
"Bortkiewicz",
"Michał",
""
],
[
"Żarski",
"Mateusz",
""
],
[
"Wołczyk",
"Maciej",
""
],
[
"Parker-Holder",
"Jack",
""
],
[
"Roberts",
"Stephen J."... | World models power some of the most efficient reinforcement learning algorithms. In this work, we showcase that they can be harnessed for continual learning - a situation when the agent faces changing environments. World models typically employ a replay buffer for training, which can be naturally extended to continual ... |
1907.00657 | Jonathan Dong | Jonathan Dong, Mushegh Rafayelyan, Florent Krzakala, Sylvain Gigan | Optical Reservoir Computing using multiple light scattering for chaotic
systems prediction | null | IEEE Journal of Selected Topics in Quantum Electronics ( Volume:
26 , Issue: 1 , Jan.-Feb. 2020 ) | 10.1109/JSTQE.2019.2936281 | null | cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reservoir Computing is a relatively recent computational framework based on a
large Recurrent Neural Network with fixed weights. Many physical
implementations of Reservoir Computing have been proposed to improve speed and
energy efficiency. In this study, we report new advances in Optical Reservoir
Computing using mu... | [
{
"created": "Mon, 1 Jul 2019 11:11:41 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Aug 2019 17:42:23 GMT",
"version": "v2"
}
] | 2019-09-10 | [
[
"Dong",
"Jonathan",
""
],
[
"Rafayelyan",
"Mushegh",
""
],
[
"Krzakala",
"Florent",
""
],
[
"Gigan",
"Sylvain",
""
]
] | Reservoir Computing is a relatively recent computational framework based on a large Recurrent Neural Network with fixed weights. Many physical implementations of Reservoir Computing have been proposed to improve speed and energy efficiency. In this study, we report new advances in Optical Reservoir Computing using mult... |
2405.09801 | Zhiqi Li | Zhiqi Li, Barnab\'as B\"orcs\"ok, Duowen Chen, Yutong Sun, Bo Zhu,
Greg Turk | Lagrangian Covector Fluid with Free Surface | 10 pages, 17 figures, SIGGRAPH Conference Papers '24 | null | 10.1145/3641519.3657514 | null | cs.GR | http://creativecommons.org/licenses/by/4.0/ | This paper introduces a novel Lagrangian fluid solver based on covector flow
maps. We aim to address the challenges of establishing a robust flow-map solver
for incompressible fluids under complex boundary conditions. Our key idea is to
use particle trajectories to establish precise flow maps and tailor path
integral... | [
{
"created": "Thu, 16 May 2024 04:14:29 GMT",
"version": "v1"
}
] | 2024-05-17 | [
[
"Li",
"Zhiqi",
""
],
[
"Börcsök",
"Barnabás",
""
],
[
"Chen",
"Duowen",
""
],
[
"Sun",
"Yutong",
""
],
[
"Zhu",
"Bo",
""
],
[
"Turk",
"Greg",
""
]
] | This paper introduces a novel Lagrangian fluid solver based on covector flow maps. We aim to address the challenges of establishing a robust flow-map solver for incompressible fluids under complex boundary conditions. Our key idea is to use particle trajectories to establish precise flow maps and tailor path integrals ... |
2306.00435 | Chen Zhang | Chen Zhang, Jiuheng Lin, Xiao Liu, Yuxuan Lai, Yansong Feng, Dongyan
Zhao | How Many Answers Should I Give? An Empirical Study of Multi-Answer
Reading Comprehension | Findings of ACL 2023 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | The multi-answer phenomenon, where a question may have multiple answers
scattered in the document, can be well handled by humans but is challenging
enough for machine reading comprehension (MRC) systems. Despite recent progress
in multi-answer MRC, there lacks a systematic analysis of how this phenomenon
arises and h... | [
{
"created": "Thu, 1 Jun 2023 08:22:21 GMT",
"version": "v1"
}
] | 2023-06-02 | [
[
"Zhang",
"Chen",
""
],
[
"Lin",
"Jiuheng",
""
],
[
"Liu",
"Xiao",
""
],
[
"Lai",
"Yuxuan",
""
],
[
"Feng",
"Yansong",
""
],
[
"Zhao",
"Dongyan",
""
]
] | The multi-answer phenomenon, where a question may have multiple answers scattered in the document, can be well handled by humans but is challenging enough for machine reading comprehension (MRC) systems. Despite recent progress in multi-answer MRC, there lacks a systematic analysis of how this phenomenon arises and how... |
2105.02714 | Dvir Ginzburg | Dvir Ginzburg and Dan Raviv | Deep Weighted Consensus: Dense correspondence confidence maps for 3D
shape registration | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new paradigm for rigid alignment between point clouds based on
learnable weighted consensus which is robust to noise as well as the full
spectrum of the rotation group.
Current models, learnable or axiomatic, work well for constrained
orientations and limited noise levels, usually by an end-to-end lear... | [
{
"created": "Thu, 6 May 2021 14:27:59 GMT",
"version": "v1"
}
] | 2021-05-07 | [
[
"Ginzburg",
"Dvir",
""
],
[
"Raviv",
"Dan",
""
]
] | We present a new paradigm for rigid alignment between point clouds based on learnable weighted consensus which is robust to noise as well as the full spectrum of the rotation group. Current models, learnable or axiomatic, work well for constrained orientations and limited noise levels, usually by an end-to-end learner ... |
1912.10718 | Fang Aiqing | Aiqing Fang, Xinbo Zhao, Yanning Zhang | Cross-Modal Image Fusion Theory Guided by Subjective Visual Attention | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The human visual perception system has very strong robustness and contextual
awareness in a variety of image processing tasks. This robustness and the
perception ability of contextual awareness is closely related to the
characteristics of multi-task auxiliary learning and subjective attention of
the human visual perc... | [
{
"created": "Mon, 23 Dec 2019 10:29:34 GMT",
"version": "v1"
}
] | 2019-12-24 | [
[
"Fang",
"Aiqing",
""
],
[
"Zhao",
"Xinbo",
""
],
[
"Zhang",
"Yanning",
""
]
] | The human visual perception system has very strong robustness and contextual awareness in a variety of image processing tasks. This robustness and the perception ability of contextual awareness is closely related to the characteristics of multi-task auxiliary learning and subjective attention of the human visual percep... |
cs/0302014 | V. Sriram | Akshar Bharati, V.Sriram, A.Vamshi Krishna, Rajeev Sangal, S.M.Bendre | An Algorithm for Aligning Sentences in Bilingual Corpora Using Lexical
Information | 10 pages, 5 figures, Conference : International Conference on Natural
Language Processing ' 2002, Mumbai | null | null | null | cs.CL | null | In this paper we describe an algorithm for aligning sentences with their
translations in a bilingual corpus using lexical information of the languages.
Existing efficient algorithms ignore word identities and consider only the
sentence lengths (Brown, 1991; Gale and Church, 1993). For a sentence in the
source languag... | [
{
"created": "Wed, 12 Feb 2003 06:31:54 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Bharati",
"Akshar",
""
],
[
"Sriram",
"V.",
""
],
[
"Krishna",
"A. Vamshi",
""
],
[
"Sangal",
"Rajeev",
""
],
[
"Bendre",
"S. M.",
""
]
] | In this paper we describe an algorithm for aligning sentences with their translations in a bilingual corpus using lexical information of the languages. Existing efficient algorithms ignore word identities and consider only the sentence lengths (Brown, 1991; Gale and Church, 1993). For a sentence in the source language ... |
2401.12973 | Ekin Aky\"urek | Ekin Aky\"urek, Bailin Wang, Yoon Kim, Jacob Andreas | In-Context Language Learning: Architectures and Algorithms | Fixes a typo in the title, and adds additional references | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large-scale neural language models exhibit a remarkable capacity for
in-context learning (ICL): they can infer novel functions from datasets
provided as input. Most of our current understanding of when and how ICL arises
comes from LMs trained on extremely simple learning problems like linear
regression and associati... | [
{
"created": "Tue, 23 Jan 2024 18:59:21 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Jan 2024 18:59:34 GMT",
"version": "v2"
}
] | 2024-01-31 | [
[
"Akyürek",
"Ekin",
""
],
[
"Wang",
"Bailin",
""
],
[
"Kim",
"Yoon",
""
],
[
"Andreas",
"Jacob",
""
]
] | Large-scale neural language models exhibit a remarkable capacity for in-context learning (ICL): they can infer novel functions from datasets provided as input. Most of our current understanding of when and how ICL arises comes from LMs trained on extremely simple learning problems like linear regression and associative... |
2111.06959 | Rakesh John Amala Arokia Nathan | Rakesh John Amala Arokia Nathan, Indrajit Kurmi, David C. Schedl and
Oliver Bimber | Through-Foliage Tracking with Airborne Optical Sectioning | 9 Pages, 9 Figures, 1 Table and supplementary videos and material | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Detecting and tracking moving targets through foliage is difficult, and for
many cases even impossible in regular aerial images and videos. We present an
initial light-weight and drone-operated 1D camera array that supports parallel
synthetic aperture aerial imaging. Our main finding is that color anomaly
detection b... | [
{
"created": "Fri, 12 Nov 2021 21:54:25 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Nov 2021 08:51:47 GMT",
"version": "v2"
}
] | 2021-12-01 | [
[
"Nathan",
"Rakesh John Amala Arokia",
""
],
[
"Kurmi",
"Indrajit",
""
],
[
"Schedl",
"David C.",
""
],
[
"Bimber",
"Oliver",
""
]
] | Detecting and tracking moving targets through foliage is difficult, and for many cases even impossible in regular aerial images and videos. We present an initial light-weight and drone-operated 1D camera array that supports parallel synthetic aperture aerial imaging. Our main finding is that color anomaly detection ben... |
2104.07658 | Weidi Xie | Charig Yang, Hala Lamdouar, Erika Lu, Andrew Zisserman, Weidi Xie | Self-supervised Video Object Segmentation by Motion Grouping | Best Paper in CVPR2021 RVSU Workshop. Accepted by ICCV | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Animals have evolved highly functional visual systems to understand motion,
assisting perception even under complex environments. In this paper, we work
towards developing a computer vision system able to segment objects by
exploiting motion cues, i.e. motion segmentation. We make the following
contributions: First, ... | [
{
"created": "Thu, 15 Apr 2021 17:59:32 GMT",
"version": "v1"
},
{
"created": "Wed, 11 Aug 2021 09:56:30 GMT",
"version": "v2"
}
] | 2021-08-12 | [
[
"Yang",
"Charig",
""
],
[
"Lamdouar",
"Hala",
""
],
[
"Lu",
"Erika",
""
],
[
"Zisserman",
"Andrew",
""
],
[
"Xie",
"Weidi",
""
]
] | Animals have evolved highly functional visual systems to understand motion, assisting perception even under complex environments. In this paper, we work towards developing a computer vision system able to segment objects by exploiting motion cues, i.e. motion segmentation. We make the following contributions: First, we... |
1009.4563 | Ayyasamy S | S.Ayyasamy and S.N. Sivanandam | A Cluster Based Replication Architecture for Load Balancing in
Peer-to-Peer Content Distribution | 15 pages, 8 figures | International Journal of Computer Networks & Communications
(IJCNC) Vol.2, No.5, September 2010 | 10.5121/ijcnc.2010.2510 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In P2P systems, large volumes of data are declustered naturally across a
large number of peers. But it is very difficult to control the initial data
distribution because every user has the freedom to share any data with other
users. The system scalability can be improved by distributing the load across
multiple serve... | [
{
"created": "Thu, 23 Sep 2010 10:24:53 GMT",
"version": "v1"
}
] | 2010-09-24 | [
[
"Ayyasamy",
"S.",
""
],
[
"Sivanandam",
"S. N.",
""
]
] | In P2P systems, large volumes of data are declustered naturally across a large number of peers. But it is very difficult to control the initial data distribution because every user has the freedom to share any data with other users. The system scalability can be improved by distributing the load across multiple servers... |
cs/0611065 | Milton Chowdhury | M. M. Chowdhury | On the security of new key exchange protocols based on the triple
decomposition problem | This figures are given in the other version | null | null | null | cs.CR | null | We show that two new key exchange protocols with security based on the triple
DP may have security based on the MSCSP.
| [
{
"created": "Tue, 14 Nov 2006 23:54:56 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Dec 2006 10:50:57 GMT",
"version": "v2"
},
{
"created": "Thu, 6 Dec 2007 17:43:37 GMT",
"version": "v3"
}
] | 2007-12-06 | [
[
"Chowdhury",
"M. M.",
""
]
] | We show that two new key exchange protocols with security based on the triple DP may have security based on the MSCSP. |
2212.03467 | Christopher Jerrett | Yue Han, Christopher Jerrett, Elliot Anshelevich | Optimizing Multiple Simultaneous Objectives for Voting and Facility
Location | To be published in the Proceedings of 37th Conference on Artificial
Intelligence (AAAI 2023) | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the classic facility location setting, where we are given $n$
clients and $m$ possible facility locations in some arbitrary metric space, and
want to choose a location to build a facility. The exact same setting also
arises in spatial social choice, where voters are the clients and the goal is
to choose a ca... | [
{
"created": "Wed, 7 Dec 2022 05:12:40 GMT",
"version": "v1"
},
{
"created": "Sat, 10 Dec 2022 18:01:15 GMT",
"version": "v2"
}
] | 2022-12-13 | [
[
"Han",
"Yue",
""
],
[
"Jerrett",
"Christopher",
""
],
[
"Anshelevich",
"Elliot",
""
]
] | We study the classic facility location setting, where we are given $n$ clients and $m$ possible facility locations in some arbitrary metric space, and want to choose a location to build a facility. The exact same setting also arises in spatial social choice, where voters are the clients and the goal is to choose a cand... |
1504.04428 | Bo Zhou | Bo Zhou, Ying Cui and Meixia Tao | Optimal Dynamic Multicast Scheduling for Cache-Enabled Content-Centric
Wireless Networks | 17 double-column pages; Shorter version appears in ISIT 2015 | null | null | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Caching and multicasting at base stations are two promising approaches to
support massive content delivery over wireless networks. However, existing
scheduling designs do not make full use of the advantages of the two
approaches. In this paper, we consider the optimal dynamic multicast scheduling
to jointly minimize ... | [
{
"created": "Fri, 17 Apr 2015 02:52:45 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Apr 2015 10:55:13 GMT",
"version": "v2"
},
{
"created": "Wed, 24 Feb 2016 01:15:52 GMT",
"version": "v3"
}
] | 2016-02-25 | [
[
"Zhou",
"Bo",
""
],
[
"Cui",
"Ying",
""
],
[
"Tao",
"Meixia",
""
]
] | Caching and multicasting at base stations are two promising approaches to support massive content delivery over wireless networks. However, existing scheduling designs do not make full use of the advantages of the two approaches. In this paper, we consider the optimal dynamic multicast scheduling to jointly minimize th... |
2306.01762 | Yujian Li | Kai Wu, Yujian Betterest Li, Jian Lou, Xiaoyu Zhang, Handing Wang,
Jing Liu | Pre-trained transformer for adversarial purification | null | null | null | null | cs.CR cs.AI cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With more and more deep neural networks being deployed as various daily
services, their reliability is essential. It is frightening that deep neural
networks are vulnerable and sensitive to adversarial attacks, the most common
one of which for the services is evasion-based. Recent works usually strengthen
the robustn... | [
{
"created": "Sat, 27 May 2023 06:00:51 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Aug 2023 04:53:15 GMT",
"version": "v2"
},
{
"created": "Mon, 25 Sep 2023 04:21:57 GMT",
"version": "v3"
}
] | 2023-09-27 | [
[
"Wu",
"Kai",
""
],
[
"Li",
"Yujian Betterest",
""
],
[
"Lou",
"Jian",
""
],
[
"Zhang",
"Xiaoyu",
""
],
[
"Wang",
"Handing",
""
],
[
"Liu",
"Jing",
""
]
] | With more and more deep neural networks being deployed as various daily services, their reliability is essential. It is frightening that deep neural networks are vulnerable and sensitive to adversarial attacks, the most common one of which for the services is evasion-based. Recent works usually strengthen the robustnes... |
2112.01523 | Benjamin Attal | Benjamin Attal, Jia-Bin Huang, Michael Zollhoefer, Johannes Kopf,
Changil Kim | Learning Neural Light Fields with Ray-Space Embedding Networks | CVPR 2022 camera ready revision. Major changes include: 1. Additional
comparison to NeX on Stanford, RealFF, Shiny datasets 2. Experiment on 360
degree lego bulldozer scene in the appendix, using Pluecker parameterization
3. Moving student-teacher results to the appendix 4. Clarity edits -- in
particular, makin... | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Neural radiance fields (NeRFs) produce state-of-the-art view synthesis
results. However, they are slow to render, requiring hundreds of network
evaluations per pixel to approximate a volume rendering integral. Baking NeRFs
into explicit data structures enables efficient rendering, but results in a
large increase in m... | [
{
"created": "Thu, 2 Dec 2021 18:59:51 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Dec 2021 17:45:14 GMT",
"version": "v2"
},
{
"created": "Tue, 10 May 2022 17:02:28 GMT",
"version": "v3"
}
] | 2022-05-11 | [
[
"Attal",
"Benjamin",
""
],
[
"Huang",
"Jia-Bin",
""
],
[
"Zollhoefer",
"Michael",
""
],
[
"Kopf",
"Johannes",
""
],
[
"Kim",
"Changil",
""
]
] | Neural radiance fields (NeRFs) produce state-of-the-art view synthesis results. However, they are slow to render, requiring hundreds of network evaluations per pixel to approximate a volume rendering integral. Baking NeRFs into explicit data structures enables efficient rendering, but results in a large increase in mem... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.