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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2311.17776 | Gen Li | Gen Li, Deqing Sun, Laura Sevilla-Lara, Varun Jampani | One-Shot Open Affordance Learning with Foundation Models | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce One-shot Open Affordance Learning (OOAL), where a model is
trained with just one example per base object category, but is expected to
identify novel objects and affordances. While vision-language models excel at
recognizing novel objects and scenes, they often struggle to understand finer
levels of granu... | [
{
"created": "Wed, 29 Nov 2023 16:23:06 GMT",
"version": "v1"
}
] | 2023-11-30 | [
[
"Li",
"Gen",
""
],
[
"Sun",
"Deqing",
""
],
[
"Sevilla-Lara",
"Laura",
""
],
[
"Jampani",
"Varun",
""
]
] | We introduce One-shot Open Affordance Learning (OOAL), where a model is trained with just one example per base object category, but is expected to identify novel objects and affordances. While vision-language models excel at recognizing novel objects and scenes, they often struggle to understand finer levels of granula... |
2311.11666 | Haiyang Ying | Haiyang Ying, Yixuan Yin, Jinzhi Zhang, Fan Wang, Tao Yu, Ruqi Huang,
Lu Fang | OmniSeg3D: Omniversal 3D Segmentation via Hierarchical Contrastive
Learning | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Towards holistic understanding of 3D scenes, a general 3D segmentation method
is needed that can segment diverse objects without restrictions on object
quantity or categories, while also reflecting the inherent hierarchical
structure. To achieve this, we propose OmniSeg3D, an omniversal segmentation
method aims for s... | [
{
"created": "Mon, 20 Nov 2023 11:04:59 GMT",
"version": "v1"
}
] | 2023-11-21 | [
[
"Ying",
"Haiyang",
""
],
[
"Yin",
"Yixuan",
""
],
[
"Zhang",
"Jinzhi",
""
],
[
"Wang",
"Fan",
""
],
[
"Yu",
"Tao",
""
],
[
"Huang",
"Ruqi",
""
],
[
"Fang",
"Lu",
""
]
] | Towards holistic understanding of 3D scenes, a general 3D segmentation method is needed that can segment diverse objects without restrictions on object quantity or categories, while also reflecting the inherent hierarchical structure. To achieve this, we propose OmniSeg3D, an omniversal segmentation method aims for seg... |
2204.09996 | Velko Vechev | Velko Vechev, Juan Zarate, Bernhard Thomaszewski, Otmar Hilliges | Computational Design of Kinesthetic Garments | null | null | null | null | cs.GR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Kinesthetic garments provide physical feedback on body posture and motion
through tailored distributions of reinforced material. Their ability to
selectively stiffen a garment's response to specific motions makes them
appealing for rehabilitation, sports, robotics, and many other application
fields. However, finding ... | [
{
"created": "Thu, 21 Apr 2022 09:41:22 GMT",
"version": "v1"
}
] | 2022-04-22 | [
[
"Vechev",
"Velko",
""
],
[
"Zarate",
"Juan",
""
],
[
"Thomaszewski",
"Bernhard",
""
],
[
"Hilliges",
"Otmar",
""
]
] | Kinesthetic garments provide physical feedback on body posture and motion through tailored distributions of reinforced material. Their ability to selectively stiffen a garment's response to specific motions makes them appealing for rehabilitation, sports, robotics, and many other application fields. However, finding de... |
1603.08777 | Wolfgang Mulzer | Pat Morin, Wolfgang Mulzer, Tommy Reddad | Encoding Arguments | 50 pages, 7 figures | ACM Computing Surveys (CSUR), 50(3), July 2017, Article 46 | 10.1145/3084288 | null | cs.IT cs.DS math.IT math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many proofs in discrete mathematics and theoretical computer science are
based on the probabilistic method. To prove the existence of a good object, we
pick a random object and show that it is bad with low probability. This method
is effective, but the underlying probabilistic machinery can be daunting.
"Encoding arg... | [
{
"created": "Tue, 29 Mar 2016 14:10:43 GMT",
"version": "v1"
},
{
"created": "Mon, 15 May 2017 13:36:55 GMT",
"version": "v2"
}
] | 2017-08-01 | [
[
"Morin",
"Pat",
""
],
[
"Mulzer",
"Wolfgang",
""
],
[
"Reddad",
"Tommy",
""
]
] | Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is effective, but the underlying probabilistic machinery can be daunting. "Encoding argum... |
1606.01750 | Tengda Ying | Tengda Ying, Wenjiang Feng, Weifeng Su, and Weiheng Jiang | On the Degrees of Freedom of MIMO X Networks with Non-Cooperation
Transmitters | version 2, 31 pages, 7 figures, submitted | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to limited backhaul/feedback link capacity and channel state information
(CSI) feedback delay, obtaining global and instantaneous channel state
information at the transmitter (CSIT) is a main obstacle in practice. In this
paper, novel transmission schemes are proposed for a class of interference
networks that can... | [
{
"created": "Mon, 6 Jun 2016 14:04:26 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Aug 2016 09:17:29 GMT",
"version": "v2"
}
] | 2016-08-15 | [
[
"Ying",
"Tengda",
""
],
[
"Feng",
"Wenjiang",
""
],
[
"Su",
"Weifeng",
""
],
[
"Jiang",
"Weiheng",
""
]
] | Due to limited backhaul/feedback link capacity and channel state information (CSI) feedback delay, obtaining global and instantaneous channel state information at the transmitter (CSIT) is a main obstacle in practice. In this paper, novel transmission schemes are proposed for a class of interference networks that can a... |
2007.12829 | Guo Zhong | Shi-Xun Lina, Guo Zhongb, Ting Shu | Joint Featurewise Weighting and Lobal Structure Learning for Multi-view
Subspace Clustering | null | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-view clustering integrates multiple feature sets, which reveal distinct
aspects of the data and provide complementary information to each other, to
improve the clustering performance. It remains challenging to effectively
exploit complementary information across multiple views since the original data
often cont... | [
{
"created": "Sat, 25 Jul 2020 01:57:57 GMT",
"version": "v1"
}
] | 2020-07-28 | [
[
"Lina",
"Shi-Xun",
""
],
[
"Zhongb",
"Guo",
""
],
[
"Shu",
"Ting",
""
]
] | Multi-view clustering integrates multiple feature sets, which reveal distinct aspects of the data and provide complementary information to each other, to improve the clustering performance. It remains challenging to effectively exploit complementary information across multiple views since the original data often contai... |
2107.11245 | Fei Zhang | Fei Zhang, Chaochen Gu, and Feng Yang | An Improved Algorithm of Robot Path Planning in Complex Environment
Based on Double DQN | Accepted in International Conference on Guidance, Navigation and
Control,2020 | null | null | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Q Network (DQN) has several limitations when applied in planning a path
in environment with a number of dilemmas according to our experiment. The
reward function may be hard to model, and successful experience transitions are
difficult to find in experience replay. In this context, this paper proposes an
improve... | [
{
"created": "Fri, 23 Jul 2021 14:03:04 GMT",
"version": "v1"
}
] | 2021-07-26 | [
[
"Zhang",
"Fei",
""
],
[
"Gu",
"Chaochen",
""
],
[
"Yang",
"Feng",
""
]
] | Deep Q Network (DQN) has several limitations when applied in planning a path in environment with a number of dilemmas according to our experiment. The reward function may be hard to model, and successful experience transitions are difficult to find in experience replay. In this context, this paper proposes an improved ... |
2010.08390 | Eleni Bohacek | Eleni Bohacek, Andrew J. Coates, David R. Selviah | Volumetric Calculation of Quantization Error in 3-D Vision Systems | As submitted to IEEE Transactions on Pattern Analysis and Machine
Intelligence on 4th September 2020 | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates how the inherent quantization of camera sensors
introduces uncertainty in the calculated position of an observed feature during
3-D mapping. It is typically assumed that pixels and scene features are points,
however, a pixel is a two-dimensional area that maps onto multiple points in
the scene... | [
{
"created": "Fri, 16 Oct 2020 13:48:30 GMT",
"version": "v1"
}
] | 2020-10-19 | [
[
"Bohacek",
"Eleni",
""
],
[
"Coates",
"Andrew J.",
""
],
[
"Selviah",
"David R.",
""
]
] | This paper investigates how the inherent quantization of camera sensors introduces uncertainty in the calculated position of an observed feature during 3-D mapping. It is typically assumed that pixels and scene features are points, however, a pixel is a two-dimensional area that maps onto multiple points in the scene. ... |
2403.05110 | Jensen Gao | Jensen Gao, Annie Xie, Ted Xiao, Chelsea Finn, Dorsa Sadigh | Efficient Data Collection for Robotic Manipulation via Compositional
Generalization | RSS 2024 | null | null | null | cs.RO cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data collection has become an increasingly important problem in robotic
manipulation, yet there still lacks much understanding of how to effectively
collect data to facilitate broad generalization. Recent works on large-scale
robotic data collection typically vary many environmental factors of variation
(e.g., object... | [
{
"created": "Fri, 8 Mar 2024 07:15:38 GMT",
"version": "v1"
},
{
"created": "Tue, 21 May 2024 14:18:47 GMT",
"version": "v2"
}
] | 2024-05-22 | [
[
"Gao",
"Jensen",
""
],
[
"Xie",
"Annie",
""
],
[
"Xiao",
"Ted",
""
],
[
"Finn",
"Chelsea",
""
],
[
"Sadigh",
"Dorsa",
""
]
] | Data collection has become an increasingly important problem in robotic manipulation, yet there still lacks much understanding of how to effectively collect data to facilitate broad generalization. Recent works on large-scale robotic data collection typically vary many environmental factors of variation (e.g., object t... |
1606.03369 | Thiago Vallin Spina PhD | Thiago Vallin Spina and Alexandre Xavier Falc\~ao | FOMTrace: Interactive Video Segmentation By Image Graphs and Fuzzy
Object Models | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Common users have changed from mere consumers to active producers of
multimedia data content. Video editing plays an important role in this
scenario, calling for simple segmentation tools that can handle fast-moving and
deformable video objects with possible occlusions, color similarities with the
background, among o... | [
{
"created": "Fri, 10 Jun 2016 15:30:30 GMT",
"version": "v1"
}
] | 2016-06-13 | [
[
"Spina",
"Thiago Vallin",
""
],
[
"Falcão",
"Alexandre Xavier",
""
]
] | Common users have changed from mere consumers to active producers of multimedia data content. Video editing plays an important role in this scenario, calling for simple segmentation tools that can handle fast-moving and deformable video objects with possible occlusions, color similarities with the background, among oth... |
1806.09472 | Andreas Brandstadt | Andreas Brandst\"adt, Raffaele Mosca | Maximum Weight Independent Sets for ($S_{1,2,4}$,Triangle)-Free Graphs
in Polynomial Time | arXiv admin note: substantial text overlap with arXiv:1511.08066 | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs
with vertex weights asks for a set of pairwise nonadjacent vertices of maximum
weight sum. MWIS is one of the most investigated and most important algorithmic
graph problems; it is well known to be NP-complete, and it remains NP-complete
ev... | [
{
"created": "Fri, 22 Jun 2018 13:57:55 GMT",
"version": "v1"
},
{
"created": "Fri, 11 Jan 2019 15:12:21 GMT",
"version": "v2"
}
] | 2019-01-14 | [
[
"Brandstädt",
"Andreas",
""
],
[
"Mosca",
"Raffaele",
""
]
] | The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum weight sum. MWIS is one of the most investigated and most important algorithmic graph problems; it is well known to be NP-complete, and it remains NP-complete even... |
2210.07800 | Samrat Mukhopadhyay | Samrat Mukhopadhyay and Himanshu Bhusan Mishra | Multiple Choice Hard Thresholding Pursuit (MCHTP) for Simultaneous
Sparse Recovery and Sparsity Order Estimation | 9 pages, 4 figures, tech-report | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We address the problem of sparse recovery using greedy compressed sensing
recovery algorithms, without explicit knowledge of the sparsity. Estimating the
sparsity order is a crucial problem in many practical scenarios, e.g., wireless
communications, where exact value of the sparsity order of the unknown channel
may b... | [
{
"created": "Fri, 14 Oct 2022 13:30:36 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Oct 2022 12:50:24 GMT",
"version": "v2"
}
] | 2022-10-26 | [
[
"Mukhopadhyay",
"Samrat",
""
],
[
"Mishra",
"Himanshu Bhusan",
""
]
] | We address the problem of sparse recovery using greedy compressed sensing recovery algorithms, without explicit knowledge of the sparsity. Estimating the sparsity order is a crucial problem in many practical scenarios, e.g., wireless communications, where exact value of the sparsity order of the unknown channel may be ... |
2405.01435 | Jean P. Martins | Jean Martins and Igor Almeida and Ricardo Souza and Silvia Lins | Closed-form congestion control via deep symbolic regression | null | null | null | null | cs.NI cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | As mobile networks embrace the 5G era, the interest in adopting Reinforcement
Learning (RL) algorithms to handle challenges in ultra-low-latency and high
throughput scenarios increases. Simultaneously, the advent of packetized
fronthaul networks imposes demanding requirements that traditional congestion
control mecha... | [
{
"created": "Thu, 28 Mar 2024 14:31:37 GMT",
"version": "v1"
}
] | 2024-05-03 | [
[
"Martins",
"Jean",
""
],
[
"Almeida",
"Igor",
""
],
[
"Souza",
"Ricardo",
""
],
[
"Lins",
"Silvia",
""
]
] | As mobile networks embrace the 5G era, the interest in adopting Reinforcement Learning (RL) algorithms to handle challenges in ultra-low-latency and high throughput scenarios increases. Simultaneously, the advent of packetized fronthaul networks imposes demanding requirements that traditional congestion control mechani... |
2111.12449 | Le Yang | Le Yang, Junwei Han, Tao Zhao, Tianwei Lin, Dingwen Zhang, Jianxin
Chen | Background-Click Supervision for Temporal Action Localization | To appear at TPAMI | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Weakly supervised temporal action localization aims at learning the
instance-level action pattern from the video-level labels, where a significant
challenge is action-context confusion. To overcome this challenge, one recent
work builds an action-click supervision framework. It requires similar
annotation costs but c... | [
{
"created": "Wed, 24 Nov 2021 12:02:52 GMT",
"version": "v1"
}
] | 2021-11-25 | [
[
"Yang",
"Le",
""
],
[
"Han",
"Junwei",
""
],
[
"Zhao",
"Tao",
""
],
[
"Lin",
"Tianwei",
""
],
[
"Zhang",
"Dingwen",
""
],
[
"Chen",
"Jianxin",
""
]
] | Weakly supervised temporal action localization aims at learning the instance-level action pattern from the video-level labels, where a significant challenge is action-context confusion. To overcome this challenge, one recent work builds an action-click supervision framework. It requires similar annotation costs but can... |
1803.05355 | James Thorne | James Thorne, Andreas Vlachos, Christos Christodoulopoulos and Arpit
Mittal | FEVER: a large-scale dataset for Fact Extraction and VERification | Updated version of NAACL2018 paper. Data is released on
http://fever.ai | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we introduce a new publicly available dataset for verification
against textual sources, FEVER: Fact Extraction and VERification. It consists
of 185,445 claims generated by altering sentences extracted from Wikipedia and
subsequently verified without knowledge of the sentence they were derived from.
The ... | [
{
"created": "Wed, 14 Mar 2018 15:30:37 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Apr 2018 23:08:25 GMT",
"version": "v2"
},
{
"created": "Tue, 18 Dec 2018 10:58:20 GMT",
"version": "v3"
}
] | 2018-12-19 | [
[
"Thorne",
"James",
""
],
[
"Vlachos",
"Andreas",
""
],
[
"Christodoulopoulos",
"Christos",
""
],
[
"Mittal",
"Arpit",
""
]
] | In this paper we introduce a new publicly available dataset for verification against textual sources, FEVER: Fact Extraction and VERification. It consists of 185,445 claims generated by altering sentences extracted from Wikipedia and subsequently verified without knowledge of the sentence they were derived from. The cl... |
2003.01515 | Ziqi Liu | Ziqi Liu, Dong Wang, Qianyu Yu, Zhiqiang Zhang, Yue Shen, Jian Ma,
Wenliang Zhong, Jinjie Gu, Jun Zhou, Shuang Yang, Yuan Qi | Graph Representation Learning for Merchant Incentive Optimization in
Mobile Payment Marketing | null | null | null | null | cs.SI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile payment such as Alipay has been widely used in our daily lives. To
further promote the mobile payment activities, it is important to run marketing
campaigns under a limited budget by providing incentives such as coupons,
commissions to merchants. As a result, incentive optimization is the key to
maximizing the... | [
{
"created": "Thu, 27 Feb 2020 18:48:55 GMT",
"version": "v1"
}
] | 2020-03-04 | [
[
"Liu",
"Ziqi",
""
],
[
"Wang",
"Dong",
""
],
[
"Yu",
"Qianyu",
""
],
[
"Zhang",
"Zhiqiang",
""
],
[
"Shen",
"Yue",
""
],
[
"Ma",
"Jian",
""
],
[
"Zhong",
"Wenliang",
""
],
[
"Gu",
"Jinjie",
... | Mobile payment such as Alipay has been widely used in our daily lives. To further promote the mobile payment activities, it is important to run marketing campaigns under a limited budget by providing incentives such as coupons, commissions to merchants. As a result, incentive optimization is the key to maximizing the c... |
2205.14790 | Orestis Papadigenopoulos | Orestis Papadigenopoulos, Constantine Caramanis, Sanjay Shakkottai | Non-Stationary Bandits under Recharging Payoffs: Improved Planning with
Sublinear Regret | Accepted for publication to NeurIPS 2022 | null | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The stochastic multi-armed bandit setting has been recently studied in the
non-stationary regime, where the mean payoff of each action is a non-decreasing
function of the number of rounds passed since it was last played. This model
captures natural behavioral aspects of the users which crucially determine the
perform... | [
{
"created": "Sun, 29 May 2022 23:55:36 GMT",
"version": "v1"
},
{
"created": "Wed, 12 Oct 2022 04:19:27 GMT",
"version": "v2"
}
] | 2022-10-13 | [
[
"Papadigenopoulos",
"Orestis",
""
],
[
"Caramanis",
"Constantine",
""
],
[
"Shakkottai",
"Sanjay",
""
]
] | The stochastic multi-armed bandit setting has been recently studied in the non-stationary regime, where the mean payoff of each action is a non-decreasing function of the number of rounds passed since it was last played. This model captures natural behavioral aspects of the users which crucially determine the performan... |
2012.15231 | Ivan Letteri | Ivan Letteri, Antonio Di Cecco, Abeer Dyoub, Giuseppe Della Penna | A Novel Resampling Technique for Imbalanced Dataset Optimization | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Despite the enormous amount of data, particular events of interest can still
be quite rare. Classification of rare events is a common problem in many
domains, such as fraudulent transactions, malware traffic analysis and network
intrusion detection. Many studies have been developed for malware detection
using machine... | [
{
"created": "Wed, 30 Dec 2020 17:17:08 GMT",
"version": "v1"
}
] | 2021-01-01 | [
[
"Letteri",
"Ivan",
""
],
[
"Di Cecco",
"Antonio",
""
],
[
"Dyoub",
"Abeer",
""
],
[
"Della Penna",
"Giuseppe",
""
]
] | Despite the enormous amount of data, particular events of interest can still be quite rare. Classification of rare events is a common problem in many domains, such as fraudulent transactions, malware traffic analysis and network intrusion detection. Many studies have been developed for malware detection using machine l... |
1907.00240 | Dennis Soemers | Matthew Stephenson, \'Eric Piette, Dennis J. N. J. Soemers, Cameron
Browne | An Overview of the Ludii General Game System | Accepted at the IEEE Conference on Games (CoG) 2019 (Demo paper) | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Digital Ludeme Project (DLP) aims to reconstruct and analyse over 1000
traditional strategy games using modern techniques. One of the key aspects of
this project is the development of Ludii, a general game system that will be
able to model and play the complete range of games required by this project.
Such an und... | [
{
"created": "Sat, 29 Jun 2019 17:16:27 GMT",
"version": "v1"
}
] | 2019-07-02 | [
[
"Stephenson",
"Matthew",
""
],
[
"Piette",
"Éric",
""
],
[
"Soemers",
"Dennis J. N. J.",
""
],
[
"Browne",
"Cameron",
""
]
] | The Digital Ludeme Project (DLP) aims to reconstruct and analyse over 1000 traditional strategy games using modern techniques. One of the key aspects of this project is the development of Ludii, a general game system that will be able to model and play the complete range of games required by this project. Such an under... |
1812.01570 | Yang Liu | Yang Liu, Wenwu Wang, Volkan Kilic | Intensity Particle Flow SMC-PHD Filter For Audio Speaker Tracking | In Proceedings of the LOCATA Challenge Workshop - a satellite event
of IWAENC 2018 (arXiv:1811.08482 ) | null | null | LOCATAchallenge/2018/04 | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Non-zero diffusion particle flow Sequential Monte Carlo probability
hypothesis density (NPF-SMC-PHD) filtering has been recently introduced for
multi-speaker tracking. However, the NPF does not consider the missing
detection which plays a key role in estimation of the number of speakers with
their states. To address ... | [
{
"created": "Tue, 4 Dec 2018 18:20:27 GMT",
"version": "v1"
}
] | 2018-12-05 | [
[
"Liu",
"Yang",
""
],
[
"Wang",
"Wenwu",
""
],
[
"Kilic",
"Volkan",
""
]
] | Non-zero diffusion particle flow Sequential Monte Carlo probability hypothesis density (NPF-SMC-PHD) filtering has been recently introduced for multi-speaker tracking. However, the NPF does not consider the missing detection which plays a key role in estimation of the number of speakers with their states. To address th... |
2406.05064 | Subhojyoti Mukherjee | Subhojyoti Mukherjee, Josiah P. Hanna, Qiaomin Xie, Robert Nowak | Pretraining Decision Transformers with Reward Prediction for In-Context
Multi-task Structured Bandit Learning | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | In this paper, we study multi-task structured bandit problem where the goal
is to learn a near-optimal algorithm that minimizes cumulative regret. The
tasks share a common structure and the algorithm exploits the shared structure
to minimize the cumulative regret for an unseen but related test task. We use a
transfor... | [
{
"created": "Fri, 7 Jun 2024 16:34:31 GMT",
"version": "v1"
}
] | 2024-06-10 | [
[
"Mukherjee",
"Subhojyoti",
""
],
[
"Hanna",
"Josiah P.",
""
],
[
"Xie",
"Qiaomin",
""
],
[
"Nowak",
"Robert",
""
]
] | In this paper, we study multi-task structured bandit problem where the goal is to learn a near-optimal algorithm that minimizes cumulative regret. The tasks share a common structure and the algorithm exploits the shared structure to minimize the cumulative regret for an unseen but related test task. We use a transforme... |
2309.10289 | Aocheng Shen | Zhiyi Huang, Hanrui Jiang, Aocheng Shen, Junkai Song, Zhiang Wu,
Qiankun Zhang | Online Matching with Stochastic Rewards: Advanced Analyses Using
Configuration Linear Programs | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mehta and Panigrahi (2012) proposed Online Matching with Stochastic Rewards,
which generalizes the Online Bipartite Matching problem of Karp, Vazirani, and
Vazirani (1990) by associating the edges with success probabilities. This new
feature captures the pay-per-click model in online advertising. Recently, Huang
and ... | [
{
"created": "Tue, 19 Sep 2023 03:35:06 GMT",
"version": "v1"
}
] | 2023-09-20 | [
[
"Huang",
"Zhiyi",
""
],
[
"Jiang",
"Hanrui",
""
],
[
"Shen",
"Aocheng",
""
],
[
"Song",
"Junkai",
""
],
[
"Wu",
"Zhiang",
""
],
[
"Zhang",
"Qiankun",
""
]
] | Mehta and Panigrahi (2012) proposed Online Matching with Stochastic Rewards, which generalizes the Online Bipartite Matching problem of Karp, Vazirani, and Vazirani (1990) by associating the edges with success probabilities. This new feature captures the pay-per-click model in online advertising. Recently, Huang and Zh... |
2009.01456 | Minhyuk Sung | Minhyuk Sung, Zhenyu Jiang, Panos Achlioptas, Niloy J. Mitra, Leonidas
J. Guibas | DeformSyncNet: Deformation Transfer via Synchronized Shape Deformation
Spaces | SIGGRAPH Asia 2020 | null | null | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Shape deformation is an important component in any geometry processing
toolbox. The goal is to enable intuitive deformations of single or multiple
shapes or to transfer example deformations to new shapes while preserving the
plausibility of the deformed shape(s). Existing approaches assume access to
point-level or pa... | [
{
"created": "Thu, 3 Sep 2020 05:26:32 GMT",
"version": "v1"
}
] | 2020-09-04 | [
[
"Sung",
"Minhyuk",
""
],
[
"Jiang",
"Zhenyu",
""
],
[
"Achlioptas",
"Panos",
""
],
[
"Mitra",
"Niloy J.",
""
],
[
"Guibas",
"Leonidas J.",
""
]
] | Shape deformation is an important component in any geometry processing toolbox. The goal is to enable intuitive deformations of single or multiple shapes or to transfer example deformations to new shapes while preserving the plausibility of the deformed shape(s). Existing approaches assume access to point-level or part... |
1904.04090 | Thorsten Wissmann | J. Leroux and M. Praveen and Ph. Schnoebelen and G. Sutre | On Functions Weakly Computable by Pushdown Petri Nets and Related
Systems | null | Logical Methods in Computer Science, Volume 15, Issue 4 (December
18, 2019) lmcs:5362 | 10.23638/LMCS-15(4:15)2019 | null | cs.FL cs.LO | http://creativecommons.org/licenses/by/4.0/ | We consider numerical functions weakly computable by grammar-controlled
vector addition systems (GVASes, a variant of pushdown Petri nets). GVASes can
weakly compute all fast growing functions $F_\alpha$ for
$\alpha<\omega^\omega$, hence they are computationally more powerful than
standard vector addition systems. On... | [
{
"created": "Mon, 8 Apr 2019 14:27:18 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Nov 2019 17:09:00 GMT",
"version": "v2"
},
{
"created": "Tue, 17 Dec 2019 09:51:33 GMT",
"version": "v3"
}
] | 2023-06-22 | [
[
"Leroux",
"J.",
""
],
[
"Praveen",
"M.",
""
],
[
"Schnoebelen",
"Ph.",
""
],
[
"Sutre",
"G.",
""
]
] | We consider numerical functions weakly computable by grammar-controlled vector addition systems (GVASes, a variant of pushdown Petri nets). GVASes can weakly compute all fast growing functions $F_\alpha$ for $\alpha<\omega^\omega$, hence they are computationally more powerful than standard vector addition systems. On t... |
2408.02193 | Weijie Lv | Weijie Lv, Xuan Xia and Sheng-Jun Huang | CodeACT: Code Adaptive Compute-efficient Tuning Framework for Code LLMs | null | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large language models (LLMs) have shown great potential in code-related
tasks, yet open-source models lag behind their closed-source counterparts. To
bridge this performance gap, existing methods generate vast amounts of
synthetic data for fine-tuning, leading to inefficiencies in training.
Motivated by the need for ... | [
{
"created": "Mon, 5 Aug 2024 02:38:48 GMT",
"version": "v1"
}
] | 2024-08-06 | [
[
"Lv",
"Weijie",
""
],
[
"Xia",
"Xuan",
""
],
[
"Huang",
"Sheng-Jun",
""
]
] | Large language models (LLMs) have shown great potential in code-related tasks, yet open-source models lag behind their closed-source counterparts. To bridge this performance gap, existing methods generate vast amounts of synthetic data for fine-tuning, leading to inefficiencies in training. Motivated by the need for mo... |
2209.10414 | Van Nguyen | Van Nguyen, Trung Le, Chakkrit Tantithamthavorn, Michael Fu, John
Grundy, Hung Nguyen, Seyit Camtepe, Paul Quirk and Dinh Phung | Statement-Level Vulnerability Detection: Learning Vulnerability Patterns
Through Information Theory and Contrastive Learning | null | null | null | null | cs.CR cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Software vulnerabilities are a serious and crucial concern. Typically, in a
program or function consisting of hundreds or thousands of source code
statements, there are only a few statements causing the corresponding
vulnerabilities. Most current approaches to vulnerability labelling are done on
a function or program... | [
{
"created": "Tue, 20 Sep 2022 00:46:20 GMT",
"version": "v1"
},
{
"created": "Wed, 12 Jun 2024 03:52:41 GMT",
"version": "v2"
}
] | 2024-06-13 | [
[
"Nguyen",
"Van",
""
],
[
"Le",
"Trung",
""
],
[
"Tantithamthavorn",
"Chakkrit",
""
],
[
"Fu",
"Michael",
""
],
[
"Grundy",
"John",
""
],
[
"Nguyen",
"Hung",
""
],
[
"Camtepe",
"Seyit",
""
],
[
"Quir... | Software vulnerabilities are a serious and crucial concern. Typically, in a program or function consisting of hundreds or thousands of source code statements, there are only a few statements causing the corresponding vulnerabilities. Most current approaches to vulnerability labelling are done on a function or program l... |
2407.19813 | Yuan Xia | Yuan Xia, Jingbo Zhou, Zhenhui Shi, Jun Chen, Haifeng Huang | Improving Retrieval Augmented Language Model with Self-Reasoning | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | The Retrieval-Augmented Language Model (RALM) has shown remarkable
performance on knowledge-intensive tasks by incorporating external knowledge
during inference, which mitigates the factual hallucinations inherited in large
language models (LLMs). Despite these advancements, challenges persist in the
implementation o... | [
{
"created": "Mon, 29 Jul 2024 09:05:10 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Aug 2024 12:11:17 GMT",
"version": "v2"
}
] | 2024-08-05 | [
[
"Xia",
"Yuan",
""
],
[
"Zhou",
"Jingbo",
""
],
[
"Shi",
"Zhenhui",
""
],
[
"Chen",
"Jun",
""
],
[
"Huang",
"Haifeng",
""
]
] | The Retrieval-Augmented Language Model (RALM) has shown remarkable performance on knowledge-intensive tasks by incorporating external knowledge during inference, which mitigates the factual hallucinations inherited in large language models (LLMs). Despite these advancements, challenges persist in the implementation of ... |
1602.01890 | Archith Bency | Archith J. Bency, S. Karthikeyan, Carter De Leo, Santhoshkumar
Sunderrajan and B. S. Manjunath | Search Tracker: Human-derived object tracking in-the-wild through
large-scale search and retrieval | Under review with the IEEE Transactions on Circuits and Systems for
Video Technology | null | 10.1109/TCSVT.2016.2555718 | null | cs.CV cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Humans use context and scene knowledge to easily localize moving objects in
conditions of complex illumination changes, scene clutter and occlusions. In
this paper, we present a method to leverage human knowledge in the form of
annotated video libraries in a novel search and retrieval based setting to
track objects i... | [
{
"created": "Fri, 5 Feb 2016 00:01:13 GMT",
"version": "v1"
}
] | 2016-04-20 | [
[
"Bency",
"Archith J.",
""
],
[
"Karthikeyan",
"S.",
""
],
[
"De Leo",
"Carter",
""
],
[
"Sunderrajan",
"Santhoshkumar",
""
],
[
"Manjunath",
"B. S.",
""
]
] | Humans use context and scene knowledge to easily localize moving objects in conditions of complex illumination changes, scene clutter and occlusions. In this paper, we present a method to leverage human knowledge in the form of annotated video libraries in a novel search and retrieval based setting to track objects in ... |
1811.04319 | Ronen Tamari | Ronen Tamari, Hiroyuki Shindo, Dafna Shahaf, Yuji Matsumoto | Playing by the Book: An Interactive Game Approach for Action Graph
Extraction from Text | Accepted to NAACL 2019 ESSP workshop
(https://scientific-knowledge.github.io/) | null | null | null | cs.LG cs.CL stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding procedural text requires tracking entities, actions and effects
as the narrative unfolds. We focus on the challenging real-world problem of
action-graph extraction from material science papers, where language is highly
specialized and data annotation is expensive and scarce. We propose a novel
approach,... | [
{
"created": "Sat, 10 Nov 2018 21:45:07 GMT",
"version": "v1"
},
{
"created": "Sat, 22 Dec 2018 16:59:00 GMT",
"version": "v2"
},
{
"created": "Sat, 6 Apr 2019 19:19:05 GMT",
"version": "v3"
}
] | 2019-04-09 | [
[
"Tamari",
"Ronen",
""
],
[
"Shindo",
"Hiroyuki",
""
],
[
"Shahaf",
"Dafna",
""
],
[
"Matsumoto",
"Yuji",
""
]
] | Understanding procedural text requires tracking entities, actions and effects as the narrative unfolds. We focus on the challenging real-world problem of action-graph extraction from material science papers, where language is highly specialized and data annotation is expensive and scarce. We propose a novel approach, T... |
cs/0303009 | Tomi Janhunen | T. Janhunen, I. Niemela, D. Seipel, P. Simons, J. You | Unfolding Partiality and Disjunctions in Stable Model Semantics | 49 pages, 4 figures, 1 table | null | null | null | cs.AI | null | The paper studies an implementation methodology for partial and disjunctive
stable models where partiality and disjunctions are unfolded from a logic
program so that an implementation of stable models for normal
(disjunction-free) programs can be used as the core inference engine. The
unfolding is done in two separat... | [
{
"created": "Fri, 14 Mar 2003 14:29:32 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Jan 2004 14:27:37 GMT",
"version": "v2"
}
] | 2007-05-23 | [
[
"Janhunen",
"T.",
""
],
[
"Niemela",
"I.",
""
],
[
"Seipel",
"D.",
""
],
[
"Simons",
"P.",
""
],
[
"You",
"J.",
""
]
] | The paper studies an implementation methodology for partial and disjunctive stable models where partiality and disjunctions are unfolded from a logic program so that an implementation of stable models for normal (disjunction-free) programs can be used as the core inference engine. The unfolding is done in two separate ... |
2004.08552 | Xulei Yang | Gabriel Tjio, Xulei Yang, Jia Mei Hong, Sum Thai Wong, Vanessa Ding,
Andre Choo and Yi Su | Accurate Tumor Tissue Region Detection with Accelerated Deep
Convolutional Neural Networks | 9 pages, 6 figures, 3 tables | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Manual annotation of pathology slides for cancer diagnosis is laborious and
repetitive. Therefore, much effort has been devoted to develop computer vision
solutions. Our approach, (FLASH), is based on a Deep Convolutional Neural
Network (DCNN) architecture. It reduces computational costs and is faster than
typical de... | [
{
"created": "Sat, 18 Apr 2020 08:24:27 GMT",
"version": "v1"
}
] | 2020-04-21 | [
[
"Tjio",
"Gabriel",
""
],
[
"Yang",
"Xulei",
""
],
[
"Hong",
"Jia Mei",
""
],
[
"Wong",
"Sum Thai",
""
],
[
"Ding",
"Vanessa",
""
],
[
"Choo",
"Andre",
""
],
[
"Su",
"Yi",
""
]
] | Manual annotation of pathology slides for cancer diagnosis is laborious and repetitive. Therefore, much effort has been devoted to develop computer vision solutions. Our approach, (FLASH), is based on a Deep Convolutional Neural Network (DCNN) architecture. It reduces computational costs and is faster than typical deep... |
2312.08212 | Jingsheng Gao | Jingsheng Gao, Jiacheng Ruan, Suncheng Xiang, Zefang Yu, Ke Ji, Mingye
Xie, Ting Liu, Yuzhuo Fu | LAMM: Label Alignment for Multi-Modal Prompt Learning | Accepted at AAAI 2024 Main Conference | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | With the success of pre-trained visual-language (VL) models such as CLIP in
visual representation tasks, transferring pre-trained models to downstream
tasks has become a crucial paradigm. Recently, the prompt tuning paradigm,
which draws inspiration from natural language processing (NLP), has made
significant progres... | [
{
"created": "Wed, 13 Dec 2023 15:29:52 GMT",
"version": "v1"
}
] | 2023-12-14 | [
[
"Gao",
"Jingsheng",
""
],
[
"Ruan",
"Jiacheng",
""
],
[
"Xiang",
"Suncheng",
""
],
[
"Yu",
"Zefang",
""
],
[
"Ji",
"Ke",
""
],
[
"Xie",
"Mingye",
""
],
[
"Liu",
"Ting",
""
],
[
"Fu",
"Yuzhuo",
... | With the success of pre-trained visual-language (VL) models such as CLIP in visual representation tasks, transferring pre-trained models to downstream tasks has become a crucial paradigm. Recently, the prompt tuning paradigm, which draws inspiration from natural language processing (NLP), has made significant progress ... |
1709.08350 | Di Zhuang | Di Zhuang, J. Morris Chang, Mingchen Li | DynaMo: Dynamic Community Detection by Incrementally Maximizing
Modularity | 14 pages, 6 figures, 2 tables, Accepted for IEEE Transactions on
Knowledge and Data Engineering | null | 10.1109/TKDE.2019.2951419 | null | cs.SI cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Community detection is of great importance for online social network
analysis. The volume, variety and velocity of data generated by today's online
social networks are advancing the way researchers analyze those networks. For
instance, real-world networks, such as Facebook, LinkedIn and Twitter, are
inherently growin... | [
{
"created": "Mon, 25 Sep 2017 07:11:44 GMT",
"version": "v1"
},
{
"created": "Mon, 20 May 2019 14:10:50 GMT",
"version": "v2"
},
{
"created": "Sat, 9 Nov 2019 20:10:02 GMT",
"version": "v3"
}
] | 2019-11-12 | [
[
"Zhuang",
"Di",
""
],
[
"Chang",
"J. Morris",
""
],
[
"Li",
"Mingchen",
""
]
] | Community detection is of great importance for online social network analysis. The volume, variety and velocity of data generated by today's online social networks are advancing the way researchers analyze those networks. For instance, real-world networks, such as Facebook, LinkedIn and Twitter, are inherently growing ... |
1809.10134 | Philip Fong | Juan Carlos Fuentes Carranza, Philip W. L. Fong | Brokering Policies and Execution Monitors for IoT Middleware | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Event-based systems lie at the heart of many cloud-based Internet-of-Things
(IoT) platforms. This combination of the Broker architectural style and the
Publisher-Subscriber design pattern provides a way for smart devices to
communicate and coordinate with one another. The present design of these
cloud-based IoT frame... | [
{
"created": "Wed, 26 Sep 2018 17:38:58 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Sep 2018 17:44:47 GMT",
"version": "v2"
}
] | 2018-09-28 | [
[
"Carranza",
"Juan Carlos Fuentes",
""
],
[
"Fong",
"Philip W. L.",
""
]
] | Event-based systems lie at the heart of many cloud-based Internet-of-Things (IoT) platforms. This combination of the Broker architectural style and the Publisher-Subscriber design pattern provides a way for smart devices to communicate and coordinate with one another. The present design of these cloud-based IoT framewo... |
1108.2157 | Rajeev Raman | Alexander Golynski and Alessio Orlandi and Rajeev Raman and S.
Srinivasa Rao | Optimal Indexes for Sparse Bit Vectors | Some of these results were published in preliminary form in the
proceedings of SWAT 2008. There are new upper bounds not in the SWAT version,
however | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of supporting Rank() and Select() operations on a bit
vector of length m with n 1 bits. The problem is considered in the succinct
index model, where the bit vector is stored in "read-only" memory and an
additional data structure, called the index, is created during pre-processing
to help answe... | [
{
"created": "Wed, 10 Aug 2011 11:36:22 GMT",
"version": "v1"
}
] | 2015-03-19 | [
[
"Golynski",
"Alexander",
""
],
[
"Orlandi",
"Alessio",
""
],
[
"Raman",
"Rajeev",
""
],
[
"Rao",
"S. Srinivasa",
""
]
] | We consider the problem of supporting Rank() and Select() operations on a bit vector of length m with n 1 bits. The problem is considered in the succinct index model, where the bit vector is stored in "read-only" memory and an additional data structure, called the index, is created during pre-processing to help answer ... |
2212.01855 | Mahender Kumar | Mahender Kumar and Satish Chand | Pairing-Friendly Elliptic Curves: Revisited Taxonomy, Attacks and
Security Concern | null | null | null | null | cs.CR | http://creativecommons.org/publicdomain/zero/1.0/ | Major families of pairing-friendly elliptic curves, including BN, BLS12,
BLS24, KSS16, and KSS18 have recently been vulnerable to number field sieve
(NFS) attacks. Due to the recent attacks on discrete logs in F_(q^k ),
selecting such curves became relevant again. This paper revisited the topic of
selecting pairing-f... | [
{
"created": "Sun, 4 Dec 2022 15:45:09 GMT",
"version": "v1"
}
] | 2022-12-06 | [
[
"Kumar",
"Mahender",
""
],
[
"Chand",
"Satish",
""
]
] | Major families of pairing-friendly elliptic curves, including BN, BLS12, BLS24, KSS16, and KSS18 have recently been vulnerable to number field sieve (NFS) attacks. Due to the recent attacks on discrete logs in F_(q^k ), selecting such curves became relevant again. This paper revisited the topic of selecting pairing-fri... |
1912.03488 | Bhanu Garg Mr. | Bhanu Garg and Naresh Manwani | Robust Deep Ordinal Regression Under Label Noise | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The real-world data is often susceptible to label noise, which might
constrict the effectiveness of the existing state of the art algorithms for
ordinal regression. Existing works on ordinal regression do not take label
noise into account. We propose a theoretically grounded approach for class
conditional label noise... | [
{
"created": "Sat, 7 Dec 2019 10:39:45 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Jan 2020 17:47:59 GMT",
"version": "v2"
}
] | 2020-01-28 | [
[
"Garg",
"Bhanu",
""
],
[
"Manwani",
"Naresh",
""
]
] | The real-world data is often susceptible to label noise, which might constrict the effectiveness of the existing state of the art algorithms for ordinal regression. Existing works on ordinal regression do not take label noise into account. We propose a theoretically grounded approach for class conditional label noise i... |
2208.04994 | Shijun Wang | Shijun Wang, Hamed Hemati, J\'on Gu{\dh}nason, Damian Borth | Generative Data Augmentation Guided by Triplet Loss for Speech Emotion
Recognition | Published in INTERSPEECH 2022 | null | null | null | cs.SD eess.AS | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Speech Emotion Recognition (SER) is crucial for human-computer interaction
but still remains a challenging problem because of two major obstacles: data
scarcity and imbalance. Many datasets for SER are substantially imbalanced,
where data utterances of one class (most often Neutral) are much more frequent
than those ... | [
{
"created": "Tue, 9 Aug 2022 18:39:42 GMT",
"version": "v1"
}
] | 2022-08-11 | [
[
"Wang",
"Shijun",
""
],
[
"Hemati",
"Hamed",
""
],
[
"Guðnason",
"Jón",
""
],
[
"Borth",
"Damian",
""
]
] | Speech Emotion Recognition (SER) is crucial for human-computer interaction but still remains a challenging problem because of two major obstacles: data scarcity and imbalance. Many datasets for SER are substantially imbalanced, where data utterances of one class (most often Neutral) are much more frequent than those of... |
2403.02574 | Yutong Li | Yutong Li, Lu Chen, Aiwei Liu, Kai Yu, Lijie Wen | ChatCite: LLM Agent with Human Workflow Guidance for Comparative
Literature Summary | 18 pages, 5 figures | null | null | null | cs.IR cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | The literature review is an indispensable step in the research process. It
provides the benefit of comprehending the research problem and understanding
the current research situation while conducting a comparative analysis of prior
works. However, literature summary is challenging and time consuming. The
previous LLM... | [
{
"created": "Tue, 5 Mar 2024 01:13:56 GMT",
"version": "v1"
}
] | 2024-03-06 | [
[
"Li",
"Yutong",
""
],
[
"Chen",
"Lu",
""
],
[
"Liu",
"Aiwei",
""
],
[
"Yu",
"Kai",
""
],
[
"Wen",
"Lijie",
""
]
] | The literature review is an indispensable step in the research process. It provides the benefit of comprehending the research problem and understanding the current research situation while conducting a comparative analysis of prior works. However, literature summary is challenging and time consuming. The previous LLM-b... |
2110.07604 | Jason Y. Zhang | Jason Y. Zhang, Gengshan Yang, Shubham Tulsiani, Deva Ramanan | NeRS: Neural Reflectance Surfaces for Sparse-view 3D Reconstruction in
the Wild | In NeurIPS 2021. v2-3: Fixed minor typos | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Recent history has seen a tremendous growth of work exploring implicit
representations of geometry and radiance, popularized through Neural Radiance
Fields (NeRF). Such works are fundamentally based on a (implicit) volumetric
representation of occupancy, allowing them to model diverse scene structure
including transl... | [
{
"created": "Thu, 14 Oct 2021 17:59:58 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Oct 2021 08:05:41 GMT",
"version": "v2"
},
{
"created": "Mon, 18 Oct 2021 04:03:39 GMT",
"version": "v3"
}
] | 2021-10-19 | [
[
"Zhang",
"Jason Y.",
""
],
[
"Yang",
"Gengshan",
""
],
[
"Tulsiani",
"Shubham",
""
],
[
"Ramanan",
"Deva",
""
]
] | Recent history has seen a tremendous growth of work exploring implicit representations of geometry and radiance, popularized through Neural Radiance Fields (NeRF). Such works are fundamentally based on a (implicit) volumetric representation of occupancy, allowing them to model diverse scene structure including transluc... |
1806.01610 | Robin Tibor Schirrmeister | Robin Tibor Schirrmeister, Patryk Chrab\k{a}szcz, Frank Hutter, Tonio
Ball | Training Generative Reversible Networks | Source code for this study is at
https://github.com/robintibor/generative-reversible | null | null | null | cs.LG cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative models with an encoding component such as autoencoders currently
receive great interest. However, training of autoencoders is typically
complicated by the need to train a separate encoder and decoder model that have
to be enforced to be reciprocal to each other. To overcome this problem,
by-design reversib... | [
{
"created": "Tue, 5 Jun 2018 11:16:42 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Jun 2018 08:40:34 GMT",
"version": "v2"
},
{
"created": "Sun, 8 Jul 2018 23:22:27 GMT",
"version": "v3"
},
{
"created": "Thu, 23 Aug 2018 12:07:40 GMT",
"version": "v4"
}
] | 2018-08-24 | [
[
"Schirrmeister",
"Robin Tibor",
""
],
[
"Chrabąszcz",
"Patryk",
""
],
[
"Hutter",
"Frank",
""
],
[
"Ball",
"Tonio",
""
]
] | Generative models with an encoding component such as autoencoders currently receive great interest. However, training of autoencoders is typically complicated by the need to train a separate encoder and decoder model that have to be enforced to be reciprocal to each other. To overcome this problem, by-design reversible... |
1111.0737 | Maxim Vashkevich | Maxim Vashkevich and Wanggen Wan and Alexander Petrovsky | Practical design of multi-channel oversampled warped cosine-modulated
filter banks | 6 pages, 9 figures. IET International Communication Conference on
Wireless Mobile & Computing 2011 | null | 10.1049/cp.2011.0844 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A practical approach to optimal design of multichannel oversampled warped
cosine-modulated filter banks (CMFB) is proposed. Warped CMFB is obtained by
allpass transformation of uniform CMFB. The paper addresses the problems of
minimization amplitude distortion and suppression of aliasing components
emerged due to ove... | [
{
"created": "Thu, 3 Nov 2011 06:46:36 GMT",
"version": "v1"
},
{
"created": "Sun, 18 Nov 2012 13:42:29 GMT",
"version": "v2"
},
{
"created": "Wed, 25 Mar 2020 06:43:16 GMT",
"version": "v3"
}
] | 2020-03-26 | [
[
"Vashkevich",
"Maxim",
""
],
[
"Wan",
"Wanggen",
""
],
[
"Petrovsky",
"Alexander",
""
]
] | A practical approach to optimal design of multichannel oversampled warped cosine-modulated filter banks (CMFB) is proposed. Warped CMFB is obtained by allpass transformation of uniform CMFB. The paper addresses the problems of minimization amplitude distortion and suppression of aliasing components emerged due to overs... |
2111.12528 | Amir Naseredini | Amir Naseredini, Stefan Gast, Martin Schwarzl, Pedro Miguel Sousa
Bernardo, Amel Smajic, Claudio Canella, Martin Berger, Daniel Gruss | Systematic Analysis of Programming Languages and Their Execution
Environments for Spectre Attacks | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we analyze the security of programming languages and their
execution environments (compilers and interpreters) with respect to Spectre
attacks. The analysis shows that only 16 out of 42 execution environments have
mitigations against at least one Spectre variant, i.e., 26 have no mitigations
against an... | [
{
"created": "Wed, 24 Nov 2021 14:54:03 GMT",
"version": "v1"
}
] | 2021-11-25 | [
[
"Naseredini",
"Amir",
""
],
[
"Gast",
"Stefan",
""
],
[
"Schwarzl",
"Martin",
""
],
[
"Bernardo",
"Pedro Miguel Sousa",
""
],
[
"Smajic",
"Amel",
""
],
[
"Canella",
"Claudio",
""
],
[
"Berger",
"Martin",
""... | In this paper, we analyze the security of programming languages and their execution environments (compilers and interpreters) with respect to Spectre attacks. The analysis shows that only 16 out of 42 execution environments have mitigations against at least one Spectre variant, i.e., 26 have no mitigations against any ... |
2201.02797 | Shaoxiong Ji | Shaoxiong Ji and Wei Sun and Xiaobo Li and Hang Dong and Ara Taalas
and Yijia Zhang and Honghan Wu and Esa Pitk\"anen and Pekka Marttinen | A Unified Review of Deep Learning for Automated Medical Coding | ACM Computing Surveys | null | 10.1145/3664615 | null | cs.CL cs.IR | http://creativecommons.org/licenses/by/4.0/ | Automated medical coding, an essential task for healthcare operation and
delivery, makes unstructured data manageable by predicting medical codes from
clinical documents. Recent advances in deep learning and natural language
processing have been widely applied to this task. However, deep learning-based
medical coding... | [
{
"created": "Sat, 8 Jan 2022 09:37:23 GMT",
"version": "v1"
},
{
"created": "Wed, 25 Jan 2023 07:55:00 GMT",
"version": "v2"
},
{
"created": "Mon, 24 Apr 2023 14:50:44 GMT",
"version": "v3"
},
{
"created": "Sun, 5 May 2024 13:04:16 GMT",
"version": "v4"
},
{
"cre... | 2024-05-15 | [
[
"Ji",
"Shaoxiong",
""
],
[
"Sun",
"Wei",
""
],
[
"Li",
"Xiaobo",
""
],
[
"Dong",
"Hang",
""
],
[
"Taalas",
"Ara",
""
],
[
"Zhang",
"Yijia",
""
],
[
"Wu",
"Honghan",
""
],
[
"Pitkänen",
"Esa",
... | Automated medical coding, an essential task for healthcare operation and delivery, makes unstructured data manageable by predicting medical codes from clinical documents. Recent advances in deep learning and natural language processing have been widely applied to this task. However, deep learning-based medical coding l... |
2406.19815 | Feng Liu | Feng Liu, Qing Xu, Qijian Zheng | Emotion Loss Attacking: Adversarial Attack Perception for Skeleton based
on Multi-dimensional Features | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adversarial attack on skeletal motion is a hot topic. However, existing
researches only consider part of dynamic features when measuring distance
between skeleton graph sequences, which results in poor imperceptibility. To
this end, we propose a novel adversarial attack method to attack action
recognizers for skeleta... | [
{
"created": "Fri, 28 Jun 2024 10:45:37 GMT",
"version": "v1"
}
] | 2024-07-01 | [
[
"Liu",
"Feng",
""
],
[
"Xu",
"Qing",
""
],
[
"Zheng",
"Qijian",
""
]
] | Adversarial attack on skeletal motion is a hot topic. However, existing researches only consider part of dynamic features when measuring distance between skeleton graph sequences, which results in poor imperceptibility. To this end, we propose a novel adversarial attack method to attack action recognizers for skeletal ... |
2301.12326 | Xuan Lu | Xuan Lu, Wei Ai, Yixin Wang, Qiaozhu Mei | Team Resilience under Shock: An Empirical Analysis of GitHub
Repositories during Early COVID-19 Pandemic | 12 pages, 4 figures. To be published in the 17th International AAAI
Conference on Web and Social Media (ICWSM) | null | null | null | cs.LG cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While many organizations have shifted to working remotely during the COVID-19
pandemic, how the remote workforce and the remote teams are influenced by and
would respond to this and future shocks remain largely unknown. Software
developers have relied on remote collaborations long before the pandemic,
working in virt... | [
{
"created": "Sun, 29 Jan 2023 02:22:29 GMT",
"version": "v1"
}
] | 2023-01-31 | [
[
"Lu",
"Xuan",
""
],
[
"Ai",
"Wei",
""
],
[
"Wang",
"Yixin",
""
],
[
"Mei",
"Qiaozhu",
""
]
] | While many organizations have shifted to working remotely during the COVID-19 pandemic, how the remote workforce and the remote teams are influenced by and would respond to this and future shocks remain largely unknown. Software developers have relied on remote collaborations long before the pandemic, working in virtua... |
1603.08019 | Raj Jain | Arjan Durresi, Sastri Kota, Mukul Goyal, Raj Jain, Venkata Bharani | Achieving QoS for TCP Traffic in Satellite Networks with Differentiated
Services | null | Space Communications, Volume 17, Number 1-3, 2001, pp. 125-136 | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Satellite networks play an indispensable role in providing global Internet
access and electronic connectivity. To achieve such a global communications,
provisioning of quality of service (QoS) within the advanced satellite systems
is the main requirement. One of the key mechanisms of implementing the quality
of servi... | [
{
"created": "Fri, 25 Mar 2016 20:16:23 GMT",
"version": "v1"
}
] | 2016-03-29 | [
[
"Durresi",
"Arjan",
""
],
[
"Kota",
"Sastri",
""
],
[
"Goyal",
"Mukul",
""
],
[
"Jain",
"Raj",
""
],
[
"Bharani",
"Venkata",
""
]
] | Satellite networks play an indispensable role in providing global Internet access and electronic connectivity. To achieve such a global communications, provisioning of quality of service (QoS) within the advanced satellite systems is the main requirement. One of the key mechanisms of implementing the quality of service... |
1601.05952 | Carsten Eickhoff | Siddharth Sarda, Carsten Eickhoff, Thomas Hofmann | Semantic Place Descriptors for Classification and Map Discovery | 13 pages, 1 figure, 1 table | null | null | null | cs.IR cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Urban environments develop complex, non-obvious structures that are often
hard to represent in the form of maps or guides. Finding the right place to go
often requires intimate familiarity with the location in question and cannot
easily be deduced by visitors. In this work, we exploit large-scale samples of
usage inf... | [
{
"created": "Fri, 22 Jan 2016 10:46:29 GMT",
"version": "v1"
}
] | 2016-01-25 | [
[
"Sarda",
"Siddharth",
""
],
[
"Eickhoff",
"Carsten",
""
],
[
"Hofmann",
"Thomas",
""
]
] | Urban environments develop complex, non-obvious structures that are often hard to represent in the form of maps or guides. Finding the right place to go often requires intimate familiarity with the location in question and cannot easily be deduced by visitors. In this work, we exploit large-scale samples of usage infor... |
2407.01216 | Xibo Li | Xibo Li, Shruti Patel and Christof B\"uskens | Let Hybrid A* Path Planner Obey Traffic Rules: A Deep Reinforcement
Learning-Based Planning Framework | null | null | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by/4.0/ | Deep reinforcement learning (DRL) allows a system to interact with its
environment and take actions by training an efficient policy that maximizes
self-defined rewards. In autonomous driving, it can be used as a strategy for
high-level decision making, whereas low-level algorithms such as the hybrid A*
path planning ... | [
{
"created": "Mon, 1 Jul 2024 12:00:10 GMT",
"version": "v1"
}
] | 2024-07-02 | [
[
"Li",
"Xibo",
""
],
[
"Patel",
"Shruti",
""
],
[
"Büskens",
"Christof",
""
]
] | Deep reinforcement learning (DRL) allows a system to interact with its environment and take actions by training an efficient policy that maximizes self-defined rewards. In autonomous driving, it can be used as a strategy for high-level decision making, whereas low-level algorithms such as the hybrid A* path planning ha... |
2310.05306 | Ruiqi Wang | Ruiqi Wang, Hanyang Liu, Jiaming Qiu, Moran Xu, Roch Guerin, Chenyang
Lu | Progressive Neural Compression for Adaptive Image Offloading under
Timing Constraints | IEEE the 44th Real-Time System Symposium (RTSS), 2023 | null | 10.1109/RTSS59052.2023.00020 | null | cs.DC cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | IoT devices are increasingly the source of data for machine learning (ML)
applications running on edge servers. Data transmissions from devices to
servers are often over local wireless networks whose bandwidth is not just
limited but, more importantly, variable. Furthermore, in cyber-physical systems
interacting with... | [
{
"created": "Sun, 8 Oct 2023 22:58:31 GMT",
"version": "v1"
}
] | 2024-02-26 | [
[
"Wang",
"Ruiqi",
""
],
[
"Liu",
"Hanyang",
""
],
[
"Qiu",
"Jiaming",
""
],
[
"Xu",
"Moran",
""
],
[
"Guerin",
"Roch",
""
],
[
"Lu",
"Chenyang",
""
]
] | IoT devices are increasingly the source of data for machine learning (ML) applications running on edge servers. Data transmissions from devices to servers are often over local wireless networks whose bandwidth is not just limited but, more importantly, variable. Furthermore, in cyber-physical systems interacting with t... |
0801.0597 | Min Chen | Min Chen, Semih Serbetli and Aylin Yener | Distributed Power Allocation Strategies for Parallel Relay Networks | IEEE Transactions on Wireless Communications, accepted for
publication. 10 pages, 7 figures | null | null | null | cs.IT math.IT | null | We consider a source-destination pair assisted by parallel regenerative
decode-and-forward relays operating in orthogonal channels. We investigate
distributed power allocation strategies for this system with limited channel
state information at the source and the relay nodes. We first propose a
distributed decision m... | [
{
"created": "Thu, 3 Jan 2008 21:01:48 GMT",
"version": "v1"
}
] | 2008-01-07 | [
[
"Chen",
"Min",
""
],
[
"Serbetli",
"Semih",
""
],
[
"Yener",
"Aylin",
""
]
] | We consider a source-destination pair assisted by parallel regenerative decode-and-forward relays operating in orthogonal channels. We investigate distributed power allocation strategies for this system with limited channel state information at the source and the relay nodes. We first propose a distributed decision mec... |
2207.07189 | Nikola Simidjievski | Ivica Dimitrovski, Ivan Kitanovski, Dragi Kocev, Nikola Simidjievski | Current Trends in Deep Learning for Earth Observation: An Open-source
Benchmark Arena for Image Classification | null | null | 10.1016/j.isprsjprs.2023.01.014 | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | We present AiTLAS: Benchmark Arena -- an open-source benchmark suite for
evaluating state-of-the-art deep learning approaches for image classification
in Earth Observation (EO). To this end, we present a comprehensive comparative
analysis of more than 500 models derived from ten different state-of-the-art
architectur... | [
{
"created": "Thu, 14 Jul 2022 20:18:58 GMT",
"version": "v1"
},
{
"created": "Sat, 14 Jan 2023 16:10:58 GMT",
"version": "v2"
}
] | 2023-02-02 | [
[
"Dimitrovski",
"Ivica",
""
],
[
"Kitanovski",
"Ivan",
""
],
[
"Kocev",
"Dragi",
""
],
[
"Simidjievski",
"Nikola",
""
]
] | We present AiTLAS: Benchmark Arena -- an open-source benchmark suite for evaluating state-of-the-art deep learning approaches for image classification in Earth Observation (EO). To this end, we present a comprehensive comparative analysis of more than 500 models derived from ten different state-of-the-art architectures... |
1002.3065 | Ayfer Ozgur | Ayfer Ozgur, Olivier Leveque, David Tse | Linear Capacity Scaling in Wireless Networks: Beyond Physical Limits? | 10 pages, 5 figures, in Proc. of IEEE Information Theory and
Applications Workshop, Feb. 2010 | null | 10.1109/ITA.2010.5454112 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the role of cooperation in wireless networks subject to a
spatial degrees of freedom limitation. To address the worst case scenario, we
consider a free-space line-of-sight type environment with no scattering and no
fading. We identify three qualitatively different operating regimes that are
determined ... | [
{
"created": "Tue, 16 Feb 2010 14:35:08 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Ozgur",
"Ayfer",
""
],
[
"Leveque",
"Olivier",
""
],
[
"Tse",
"David",
""
]
] | We investigate the role of cooperation in wireless networks subject to a spatial degrees of freedom limitation. To address the worst case scenario, we consider a free-space line-of-sight type environment with no scattering and no fading. We identify three qualitatively different operating regimes that are determined by... |
2211.11040 | Aadesh Desai | Aadesh Desai, Saagar Parikh, Seema Kumari, Shanmuganathan Raman | PointResNet: Residual Network for 3D Point Cloud Segmentation and
Classification | Paper Under Review at IEEE International Conference on Acoustics,
Speech and Signal Processing (ICASSP) 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Point cloud segmentation and classification are some of the primary tasks in
3D computer vision with applications ranging from augmented reality to
robotics. However, processing point clouds using deep learning-based algorithms
is quite challenging due to the irregular point formats. Voxelization or 3D
grid-based rep... | [
{
"created": "Sun, 20 Nov 2022 17:39:48 GMT",
"version": "v1"
}
] | 2022-11-22 | [
[
"Desai",
"Aadesh",
""
],
[
"Parikh",
"Saagar",
""
],
[
"Kumari",
"Seema",
""
],
[
"Raman",
"Shanmuganathan",
""
]
] | Point cloud segmentation and classification are some of the primary tasks in 3D computer vision with applications ranging from augmented reality to robotics. However, processing point clouds using deep learning-based algorithms is quite challenging due to the irregular point formats. Voxelization or 3D grid-based repre... |
2004.10278 | Qi Cheng | Yanbin Pan, Jun Xu, Nick Wadleigh, and Qi Cheng | On the ideal shortest vector problem over random rational primes | null | null | null | null | cs.CR math.NT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Any ideal in a number field can be factored into a product of prime ideals.
In this paper we study the prime ideal shortest vector problem (SVP) in the
ring $ \Z[x]/(x^{2^n} + 1) $, a popular choice in the design of ideal lattice
based cryptosystems. We show that a majority of rational primes lie under prime
ideals a... | [
{
"created": "Tue, 21 Apr 2020 20:21:33 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Mar 2021 16:16:57 GMT",
"version": "v2"
}
] | 2021-03-03 | [
[
"Pan",
"Yanbin",
""
],
[
"Xu",
"Jun",
""
],
[
"Wadleigh",
"Nick",
""
],
[
"Cheng",
"Qi",
""
]
] | Any ideal in a number field can be factored into a product of prime ideals. In this paper we study the prime ideal shortest vector problem (SVP) in the ring $ \Z[x]/(x^{2^n} + 1) $, a popular choice in the design of ideal lattice based cryptosystems. We show that a majority of rational primes lie under prime ideals adm... |
2202.10862 | Noa Schiller | Hagit Attiya and Noa Schiller | Asynchronous Fully-Decentralized SGD in the Cluster-Based Model | null | CIAC 13 (2023) 52-66 | 10.1007/978-3-031-30448-4_5 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents fault-tolerant asynchronous Stochastic Gradient Descent
(SGD) algorithms. SGD is widely used for approximating the minimum of a cost
function $Q$, as a core part of optimization and learning algorithms. Our
algorithms are designed for the cluster-based model, which combines
message-passing and sha... | [
{
"created": "Tue, 22 Feb 2022 12:50:00 GMT",
"version": "v1"
},
{
"created": "Sun, 27 Mar 2022 11:53:37 GMT",
"version": "v2"
},
{
"created": "Tue, 13 Jun 2023 17:19:24 GMT",
"version": "v3"
}
] | 2023-06-14 | [
[
"Attiya",
"Hagit",
""
],
[
"Schiller",
"Noa",
""
]
] | This paper presents fault-tolerant asynchronous Stochastic Gradient Descent (SGD) algorithms. SGD is widely used for approximating the minimum of a cost function $Q$, as a core part of optimization and learning algorithms. Our algorithms are designed for the cluster-based model, which combines message-passing and share... |
1903.02953 | Daniel Hershcovich | Daniel Hershcovich, Zohar Aizenbud, Leshem Choshen, Elior Sulem, Ari
Rappoport, Omri Abend | SemEval-2019 Task 1: Cross-lingual Semantic Parsing with UCCA | SemEval 2019 Shared task. arXiv admin note: substantial text overlap
with arXiv:1805.12386 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the SemEval 2019 shared task on UCCA parsing in English, German
and French, and discuss the participating systems and results. UCCA is a
cross-linguistically applicable framework for semantic representation, which
builds on extensive typological work and supports rapid annotation. UCCA poses
a challenge fo... | [
{
"created": "Wed, 6 Mar 2019 16:55:58 GMT",
"version": "v1"
},
{
"created": "Thu, 25 Apr 2019 05:18:27 GMT",
"version": "v2"
},
{
"created": "Thu, 11 Jun 2020 09:20:56 GMT",
"version": "v3"
}
] | 2020-06-12 | [
[
"Hershcovich",
"Daniel",
""
],
[
"Aizenbud",
"Zohar",
""
],
[
"Choshen",
"Leshem",
""
],
[
"Sulem",
"Elior",
""
],
[
"Rappoport",
"Ari",
""
],
[
"Abend",
"Omri",
""
]
] | We present the SemEval 2019 shared task on UCCA parsing in English, German and French, and discuss the participating systems and results. UCCA is a cross-linguistically applicable framework for semantic representation, which builds on extensive typological work and supports rapid annotation. UCCA poses a challenge for ... |
1911.01163 | Youngmin Jeong | Dung Phuong Trinh, Youngmin Jeong, Hyundong Shin, Moe Z. Win | Molecular Communication in H-Diffusion | This work has been submitted to the IEEE for possible publication | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The random propagation of molecules in a fluid medium is characterized by the
spontaneous diffusion law as well as the interaction between the environment
and molecules. In this paper, we embody the anomalous diffusion theory for
modeling and analysis in molecular communication. We employ H-diffusion to
model a non-F... | [
{
"created": "Mon, 4 Nov 2019 12:41:06 GMT",
"version": "v1"
}
] | 2019-11-05 | [
[
"Trinh",
"Dung Phuong",
""
],
[
"Jeong",
"Youngmin",
""
],
[
"Shin",
"Hyundong",
""
],
[
"Win",
"Moe Z.",
""
]
] | The random propagation of molecules in a fluid medium is characterized by the spontaneous diffusion law as well as the interaction between the environment and molecules. In this paper, we embody the anomalous diffusion theory for modeling and analysis in molecular communication. We employ H-diffusion to model a non-Fic... |
1906.00246 | Lei Chen | Le Wu, Lei Chen, Yonghui Yang, Richang Hong, Yong Ge, Xing Xie, Meng
Wang | Personalized Multimedia Item and Key Frame Recommendation | The updated version is publised in IJCAI 2019,
https://doi.org/10.24963/ijcai.2019/198 | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When recommending or advertising items to users, an emerging trend is to
present each multimedia item with a key frame image (e.g., the poster of a
movie). As each multimedia item can be represented as multiple fine-grained
visual images (e.g., related images of the movie), personalized key frame
recommendation is ne... | [
{
"created": "Sat, 1 Jun 2019 15:34:59 GMT",
"version": "v1"
},
{
"created": "Sat, 4 Jan 2020 06:38:25 GMT",
"version": "v2"
}
] | 2020-01-07 | [
[
"Wu",
"Le",
""
],
[
"Chen",
"Lei",
""
],
[
"Yang",
"Yonghui",
""
],
[
"Hong",
"Richang",
""
],
[
"Ge",
"Yong",
""
],
[
"Xie",
"Xing",
""
],
[
"Wang",
"Meng",
""
]
] | When recommending or advertising items to users, an emerging trend is to present each multimedia item with a key frame image (e.g., the poster of a movie). As each multimedia item can be represented as multiple fine-grained visual images (e.g., related images of the movie), personalized key frame recommendation is nece... |
2207.00933 | Wei Tang | Wei Tang, Margaret Martonosi | ScaleQC: A Scalable Framework for Hybrid Computation on Quantum and
Classical Processors | 12 pages, 13 figures | null | null | null | cs.ET quant-ph | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Quantum processing unit (QPU) has to satisfy highly demanding quantity and
quality requirements on its qubits to produce accurate results for problems at
useful scales. Furthermore, classical simulations of quantum circuits generally
do not scale. Instead, quantum circuit cutting techniques cut and distribute a
large... | [
{
"created": "Sun, 3 Jul 2022 01:44:31 GMT",
"version": "v1"
}
] | 2022-07-05 | [
[
"Tang",
"Wei",
""
],
[
"Martonosi",
"Margaret",
""
]
] | Quantum processing unit (QPU) has to satisfy highly demanding quantity and quality requirements on its qubits to produce accurate results for problems at useful scales. Furthermore, classical simulations of quantum circuits generally do not scale. Instead, quantum circuit cutting techniques cut and distribute a large q... |
2206.00279 | Depeng Liu | Depeng Liu, Lutan Zhao, Pengfei Yang, Bow-Yaw Wang, Rui Hou, Lijun
Zhang, Naijun Zhan | Defensive Design of Saturating Counters Based on Differential Privacy | null | null | null | null | cs.CR cs.FL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The saturating counter is the basic module of the dynamic branch predictor,
which involves the core technique to improve instruction level parallelism
performance in modern processors. However, most studies focus on the
performance improvement and hardware consumption of saturating counters, while
ignoring the securi... | [
{
"created": "Wed, 1 Jun 2022 07:19:31 GMT",
"version": "v1"
}
] | 2022-06-02 | [
[
"Liu",
"Depeng",
""
],
[
"Zhao",
"Lutan",
""
],
[
"Yang",
"Pengfei",
""
],
[
"Wang",
"Bow-Yaw",
""
],
[
"Hou",
"Rui",
""
],
[
"Zhang",
"Lijun",
""
],
[
"Zhan",
"Naijun",
""
]
] | The saturating counter is the basic module of the dynamic branch predictor, which involves the core technique to improve instruction level parallelism performance in modern processors. However, most studies focus on the performance improvement and hardware consumption of saturating counters, while ignoring the security... |
2209.13304 | Manuel Vidigueira | Martina Camaioni, Rachid Guerraoui, Matteo Monti, Manuel Vidigueira | Oracular Byzantine Reliable Broadcast [Extended Version] | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Byzantine Reliable Broadcast (BRB) is a fundamental distributed computing
primitive, with applications ranging from notifications to asynchronous payment
systems. Motivated by practical consideration, we study Client-Server Byzantine
Reliable Broadcast (CSB), a multi-shot variant of BRB whose interface is split
betwe... | [
{
"created": "Tue, 27 Sep 2022 11:09:54 GMT",
"version": "v1"
}
] | 2022-09-28 | [
[
"Camaioni",
"Martina",
""
],
[
"Guerraoui",
"Rachid",
""
],
[
"Monti",
"Matteo",
""
],
[
"Vidigueira",
"Manuel",
""
]
] | Byzantine Reliable Broadcast (BRB) is a fundamental distributed computing primitive, with applications ranging from notifications to asynchronous payment systems. Motivated by practical consideration, we study Client-Server Byzantine Reliable Broadcast (CSB), a multi-shot variant of BRB whose interface is split between... |
2007.10876 | Bakheet Aljedaani | Bakheet Aljedaani, M. Ali Babar | Challenges in Developing Secure Mobile Health Applications, A Systematic
Review | This paper has 5 figures and 1 table | null | null | null | cs.SE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Mobile health (mHealth) applications (apps) have gained significant
popularity over the last few years due to its tremendous benefits, such as
lowering healthcare cost and increasing patient awareness. However, the
sensitivity of healthcare data makes the security of mHealth apps a serious
concern. In this review, we... | [
{
"created": "Tue, 21 Jul 2020 15:06:46 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Jan 2021 21:59:09 GMT",
"version": "v2"
}
] | 2021-01-19 | [
[
"Aljedaani",
"Bakheet",
""
],
[
"Babar",
"M. Ali",
""
]
] | Mobile health (mHealth) applications (apps) have gained significant popularity over the last few years due to its tremendous benefits, such as lowering healthcare cost and increasing patient awareness. However, the sensitivity of healthcare data makes the security of mHealth apps a serious concern. In this review, we a... |
cs/0206001 | Carlos Gershenson | A. Das, M. Marko, A. Probst, M. A. Porter, C. Gershenson | Neural Net Model for Featured Word Extraction | null | null | null | null | cs.NE cs.NI | null | Search engines perform the task of retrieving information related to the
user-supplied query words. This task has two parts; one is finding "featured
words" which describe an article best and the other is finding a match among
these words to user-defined search terms. There are two main independent
approaches to achi... | [
{
"created": "Sat, 1 Jun 2002 15:10:56 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Das",
"A.",
""
],
[
"Marko",
"M.",
""
],
[
"Probst",
"A.",
""
],
[
"Porter",
"M. A.",
""
],
[
"Gershenson",
"C.",
""
]
] | Search engines perform the task of retrieving information related to the user-supplied query words. This task has two parts; one is finding "featured words" which describe an article best and the other is finding a match among these words to user-defined search terms. There are two main independent approaches to achiev... |
2302.04761 | Timo Schick | Timo Schick, Jane Dwivedi-Yu, Roberto Dess\`i, Roberta Raileanu, Maria
Lomeli, Luke Zettlemoyer, Nicola Cancedda, Thomas Scialom | Toolformer: Language Models Can Teach Themselves to Use Tools | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Language models (LMs) exhibit remarkable abilities to solve new tasks from
just a few examples or textual instructions, especially at scale. They also,
paradoxically, struggle with basic functionality, such as arithmetic or factual
lookup, where much simpler and smaller models excel. In this paper, we show
that LMs c... | [
{
"created": "Thu, 9 Feb 2023 16:49:57 GMT",
"version": "v1"
}
] | 2023-02-10 | [
[
"Schick",
"Timo",
""
],
[
"Dwivedi-Yu",
"Jane",
""
],
[
"Dessì",
"Roberto",
""
],
[
"Raileanu",
"Roberta",
""
],
[
"Lomeli",
"Maria",
""
],
[
"Zettlemoyer",
"Luke",
""
],
[
"Cancedda",
"Nicola",
""
],
[... | Language models (LMs) exhibit remarkable abilities to solve new tasks from just a few examples or textual instructions, especially at scale. They also, paradoxically, struggle with basic functionality, such as arithmetic or factual lookup, where much simpler and smaller models excel. In this paper, we show that LMs can... |
1002.0855 | Bartek Blaszczyszyn | Fran\c{c}ois Baccelli (INRIA Rocquencourt), Bartek Blaszczyszyn (INRIA
Rocquencourt) | A New Phase Transition for Local Delays in MANETs | accepted for IEEE Infocom 2010 | null | 10.1109/INFCOM.2010.5462132 | null | cs.NI math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider Mobile Ad-hoc Network (MANET) with transmitters located according
to a Poisson point in the Euclidean plane, slotted Aloha Medium Access (MAC)
protocol and the so-called outage scenario, where a successful transmission
requires a Signal-to-Interference-and-Noise (SINR) larger than some threshold.
We analy... | [
{
"created": "Wed, 3 Feb 2010 21:18:20 GMT",
"version": "v1"
}
] | 2010-10-28 | [
[
"Baccelli",
"François",
"",
"INRIA Rocquencourt"
],
[
"Blaszczyszyn",
"Bartek",
"",
"INRIA\n Rocquencourt"
]
] | We consider Mobile Ad-hoc Network (MANET) with transmitters located according to a Poisson point in the Euclidean plane, slotted Aloha Medium Access (MAC) protocol and the so-called outage scenario, where a successful transmission requires a Signal-to-Interference-and-Noise (SINR) larger than some threshold. We analyze... |
1803.09576 | Lucas Isenmann | Daniel Gon\c{c}alves and Lucas Isenmann | Dushnik-Miller dimension of TD-Delaunay complexes | A short version appears in the proceedings of EuroCG 2017 | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | TD-Delaunay graphs, where TD stands for triangular distance, is a variation
of the classical Delaunay triangulations obtained from a specific convex
distance function. Bonichon et. al. noticed that every triangulation is the
TD-Delaunay graph of a set of points in $\mathbb{R}^2$, and conversely every
TD-Delaunay grap... | [
{
"created": "Mon, 26 Mar 2018 13:28:54 GMT",
"version": "v1"
}
] | 2018-03-28 | [
[
"Gonçalves",
"Daniel",
""
],
[
"Isenmann",
"Lucas",
""
]
] | TD-Delaunay graphs, where TD stands for triangular distance, is a variation of the classical Delaunay triangulations obtained from a specific convex distance function. Bonichon et. al. noticed that every triangulation is the TD-Delaunay graph of a set of points in $\mathbb{R}^2$, and conversely every TD-Delaunay graph ... |
2405.14176 | Ambar Pal | Ambar Pal and Ren\'e Vidal and Jeremias Sulam | Certified Robustness against Sparse Adversarial Perturbations via Data
Localization | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Recent work in adversarial robustness suggests that natural data
distributions are localized, i.e., they place high probability in small volume
regions of the input space, and that this property can be utilized for
designing classifiers with improved robustness guarantees for $\ell_2$-bounded
perturbations. Yet, it i... | [
{
"created": "Thu, 23 May 2024 05:02:00 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Pal",
"Ambar",
""
],
[
"Vidal",
"René",
""
],
[
"Sulam",
"Jeremias",
""
]
] | Recent work in adversarial robustness suggests that natural data distributions are localized, i.e., they place high probability in small volume regions of the input space, and that this property can be utilized for designing classifiers with improved robustness guarantees for $\ell_2$-bounded perturbations. Yet, it is ... |
2009.05183 | Ye Tao | Ye Tao, Can Wang, Lina Yao, Weimin Li, Yonghong Yu | TRec: Sequential Recommender Based On Latent Item Trend Information | 8 pages, accepted by IJCNN2020 | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recommendation system plays an important role in online web applications.
Sequential recommender further models user short-term preference through
exploiting information from latest user-item interaction history. Most of the
sequential recommendation methods neglect the importance of ever-changing item
popularity. We... | [
{
"created": "Fri, 11 Sep 2020 00:31:39 GMT",
"version": "v1"
}
] | 2020-09-14 | [
[
"Tao",
"Ye",
""
],
[
"Wang",
"Can",
""
],
[
"Yao",
"Lina",
""
],
[
"Li",
"Weimin",
""
],
[
"Yu",
"Yonghong",
""
]
] | Recommendation system plays an important role in online web applications. Sequential recommender further models user short-term preference through exploiting information from latest user-item interaction history. Most of the sequential recommendation methods neglect the importance of ever-changing item popularity. We p... |
1901.04908 | Iuliia Kotseruba | John K. Tsotsos, Iuliia Kotseruba, Calden Wloka | Rapid Visual Categorization is not Guided by Early Salience-Based
Selection | 22 pages, 9 figures | null | 10.1371/journal.pone.0224306 | null | cs.CV q-bio.NC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The current dominant visual processing paradigm in both human and machine
research is the feedforward, layered hierarchy of neural-like processing
elements. Within this paradigm, visual saliency is seen by many to have a
specific role, namely that of early selection. Early selection is thought to
enable very fast vis... | [
{
"created": "Tue, 15 Jan 2019 16:22:24 GMT",
"version": "v1"
},
{
"created": "Fri, 20 Dec 2019 14:43:38 GMT",
"version": "v2"
},
{
"created": "Thu, 30 Jan 2020 20:58:35 GMT",
"version": "v3"
}
] | 2020-02-03 | [
[
"Tsotsos",
"John K.",
""
],
[
"Kotseruba",
"Iuliia",
""
],
[
"Wloka",
"Calden",
""
]
] | The current dominant visual processing paradigm in both human and machine research is the feedforward, layered hierarchy of neural-like processing elements. Within this paradigm, visual saliency is seen by many to have a specific role, namely that of early selection. Early selection is thought to enable very fast visua... |
1809.04170 | S\'ebastien Philippe | S\'ebastien Philippe, Alexander Glaser, and Edward W. Felten | A Cryptographic Escrow for Treaty Declarations and Step-by-Step
Verification | 14 pages, 4 figures | Science & Global Security, pp.1-12 (2019) | 10.1080/08929882.2019.1573483 | null | cs.CR cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The verification of arms-control and disarmament agreements requires states
to provide declarations, including information on sensitive military sites and
assets. There are important cases, however, where negotiations of these
agreements are impeded because states are reluctant to provide any such data,
because of co... | [
{
"created": "Tue, 11 Sep 2018 21:17:18 GMT",
"version": "v1"
}
] | 2019-05-13 | [
[
"Philippe",
"Sébastien",
""
],
[
"Glaser",
"Alexander",
""
],
[
"Felten",
"Edward W.",
""
]
] | The verification of arms-control and disarmament agreements requires states to provide declarations, including information on sensitive military sites and assets. There are important cases, however, where negotiations of these agreements are impeded because states are reluctant to provide any such data, because of conc... |
2011.07222 | Risul Islam | Risul Islam, Md Omar Faruk Rokon, Ahmad Darki, Michalis Faloutsos | HackerScope: The Dynamics of a Massive Hacker Online Ecosystem | 8 pages, 7 figures, and 4 tables. In press of ASONAM'20 | null | null | null | cs.CR cs.IR | http://creativecommons.org/publicdomain/zero/1.0/ | Authors of malicious software are not hiding as much as one would assume:
they have a visible online footprint. Apart from online forums, this footprint
appears in software development platforms, where authors create
publicly-accessible malware repositories to share and collaborate. With the
exception of a few recent... | [
{
"created": "Sat, 14 Nov 2020 05:19:54 GMT",
"version": "v1"
}
] | 2020-11-17 | [
[
"Islam",
"Risul",
""
],
[
"Rokon",
"Md Omar Faruk",
""
],
[
"Darki",
"Ahmad",
""
],
[
"Faloutsos",
"Michalis",
""
]
] | Authors of malicious software are not hiding as much as one would assume: they have a visible online footprint. Apart from online forums, this footprint appears in software development platforms, where authors create publicly-accessible malware repositories to share and collaborate. With the exception of a few recent e... |
2111.11955 | Priyanka Meel | Chahat Raj, Priyanka Meel | People Lie, Actions Don't! Modeling Infodemic Proliferation Predictors
among Social Media Users | 32 pages | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Social media is interactive, and interaction brings misinformation. With the
growing amount of user-generated data, fake news on online platforms has become
much frequent since the arrival of social networks. Now and then, an event
occurs and becomes the topic of discussion, generating and propagating false
informati... | [
{
"created": "Tue, 23 Nov 2021 15:48:54 GMT",
"version": "v1"
}
] | 2021-11-24 | [
[
"Raj",
"Chahat",
""
],
[
"Meel",
"Priyanka",
""
]
] | Social media is interactive, and interaction brings misinformation. With the growing amount of user-generated data, fake news on online platforms has become much frequent since the arrival of social networks. Now and then, an event occurs and becomes the topic of discussion, generating and propagating false information... |
1511.07922 | Yi Zhang | Yi Zhang | Contraction of Ore Ideals with Applications | null | null | null | null | cs.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ore operators form a common algebraic abstraction of linear ordinary
differential and recurrence equations. Given an Ore operator $L$ with
polynomial coefficients in $x$, it generates a left ideal $I$ in the Ore
algebra over the field $\mathbf{k}(x)$ of rational functions. We present an
algorithm for computing a basi... | [
{
"created": "Wed, 25 Nov 2015 00:15:50 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Nov 2015 21:08:36 GMT",
"version": "v2"
},
{
"created": "Wed, 16 Dec 2015 06:54:48 GMT",
"version": "v3"
},
{
"created": "Thu, 17 Dec 2015 08:54:06 GMT",
"version": "v4"
},
{
"c... | 2016-02-01 | [
[
"Zhang",
"Yi",
""
]
] | Ore operators form a common algebraic abstraction of linear ordinary differential and recurrence equations. Given an Ore operator $L$ with polynomial coefficients in $x$, it generates a left ideal $I$ in the Ore algebra over the field $\mathbf{k}(x)$ of rational functions. We present an algorithm for computing a basis ... |
1704.03118 | Neil Zhenqiang Gong | Neil Zhenqiang Gong, Altay Ozen, Yu Wu, Xiaoyu Cao, Richard Shin, Dawn
Song, Hongxia Jin and Xuan Bao | PIANO: Proximity-based User Authentication on Voice-Powered
Internet-of-Things Devices | To appear in ICDCS'17 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Voice is envisioned to be a popular way for humans to interact with
Internet-of-Things (IoT) devices. We propose a proximity-based user
authentication method (called PIANO) for access control on such voice-powered
IoT devices. PIANO leverages the built-in speaker, microphone, and Bluetooth
that voice-powered IoT devi... | [
{
"created": "Tue, 11 Apr 2017 02:27:31 GMT",
"version": "v1"
}
] | 2017-04-12 | [
[
"Gong",
"Neil Zhenqiang",
""
],
[
"Ozen",
"Altay",
""
],
[
"Wu",
"Yu",
""
],
[
"Cao",
"Xiaoyu",
""
],
[
"Shin",
"Richard",
""
],
[
"Song",
"Dawn",
""
],
[
"Jin",
"Hongxia",
""
],
[
"Bao",
"Xuan"... | Voice is envisioned to be a popular way for humans to interact with Internet-of-Things (IoT) devices. We propose a proximity-based user authentication method (called PIANO) for access control on such voice-powered IoT devices. PIANO leverages the built-in speaker, microphone, and Bluetooth that voice-powered IoT device... |
2404.12555 | Tiffany Nguyen | Tiffany T. Nguyen, Cinthya Jauregui, Sarah H. Sallee, Mohan R.
Chandrasekar, Liam A'Hearn, Dominic J. Woetzel, Pinak Paliwal, Madison
Nguyen, Isabella `Amne Gomez, Xinqi Zhang, Lee M. Panich, Danielle M.
Heitmuller, Amy Lueck, Kai Lukoff | Sociotechnical Considerations for SLAM Anchors in Location-Based AR | Presented at CHI 2024 (arXiv:2404.05889) | null | null | ARSJ/2024/13 | cs.HC | http://creativecommons.org/licenses/by/4.0/ | In this position paper, we explore the power of storytelling and its
connection to place through the use of Augmented Reality (AR) technology,
particularly within the context of Th\'amien Ohlone history on the Santa Clara
University campus. To do this, we utilized SLAM and 8th Wall to create virtual,
location-based e... | [
{
"created": "Fri, 19 Apr 2024 00:19:43 GMT",
"version": "v1"
}
] | 2024-04-22 | [
[
"Nguyen",
"Tiffany T.",
""
],
[
"Jauregui",
"Cinthya",
""
],
[
"Sallee",
"Sarah H.",
""
],
[
"Chandrasekar",
"Mohan R.",
""
],
[
"A'Hearn",
"Liam",
""
],
[
"Woetzel",
"Dominic J.",
""
],
[
"Paliwal",
"Pinak",
... | In this position paper, we explore the power of storytelling and its connection to place through the use of Augmented Reality (AR) technology, particularly within the context of Th\'amien Ohlone history on the Santa Clara University campus. To do this, we utilized SLAM and 8th Wall to create virtual, location-based exp... |
2204.09610 | Noah Daniels | Polina Shpilker, John Freeman, Hailey McKelvie, Jill Ashey, Jay-Miguel
Fonticella, Hollie Putnam, Jane Greenberg, Lenore J. Cowen, Alva Couch, Noah
M. Daniels | MEDFORD: A human and machine readable metadata markup language | 10 pages, no figures | null | null | null | cs.DL cs.DB q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reproducibility of research is essential for science. However, in the way
modern computational biology research is done, it is easy to lose track of
small, but extremely critical, details. Key details, such as the specific
version of a software used or iteration of a genome can easily be lost in the
shuffle, or perha... | [
{
"created": "Wed, 20 Apr 2022 16:45:03 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Jun 2022 16:46:57 GMT",
"version": "v2"
}
] | 2022-06-17 | [
[
"Shpilker",
"Polina",
""
],
[
"Freeman",
"John",
""
],
[
"McKelvie",
"Hailey",
""
],
[
"Ashey",
"Jill",
""
],
[
"Fonticella",
"Jay-Miguel",
""
],
[
"Putnam",
"Hollie",
""
],
[
"Greenberg",
"Jane",
""
],
... | Reproducibility of research is essential for science. However, in the way modern computational biology research is done, it is easy to lose track of small, but extremely critical, details. Key details, such as the specific version of a software used or iteration of a genome can easily be lost in the shuffle, or perhaps... |
1203.1212 | Luciano Panek | Luciano Panek and Marcelo Firer | Codes Satisfying the Chain Condition with a Poset Weights | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we extend the concept of generalized Wei weights for
poset-weight codes and show that all linear codes C satisfy the chain condition
if support of C is a subposet totally ordered.
| [
{
"created": "Tue, 6 Mar 2012 14:43:55 GMT",
"version": "v1"
}
] | 2012-03-07 | [
[
"Panek",
"Luciano",
""
],
[
"Firer",
"Marcelo",
""
]
] | In this paper we extend the concept of generalized Wei weights for poset-weight codes and show that all linear codes C satisfy the chain condition if support of C is a subposet totally ordered. |
1904.07664 | Mika\"el Rabie | Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mika\"el
Rabie | Distributed Computing in the Asynchronous LOCAL model | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The LOCAL model is among the main models for studying locality in the
framework of distributed network computing. This model is however subject to
pertinent criticisms, including the facts that all nodes wake up
simultaneously, perform in lock steps, and are failure-free. We show that
relaxing these hypotheses to som... | [
{
"created": "Tue, 16 Apr 2019 13:40:25 GMT",
"version": "v1"
},
{
"created": "Mon, 20 May 2019 14:05:49 GMT",
"version": "v2"
},
{
"created": "Fri, 6 Dec 2019 17:27:16 GMT",
"version": "v3"
}
] | 2019-12-09 | [
[
"Delporte-Gallet",
"Carole",
""
],
[
"Fauconnier",
"Hugues",
""
],
[
"Fraigniaud",
"Pierre",
""
],
[
"Rabie",
"Mikaël",
""
]
] | The LOCAL model is among the main models for studying locality in the framework of distributed network computing. This model is however subject to pertinent criticisms, including the facts that all nodes wake up simultaneously, perform in lock steps, and are failure-free. We show that relaxing these hypotheses to some ... |
2108.04527 | Zan Gao | Zan Gao, Hongwei Wei, Weili Guan, Weizhi Nie, Meng Liu, Meng Wang | Multigranular Visual-Semantic Embedding for Cloth-Changing Person
Re-identification | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Person reidentification (ReID) is a very hot research topic in machine
learning and computer vision, and many person ReID approaches have been
proposed; however, most of these methods assume that the same person has the
same clothes within a short time interval, and thus their visual appearance
must be similar. Howev... | [
{
"created": "Tue, 10 Aug 2021 09:14:44 GMT",
"version": "v1"
}
] | 2021-08-11 | [
[
"Gao",
"Zan",
""
],
[
"Wei",
"Hongwei",
""
],
[
"Guan",
"Weili",
""
],
[
"Nie",
"Weizhi",
""
],
[
"Liu",
"Meng",
""
],
[
"Wang",
"Meng",
""
]
] | Person reidentification (ReID) is a very hot research topic in machine learning and computer vision, and many person ReID approaches have been proposed; however, most of these methods assume that the same person has the same clothes within a short time interval, and thus their visual appearance must be similar. However... |
1707.01736 | Emiel van Miltenburg | Emiel van Miltenburg, Desmond Elliott, Piek Vossen | Cross-linguistic differences and similarities in image descriptions | Accepted for INLG 2017, Santiago de Compostela, Spain, 4-7 September,
2017. Camera-ready version. See the ACL anthology for full bibliographic
information | null | null | null | cs.CL cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatic image description systems are commonly trained and evaluated on
large image description datasets. Recently, researchers have started to collect
such datasets for languages other than English. An unexplored question is how
different these datasets are from English and, if there are any differences,
what caus... | [
{
"created": "Thu, 6 Jul 2017 11:53:41 GMT",
"version": "v1"
},
{
"created": "Sun, 13 Aug 2017 10:18:44 GMT",
"version": "v2"
}
] | 2017-08-15 | [
[
"van Miltenburg",
"Emiel",
""
],
[
"Elliott",
"Desmond",
""
],
[
"Vossen",
"Piek",
""
]
] | Automatic image description systems are commonly trained and evaluated on large image description datasets. Recently, researchers have started to collect such datasets for languages other than English. An unexplored question is how different these datasets are from English and, if there are any differences, what causes... |
1911.04820 | Qiang Ren | Qiang Ren | Grouping Capsules Based Different Types | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Capsule network was introduced as a new architecture of neural networks, it
encoding features as capsules to overcome the lacking of equivariant in the
convolutional neural networks. It uses dynamic routing algorithm to train
parameters in different capsule layers, but the dynamic routing algorithm need
to be improve... | [
{
"created": "Tue, 12 Nov 2019 12:39:20 GMT",
"version": "v1"
}
] | 2019-11-13 | [
[
"Ren",
"Qiang",
""
]
] | Capsule network was introduced as a new architecture of neural networks, it encoding features as capsules to overcome the lacking of equivariant in the convolutional neural networks. It uses dynamic routing algorithm to train parameters in different capsule layers, but the dynamic routing algorithm need to be improved.... |
2402.01488 | Max Peter Ronecker | Max Peter Ronecker, Markus Schratter, Lukas Kuschnig and Daniel
Watzenig | Dynamic Occupancy Grids for Object Detection: A Radar-Centric Approach | Accepted at 2024 IEEE International Conference on Robotics and
Automation (ICRA) Second Version: Corrected Typos | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Dynamic Occupancy Grid Mapping is a technique used to generate a local map of
the environment containing both static and dynamic information. Typically,
these maps are primarily generated using lidar measurements. However, with
improvements in radar sensing, resulting in better accuracy and higher
resolution, radar i... | [
{
"created": "Fri, 2 Feb 2024 15:14:47 GMT",
"version": "v1"
},
{
"created": "Wed, 22 May 2024 02:55:49 GMT",
"version": "v2"
}
] | 2024-05-24 | [
[
"Ronecker",
"Max Peter",
""
],
[
"Schratter",
"Markus",
""
],
[
"Kuschnig",
"Lukas",
""
],
[
"Watzenig",
"Daniel",
""
]
] | Dynamic Occupancy Grid Mapping is a technique used to generate a local map of the environment containing both static and dynamic information. Typically, these maps are primarily generated using lidar measurements. However, with improvements in radar sensing, resulting in better accuracy and higher resolution, radar is ... |
1205.1860 | Mohandeep Sharma | Mohandeep Sharma, Dilip Kumar | Wishbone bus Architecture - A Survey and Comparison | 18 pages | International journal of VLSI Design & Communication Systems
(VLSICS) Vol.3, No.2 April 2012, 107-124 | 10.5121/vlsic.2012.3210 | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The performance of an on-chip interconnection architecture used for
communication between IP cores depends on the efficiency of its bus
architecture. Any bus architecture having advantages of faster bus clock speed,
extra data transfer cycle, improved bus width and throughput is highly
desirable for a low cost, reduc... | [
{
"created": "Wed, 9 May 2012 03:18:40 GMT",
"version": "v1"
}
] | 2012-05-10 | [
[
"Sharma",
"Mohandeep",
""
],
[
"Kumar",
"Dilip",
""
]
] | The performance of an on-chip interconnection architecture used for communication between IP cores depends on the efficiency of its bus architecture. Any bus architecture having advantages of faster bus clock speed, extra data transfer cycle, improved bus width and throughput is highly desirable for a low cost, reduced... |
2306.13935 | Abhishek Ghose | Emma Thuong Nguyen, Abhishek Ghose | Are Good Explainers Secretly Human-in-the-Loop Active Learners? | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Explainable AI (XAI) techniques have become popular for multiple use-cases in
the past few years. Here we consider its use in studying model predictions to
gather additional training data. We argue that this is equivalent to Active
Learning, where the query strategy involves a human-in-the-loop. We provide a
mathemat... | [
{
"created": "Sat, 24 Jun 2023 10:50:42 GMT",
"version": "v1"
},
{
"created": "Sat, 15 Jul 2023 14:03:55 GMT",
"version": "v2"
},
{
"created": "Tue, 16 Apr 2024 16:33:07 GMT",
"version": "v3"
}
] | 2024-04-17 | [
[
"Nguyen",
"Emma Thuong",
""
],
[
"Ghose",
"Abhishek",
""
]
] | Explainable AI (XAI) techniques have become popular for multiple use-cases in the past few years. Here we consider its use in studying model predictions to gather additional training data. We argue that this is equivalent to Active Learning, where the query strategy involves a human-in-the-loop. We provide a mathematic... |
2211.04259 | Istv\'an Andr\'as Seres | Domokos Mikl\'os Kelen and Istv\'an Andr\'as Seres | Towards Measuring the Traceability of Cryptocurrencies | Pre-print. Various major updates since the previous version. Added
more applications, explanation, and clarification | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Cryptocurrencies aim to replicate physical cash in the digital realm while
removing centralized and trusted intermediaries. Decentralization is achieved
by the blockchain, a permanent public ledger that contains a record of every
transaction. The public ledger ensures transparency, which enables public
verifiability ... | [
{
"created": "Tue, 8 Nov 2022 14:08:39 GMT",
"version": "v1"
},
{
"created": "Sat, 1 Jun 2024 14:05:33 GMT",
"version": "v2"
}
] | 2024-06-04 | [
[
"Kelen",
"Domokos Miklós",
""
],
[
"Seres",
"István András",
""
]
] | Cryptocurrencies aim to replicate physical cash in the digital realm while removing centralized and trusted intermediaries. Decentralization is achieved by the blockchain, a permanent public ledger that contains a record of every transaction. The public ledger ensures transparency, which enables public verifiability bu... |
1304.2744 | Donald H. Mitchell | Donald H. Mitchell, Steven A. Harp, David K. Simkin | A Knowledge Engineer's Comparison of Three Evidence Aggregation Methods | Appears in Proceedings of the Third Conference on Uncertainty in
Artificial Intelligence (UAI1987) | null | null | UAI-P-1987-PG-297-304 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The comparisons of uncertainty calculi from the last two Uncertainty
Workshops have all used theoretical probabilistic accuracy as the sole metric.
While mathematical correctness is important, there are other factors which
should be considered when developing reasoning systems. These other factors
include, among othe... | [
{
"created": "Wed, 27 Mar 2013 19:48:59 GMT",
"version": "v1"
}
] | 2013-04-11 | [
[
"Mitchell",
"Donald H.",
""
],
[
"Harp",
"Steven A.",
""
],
[
"Simkin",
"David K.",
""
]
] | The comparisons of uncertainty calculi from the last two Uncertainty Workshops have all used theoretical probabilistic accuracy as the sole metric. While mathematical correctness is important, there are other factors which should be considered when developing reasoning systems. These other factors include, among other ... |
1412.2109 | Janne H. Korhonen | Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Jukka Suomela | Algebrisation in Distributed Graph Algorithms: Fast Matrix
Multiplication in the Congested Clique | This paper has been withdrawn by the authors. This paper has been
superseded by arXiv:1503.04963 (merged from arXiv:1412.2109 and
arXiv:1412.2667) | null | null | null | cs.DC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While algebrisation constitutes a powerful technique in the design and
analysis of centralised algorithms, to date there have been hardly any
applications of algebraic techniques in the context of distributed graph
algorithms. This work is a case study that demonstrates the potential of
algebrisation in the distribut... | [
{
"created": "Fri, 5 Dec 2014 19:33:46 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Mar 2015 09:52:27 GMT",
"version": "v2"
}
] | 2015-03-19 | [
[
"Kaski",
"Petteri",
""
],
[
"Korhonen",
"Janne H.",
""
],
[
"Lenzen",
"Christoph",
""
],
[
"Suomela",
"Jukka",
""
]
] | While algebrisation constitutes a powerful technique in the design and analysis of centralised algorithms, to date there have been hardly any applications of algebraic techniques in the context of distributed graph algorithms. This work is a case study that demonstrates the potential of algebrisation in the distributed... |
2302.10730 | Lorenzo Vaquero | Saqib Nazir, Lorenzo Vaquero, Manuel Mucientes, V\'ictor M. Brea,
Daniela Coltuc | Depth Estimation and Image Restoration by Deep Learning from Defocused
Images | null | IEEE Transactions on Computational Imaging, vol. 9, pp. 607-619,
2023 | 10.1109/TCI.2023.3288335 | null | cs.CV eess.IV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Monocular depth estimation and image deblurring are two fundamental tasks in
computer vision, given their crucial role in understanding 3D scenes.
Performing any of them by relying on a single image is an ill-posed problem.
The recent advances in the field of Deep Convolutional Neural Networks (DNNs)
have revolutioni... | [
{
"created": "Tue, 21 Feb 2023 15:28:42 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Jul 2023 19:29:15 GMT",
"version": "v2"
}
] | 2023-07-31 | [
[
"Nazir",
"Saqib",
""
],
[
"Vaquero",
"Lorenzo",
""
],
[
"Mucientes",
"Manuel",
""
],
[
"Brea",
"Víctor M.",
""
],
[
"Coltuc",
"Daniela",
""
]
] | Monocular depth estimation and image deblurring are two fundamental tasks in computer vision, given their crucial role in understanding 3D scenes. Performing any of them by relying on a single image is an ill-posed problem. The recent advances in the field of Deep Convolutional Neural Networks (DNNs) have revolutionize... |
2104.09925 | Benjamin Rosen | Benjamin Rosen, Adnan M. Abu-Mahfouz and Ling Cheng | A Note on Slepian-Wolf Bounds for Several Node Grouping Configurations | 4 pages, 5 figures | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | The Slepian-Wolf bound on the admissible coding rate forms the most
fundamental aspect of distributed source coding. As such, it is necessary to
provide a framework with which to model more practical scenarios with respect
to the arrangement of nodes in order to make Slepian-Wolf coding more suitable
for multi-node W... | [
{
"created": "Tue, 20 Apr 2021 12:31:52 GMT",
"version": "v1"
}
] | 2021-04-21 | [
[
"Rosen",
"Benjamin",
""
],
[
"Abu-Mahfouz",
"Adnan M.",
""
],
[
"Cheng",
"Ling",
""
]
] | The Slepian-Wolf bound on the admissible coding rate forms the most fundamental aspect of distributed source coding. As such, it is necessary to provide a framework with which to model more practical scenarios with respect to the arrangement of nodes in order to make Slepian-Wolf coding more suitable for multi-node Wir... |
1505.07194 | Peng Liu | Peng Liu and Saeed Gazor and Il-Min Kim and Dong In Kim | Noncoherent Relaying in Energy Harvesting Communication Systems | null | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-sa/3.0/ | In energy harvesting (EH) relay networks, the coherent communication requires
accurate estima- tion/tracking of the instantaneous channel state information
(CSI) which consumes extra power. As a remedy, we propose two noncoherent EH
relaying protocols based on the amplify-and-forward (AF) relaying, namely,
power spli... | [
{
"created": "Wed, 27 May 2015 05:56:15 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Jun 2015 14:18:26 GMT",
"version": "v2"
}
] | 2015-06-15 | [
[
"Liu",
"Peng",
""
],
[
"Gazor",
"Saeed",
""
],
[
"Kim",
"Il-Min",
""
],
[
"Kim",
"Dong In",
""
]
] | In energy harvesting (EH) relay networks, the coherent communication requires accurate estima- tion/tracking of the instantaneous channel state information (CSI) which consumes extra power. As a remedy, we propose two noncoherent EH relaying protocols based on the amplify-and-forward (AF) relaying, namely, power splitt... |
2202.12575 | Guillaume Wisniewski Dr. | Aur\'elien Max and Guillaume Wisniewski | Mining Naturally-occurring Corrections and Paraphrases from Wikipedia's
Revision History | Accepted at LREC'10 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Naturally-occurring instances of linguistic phenomena are important both for
training and for evaluating automatic processes on text. When available in
large quantities, they also prove interesting material for linguistic studies.
In this article, we present a new resource built from Wikipedia's revision
history, cal... | [
{
"created": "Fri, 25 Feb 2022 09:24:38 GMT",
"version": "v1"
}
] | 2022-02-28 | [
[
"Max",
"Aurélien",
""
],
[
"Wisniewski",
"Guillaume",
""
]
] | Naturally-occurring instances of linguistic phenomena are important both for training and for evaluating automatic processes on text. When available in large quantities, they also prove interesting material for linguistic studies. In this article, we present a new resource built from Wikipedia's revision history, calle... |
1208.4809 | Husnabad Venkateswara Reddy | H. Venkateswara Reddy, Dr.S.Viswanadha Raju, B.Ramasubba Reddy | Comparing N-Node Set Importance Representative results with Node
Importance Representative results for Categorical Clustering: An exploratory
study | 16 pages, 4 figures, 3 equations | null | null | null | cs.DB | http://creativecommons.org/licenses/by/3.0/ | The proportionate increase in the size of the data with increase in space
implies that clustering a very large data set becomes difficult and is a time
consuming process.Sampling is one important technique to scale down the size of
dataset and to improve the efficiency of clustering. After sampling allocating
unlabel... | [
{
"created": "Thu, 23 Aug 2012 17:32:32 GMT",
"version": "v1"
}
] | 2015-03-13 | [
[
"Reddy",
"H. Venkateswara",
""
],
[
"Raju",
"Dr. S. Viswanadha",
""
],
[
"Reddy",
"B. Ramasubba",
""
]
] | The proportionate increase in the size of the data with increase in space implies that clustering a very large data set becomes difficult and is a time consuming process.Sampling is one important technique to scale down the size of dataset and to improve the efficiency of clustering. After sampling allocating unlabeled... |
2304.02554 | Mingqi Gao | Mingqi Gao, Jie Ruan, Renliang Sun, Xunjian Yin, Shiping Yang, Xiaojun
Wan | Human-like Summarization Evaluation with ChatGPT | 9 pages, 5 figures, in process | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Evaluating text summarization is a challenging problem, and existing
evaluation metrics are far from satisfactory. In this study, we explored
ChatGPT's ability to perform human-like summarization evaluation using four
human evaluation methods on five datasets. We found that ChatGPT was able to
complete annotations re... | [
{
"created": "Wed, 5 Apr 2023 16:17:32 GMT",
"version": "v1"
}
] | 2023-04-06 | [
[
"Gao",
"Mingqi",
""
],
[
"Ruan",
"Jie",
""
],
[
"Sun",
"Renliang",
""
],
[
"Yin",
"Xunjian",
""
],
[
"Yang",
"Shiping",
""
],
[
"Wan",
"Xiaojun",
""
]
] | Evaluating text summarization is a challenging problem, and existing evaluation metrics are far from satisfactory. In this study, we explored ChatGPT's ability to perform human-like summarization evaluation using four human evaluation methods on five datasets. We found that ChatGPT was able to complete annotations rela... |
2104.11386 | Nam Wook Kim | Nam Wook Kim | Recording Reusable and Guided Analytics From Interaction Histories | 2 pages, 2 figures, conference | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | The use of visual analytics tools has gained popularity in various domains,
helping users discover meaningful information from complex and large data sets.
Users often face difficulty in disseminating the knowledge discovered without
clear recall of their exploration paths and analysis processes. We introduce a
visua... | [
{
"created": "Fri, 23 Apr 2021 02:46:00 GMT",
"version": "v1"
}
] | 2021-04-26 | [
[
"Kim",
"Nam Wook",
""
]
] | The use of visual analytics tools has gained popularity in various domains, helping users discover meaningful information from complex and large data sets. Users often face difficulty in disseminating the knowledge discovered without clear recall of their exploration paths and analysis processes. We introduce a visual ... |
1811.08996 | Shipeng Wang | Shipeng Wang, Jian Sun and Zongben Xu | HyperAdam: A Learnable Task-Adaptive Adam for Network Training | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks are traditionally trained using human-designed
stochastic optimization algorithms, such as SGD and Adam. Recently, the
approach of learning to optimize network parameters has emerged as a promising
research topic. However, these learned black-box optimizers sometimes do not
fully utilize the expe... | [
{
"created": "Thu, 22 Nov 2018 02:37:53 GMT",
"version": "v1"
}
] | 2018-11-26 | [
[
"Wang",
"Shipeng",
""
],
[
"Sun",
"Jian",
""
],
[
"Xu",
"Zongben",
""
]
] | Deep neural networks are traditionally trained using human-designed stochastic optimization algorithms, such as SGD and Adam. Recently, the approach of learning to optimize network parameters has emerged as a promising research topic. However, these learned black-box optimizers sometimes do not fully utilize the experi... |
1604.02677 | Hao Chen | Hao Chen, Xiaojuan Qi, Lequan Yu, Pheng-Ann Heng | DCAN: Deep Contour-Aware Networks for Accurate Gland Segmentation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The morphology of glands has been used routinely by pathologists to assess
the malignancy degree of adenocarcinomas. Accurate segmentation of glands from
histology images is a crucial step to obtain reliable morphological statistics
for quantitative diagnosis. In this paper, we proposed an efficient deep
contour-awar... | [
{
"created": "Sun, 10 Apr 2016 12:12:24 GMT",
"version": "v1"
}
] | 2016-04-12 | [
[
"Chen",
"Hao",
""
],
[
"Qi",
"Xiaojuan",
""
],
[
"Yu",
"Lequan",
""
],
[
"Heng",
"Pheng-Ann",
""
]
] | The morphology of glands has been used routinely by pathologists to assess the malignancy degree of adenocarcinomas. Accurate segmentation of glands from histology images is a crucial step to obtain reliable morphological statistics for quantitative diagnosis. In this paper, we proposed an efficient deep contour-aware ... |
2407.05280 | Adri Bhattacharya | Pritam Goswami, Adri Bhattacharya, Raja Das and Partha Sarathi Mandal | Perpetual Exploration of a Ring in Presence of Byzantine Black Hole | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Perpetual exploration is a fundamental problem in the domain of mobile
agents, where an agent needs to visit each node infinitely often. This issue
has received lot of attention, mainly for ring topologies, presence of black
holes adds more complexity. A black hole can destroy any incoming agent without
any observabl... | [
{
"created": "Sun, 7 Jul 2024 06:41:17 GMT",
"version": "v1"
}
] | 2024-07-09 | [
[
"Goswami",
"Pritam",
""
],
[
"Bhattacharya",
"Adri",
""
],
[
"Das",
"Raja",
""
],
[
"Mandal",
"Partha Sarathi",
""
]
] | Perpetual exploration is a fundamental problem in the domain of mobile agents, where an agent needs to visit each node infinitely often. This issue has received lot of attention, mainly for ring topologies, presence of black holes adds more complexity. A black hole can destroy any incoming agent without any observable ... |
1309.3858 | Matias Korman | Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Birgit
Vogtenhuber | Geodesic-Preserving Polygon Simplification | null | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Polygons are a paramount data structure in computational geometry. While the
complexity of many algorithms on simple polygons or polygons with holes depends
on the size of the input polygon, the intrinsic complexity of the problems
these algorithms solve is often related to the reflex vertices of the polygon.
In this... | [
{
"created": "Mon, 16 Sep 2013 08:50:17 GMT",
"version": "v1"
}
] | 2013-09-17 | [
[
"Aichholzer",
"Oswin",
""
],
[
"Hackl",
"Thomas",
""
],
[
"Korman",
"Matias",
""
],
[
"Pilz",
"Alexander",
""
],
[
"Vogtenhuber",
"Birgit",
""
]
] | Polygons are a paramount data structure in computational geometry. While the complexity of many algorithms on simple polygons or polygons with holes depends on the size of the input polygon, the intrinsic complexity of the problems these algorithms solve is often related to the reflex vertices of the polygon. In this p... |
2301.06690 | Jing Li | Jing Li, Di Kang, Wenjie Pei, Xuefei Zhe, Ying Zhang, Linchao Bao,
Zhenyu He | Audio2Gestures: Generating Diverse Gestures from Audio | arXiv admin note: substantial text overlap with arXiv:2108.06720 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | People may perform diverse gestures affected by various mental and physical
factors when speaking the same sentences. This inherent one-to-many
relationship makes co-speech gesture generation from audio particularly
challenging. Conventional CNNs/RNNs assume one-to-one mapping, and thus tend to
predict the average of... | [
{
"created": "Tue, 17 Jan 2023 04:09:58 GMT",
"version": "v1"
}
] | 2023-01-18 | [
[
"Li",
"Jing",
""
],
[
"Kang",
"Di",
""
],
[
"Pei",
"Wenjie",
""
],
[
"Zhe",
"Xuefei",
""
],
[
"Zhang",
"Ying",
""
],
[
"Bao",
"Linchao",
""
],
[
"He",
"Zhenyu",
""
]
] | People may perform diverse gestures affected by various mental and physical factors when speaking the same sentences. This inherent one-to-many relationship makes co-speech gesture generation from audio particularly challenging. Conventional CNNs/RNNs assume one-to-one mapping, and thus tend to predict the average of a... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.