id stringlengths 9 10 | submitter stringlengths 1 64 ⌀ | authors stringlengths 4 20.7k | title stringlengths 4 246 | comments stringlengths 1 523 ⌀ | journal-ref stringlengths 4 404 ⌀ | doi stringlengths 11 153 ⌀ | report-no stringlengths 2 254 ⌀ | categories stringlengths 5 98 | license stringclasses 9
values | orig_abstract stringlengths 14 3.35k | versions listlengths 1 60 | update_date stringlengths 10 10 | authors_parsed listlengths 1 1.35k | abstract stringlengths 11 3.34k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2203.01057 | Le Yang | Le Yang, Junwei Han, Dingwen Zhang | Colar: Effective and Efficient Online Action Detection by Consulting
Exemplars | CVPR 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Online action detection has attracted increasing research interests in recent
years. Current works model historical dependencies and anticipate the future to
perceive the action evolution within a video segment and improve the detection
accuracy. However, the existing paradigm ignores category-level modeling and
does... | [
{
"created": "Wed, 2 Mar 2022 12:13:08 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Mar 2022 13:31:53 GMT",
"version": "v2"
}
] | 2022-03-23 | [
[
"Yang",
"Le",
""
],
[
"Han",
"Junwei",
""
],
[
"Zhang",
"Dingwen",
""
]
] | Online action detection has attracted increasing research interests in recent years. Current works model historical dependencies and anticipate the future to perceive the action evolution within a video segment and improve the detection accuracy. However, the existing paradigm ignores category-level modeling and does n... |
2002.02450 | Pavel Gulyaev | Pavel Gulyaev, Eugenia Elistratova, Vasily Konovalov, Yuri Kuratov,
Leonid Pugachev, Mikhail Burtsev | Goal-Oriented Multi-Task BERT-Based Dialogue State Tracker | null | null | null | null | cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dialogue State Tracking (DST) is a core component of virtual assistants such
as Alexa or Siri. To accomplish various tasks, these assistants need to support
an increasing number of services and APIs. The Schema-Guided State Tracking
track of the 8th Dialogue System Technology Challenge highlighted the DST
problem for... | [
{
"created": "Wed, 5 Feb 2020 22:56:12 GMT",
"version": "v1"
}
] | 2020-02-10 | [
[
"Gulyaev",
"Pavel",
""
],
[
"Elistratova",
"Eugenia",
""
],
[
"Konovalov",
"Vasily",
""
],
[
"Kuratov",
"Yuri",
""
],
[
"Pugachev",
"Leonid",
""
],
[
"Burtsev",
"Mikhail",
""
]
] | Dialogue State Tracking (DST) is a core component of virtual assistants such as Alexa or Siri. To accomplish various tasks, these assistants need to support an increasing number of services and APIs. The Schema-Guided State Tracking track of the 8th Dialogue System Technology Challenge highlighted the DST problem for u... |
2405.13721 | Zhiwei Bai | Zhiwei Bai, Jiajie Zhao, Yaoyu Zhang | Connectivity Shapes Implicit Regularization in Matrix Factorization
Models for Matrix Completion | 34 pages | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Matrix factorization models have been extensively studied as a valuable
test-bed for understanding the implicit biases of overparameterized models.
Although both low nuclear norm and low rank regularization have been studied
for these models, a unified understanding of when, how, and why they achieve
different implic... | [
{
"created": "Wed, 22 May 2024 15:12:14 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Bai",
"Zhiwei",
""
],
[
"Zhao",
"Jiajie",
""
],
[
"Zhang",
"Yaoyu",
""
]
] | Matrix factorization models have been extensively studied as a valuable test-bed for understanding the implicit biases of overparameterized models. Although both low nuclear norm and low rank regularization have been studied for these models, a unified understanding of when, how, and why they achieve different implicit... |
1807.08532 | Baha Eddine Youcef Belmekki | Baha Eddine Youcef Belmekki, Abdelkrim Hamza, Beno\^it Escrig | Performance Analysis of Cooperative Communications at Road Intersections
Using Stochastic Geometry Tools | 31 pages, 10 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vehicular safety communications (VSCs) are known to provide relevant
contributions to avoid congestions and prevent road accidents, and more
particularly at road intersections since these areas are more prone to
accidents. In this context, one of the main impairments that affect the
performance of VSCs are interferen... | [
{
"created": "Mon, 23 Jul 2018 11:12:26 GMT",
"version": "v1"
},
{
"created": "Sat, 13 Jul 2019 15:39:00 GMT",
"version": "v2"
},
{
"created": "Tue, 26 Nov 2019 17:14:05 GMT",
"version": "v3"
}
] | 2019-11-27 | [
[
"Belmekki",
"Baha Eddine Youcef",
""
],
[
"Hamza",
"Abdelkrim",
""
],
[
"Escrig",
"Benoît",
""
]
] | Vehicular safety communications (VSCs) are known to provide relevant contributions to avoid congestions and prevent road accidents, and more particularly at road intersections since these areas are more prone to accidents. In this context, one of the main impairments that affect the performance of VSCs are interference... |
1503.03283 | Ayineedi Venkateswarlu | Ayineedi Venkateswarlu, Santanu Sarkar and A. Sai Mali | On Acyclic Edge-Coloring of Complete Bipartite Graphs | 17 pages, 10 figures | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An acyclic edge-coloring of a graph is a proper edge-coloring without
bichromatic ($2$-colored) cycles. The acyclic chromatic index of a graph $G$,
denoted by $a'(G)$, is the least integer $k$ such that $G$ admits an acyclic
edge-coloring using $k$ colors. Let $\Delta = \Delta(G)$ denote the maximum
degree of a verte... | [
{
"created": "Wed, 11 Mar 2015 11:41:31 GMT",
"version": "v1"
}
] | 2015-03-12 | [
[
"Venkateswarlu",
"Ayineedi",
""
],
[
"Sarkar",
"Santanu",
""
],
[
"Mali",
"A. Sai",
""
]
] | An acyclic edge-coloring of a graph is a proper edge-coloring without bichromatic ($2$-colored) cycles. The acyclic chromatic index of a graph $G$, denoted by $a'(G)$, is the least integer $k$ such that $G$ admits an acyclic edge-coloring using $k$ colors. Let $\Delta = \Delta(G)$ denote the maximum degree of a vertex ... |
2212.03559 | Xihong Yang | Xihong Yang, Erxue Min, Ke Liang, Yue Liu, Siwei Wang, Sihang Zhou,
Huijun Wu, Xinwang Liu, En Zhu | GraphLearner: Graph Node Clustering with Fully Learnable Augmentation | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Contrastive deep graph clustering (CDGC) leverages the power of contrastive
learning to group nodes into different clusters. The quality of contrastive
samples is crucial for achieving better performance, making augmentation
techniques a key factor in the process. However, the augmentation samples in
existing methods... | [
{
"created": "Wed, 7 Dec 2022 10:19:39 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Sep 2023 13:14:07 GMT",
"version": "v2"
},
{
"created": "Tue, 6 Aug 2024 15:56:31 GMT",
"version": "v3"
}
] | 2024-08-07 | [
[
"Yang",
"Xihong",
""
],
[
"Min",
"Erxue",
""
],
[
"Liang",
"Ke",
""
],
[
"Liu",
"Yue",
""
],
[
"Wang",
"Siwei",
""
],
[
"Zhou",
"Sihang",
""
],
[
"Wu",
"Huijun",
""
],
[
"Liu",
"Xinwang",
""... | Contrastive deep graph clustering (CDGC) leverages the power of contrastive learning to group nodes into different clusters. The quality of contrastive samples is crucial for achieving better performance, making augmentation techniques a key factor in the process. However, the augmentation samples in existing methods a... |
2101.02839 | Haojian Zhang | Haojian Zhang, Yabin Zhang, Kui Jia, Lei Zhang | Unsupervised Domain Adaptation of Black-Box Source Models | null | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | Unsupervised domain adaptation (UDA) aims to learn models for a target domain
of unlabeled data by transferring knowledge from a labeled source domain. In
the traditional UDA setting, labeled source data are assumed to be available
for adaptation. Due to increasing concerns for data privacy, source-free UDA is
highly... | [
{
"created": "Fri, 8 Jan 2021 04:00:49 GMT",
"version": "v1"
},
{
"created": "Sun, 28 Mar 2021 02:13:16 GMT",
"version": "v2"
}
] | 2021-03-30 | [
[
"Zhang",
"Haojian",
""
],
[
"Zhang",
"Yabin",
""
],
[
"Jia",
"Kui",
""
],
[
"Zhang",
"Lei",
""
]
] | Unsupervised domain adaptation (UDA) aims to learn models for a target domain of unlabeled data by transferring knowledge from a labeled source domain. In the traditional UDA setting, labeled source data are assumed to be available for adaptation. Due to increasing concerns for data privacy, source-free UDA is highly a... |
1312.5307 | Bryan Ford | Joan Feigenbaum and Bryan Ford | Seeking Anonymity in an Internet Panopticon | 8 pages, 10 figures | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Obtaining and maintaining anonymity on the Internet is challenging. The state
of the art in deployed tools, such as Tor, uses onion routing (OR) to relay
encrypted connections on a detour passing through randomly chosen relays
scattered around the Internet. Unfortunately, OR is known to be vulnerable at
least in prin... | [
{
"created": "Wed, 18 Dec 2013 20:50:35 GMT",
"version": "v1"
},
{
"created": "Sat, 29 Mar 2014 15:33:45 GMT",
"version": "v2"
},
{
"created": "Sat, 3 Jan 2015 01:10:43 GMT",
"version": "v3"
}
] | 2015-01-06 | [
[
"Feigenbaum",
"Joan",
""
],
[
"Ford",
"Bryan",
""
]
] | Obtaining and maintaining anonymity on the Internet is challenging. The state of the art in deployed tools, such as Tor, uses onion routing (OR) to relay encrypted connections on a detour passing through randomly chosen relays scattered around the Internet. Unfortunately, OR is known to be vulnerable at least in princi... |
2206.13381 | Su Yuchen | Yuchen Su, Zhiwen Shao, Yong Zhou, Fanrong Meng, Hancheng Zhu, Bing
Liu, and Rui Yao | TextDCT: Arbitrary-Shaped Text Detection via Discrete Cosine Transform
Mask | This paper has been accepted by IEEE Transactions on Multimedia | null | 10.1109/TMM.2022.3186431 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Arbitrary-shaped scene text detection is a challenging task due to the
variety of text changes in font, size, color, and orientation. Most existing
regression based methods resort to regress the masks or contour points of text
regions to model the text instances. However, regressing the complete masks
requires high t... | [
{
"created": "Mon, 27 Jun 2022 15:42:25 GMT",
"version": "v1"
}
] | 2022-06-28 | [
[
"Su",
"Yuchen",
""
],
[
"Shao",
"Zhiwen",
""
],
[
"Zhou",
"Yong",
""
],
[
"Meng",
"Fanrong",
""
],
[
"Zhu",
"Hancheng",
""
],
[
"Liu",
"Bing",
""
],
[
"Yao",
"Rui",
""
]
] | Arbitrary-shaped scene text detection is a challenging task due to the variety of text changes in font, size, color, and orientation. Most existing regression based methods resort to regress the masks or contour points of text regions to model the text instances. However, regressing the complete masks requires high tra... |
1311.3048 | Ofer Neiman | Ittai Abraham and Cyril Gavoille and Anupam Gupta and Ofer Neiman and
Kunal Talwar | Cops, Robbers, and Threatening Skeletons: Padded Decomposition for
Minor-Free Graphs | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove that any graph excluding $K_r$ as a minor has can be partitioned
into clusters of diameter at most $\Delta$ while removing at most $O(r/\Delta)$
fraction of the edges. This improves over the results of Fakcharoenphol and
Talwar, who building on the work of Klein, Plotkin and Rao gave a partitioning
that requ... | [
{
"created": "Wed, 13 Nov 2013 08:21:04 GMT",
"version": "v1"
},
{
"created": "Sun, 10 Jan 2021 14:46:19 GMT",
"version": "v2"
}
] | 2021-01-12 | [
[
"Abraham",
"Ittai",
""
],
[
"Gavoille",
"Cyril",
""
],
[
"Gupta",
"Anupam",
""
],
[
"Neiman",
"Ofer",
""
],
[
"Talwar",
"Kunal",
""
]
] | We prove that any graph excluding $K_r$ as a minor has can be partitioned into clusters of diameter at most $\Delta$ while removing at most $O(r/\Delta)$ fraction of the edges. This improves over the results of Fakcharoenphol and Talwar, who building on the work of Klein, Plotkin and Rao gave a partitioning that requir... |
2006.02051 | Qiyao Deng | Qiyao Deng, Jie Cao, Yunfan Liu, Zhenhua Chai, Qi Li and Zhenan Sun | Reference-guided Face Component Editing | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Face portrait editing has achieved great progress in recent years. However,
previous methods either 1) operate on pre-defined face attributes, lacking the
flexibility of controlling shapes of high-level semantic facial components
(e.g., eyes, nose, mouth), or 2) take manually edited mask or sketch as an
intermediate ... | [
{
"created": "Wed, 3 Jun 2020 05:34:54 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Jul 2020 13:37:59 GMT",
"version": "v2"
}
] | 2020-07-15 | [
[
"Deng",
"Qiyao",
""
],
[
"Cao",
"Jie",
""
],
[
"Liu",
"Yunfan",
""
],
[
"Chai",
"Zhenhua",
""
],
[
"Li",
"Qi",
""
],
[
"Sun",
"Zhenan",
""
]
] | Face portrait editing has achieved great progress in recent years. However, previous methods either 1) operate on pre-defined face attributes, lacking the flexibility of controlling shapes of high-level semantic facial components (e.g., eyes, nose, mouth), or 2) take manually edited mask or sketch as an intermediate re... |
2109.13404 | Yunchou Xing | Yunchou Xing and Theodore S. Rappaport | Millimeter Wave and Terahertz Urban Microcell Propagation Measurements
and Models | 5 pages, 2 figures, and 3 tables | IEEE Communications Letters 2021 | 10.1109/LCOMM.2021.3117900 | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | Comparisons of outdoor Urban Microcell (UMi) large-scale path loss models,
root mean square (RMS) delay spreads (DS), angular spreads (AS), and the number
of spatial beams for extensive measurements performed at 28, 38, 73, and 142
GHz are presented in this letter. Measurement campaigns were conducted from
2011-2020 ... | [
{
"created": "Tue, 28 Sep 2021 00:08:56 GMT",
"version": "v1"
}
] | 2021-10-26 | [
[
"Xing",
"Yunchou",
""
],
[
"Rappaport",
"Theodore S.",
""
]
] | Comparisons of outdoor Urban Microcell (UMi) large-scale path loss models, root mean square (RMS) delay spreads (DS), angular spreads (AS), and the number of spatial beams for extensive measurements performed at 28, 38, 73, and 142 GHz are presented in this letter. Measurement campaigns were conducted from 2011-2020 in... |
2211.09443 | Amirmohammad Farzaneh | Amirmohammad Farzaneh, Mihai-Alin Badiu, Justin P. Coon | LEAST: a Low-Energy Adaptive Scalable Tree-based routing protocol for
Wireless Sensor Networks | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | Routing is one of the critical and ongoing challenges in Wireless Sensor
Networks. The main challenge has always been to have a routing protocol that
reduces the communication overhead, hence saving the energy of the sensors in
the network. Hierarchical routing protocols are known to be the most
energy-efficient rout... | [
{
"created": "Thu, 17 Nov 2022 10:11:42 GMT",
"version": "v1"
}
] | 2022-11-18 | [
[
"Farzaneh",
"Amirmohammad",
""
],
[
"Badiu",
"Mihai-Alin",
""
],
[
"Coon",
"Justin P.",
""
]
] | Routing is one of the critical and ongoing challenges in Wireless Sensor Networks. The main challenge has always been to have a routing protocol that reduces the communication overhead, hence saving the energy of the sensors in the network. Hierarchical routing protocols are known to be the most energy-efficient routin... |
2105.14923 | Bestoun Ahmed Dr. | Kamal Z. Zamli, Md. Abdul Kader, Saiful Azad, Bestoun S. Ahmed | Hybrid Henry Gas Solubility Optimization Algorithm with Dynamic
Cluster-to-Algorithm Mapping for Search-based Software Engineering Problems | 31 pages | Neural Computing and Applications 2021 | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | This paper discusses a new variant of the Henry Gas Solubility Optimization
(HGSO) Algorithm, called Hybrid HGSO (HHGSO). Unlike its predecessor, HHGSO
allows multiple clusters serving different individual meta-heuristic algorithms
(i.e., with its own defined parameters and local best) to coexist within the
same popu... | [
{
"created": "Mon, 31 May 2021 12:42:15 GMT",
"version": "v1"
}
] | 2021-06-01 | [
[
"Zamli",
"Kamal Z.",
""
],
[
"Kader",
"Md. Abdul",
""
],
[
"Azad",
"Saiful",
""
],
[
"Ahmed",
"Bestoun S.",
""
]
] | This paper discusses a new variant of the Henry Gas Solubility Optimization (HGSO) Algorithm, called Hybrid HGSO (HHGSO). Unlike its predecessor, HHGSO allows multiple clusters serving different individual meta-heuristic algorithms (i.e., with its own defined parameters and local best) to coexist within the same popula... |
2308.14710 | Xudong Wang | Xudong Wang and Ishan Misra and Ziyun Zeng and Rohit Girdhar and
Trevor Darrell | VideoCutLER: Surprisingly Simple Unsupervised Video Instance
Segmentation | Preprint. Code: https://github.com/facebookresearch/CutLER | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing approaches to unsupervised video instance segmentation typically
rely on motion estimates and experience difficulties tracking small or
divergent motions. We present VideoCutLER, a simple method for unsupervised
multi-instance video segmentation without using motion-based learning signals
like optical flow o... | [
{
"created": "Mon, 28 Aug 2023 17:10:12 GMT",
"version": "v1"
}
] | 2023-08-29 | [
[
"Wang",
"Xudong",
""
],
[
"Misra",
"Ishan",
""
],
[
"Zeng",
"Ziyun",
""
],
[
"Girdhar",
"Rohit",
""
],
[
"Darrell",
"Trevor",
""
]
] | Existing approaches to unsupervised video instance segmentation typically rely on motion estimates and experience difficulties tracking small or divergent motions. We present VideoCutLER, a simple method for unsupervised multi-instance video segmentation without using motion-based learning signals like optical flow or ... |
2405.12865 | Noriyoshi Sukegawa | Yuki Uehara, Naoki Nishimura, Yilin Li, Jie Yang, Deddy Jobson, Koya
Ohashi, Takeshi Matsumoto, Noriyoshi Sukegawa, Yuichi Takano | Robust portfolio optimization model for electronic coupon allocation | 9 pages, 17 figures, AAAI-2024 Workshop on Artificial Intelligence
for Operations Research | null | null | null | cs.IR math.OC | http://creativecommons.org/licenses/by/4.0/ | Currently, many e-commerce websites issue online/electronic coupons as an
effective tool for promoting sales of various products and services. We focus
on the problem of optimally allocating coupons to customers subject to a budget
constraint on an e-commerce website. We apply a robust portfolio optimization
model ba... | [
{
"created": "Tue, 21 May 2024 15:30:25 GMT",
"version": "v1"
}
] | 2024-05-22 | [
[
"Uehara",
"Yuki",
""
],
[
"Nishimura",
"Naoki",
""
],
[
"Li",
"Yilin",
""
],
[
"Yang",
"Jie",
""
],
[
"Jobson",
"Deddy",
""
],
[
"Ohashi",
"Koya",
""
],
[
"Matsumoto",
"Takeshi",
""
],
[
"Sukegawa",... | Currently, many e-commerce websites issue online/electronic coupons as an effective tool for promoting sales of various products and services. We focus on the problem of optimally allocating coupons to customers subject to a budget constraint on an e-commerce website. We apply a robust portfolio optimization model base... |
2209.01943 | Jianhui Ma | Jianhui Ma, Qiang Li, Zilong Liu, Linsong Du, Hongyang Chen, and
Nirwan Ansari | Jamming Modulation: An Active Anti-Jamming Scheme | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Providing quality communications under adversarial electronic attacks, e.g.,
broadband jamming attacks, is a challenging task. Unlike state-of-the-art
approaches which treat jamming signals as destructive interference, this paper
presents a novel active anti-jamming (AAJ) scheme for a jammed channel to
enhance the co... | [
{
"created": "Mon, 5 Sep 2022 12:48:20 GMT",
"version": "v1"
}
] | 2022-09-07 | [
[
"Ma",
"Jianhui",
""
],
[
"Li",
"Qiang",
""
],
[
"Liu",
"Zilong",
""
],
[
"Du",
"Linsong",
""
],
[
"Chen",
"Hongyang",
""
],
[
"Ansari",
"Nirwan",
""
]
] | Providing quality communications under adversarial electronic attacks, e.g., broadband jamming attacks, is a challenging task. Unlike state-of-the-art approaches which treat jamming signals as destructive interference, this paper presents a novel active anti-jamming (AAJ) scheme for a jammed channel to enhance the comm... |
2405.14548 | Vinicius Luiz Santos Silva | Vinicius L S Silva, Geraldine Regnier, Pablo Salinas, Claire E Heaney,
Matthew D Jackson, Christopher C Pain | Rapid modelling of reactive transport in porous media using machine
learning: limitations and solutions | null | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reactive transport in porous media plays a pivotal role in subsurface
reservoir processes, influencing fluid properties and geochemical
characteristics. However, coupling fluid flow and transport with geochemical
reactions is computationally intensive, requiring geochemical calculations at
each grid cell and each tim... | [
{
"created": "Thu, 23 May 2024 13:28:10 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Silva",
"Vinicius L S",
""
],
[
"Regnier",
"Geraldine",
""
],
[
"Salinas",
"Pablo",
""
],
[
"Heaney",
"Claire E",
""
],
[
"Jackson",
"Matthew D",
""
],
[
"Pain",
"Christopher C",
""
]
] | Reactive transport in porous media plays a pivotal role in subsurface reservoir processes, influencing fluid properties and geochemical characteristics. However, coupling fluid flow and transport with geochemical reactions is computationally intensive, requiring geochemical calculations at each grid cell and each time ... |
1808.07151 | Luke Rodriguez | Luke Rodriguez, Babak Salimi, Haoyue Ping, Julia Stoyanovich, Bill
Howe | MobilityMirror: Bias-Adjusted Transportation Datasets | Presented at BIDU 2018 workshop and published in Springer
Communications in Computer and Information Science vol 926 | Big Social Data and Urban Computing. BiDU 2018. Communications in
Computer and Information Science, vol 926. Springer, Cham | 10.1007/978-3-030-11238-7_2 | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe customized synthetic datasets for publishing mobility data.
Private companies are providing new transportation modalities, and their data
is of high value for integrative transportation research, policy enforcement,
and public accountability. However, these companies are disincentivized from
sharing data ... | [
{
"created": "Tue, 21 Aug 2018 22:19:48 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Aug 2018 01:28:03 GMT",
"version": "v2"
},
{
"created": "Fri, 25 Jan 2019 00:27:21 GMT",
"version": "v3"
}
] | 2019-01-28 | [
[
"Rodriguez",
"Luke",
""
],
[
"Salimi",
"Babak",
""
],
[
"Ping",
"Haoyue",
""
],
[
"Stoyanovich",
"Julia",
""
],
[
"Howe",
"Bill",
""
]
] | We describe customized synthetic datasets for publishing mobility data. Private companies are providing new transportation modalities, and their data is of high value for integrative transportation research, policy enforcement, and public accountability. However, these companies are disincentivized from sharing data no... |
2007.07320 | Tiansi Dong | Tiansi Dong, Chengjiang Li, Christian Bauckhage, Juanzi Li, Stefan
Wrobel, Armin B. Cremers | Learning Syllogism with Euler Neural-Networks | 16 pages, 6 figures | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traditional neural networks represent everything as a vector, and are able to
approximate a subset of logical reasoning to a certain degree. As basic logic
relations are better represented by topological relations between regions, we
propose a novel neural network that represents everything as a ball and is able
to l... | [
{
"created": "Tue, 14 Jul 2020 19:35:35 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Jul 2020 09:58:24 GMT",
"version": "v2"
}
] | 2020-07-21 | [
[
"Dong",
"Tiansi",
""
],
[
"Li",
"Chengjiang",
""
],
[
"Bauckhage",
"Christian",
""
],
[
"Li",
"Juanzi",
""
],
[
"Wrobel",
"Stefan",
""
],
[
"Cremers",
"Armin B.",
""
]
] | Traditional neural networks represent everything as a vector, and are able to approximate a subset of logical reasoning to a certain degree. As basic logic relations are better represented by topological relations between regions, we propose a novel neural network that represents everything as a ball and is able to lea... |
1704.03421 | Malika Bendechache | Malika Bendechache, Nhien-An Le-Khac, M-Tahar Kechadi | Efficient Large Scale Clustering based on Data Partitioning | 10 pages | Data Science and Advanced Analytics (DSAA), 2016 IEEE
International Conference on, 612--621, 2016 | 10.1109/DSAA.2016.70 | null | cs.DB cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clustering techniques are very attractive for extracting and identifying
patterns in datasets. However, their application to very large spatial datasets
presents numerous challenges such as high-dimensionality data, heterogeneity,
and high complexity of some algorithms. For instance, some algorithms may have
linear c... | [
{
"created": "Tue, 11 Apr 2017 17:05:01 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Feb 2018 15:23:31 GMT",
"version": "v2"
}
] | 2018-02-27 | [
[
"Bendechache",
"Malika",
""
],
[
"Le-Khac",
"Nhien-An",
""
],
[
"Kechadi",
"M-Tahar",
""
]
] | Clustering techniques are very attractive for extracting and identifying patterns in datasets. However, their application to very large spatial datasets presents numerous challenges such as high-dimensionality data, heterogeneity, and high complexity of some algorithms. For instance, some algorithms may have linear com... |
2306.06184 | Aldo Pacchiano | Nataly Brukhim, Miroslav Dudik, Aldo Pacchiano, Robert Schapire | A Unified Model and Dimension for Interactive Estimation | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study an abstract framework for interactive learning called interactive
estimation in which the goal is to estimate a target from its "similarity'' to
points queried by the learner. We introduce a combinatorial measure called
dissimilarity dimension which largely captures learnability in our model. We
present a si... | [
{
"created": "Fri, 9 Jun 2023 18:21:04 GMT",
"version": "v1"
}
] | 2023-06-13 | [
[
"Brukhim",
"Nataly",
""
],
[
"Dudik",
"Miroslav",
""
],
[
"Pacchiano",
"Aldo",
""
],
[
"Schapire",
"Robert",
""
]
] | We study an abstract framework for interactive learning called interactive estimation in which the goal is to estimate a target from its "similarity'' to points queried by the learner. We introduce a combinatorial measure called dissimilarity dimension which largely captures learnability in our model. We present a simp... |
2408.05792 | Jiafeng Xia | Jiafeng Xia, Dongsheng Li, Hansu Gu, Tun Lu and Ning Gu | GraphTransfer: A Generic Feature Fusion Framework for Collaborative
Filtering | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph Neural Networks (GNNs) have demonstrated effectiveness in collaborative
filtering tasks due to their ability to extract powerful structural features.
However, combining the graph features extracted from user-item interactions and
auxiliary features extracted from user genres and item properties remains a
challe... | [
{
"created": "Sun, 11 Aug 2024 14:47:34 GMT",
"version": "v1"
}
] | 2024-08-13 | [
[
"Xia",
"Jiafeng",
""
],
[
"Li",
"Dongsheng",
""
],
[
"Gu",
"Hansu",
""
],
[
"Lu",
"Tun",
""
],
[
"Gu",
"Ning",
""
]
] | Graph Neural Networks (GNNs) have demonstrated effectiveness in collaborative filtering tasks due to their ability to extract powerful structural features. However, combining the graph features extracted from user-item interactions and auxiliary features extracted from user genres and item properties remains a challeng... |
1708.05520 | Steffen Rechner | Steffen Rechner | An Optimal Realization Algorithm for Bipartite Graphs with Degrees in
Prescribed Intervals | Submitted to the Journal of Discrete Algorithms | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of constructing a bipartite graph whose degrees lie
in prescribed intervals. Necessary and sufficient conditions for the existence
of such graphs are well-known. However, existing realization algorithms suffer
from large running times. In this paper, we present a realization algorithm
that con... | [
{
"created": "Fri, 18 Aug 2017 06:58:37 GMT",
"version": "v1"
}
] | 2017-08-21 | [
[
"Rechner",
"Steffen",
""
]
] | We consider the problem of constructing a bipartite graph whose degrees lie in prescribed intervals. Necessary and sufficient conditions for the existence of such graphs are well-known. However, existing realization algorithms suffer from large running times. In this paper, we present a realization algorithm that const... |
2202.02705 | Sumedh Vilas Datar | Sumedh Vilas Datar and, Jesus Gonzales Bernal | Portrait Segmentation Using Deep Learning | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | A portrait is a painting, drawing, photograph, or engraving of a person,
especially one depicting only the face or head and shoulders. In the digital
world the portrait of a person is captured by having the person as a subject in
the image and capturing the image of the person such that the background is
blurred. DSL... | [
{
"created": "Sun, 6 Feb 2022 04:28:15 GMT",
"version": "v1"
}
] | 2022-02-08 | [
[
"and",
"Sumedh Vilas Datar",
""
],
[
"Bernal",
"Jesus Gonzales",
""
]
] | A portrait is a painting, drawing, photograph, or engraving of a person, especially one depicting only the face or head and shoulders. In the digital world the portrait of a person is captured by having the person as a subject in the image and capturing the image of the person such that the background is blurred. DSLRs... |
2311.09787 | EPTCS | Francesco Belardinelli (Imperial College London), Angelo Ferrando
(University of Genoa), Vadim Malvone (Telecom Paris) | 3vLTL: A Tool to Generate Automata for Three-valued LTL | In Proceedings FMAS 2023, arXiv:2311.08987 | EPTCS 395, 2023, pp. 180-187 | 10.4204/EPTCS.395.13 | null | cs.FL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Multi-valued logics have a long tradition in the literature on system
verification, including run-time verification. However, comparatively fewer
model-checking tools have been developed for multi-valued specification
languages. We present 3vLTL, a tool to generate Buchi automata from formulas in
Linear-time Temporal... | [
{
"created": "Thu, 16 Nov 2023 11:04:38 GMT",
"version": "v1"
}
] | 2023-11-17 | [
[
"Belardinelli",
"Francesco",
"",
"Imperial College London"
],
[
"Ferrando",
"Angelo",
"",
"University of Genoa"
],
[
"Malvone",
"Vadim",
"",
"Telecom Paris"
]
] | Multi-valued logics have a long tradition in the literature on system verification, including run-time verification. However, comparatively fewer model-checking tools have been developed for multi-valued specification languages. We present 3vLTL, a tool to generate Buchi automata from formulas in Linear-time Temporal L... |
2004.12496 | Amit Levi | Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten | Learning and Testing Junta Distributions with Subcube Conditioning | null | null | null | null | cs.DS cs.DM cs.LG math.PR math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problems of learning and testing junta distributions on
$\{-1,1\}^n$ with respect to the uniform distribution, where a distribution $p$
is a $k$-junta if its probability mass function $p(x)$ depends on a subset of
at most $k$ variables. The main contribution is an algorithm for finding
relevant coordinat... | [
{
"created": "Sun, 26 Apr 2020 22:52:53 GMT",
"version": "v1"
}
] | 2020-04-28 | [
[
"Chen",
"Xi",
""
],
[
"Jayaram",
"Rajesh",
""
],
[
"Levi",
"Amit",
""
],
[
"Waingarten",
"Erik",
""
]
] | We study the problems of learning and testing junta distributions on $\{-1,1\}^n$ with respect to the uniform distribution, where a distribution $p$ is a $k$-junta if its probability mass function $p(x)$ depends on a subset of at most $k$ variables. The main contribution is an algorithm for finding relevant coordinates... |
2010.07987 | Nadezhda Chirkova | Nadezhda Chirkova, Sergey Troshin | Empirical Study of Transformers for Source Code | Published at the ACM Joint European Software Engineering Conference
and Symposium on the Foundations of Software Engineering 2021 (ESEC/FSE'21) | null | 10.1145/3468264.3468611 | null | cs.LG cs.CL cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Initially developed for natural language processing (NLP), Transformers are
now widely used for source code processing, due to the format similarity
between source code and text. In contrast to natural language, source code is
strictly structured, i.e., it follows the syntax of the programming language.
Several recen... | [
{
"created": "Thu, 15 Oct 2020 19:09:15 GMT",
"version": "v1"
},
{
"created": "Thu, 24 Jun 2021 11:32:30 GMT",
"version": "v2"
}
] | 2021-06-25 | [
[
"Chirkova",
"Nadezhda",
""
],
[
"Troshin",
"Sergey",
""
]
] | Initially developed for natural language processing (NLP), Transformers are now widely used for source code processing, due to the format similarity between source code and text. In contrast to natural language, source code is strictly structured, i.e., it follows the syntax of the programming language. Several recent ... |
1109.2984 | Baoqi Huang Mr | Baoqi Huang, Tao Li, Brian D.O. Anderson, Changbin Yu | A Statistically Modelling Method for Performance Limits in Sensor
Localization | null | Automatica, Volume 49, Issue 2, 2013, Pages 503-509 | 10.1016/j.automatica.2012.11.011 | null | cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study performance limits of sensor localization from a
novel perspective. Specifically, we consider the Cramer-Rao Lower Bound (CRLB)
in single-hop sensor localization using measurements from received signal
strength (RSS), time of arrival (TOA) and bearing, respectively, but
differently from the ex... | [
{
"created": "Wed, 14 Sep 2011 03:40:31 GMT",
"version": "v1"
}
] | 2018-01-30 | [
[
"Huang",
"Baoqi",
""
],
[
"Li",
"Tao",
""
],
[
"Anderson",
"Brian D. O.",
""
],
[
"Yu",
"Changbin",
""
]
] | In this paper, we study performance limits of sensor localization from a novel perspective. Specifically, we consider the Cramer-Rao Lower Bound (CRLB) in single-hop sensor localization using measurements from received signal strength (RSS), time of arrival (TOA) and bearing, respectively, but differently from the exis... |
2101.06883 | Guangyu Huo | Guangyu Huo, Yong Zhang, Junbin Gao, Boyue Wang, Yongli Hu, and Baocai
Yin | CaEGCN: Cross-Attention Fusion based Enhanced Graph Convolutional
Network for Clustering | null | IEEE Transactions on Knowledge and Data Engineering 2021 | 10.1109/TKDE.2021.3125020 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the powerful learning ability of deep convolutional networks, deep
clustering methods can extract the most discriminative information from
individual data and produce more satisfactory clustering results. However,
existing deep clustering methods usually ignore the relationship between the
data. Fortunately, the... | [
{
"created": "Mon, 18 Jan 2021 05:21:59 GMT",
"version": "v1"
}
] | 2022-01-10 | [
[
"Huo",
"Guangyu",
""
],
[
"Zhang",
"Yong",
""
],
[
"Gao",
"Junbin",
""
],
[
"Wang",
"Boyue",
""
],
[
"Hu",
"Yongli",
""
],
[
"Yin",
"Baocai",
""
]
] | With the powerful learning ability of deep convolutional networks, deep clustering methods can extract the most discriminative information from individual data and produce more satisfactory clustering results. However, existing deep clustering methods usually ignore the relationship between the data. Fortunately, the g... |
2408.00395 | Cansu Betin Onur | Cansu Betin Onur | A Zero-Knowledge Proof of Knowledge for Subgroup Distance Problem | null | null | null | null | cs.CR math.GR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In this study, we introduce a novel zero-knowledge identification scheme
based on the hardness of the subgroup distance problem in the Hamming metric.
The proposed protocol, named Subgroup Distance Zero Knowledge Proof (SDZKP),
employs a cryptographically secure pseudorandom number generator to mask
secrets and utili... | [
{
"created": "Thu, 1 Aug 2024 09:04:50 GMT",
"version": "v1"
}
] | 2024-08-02 | [
[
"Onur",
"Cansu Betin",
""
]
] | In this study, we introduce a novel zero-knowledge identification scheme based on the hardness of the subgroup distance problem in the Hamming metric. The proposed protocol, named Subgroup Distance Zero Knowledge Proof (SDZKP), employs a cryptographically secure pseudorandom number generator to mask secrets and utilize... |
2103.04357 | Lei Sun | Lei Sun | IRON: Invariant-based Highly Robust Point Cloud Registration | null | null | null | null | cs.CV cs.RO | http://creativecommons.org/publicdomain/zero/1.0/ | In this paper, we present IRON (Invariant-based global Robust estimation and
OptimizatioN), a non-minimal and highly robust solution for point cloud
registration with a great number of outliers among the correspondences. To
realize this, we decouple the registration problem into the estimation of
scale, rotation and ... | [
{
"created": "Sun, 7 Mar 2021 13:46:56 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Mar 2021 07:46:14 GMT",
"version": "v2"
}
] | 2021-04-21 | [
[
"Sun",
"Lei",
""
]
] | In this paper, we present IRON (Invariant-based global Robust estimation and OptimizatioN), a non-minimal and highly robust solution for point cloud registration with a great number of outliers among the correspondences. To realize this, we decouple the registration problem into the estimation of scale, rotation and tr... |
2112.02749 | Suzhen Wang | Suzhen Wang, Lincheng Li, Yu Ding, Xin Yu | One-shot Talking Face Generation from Single-speaker Audio-Visual
Correlation Learning | Accepted by AAAI 2022 | AAAI 2022 | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Audio-driven one-shot talking face generation methods are usually trained on
video resources of various persons. However, their created videos often suffer
unnatural mouth shapes and asynchronous lips because those methods struggle to
learn a consistent speech style from different speakers. We observe that it
would b... | [
{
"created": "Mon, 6 Dec 2021 02:53:51 GMT",
"version": "v1"
}
] | 2021-12-07 | [
[
"Wang",
"Suzhen",
""
],
[
"Li",
"Lincheng",
""
],
[
"Ding",
"Yu",
""
],
[
"Yu",
"Xin",
""
]
] | Audio-driven one-shot talking face generation methods are usually trained on video resources of various persons. However, their created videos often suffer unnatural mouth shapes and asynchronous lips because those methods struggle to learn a consistent speech style from different speakers. We observe that it would be ... |
2206.04789 | Tianxin Wei | Tianxin Wei, Jingrui He | Comprehensive Fair Meta-learned Recommender System | Accepted to SIGKDD 2022 | null | 10.1145/3534678.3539269 | null | cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recommender systems, one common challenge is the cold-start problem, where
interactions are very limited for fresh users in the systems. To address this
challenge, recently, many works introduce the meta-optimization idea into the
recommendation scenarios, i.e. learning to learn the user preference by only a
few p... | [
{
"created": "Thu, 9 Jun 2022 22:48:35 GMT",
"version": "v1"
}
] | 2022-06-13 | [
[
"Wei",
"Tianxin",
""
],
[
"He",
"Jingrui",
""
]
] | In recommender systems, one common challenge is the cold-start problem, where interactions are very limited for fresh users in the systems. To address this challenge, recently, many works introduce the meta-optimization idea into the recommendation scenarios, i.e. learning to learn the user preference by only a few pas... |
1311.4809 | Siddhartan Govindasamy | Siddhartan Govindasamy | Uplink Performance of Large Optimum-Combining Antenna Arrays in
Poisson-Cell Networks | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The uplink of a wireless network with base stations distributed according to
a Poisson Point Process (PPP) is analyzed. The base stations are assumed to
have a large number of antennas and use linear minimum-mean-square-error (MMSE)
spatial processing for multiple access. The number of active mobiles per cell
is limi... | [
{
"created": "Tue, 19 Nov 2013 17:17:16 GMT",
"version": "v1"
}
] | 2013-11-20 | [
[
"Govindasamy",
"Siddhartan",
""
]
] | The uplink of a wireless network with base stations distributed according to a Poisson Point Process (PPP) is analyzed. The base stations are assumed to have a large number of antennas and use linear minimum-mean-square-error (MMSE) spatial processing for multiple access. The number of active mobiles per cell is limite... |
1601.03055 | Yuqing Hou | Yuqing Hou, Zhouchen Lin, Jin-ge Yao | Subspace Clustering Based Tag Sharing for Inductive Tag Matrix
Refinement with Complex Errors | 4 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Annotating images with tags is useful for indexing and retrieving images.
However, many available annotation data include missing or inaccurate
annotations. In this paper, we propose an image annotation framework which
sequentially performs tag completion and refinement. We utilize the subspace
property of data via s... | [
{
"created": "Tue, 12 Jan 2016 21:03:43 GMT",
"version": "v1"
},
{
"created": "Tue, 1 Mar 2016 04:41:53 GMT",
"version": "v2"
},
{
"created": "Tue, 21 Jun 2016 15:48:06 GMT",
"version": "v3"
}
] | 2016-06-22 | [
[
"Hou",
"Yuqing",
""
],
[
"Lin",
"Zhouchen",
""
],
[
"Yao",
"Jin-ge",
""
]
] | Annotating images with tags is useful for indexing and retrieving images. However, many available annotation data include missing or inaccurate annotations. In this paper, we propose an image annotation framework which sequentially performs tag completion and refinement. We utilize the subspace property of data via spa... |
2305.13864 | Qiong Chen | Yong Yang and Qiong Chen and Yuan Feng and Tianlin Huang | MIANet: Aggregating Unbiased Instance and General Information for
Few-Shot Semantic Segmentation | Accepted to CVPR 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Existing few-shot segmentation methods are based on the meta-learning
strategy and extract instance knowledge from a support set and then apply the
knowledge to segment target objects in a query set. However, the extracted
knowledge is insufficient to cope with the variable intra-class differences
since the knowledge... | [
{
"created": "Tue, 23 May 2023 09:36:27 GMT",
"version": "v1"
}
] | 2023-05-24 | [
[
"Yang",
"Yong",
""
],
[
"Chen",
"Qiong",
""
],
[
"Feng",
"Yuan",
""
],
[
"Huang",
"Tianlin",
""
]
] | Existing few-shot segmentation methods are based on the meta-learning strategy and extract instance knowledge from a support set and then apply the knowledge to segment target objects in a query set. However, the extracted knowledge is insufficient to cope with the variable intra-class differences since the knowledge i... |
2406.04910 | Binglei Lou | Binglei Lou, Richard Rademacher, David Boland, Philip H.W. Leong | PolyLUT-Add: FPGA-based LUT Inference with Wide Inputs | To be published in the International Conference on Field-Programmable
Logic and Applications (FPL) 2024 | null | null | null | cs.LG cs.AI cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | FPGAs have distinct advantages as a technology for deploying deep neural
networks (DNNs) at the edge. Lookup Table (LUT) based networks, where neurons
are directly modelled using LUTs, help maximize this promise of offering
ultra-low latency and high area efficiency on FPGAs. Unfortunately, LUT
resource usage scales ... | [
{
"created": "Fri, 7 Jun 2024 13:00:57 GMT",
"version": "v1"
}
] | 2024-06-10 | [
[
"Lou",
"Binglei",
""
],
[
"Rademacher",
"Richard",
""
],
[
"Boland",
"David",
""
],
[
"Leong",
"Philip H. W.",
""
]
] | FPGAs have distinct advantages as a technology for deploying deep neural networks (DNNs) at the edge. Lookup Table (LUT) based networks, where neurons are directly modelled using LUTs, help maximize this promise of offering ultra-low latency and high area efficiency on FPGAs. Unfortunately, LUT resource usage scales ex... |
2212.03191 | Yi Wang | Yi Wang, Kunchang Li, Yizhuo Li, Yinan He, Bingkun Huang, Zhiyu Zhao,
Hongjie Zhang, Jilan Xu, Yi Liu, Zun Wang, Sen Xing, Guo Chen, Junting Pan,
Jiashuo Yu, Yali Wang, Limin Wang, Yu Qiao | InternVideo: General Video Foundation Models via Generative and
Discriminative Learning | technical report | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | The foundation models have recently shown excellent performance on a variety
of downstream tasks in computer vision. However, most existing vision
foundation models simply focus on image-level pretraining and adpation, which
are limited for dynamic and complex video-level understanding tasks. To fill
the gap, we pres... | [
{
"created": "Tue, 6 Dec 2022 18:09:49 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Dec 2022 12:20:55 GMT",
"version": "v2"
}
] | 2022-12-08 | [
[
"Wang",
"Yi",
""
],
[
"Li",
"Kunchang",
""
],
[
"Li",
"Yizhuo",
""
],
[
"He",
"Yinan",
""
],
[
"Huang",
"Bingkun",
""
],
[
"Zhao",
"Zhiyu",
""
],
[
"Zhang",
"Hongjie",
""
],
[
"Xu",
"Jilan",
... | The foundation models have recently shown excellent performance on a variety of downstream tasks in computer vision. However, most existing vision foundation models simply focus on image-level pretraining and adpation, which are limited for dynamic and complex video-level understanding tasks. To fill the gap, we presen... |
2407.09766 | Stephen Jimmy | Stephen Jimmy and Kalkidan Berhane and Kevin Muhammad | User Digital Twin-Driven Video Streaming for Customized Preferences and
Adaptive Transcoding | null | null | null | null | cs.MM cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the rapidly evolving field of multimedia services, video streaming has
become increasingly prevalent, demanding innovative solutions to enhance user
experience and system efficiency. This paper introduces a novel approach that
integrates user digital twins-a dynamic digital representation of a user's
preferences a... | [
{
"created": "Sat, 13 Jul 2024 04:15:02 GMT",
"version": "v1"
}
] | 2024-07-16 | [
[
"Jimmy",
"Stephen",
""
],
[
"Berhane",
"Kalkidan",
""
],
[
"Muhammad",
"Kevin",
""
]
] | In the rapidly evolving field of multimedia services, video streaming has become increasingly prevalent, demanding innovative solutions to enhance user experience and system efficiency. This paper introduces a novel approach that integrates user digital twins-a dynamic digital representation of a user's preferences and... |
1211.4935 | Keehang Kwon | Keehang Kwon and Daeseong Kang | Mutually Exclusive Rules in LogicWeb | 4 pages | null | null | null | cs.LO cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | LogicWeb has traditionally lacked devices for expressing mutually exclusive
clauses. We address this limitation by adopting choice-conjunctive clauses of
the form $D_0 \adc D_1$ where $D_0, D_1$ are Horn clauses and $\adc$ is a
linear logic connective. Solving a goal $G$ using $D_0 \adc D_1$ -- $\prov(D_0
\adc D_1,G)... | [
{
"created": "Wed, 21 Nov 2012 04:54:05 GMT",
"version": "v1"
}
] | 2012-11-22 | [
[
"Kwon",
"Keehang",
""
],
[
"Kang",
"Daeseong",
""
]
] | LogicWeb has traditionally lacked devices for expressing mutually exclusive clauses. We address this limitation by adopting choice-conjunctive clauses of the form $D_0 \adc D_1$ where $D_0, D_1$ are Horn clauses and $\adc$ is a linear logic connective. Solving a goal $G$ using $D_0 \adc D_1$ -- $\prov(D_0 \adc D_1,G)$ ... |
0907.0340 | James Whitacre | James M. Whitacre, Hussein A. Abbass, Ruhul Sarker, Axel Bender,
Stephen Baker | Strategic Positioning in Tactical Scenario Planning | null | Genetic And Evolutionary Computation Conference 2008, Pages
1081-1088 | 10.1145/1389095.1389293 | null | cs.NE cs.AI | http://creativecommons.org/licenses/by/3.0/ | Capability planning problems are pervasive throughout many areas of human
interest with prominent examples found in defense and security. Planning
provides a unique context for optimization that has not been explored in great
detail and involves a number of interesting challenges which are distinct from
traditional o... | [
{
"created": "Thu, 2 Jul 2009 10:56:52 GMT",
"version": "v1"
}
] | 2009-07-03 | [
[
"Whitacre",
"James M.",
""
],
[
"Abbass",
"Hussein A.",
""
],
[
"Sarker",
"Ruhul",
""
],
[
"Bender",
"Axel",
""
],
[
"Baker",
"Stephen",
""
]
] | Capability planning problems are pervasive throughout many areas of human interest with prominent examples found in defense and security. Planning provides a unique context for optimization that has not been explored in great detail and involves a number of interesting challenges which are distinct from traditional opt... |
1709.07807 | Juan Pablo Vigneaux | Juan Pablo Vigneaux | Information structures and their cohomology | 54 pages, 1 figure. This improved version was finally published in
Theory and Applications of Categories. It took into account multiple
suggestion of the reviewer | Theory and Applications of Categories, Vol. 35, 2020, No. 38, pp
1476-1529 | null | null | cs.IT math.AT math.IT math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the category of information structures, whose objects are
suitable diagrams of measurable sets that encode the possible outputs of a
given family of observables and their mutual relationships of refinement; they
serve as mathematical models of contextuality in classical and quantum
settings. Each informa... | [
{
"created": "Fri, 22 Sep 2017 15:19:11 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Oct 2018 09:39:13 GMT",
"version": "v2"
},
{
"created": "Tue, 15 Oct 2019 17:09:25 GMT",
"version": "v3"
},
{
"created": "Mon, 8 Nov 2021 18:52:00 GMT",
"version": "v4"
}
] | 2021-11-09 | [
[
"Vigneaux",
"Juan Pablo",
""
]
] | We introduce the category of information structures, whose objects are suitable diagrams of measurable sets that encode the possible outputs of a given family of observables and their mutual relationships of refinement; they serve as mathematical models of contextuality in classical and quantum settings. Each informati... |
2009.10990 | Rohun Kshirsagar | Rohun Kshirsagar, Li-Yen Hsu, Vatshank Chaturvedi, Charles H.
Greenberg, Matthew McClelland, Anushadevi Mohan, Wideet Shende, Nicolas P.
Tilmans, Renzo Frigato, Min Guo, Ankit Chheda, Meredith Trotter, Shonket Ray,
Arnold Lee, Miguel Alvarado | Accurate and Interpretable Machine Learning for Transparent Pricing of
Health Insurance Plans | Accepted for publication in The Thirty-Fifth AAAI Conference on
Artificial Intelligence (AAAI-21), in the Innovative Applications of
Artificial Intelligence track. This is the extended version with some
stylistic fixes from the first posting and complete author list | null | null | null | cs.CY cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Health insurance companies cover half of the United States population through
commercial employer-sponsored health plans and pay 1.2 trillion US dollars
every year to cover medical expenses for their members. The actuary and
underwriter roles at a health insurance company serve to assess which risks to
take on and ho... | [
{
"created": "Wed, 23 Sep 2020 08:07:33 GMT",
"version": "v1"
},
{
"created": "Sat, 27 Feb 2021 22:47:22 GMT",
"version": "v2"
}
] | 2021-03-02 | [
[
"Kshirsagar",
"Rohun",
""
],
[
"Hsu",
"Li-Yen",
""
],
[
"Chaturvedi",
"Vatshank",
""
],
[
"Greenberg",
"Charles H.",
""
],
[
"McClelland",
"Matthew",
""
],
[
"Mohan",
"Anushadevi",
""
],
[
"Shende",
"Wideet",
... | Health insurance companies cover half of the United States population through commercial employer-sponsored health plans and pay 1.2 trillion US dollars every year to cover medical expenses for their members. The actuary and underwriter roles at a health insurance company serve to assess which risks to take on and how ... |
2401.15443 | Zibin Dong | Zibin Dong, Jianye Hao, Yifu Yuan, Fei Ni, Yitian Wang, Pengyi Li and
Yan Zheng | DiffuserLite: Towards Real-time Diffusion Planning | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Diffusion planning has been recognized as an effective decision-making
paradigm in various domains. The capability of conditionally generating
high-quality long-horizon trajectories makes it a promising research direction.
However, existing diffusion planning methods suffer from low decision-making
frequencies due to... | [
{
"created": "Sat, 27 Jan 2024 15:30:49 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Jan 2024 04:43:27 GMT",
"version": "v2"
},
{
"created": "Wed, 31 Jan 2024 02:50:41 GMT",
"version": "v3"
},
{
"created": "Fri, 2 Feb 2024 08:57:16 GMT",
"version": "v4"
}
] | 2024-02-05 | [
[
"Dong",
"Zibin",
""
],
[
"Hao",
"Jianye",
""
],
[
"Yuan",
"Yifu",
""
],
[
"Ni",
"Fei",
""
],
[
"Wang",
"Yitian",
""
],
[
"Li",
"Pengyi",
""
],
[
"Zheng",
"Yan",
""
]
] | Diffusion planning has been recognized as an effective decision-making paradigm in various domains. The capability of conditionally generating high-quality long-horizon trajectories makes it a promising research direction. However, existing diffusion planning methods suffer from low decision-making frequencies due to t... |
2002.03749 | Hartmut Feld | Hartmut Feld, Bruno Mirbach, Jigyasa Katrolia, Mohamed Selim, Oliver
Wasenm\"uller, Didier Stricker | DFKI Cabin Simulator: A Test Platform for Visual In-Cabin Monitoring
Functions | corrected typos and bad reference | null | null | null | cs.CV cs.HC cs.LG cs.RO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a test platform for visual in-cabin scene analysis and occupant
monitoring functions. The test platform is based on a driving simulator
developed at the DFKI, consisting of a realistic in-cabin mock-up and a
wide-angle projection system for a realistic driving experience. The platform
has been equipped wit... | [
{
"created": "Tue, 28 Jan 2020 07:15:50 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Feb 2020 12:27:42 GMT",
"version": "v2"
}
] | 2020-02-12 | [
[
"Feld",
"Hartmut",
""
],
[
"Mirbach",
"Bruno",
""
],
[
"Katrolia",
"Jigyasa",
""
],
[
"Selim",
"Mohamed",
""
],
[
"Wasenmüller",
"Oliver",
""
],
[
"Stricker",
"Didier",
""
]
] | We present a test platform for visual in-cabin scene analysis and occupant monitoring functions. The test platform is based on a driving simulator developed at the DFKI, consisting of a realistic in-cabin mock-up and a wide-angle projection system for a realistic driving experience. The platform has been equipped with ... |
0910.4049 | Nizami Gasilov | N. Gasilov, \c{S}ahin Emrah Amrahov, A. Golayoglu Fatullayev, H. I.
Karakas, O. Akin | A Geometric Approach to Solve Fuzzy Linear Systems | null | CMES: Computer Modeling in Engineering & Sciences, Vol. 75, No. 3,
pp. 189-204, 2011 | 10.3970/cmes.2011.075.189 | null | cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, linear systems with a crisp real coefficient matrix and with a
vector of fuzzy triangular numbers on the right-hand side are studied. A new
method, which is based on the geometric representations of linear
transformations, is proposed to find solutions. The method uses the fact that a
vector of fuzzy t... | [
{
"created": "Wed, 21 Oct 2009 11:20:37 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Apr 2011 08:06:58 GMT",
"version": "v2"
}
] | 2011-11-03 | [
[
"Gasilov",
"N.",
""
],
[
"Amrahov",
"Şahin Emrah",
""
],
[
"Fatullayev",
"A. Golayoglu",
""
],
[
"Karakas",
"H. I.",
""
],
[
"Akin",
"O.",
""
]
] | In this paper, linear systems with a crisp real coefficient matrix and with a vector of fuzzy triangular numbers on the right-hand side are studied. A new method, which is based on the geometric representations of linear transformations, is proposed to find solutions. The method uses the fact that a vector of fuzzy tri... |
2111.02338 | Ran Liu | Ran Liu, Mehdi Azabou, Max Dabagia, Chi-Heng Lin, Mohammad Gheshlaghi
Azar, Keith B. Hengen, Michal Valko, Eva L. Dyer | Drop, Swap, and Generate: A Self-Supervised Approach for Generating
Neural Activity | To be published in Neurips 2021 | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Meaningful and simplified representations of neural activity can yield
insights into how and what information is being processed within a neural
circuit. However, without labels, finding representations that reveal the link
between the brain and behavior can be challenging. Here, we introduce a novel
unsupervised app... | [
{
"created": "Wed, 3 Nov 2021 16:39:43 GMT",
"version": "v1"
}
] | 2021-11-04 | [
[
"Liu",
"Ran",
""
],
[
"Azabou",
"Mehdi",
""
],
[
"Dabagia",
"Max",
""
],
[
"Lin",
"Chi-Heng",
""
],
[
"Azar",
"Mohammad Gheshlaghi",
""
],
[
"Hengen",
"Keith B.",
""
],
[
"Valko",
"Michal",
""
],
[
... | Meaningful and simplified representations of neural activity can yield insights into how and what information is being processed within a neural circuit. However, without labels, finding representations that reveal the link between the brain and behavior can be challenging. Here, we introduce a novel unsupervised appro... |
1104.4155 | Sergiy Vorobyov A. | Zengmao Chen, Cheng-Xiang Wang, Xuemin Hong, John Thompson, Sergiy A.
Vorobyov, Feng Zhao, Hailin Xiao, and Xiaohu Ge | Interference Mitigation for Cognitive Radio MIMO Systems Based on
Practical Precoding | 12 pages, 4 figures, submitted to the IEEE Trans. Wireless
Communications in April 2011 | Z. Chen, C.-X. Wang, X. Hong, J. Thompson, S.A. Vorobyov, and et
al, "Interference mitigation for cognitive radio MIMO systems based on
practical precoding," Invited Paper, Physical Communication, vol. 9, pp.
308-315, Dec. 2013 | 10.1016/j.phycom.2012.04.007 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose two subspace-projection-based precoding schemes,
namely, full-projection (FP)- and partial-projection (PP)-based precoding, for
a cognitive radio multiple-input multiple-output (CR-MIMO) network to mitigate
its interference to a primary time-division-duplexing (TDD) system. The
proposed prec... | [
{
"created": "Thu, 21 Apr 2011 01:42:27 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Chen",
"Zengmao",
""
],
[
"Wang",
"Cheng-Xiang",
""
],
[
"Hong",
"Xuemin",
""
],
[
"Thompson",
"John",
""
],
[
"Vorobyov",
"Sergiy A.",
""
],
[
"Zhao",
"Feng",
""
],
[
"Xiao",
"Hailin",
""
],
[
"Ge... | In this paper, we propose two subspace-projection-based precoding schemes, namely, full-projection (FP)- and partial-projection (PP)-based precoding, for a cognitive radio multiple-input multiple-output (CR-MIMO) network to mitigate its interference to a primary time-division-duplexing (TDD) system. The proposed precod... |
2301.10960 | Alireza Hashemi | Alireza Hashemi, Hernan Makse | Visiting Distant Neighbors in Graph Convolutional Networks | null | null | null | null | cs.LG cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We extend the graph convolutional network method for deep learning on graph
data to higher order in terms of neighboring nodes. In order to construct
representations for a node in a graph, in addition to the features of the node
and its immediate neighboring nodes, we also include more distant nodes in the
calculatio... | [
{
"created": "Thu, 26 Jan 2023 06:37:11 GMT",
"version": "v1"
},
{
"created": "Sun, 29 Jan 2023 06:18:23 GMT",
"version": "v2"
},
{
"created": "Wed, 22 May 2024 19:57:15 GMT",
"version": "v3"
}
] | 2024-05-24 | [
[
"Hashemi",
"Alireza",
""
],
[
"Makse",
"Hernan",
""
]
] | We extend the graph convolutional network method for deep learning on graph data to higher order in terms of neighboring nodes. In order to construct representations for a node in a graph, in addition to the features of the node and its immediate neighboring nodes, we also include more distant nodes in the calculations... |
2002.02702 | Martin Trapp | Mohamed Tarek, Kai Xu, Martin Trapp, Hong Ge, Zoubin Ghahramani | DynamicPPL: Stan-like Speed for Dynamic Probabilistic Models | null | null | null | null | cs.LG cs.PL stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the preliminary high-level design and features of DynamicPPL.jl, a
modular library providing a lightning-fast infrastructure for probabilistic
programming. Besides a computational performance that is often close to or
better than Stan, DynamicPPL provides an intuitive DSL that allows the rapid
development ... | [
{
"created": "Fri, 7 Feb 2020 10:21:49 GMT",
"version": "v1"
}
] | 2020-02-10 | [
[
"Tarek",
"Mohamed",
""
],
[
"Xu",
"Kai",
""
],
[
"Trapp",
"Martin",
""
],
[
"Ge",
"Hong",
""
],
[
"Ghahramani",
"Zoubin",
""
]
] | We present the preliminary high-level design and features of DynamicPPL.jl, a modular library providing a lightning-fast infrastructure for probabilistic programming. Besides a computational performance that is often close to or better than Stan, DynamicPPL provides an intuitive DSL that allows the rapid development of... |
2405.13360 | Zhenting Wang | Zhenting Wang, Vikash Sehwag, Chen Chen, Lingjuan Lyu, Dimitris N.
Metaxas, Shiqing Ma | How to Trace Latent Generative Model Generated Images without Artificial
Watermark? | ICML 2024 | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Latent generative models (e.g., Stable Diffusion) have become more and more
popular, but concerns have arisen regarding potential misuse related to images
generated by these models. It is, therefore, necessary to analyze the origin of
images by inferring if a particular image was generated by a specific latent
genera... | [
{
"created": "Wed, 22 May 2024 05:33:47 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Wang",
"Zhenting",
""
],
[
"Sehwag",
"Vikash",
""
],
[
"Chen",
"Chen",
""
],
[
"Lyu",
"Lingjuan",
""
],
[
"Metaxas",
"Dimitris N.",
""
],
[
"Ma",
"Shiqing",
""
]
] | Latent generative models (e.g., Stable Diffusion) have become more and more popular, but concerns have arisen regarding potential misuse related to images generated by these models. It is, therefore, necessary to analyze the origin of images by inferring if a particular image was generated by a specific latent generati... |
2404.12512 | Yubo Gao | Yubo Gao, Maryam Haghifam, Christina Giannoula, Renbo Tu, Gennady
Pekhimenko, Nandita Vijaykumar | Proteus: Preserving Model Confidentiality during Graph Optimizations | null | null | null | null | cs.CR cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Deep learning (DL) models have revolutionized numerous domains, yet
optimizing them for computational efficiency remains a challenging endeavor.
Development of new DL models typically involves two parties: the model
developers and performance optimizers. The collaboration between the parties
often necessitates the mo... | [
{
"created": "Thu, 18 Apr 2024 21:23:25 GMT",
"version": "v1"
}
] | 2024-04-22 | [
[
"Gao",
"Yubo",
""
],
[
"Haghifam",
"Maryam",
""
],
[
"Giannoula",
"Christina",
""
],
[
"Tu",
"Renbo",
""
],
[
"Pekhimenko",
"Gennady",
""
],
[
"Vijaykumar",
"Nandita",
""
]
] | Deep learning (DL) models have revolutionized numerous domains, yet optimizing them for computational efficiency remains a challenging endeavor. Development of new DL models typically involves two parties: the model developers and performance optimizers. The collaboration between the parties often necessitates the mode... |
2305.11744 | Revanth Reddy | Revanth Gangi Reddy, Pradeep Dasigi, Md Arafat Sultan, Arman Cohan,
Avirup Sil, Heng Ji, Hannaneh Hajishirzi | ReFIT: Relevance Feedback from a Reranker during Inference | Preprint | null | null | null | cs.IR cs.CL | http://creativecommons.org/licenses/by/4.0/ | Retrieve-and-rerank is a prevalent framework in neural information retrieval,
wherein a bi-encoder network initially retrieves a pre-defined number of
candidates (e.g., K=100), which are then reranked by a more powerful
cross-encoder model. While the reranker often yields improved candidate scores
compared to the ret... | [
{
"created": "Fri, 19 May 2023 15:30:33 GMT",
"version": "v1"
},
{
"created": "Tue, 28 May 2024 17:12:02 GMT",
"version": "v2"
}
] | 2024-05-29 | [
[
"Reddy",
"Revanth Gangi",
""
],
[
"Dasigi",
"Pradeep",
""
],
[
"Sultan",
"Md Arafat",
""
],
[
"Cohan",
"Arman",
""
],
[
"Sil",
"Avirup",
""
],
[
"Ji",
"Heng",
""
],
[
"Hajishirzi",
"Hannaneh",
""
]
] | Retrieve-and-rerank is a prevalent framework in neural information retrieval, wherein a bi-encoder network initially retrieves a pre-defined number of candidates (e.g., K=100), which are then reranked by a more powerful cross-encoder model. While the reranker often yields improved candidate scores compared to the retri... |
1711.04451 | Jianyu Wang | Jianyu Wang, Zhishuai Zhang, Cihang Xie, Yuyin Zhou, Vittal
Premachandran, Jun Zhu, Lingxi Xie, Alan Yuille | Visual Concepts and Compositional Voting | It is accepted by Annals of Mathematical Sciences and Applications | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is very attractive to formulate vision in terms of pattern theory
\cite{Mumford2010pattern}, where patterns are defined hierarchically by
compositions of elementary building blocks. But applying pattern theory to real
world images is currently less successful than discriminative methods such as
deep networks. Deep... | [
{
"created": "Mon, 13 Nov 2017 07:29:04 GMT",
"version": "v1"
}
] | 2017-11-15 | [
[
"Wang",
"Jianyu",
""
],
[
"Zhang",
"Zhishuai",
""
],
[
"Xie",
"Cihang",
""
],
[
"Zhou",
"Yuyin",
""
],
[
"Premachandran",
"Vittal",
""
],
[
"Zhu",
"Jun",
""
],
[
"Xie",
"Lingxi",
""
],
[
"Yuille",
... | It is very attractive to formulate vision in terms of pattern theory \cite{Mumford2010pattern}, where patterns are defined hierarchically by compositions of elementary building blocks. But applying pattern theory to real world images is currently less successful than discriminative methods such as deep networks. Deep n... |
1508.00761 | Tingshao Zhu | Shun Li, Changye Zhu, Liqing Cui, Nan Zhao, Baobin Li and Tingshao Zhu | Recognition of Emotions using Kinects | 15 pages, 4 figures | null | null | null | cs.CY cs.CV cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Psychological studies indicate that emotional states are expressed in the way
people walk and the human gait is investigated in terms of its ability to
reveal a person's emotional state. And Microsoft Kinect is a rapidly
developing, inexpensive, portable and no-marker motion capture system. This
paper gives a new ref... | [
{
"created": "Tue, 4 Aug 2015 13:03:27 GMT",
"version": "v1"
}
] | 2015-08-05 | [
[
"Li",
"Shun",
""
],
[
"Zhu",
"Changye",
""
],
[
"Cui",
"Liqing",
""
],
[
"Zhao",
"Nan",
""
],
[
"Li",
"Baobin",
""
],
[
"Zhu",
"Tingshao",
""
]
] | Psychological studies indicate that emotional states are expressed in the way people walk and the human gait is investigated in terms of its ability to reveal a person's emotional state. And Microsoft Kinect is a rapidly developing, inexpensive, portable and no-marker motion capture system. This paper gives a new refer... |
1911.03567 | Zuheng Ming | Souhail Bakkali, Zuheng Ming, Muhammad Muzzamil Luqman,
Jean-Christophe Burie | Face Detection in Camera Captured Images of Identity Documents under
Challenging Conditions | accepted by the ICDAR2019 workshop CBDAR2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Benefiting from the advance of deep convolutional neural network approaches
(CNNs), many face detection algorithms have achieved state-of-the-art
performance in terms of accuracy and very high speed in unconstrained
applications. However, due to the lack of public datasets and due to the
variation of the orientation ... | [
{
"created": "Fri, 8 Nov 2019 22:39:06 GMT",
"version": "v1"
}
] | 2019-11-12 | [
[
"Bakkali",
"Souhail",
""
],
[
"Ming",
"Zuheng",
""
],
[
"Luqman",
"Muhammad Muzzamil",
""
],
[
"Burie",
"Jean-Christophe",
""
]
] | Benefiting from the advance of deep convolutional neural network approaches (CNNs), many face detection algorithms have achieved state-of-the-art performance in terms of accuracy and very high speed in unconstrained applications. However, due to the lack of public datasets and due to the variation of the orientation of... |
2206.14863 | Ruijia Cheng | Ruijia Cheng, Alison Smith-Renner, Ke Zhang, Joel R. Tetreault,
Alejandro Jaimes | Mapping the Design Space of Human-AI Interaction in Text Summarization | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatic text summarization systems commonly involve humans for preparing
data or evaluating model performance, yet, there lacks a systematic
understanding of humans' roles, experience, and needs when interacting with or
being assisted by AI. From a human-centered perspective, we map the design
opportunities and con... | [
{
"created": "Wed, 29 Jun 2022 19:03:25 GMT",
"version": "v1"
}
] | 2022-07-01 | [
[
"Cheng",
"Ruijia",
""
],
[
"Smith-Renner",
"Alison",
""
],
[
"Zhang",
"Ke",
""
],
[
"Tetreault",
"Joel R.",
""
],
[
"Jaimes",
"Alejandro",
""
]
] | Automatic text summarization systems commonly involve humans for preparing data or evaluating model performance, yet, there lacks a systematic understanding of humans' roles, experience, and needs when interacting with or being assisted by AI. From a human-centered perspective, we map the design opportunities and consi... |
2405.04049 | Hamed Poursiami | Hamed Poursiami, Ihsen Alouani, Maryam Parsa | Watermarking Neuromorphic Brains: Intellectual Property Protection in
Spiking Neural Networks | 7 pages, 7 figures | null | null | null | cs.CR cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As spiking neural networks (SNNs) gain traction in deploying neuromorphic
computing solutions, protecting their intellectual property (IP) has become
crucial. Without adequate safeguards, proprietary SNN architectures are at risk
of theft, replication, or misuse, which could lead to significant financial
losses for t... | [
{
"created": "Tue, 7 May 2024 06:42:30 GMT",
"version": "v1"
}
] | 2024-05-08 | [
[
"Poursiami",
"Hamed",
""
],
[
"Alouani",
"Ihsen",
""
],
[
"Parsa",
"Maryam",
""
]
] | As spiking neural networks (SNNs) gain traction in deploying neuromorphic computing solutions, protecting their intellectual property (IP) has become crucial. Without adequate safeguards, proprietary SNN architectures are at risk of theft, replication, or misuse, which could lead to significant financial losses for the... |
1701.06664 | Katina Kralevska | Danilo Gligoroski, Katina Kralevska, Rune E. Jensen, Per Simonsen | Repair Duality with Locally Repairable and Locally Regenerating Codes | Accepted as a full paper for publication at IEEE DataCom 2017 | 2017 IEEE 15th Intl Conf on Dependable, Autonomic and Secure
Computing, 15th Intl Conf on Pervasive Intelligence and Computing, 3rd Intl
Conf on Big Data Intelligence and Computing and Cyber Science and Technology
Congress(DASC/PiCom/DataCom/CyberSciTech), Orlando, FL, 2017, pp. 979-984 | 10.1109/DASC-PICom-DataCom-CyberSciTec.2017.162 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We construct an explicit family of locally repairable and locally
regenerating codes whose existence was proven in a recent work by Kamath et al.
about codes with local regeneration but no explicit construction was given.
This explicit family of codes is based on HashTag codes. HashTag codes are
recently defined vect... | [
{
"created": "Mon, 23 Jan 2017 22:50:54 GMT",
"version": "v1"
},
{
"created": "Sat, 28 Jan 2017 11:12:27 GMT",
"version": "v2"
},
{
"created": "Sat, 22 Apr 2017 11:18:37 GMT",
"version": "v3"
},
{
"created": "Wed, 30 Aug 2017 09:29:12 GMT",
"version": "v4"
}
] | 2020-02-14 | [
[
"Gligoroski",
"Danilo",
""
],
[
"Kralevska",
"Katina",
""
],
[
"Jensen",
"Rune E.",
""
],
[
"Simonsen",
"Per",
""
]
] | We construct an explicit family of locally repairable and locally regenerating codes whose existence was proven in a recent work by Kamath et al. about codes with local regeneration but no explicit construction was given. This explicit family of codes is based on HashTag codes. HashTag codes are recently defined vector... |
1912.01452 | Jia-Hong Huang | Jia-Hong Huang, Modar Alfadly, Bernard Ghanem, Marcel Worring | Assessing the Robustness of Visual Question Answering Models | 24 pages, 13 figures, International Journal of Computer Vision (IJCV)
[under review]. arXiv admin note: substantial text overlap with
arXiv:1711.06232, arXiv:1709.04625 | null | null | null | cs.CV cs.CL | http://creativecommons.org/licenses/by/4.0/ | Deep neural networks have been playing an essential role in the task of
Visual Question Answering (VQA). Until recently, their accuracy has been the
main focus of research. Now there is a trend toward assessing the robustness of
these models against adversarial attacks by evaluating the accuracy of these
models under... | [
{
"created": "Sat, 30 Nov 2019 09:32:38 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Mar 2022 14:17:46 GMT",
"version": "v2"
}
] | 2022-03-04 | [
[
"Huang",
"Jia-Hong",
""
],
[
"Alfadly",
"Modar",
""
],
[
"Ghanem",
"Bernard",
""
],
[
"Worring",
"Marcel",
""
]
] | Deep neural networks have been playing an essential role in the task of Visual Question Answering (VQA). Until recently, their accuracy has been the main focus of research. Now there is a trend toward assessing the robustness of these models against adversarial attacks by evaluating the accuracy of these models under i... |
1006.0551 | EPTCS | Xizhong Zheng (Arcadia University), Ning Zhong (University of
Cincinnati) | Proceedings Seventh International Conference on Computability and
Complexity in Analysis | null | EPTCS 24, 2010 | 10.4204/EPTCS.24 | null | cs.CC cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This volume of the Electronic Proceedings in Theoretical Computer Science
(EPTCS) contains extended abstracts of talks to be presented at the Seventh
International Conference on Computability and Complexity in Analysis (CCA 2010)
that will take place in Zhenjiang, China, June 21-25, 2010. This conference is
the seven... | [
{
"created": "Thu, 3 Jun 2010 04:22:39 GMT",
"version": "v1"
}
] | 2010-06-04 | [
[
"Zheng",
"Xizhong",
"",
"Arcadia University"
],
[
"Zhong",
"Ning",
"",
"University of\n Cincinnati"
]
] | This volume of the Electronic Proceedings in Theoretical Computer Science (EPTCS) contains extended abstracts of talks to be presented at the Seventh International Conference on Computability and Complexity in Analysis (CCA 2010) that will take place in Zhenjiang, China, June 21-25, 2010. This conference is the sevente... |
2208.02311 | Amar Kumar | Amar Kumar, Anjun Hu, Brennan Nichyporuk, Jean-Pierre R. Falet,
Douglas L. Arnold, Sotirios Tsaftaris, and Tal Arbel | Counterfactual Image Synthesis for Discovery of Personalized Predictive
Image Markers | Accepted to the MIABID workshop at MICCAI 2022 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The discovery of patient-specific imaging markers that are predictive of
future disease outcomes can help us better understand individual-level
heterogeneity of disease evolution. In fact, deep learning models that can
provide data-driven personalized markers are much more likely to be adopted in
medical practice. In... | [
{
"created": "Wed, 3 Aug 2022 18:58:45 GMT",
"version": "v1"
}
] | 2022-08-05 | [
[
"Kumar",
"Amar",
""
],
[
"Hu",
"Anjun",
""
],
[
"Nichyporuk",
"Brennan",
""
],
[
"Falet",
"Jean-Pierre R.",
""
],
[
"Arnold",
"Douglas L.",
""
],
[
"Tsaftaris",
"Sotirios",
""
],
[
"Arbel",
"Tal",
""
]
] | The discovery of patient-specific imaging markers that are predictive of future disease outcomes can help us better understand individual-level heterogeneity of disease evolution. In fact, deep learning models that can provide data-driven personalized markers are much more likely to be adopted in medical practice. In t... |
1907.02562 | Hang Hu | Xiaolong Yang, Tzu-Hao Huang, Hang Hu, Shuangyue Yu, Sainan Zhang,
Xianlian Zhou, Alessandra Carriero, Guang Yue, and Hao Su | Spine-Inspired Continuum Soft Exoskeleton for Stoop Lifting Assistance | 8 pages, 13 figures | IROS 2019 | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Back injuries are the most prevalent work-related musculoskeletal disorders
and represent a major cause of disability. Although innovations in wearable
robots aim to alleviate this hazard, the majority of existing exoskeletons are
obtrusive because the rigid linkage design limits natural movement, thus
causing ergono... | [
{
"created": "Thu, 4 Jul 2019 18:44:44 GMT",
"version": "v1"
}
] | 2019-07-08 | [
[
"Yang",
"Xiaolong",
""
],
[
"Huang",
"Tzu-Hao",
""
],
[
"Hu",
"Hang",
""
],
[
"Yu",
"Shuangyue",
""
],
[
"Zhang",
"Sainan",
""
],
[
"Zhou",
"Xianlian",
""
],
[
"Carriero",
"Alessandra",
""
],
[
"Yue... | Back injuries are the most prevalent work-related musculoskeletal disorders and represent a major cause of disability. Although innovations in wearable robots aim to alleviate this hazard, the majority of existing exoskeletons are obtrusive because the rigid linkage design limits natural movement, thus causing ergonomi... |
1009.2893 | Juha Kontinen | Juha Kontinen (University of Helsinki, Finland), Heribert Vollmer
(University of Hannover, Germany) | On Second-Order Monadic Monoidal and Groupoidal Quantifiers | null | Logical Methods in Computer Science, Volume 6, Issue 3 (September
20, 2010) lmcs:1006 | 10.2168/LMCS-6(3:25)2010 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study logics defined in terms of second-order monadic monoidal and
groupoidal quantifiers. These are generalized quantifiers defined by monoid and
groupoid word-problems, equivalently, by regular and context-free languages. We
give a computational classification of the expressive power of these logics
over strings... | [
{
"created": "Wed, 15 Sep 2010 10:30:50 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Sep 2010 08:22:57 GMT",
"version": "v2"
}
] | 2015-07-01 | [
[
"Kontinen",
"Juha",
"",
"University of Helsinki, Finland"
],
[
"Vollmer",
"Heribert",
"",
"University of Hannover, Germany"
]
] | We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages. We give a computational classification of the expressive power of these logics over strings w... |
1907.03050 | Soheil Khorram | Soheil Khorram, Melvin G McInnis, Emily Mower Provost | Jointly Aligning and Predicting Continuous Emotion Annotations | IEEE Transactions on Affective Computing | null | null | null | cs.LG cs.HC eess.AS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Time-continuous dimensional descriptions of emotions (e.g., arousal, valence)
allow researchers to characterize short-time changes and to capture long-term
trends in emotion expression. However, continuous emotion labels are generally
not synchronized with the input speech signal due to delays caused by
reaction-time... | [
{
"created": "Fri, 5 Jul 2019 23:49:49 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Jul 2019 22:40:43 GMT",
"version": "v2"
}
] | 2019-07-22 | [
[
"Khorram",
"Soheil",
""
],
[
"McInnis",
"Melvin G",
""
],
[
"Provost",
"Emily Mower",
""
]
] | Time-continuous dimensional descriptions of emotions (e.g., arousal, valence) allow researchers to characterize short-time changes and to capture long-term trends in emotion expression. However, continuous emotion labels are generally not synchronized with the input speech signal due to delays caused by reaction-time, ... |
2211.06479 | Ron Fulbright | Ron Fulbright | Calculating Cognitive Augmentation, A Case Study | 14 pages; 4 figures | HCII 2019: Augmented Cognition; Lecture Notes in Computer Science
book series (LNAI,volume 11580) | 10.1007/978-3-030-22419-6_38 | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We are entering an era in which humans will increasingly work in partnership
and collaboration with artificially intelligent entities. For millennia, tools
have augmented human physical and mental performance but in the coming era of
cognitive systems, human cognitive performance will be augmented. We are only
just n... | [
{
"created": "Fri, 11 Nov 2022 20:48:29 GMT",
"version": "v1"
}
] | 2022-11-15 | [
[
"Fulbright",
"Ron",
""
]
] | We are entering an era in which humans will increasingly work in partnership and collaboration with artificially intelligent entities. For millennia, tools have augmented human physical and mental performance but in the coming era of cognitive systems, human cognitive performance will be augmented. We are only just now... |
2102.01020 | Yan Uehara De Moraes | Carlos Pedroso, Yan Uehara de Moraes, Michele Nogueira, Aldri Santos | Relational Consensus-Based Cooperative Task Allocation Management for
IIoT-Health Networks | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | IIoT services focused on industry-oriented services often require objects run
more than one task. IIoT objects poses the challenge of distributing and
managing task allocation among them. The fairness of task allocation brings
flexible network reconfiguration and maximizes the tasks to be performed.
Although existing... | [
{
"created": "Mon, 1 Feb 2021 17:53:11 GMT",
"version": "v1"
}
] | 2021-02-02 | [
[
"Pedroso",
"Carlos",
""
],
[
"de Moraes",
"Yan Uehara",
""
],
[
"Nogueira",
"Michele",
""
],
[
"Santos",
"Aldri",
""
]
] | IIoT services focused on industry-oriented services often require objects run more than one task. IIoT objects poses the challenge of distributing and managing task allocation among them. The fairness of task allocation brings flexible network reconfiguration and maximizes the tasks to be performed. Although existing a... |
2305.04177 | Anastasiia Razdaibiedina | Anastasia Razdaibiedina, Alexander Brechalov | MIReAD: Simple Method for Learning High-quality Representations from
Scientific Documents | ACL 2023 (short paper) | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Learning semantically meaningful representations from scientific documents
can facilitate academic literature search and improve performance of
recommendation systems. Pre-trained language models have been shown to learn
rich textual representations, yet they cannot provide powerful document-level
representations for... | [
{
"created": "Sun, 7 May 2023 03:29:55 GMT",
"version": "v1"
}
] | 2023-05-09 | [
[
"Razdaibiedina",
"Anastasia",
""
],
[
"Brechalov",
"Alexander",
""
]
] | Learning semantically meaningful representations from scientific documents can facilitate academic literature search and improve performance of recommendation systems. Pre-trained language models have been shown to learn rich textual representations, yet they cannot provide powerful document-level representations for s... |
2207.13541 | Wim Martens | Wim Martens, Matthias Niewerth, Tina Popp, Stijn Vansummeren, Domagoj
Vrgoc | Representing Paths in Graph Database Pattern Matching | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern graph database query languages such as GQL, SQL/PGQ, and their
academic predecessor G-Core promote paths to first-class citizens in the sense
that paths that match regular path queries can be returned to the user. This
brings a number of challenges in terms of efficiency, caused by the fact that
graphs can hav... | [
{
"created": "Wed, 27 Jul 2022 14:28:39 GMT",
"version": "v1"
}
] | 2022-07-28 | [
[
"Martens",
"Wim",
""
],
[
"Niewerth",
"Matthias",
""
],
[
"Popp",
"Tina",
""
],
[
"Vansummeren",
"Stijn",
""
],
[
"Vrgoc",
"Domagoj",
""
]
] | Modern graph database query languages such as GQL, SQL/PGQ, and their academic predecessor G-Core promote paths to first-class citizens in the sense that paths that match regular path queries can be returned to the user. This brings a number of challenges in terms of efficiency, caused by the fact that graphs can have ... |
1806.10570 | Anna Aljanaki | Anna Aljanaki, Gerhard Widmer | Modeling Majorness as a Perceptual Property in Music from Listener
Ratings | short paper for ICMPC proceedings | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For the tasks of automatic music emotion recognition, genre recognition,
music recommendation it is helpful to be able to extract mode from any section
of a musical piece as a perceived amount of major or minor mode (majorness)
inside that section, perceived as a whole (one or several melodies and any
harmony present... | [
{
"created": "Wed, 27 Jun 2018 17:05:48 GMT",
"version": "v1"
}
] | 2018-06-28 | [
[
"Aljanaki",
"Anna",
""
],
[
"Widmer",
"Gerhard",
""
]
] | For the tasks of automatic music emotion recognition, genre recognition, music recommendation it is helpful to be able to extract mode from any section of a musical piece as a perceived amount of major or minor mode (majorness) inside that section, perceived as a whole (one or several melodies and any harmony present).... |
2007.03631 | Uma Girish | Uma Girish, Ran Raz, Wei Zhan | Lower Bounds for XOR of Forrelations | null | null | null | null | cs.CC quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Forrelation problem, introduced by Aaronson [A10] and Aaronson and
Ambainis [AA15], is a well studied problem in the context of separating quantum
and classical models. Variants of this problem were used to give exponential
separations between quantum and classical query complexity [A10, AA15]; quantum
query comp... | [
{
"created": "Tue, 7 Jul 2020 17:05:09 GMT",
"version": "v1"
}
] | 2020-07-08 | [
[
"Girish",
"Uma",
""
],
[
"Raz",
"Ran",
""
],
[
"Zhan",
"Wei",
""
]
] | The Forrelation problem, introduced by Aaronson [A10] and Aaronson and Ambainis [AA15], is a well studied problem in the context of separating quantum and classical models. Variants of this problem were used to give exponential separations between quantum and classical query complexity [A10, AA15]; quantum query comple... |
2005.13290 | Tim Schatto-Eckrodt | Thorsten Quandt, Svenja Boberg, Tim Schatto-Eckrodt, Lena Frischlich | Pandemic News: Facebook Pages of Mainstream News Media and the
Coronavirus Crisis -- A Computational Content Analysis | Corrected typos, 7 figures, 4 tables, 1 ancillary file | null | null | Muenster Online Research (MOR) Working Paper 2/2020, | cs.SI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The unfolding of the COVID-19 pandemic has been an unprecedented challenge
for news media around the globe. While journalism is meant to process yet
unknown events by design, the dynamically evolving situation affected all
aspects of life in such profound ways that even the routines of crisis
reporting seemed to be i... | [
{
"created": "Wed, 27 May 2020 11:39:15 GMT",
"version": "v1"
},
{
"created": "Thu, 28 May 2020 15:28:13 GMT",
"version": "v2"
}
] | 2020-05-29 | [
[
"Quandt",
"Thorsten",
""
],
[
"Boberg",
"Svenja",
""
],
[
"Schatto-Eckrodt",
"Tim",
""
],
[
"Frischlich",
"Lena",
""
]
] | The unfolding of the COVID-19 pandemic has been an unprecedented challenge for news media around the globe. While journalism is meant to process yet unknown events by design, the dynamically evolving situation affected all aspects of life in such profound ways that even the routines of crisis reporting seemed to be ins... |
1508.05133 | Tamir Hazan | Tamir Hazan and Tommi Jaakkola | Steps Toward Deep Kernel Methods from Infinite Neural Networks | null | null | null | null | cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Contemporary deep neural networks exhibit impressive results on practical
problems. These networks generalize well although their inherent capacity may
extend significantly beyond the number of training examples. We analyze this
behavior in the context of deep, infinite neural networks. We show that deep
infinite lay... | [
{
"created": "Thu, 20 Aug 2015 21:35:52 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Sep 2015 18:27:36 GMT",
"version": "v2"
}
] | 2015-09-03 | [
[
"Hazan",
"Tamir",
""
],
[
"Jaakkola",
"Tommi",
""
]
] | Contemporary deep neural networks exhibit impressive results on practical problems. These networks generalize well although their inherent capacity may extend significantly beyond the number of training examples. We analyze this behavior in the context of deep, infinite neural networks. We show that deep infinite layer... |
cs/0607133 | Peter Turney | Robert Ewaschuk, Peter D. Turney | Self-Replication and Self-Assembly for Manufacturing | Java code available at http://purl.org/net/johnnyvon/ | Artificial Life, (2006), 12, 411-433 | 10.1162/artl.2006.12.3.411 | NRC-48760 | cs.MA cs.CE | null | It has been argued that a central objective of nanotechnology is to make
products inexpensively, and that self-replication is an effective approach to
very low-cost manufacturing. The research presented here is intended to be a
step towards this vision. We describe a computational simulation of nanoscale
machines flo... | [
{
"created": "Thu, 27 Jul 2006 17:55:16 GMT",
"version": "v1"
}
] | 2020-08-20 | [
[
"Ewaschuk",
"Robert",
""
],
[
"Turney",
"Peter D.",
""
]
] | It has been argued that a central objective of nanotechnology is to make products inexpensively, and that self-replication is an effective approach to very low-cost manufacturing. The research presented here is intended to be a step towards this vision. We describe a computational simulation of nanoscale machines float... |
2104.08575 | Hangqi Zhou | Hangqi Zhou, Chao Huang, Shangqi Gao, Xiahai Zhuang | VSpSR: Explorable Super-Resolution via Variational Sparse Representation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Super-resolution (SR) is an ill-posed problem, which means that infinitely
many high-resolution (HR) images can be degraded to the same low-resolution
(LR) image. To study the one-to-many stochastic SR mapping, we implicitly
represent the non-local self-similarity of natural images and develop a
Variational Sparse fr... | [
{
"created": "Sat, 17 Apr 2021 15:36:24 GMT",
"version": "v1"
}
] | 2021-04-20 | [
[
"Zhou",
"Hangqi",
""
],
[
"Huang",
"Chao",
""
],
[
"Gao",
"Shangqi",
""
],
[
"Zhuang",
"Xiahai",
""
]
] | Super-resolution (SR) is an ill-posed problem, which means that infinitely many high-resolution (HR) images can be degraded to the same low-resolution (LR) image. To study the one-to-many stochastic SR mapping, we implicitly represent the non-local self-similarity of natural images and develop a Variational Sparse fram... |
1310.6205 | Nicolas Trotignon | St\'ephan Thomass\'e, Nicolas Trotignon, Kristina Vuskovi\'c | Parameterized algorithm for weighted independent set problem in
bull-free graphs | null | Parameterized algorithm for weighted independent set problem in
bull-free graphs. Algorithmica, November 2015, 1--23 | 10.1007/s00453-015-0083-x | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The maximum stable set problem is NP-hard, even when restricted to
triangle-free graphs. In particular, one cannot expect a polynomial time
algorithm deciding if a bull-free graph has a stable set of size $k$, when $k$
is part of the instance. Our main result in this paper is to show the existence
of an FPT algorithm... | [
{
"created": "Wed, 23 Oct 2013 12:36:51 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Nov 2014 12:43:57 GMT",
"version": "v2"
}
] | 2015-11-20 | [
[
"Thomassé",
"Stéphan",
""
],
[
"Trotignon",
"Nicolas",
""
],
[
"Vusković",
"Kristina",
""
]
] | The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In particular, one cannot expect a polynomial time algorithm deciding if a bull-free graph has a stable set of size $k$, when $k$ is part of the instance. Our main result in this paper is to show the existence of an FPT algorithm w... |
1811.01510 | Marc Moreno Maza | Rui-Juan Jing, Marc Moreno-Maza, Delaram Talaashrafi | Complexity Estimates for Fourier-Motzkin Elimination | null | null | null | null | cs.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a new method for removing all the redundant
inequalities generated by Fourier-Motzkin elimination. This method is based on
an improved version of Balas' work and can also be used to remove all the
redundant inequalities in the input system. Moreover, our method only uses
arithmetic operation... | [
{
"created": "Mon, 5 Nov 2018 04:41:42 GMT",
"version": "v1"
},
{
"created": "Fri, 10 May 2019 23:20:47 GMT",
"version": "v2"
}
] | 2019-05-14 | [
[
"Jing",
"Rui-Juan",
""
],
[
"Moreno-Maza",
"Marc",
""
],
[
"Talaashrafi",
"Delaram",
""
]
] | In this paper, we propose a new method for removing all the redundant inequalities generated by Fourier-Motzkin elimination. This method is based on an improved version of Balas' work and can also be used to remove all the redundant inequalities in the input system. Moreover, our method only uses arithmetic operations ... |
2405.07671 | Martin Berglund | Martin Berglund, Willeke Martens, Brink van der Merwe | Constructing a BPE Tokenization DFA | null | null | null | null | cs.FL cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many natural language processing systems operate over tokenizations of text
to address the open-vocabulary problem. In this paper, we give and analyze an
algorithm for the efficient construction of deterministic finite automata
designed to operate directly on tokenizations produced by the popular byte pair
encoding t... | [
{
"created": "Mon, 13 May 2024 11:59:24 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"Berglund",
"Martin",
""
],
[
"Martens",
"Willeke",
""
],
[
"van der Merwe",
"Brink",
""
]
] | Many natural language processing systems operate over tokenizations of text to address the open-vocabulary problem. In this paper, we give and analyze an algorithm for the efficient construction of deterministic finite automata designed to operate directly on tokenizations produced by the popular byte pair encoding tec... |
1403.1956 | Hanum Putri Permatasari | Hanum Putri Permatasari, Silvia Harlena, Donny Erlangga, Reza Chandra | Effect of Social Media on Website Popularity: Differences between Public
and Private Universities in Indonesia | 6 pages, 3 figures, 5 tables | World of Computer Science and Information Technology Journal
(WCSIT), ISSN: 2221-0741, Vol. 3, No. 2, pp. 32-37, 2013 | null | null | cs.CY cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Social media has become something that is important to enhance social
networking and sharing of information through the website. Social media have
not only changed social networking, they provide a valuable tool for social
organization, activism, political, healthcare and even academic relations in
the university. Th... | [
{
"created": "Sat, 8 Mar 2014 10:06:57 GMT",
"version": "v1"
}
] | 2014-03-11 | [
[
"Permatasari",
"Hanum Putri",
""
],
[
"Harlena",
"Silvia",
""
],
[
"Erlangga",
"Donny",
""
],
[
"Chandra",
"Reza",
""
]
] | Social media has become something that is important to enhance social networking and sharing of information through the website. Social media have not only changed social networking, they provide a valuable tool for social organization, activism, political, healthcare and even academic relations in the university. The ... |
2007.03730 | Ping-Yeh Chiang | Ping-yeh Chiang, Michael J. Curry, Ahmed Abdelkader, Aounon Kumar,
John Dickerson, Tom Goldstein | Detection as Regression: Certified Object Detection by Median Smoothing | null | null | null | null | cs.CV cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the vulnerability of object detectors to adversarial attacks, very
few defenses are known to date. While adversarial training can improve the
empirical robustness of image classifiers, a direct extension to object
detection is very expensive. This work is motivated by recent progress on
certified classificati... | [
{
"created": "Tue, 7 Jul 2020 18:40:19 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Aug 2020 22:13:31 GMT",
"version": "v2"
},
{
"created": "Wed, 25 Nov 2020 16:43:49 GMT",
"version": "v3"
},
{
"created": "Fri, 25 Feb 2022 14:23:54 GMT",
"version": "v4"
}
] | 2022-02-28 | [
[
"Chiang",
"Ping-yeh",
""
],
[
"Curry",
"Michael J.",
""
],
[
"Abdelkader",
"Ahmed",
""
],
[
"Kumar",
"Aounon",
""
],
[
"Dickerson",
"John",
""
],
[
"Goldstein",
"Tom",
""
]
] | Despite the vulnerability of object detectors to adversarial attacks, very few defenses are known to date. While adversarial training can improve the empirical robustness of image classifiers, a direct extension to object detection is very expensive. This work is motivated by recent progress on certified classification... |
1901.05311 | Chao Zhai | Chao Zhai, Hehong Zhang, Gaoxi Xiao and Tso-Chien Pan | Contingency Identification of Cascading Failures in Power Transmission
Networks | null | null | null | null | cs.SY nlin.AO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to the evolving nature of power systems and the complicated coupling
relationship of power devices, it has been a great challenge to identify the
contingencies that could trigger cascading blackouts of power systems. This
paper provides an effective approach to identifying the initial contingency in
power transmi... | [
{
"created": "Tue, 15 Jan 2019 03:21:24 GMT",
"version": "v1"
}
] | 2019-01-17 | [
[
"Zhai",
"Chao",
""
],
[
"Zhang",
"Hehong",
""
],
[
"Xiao",
"Gaoxi",
""
],
[
"Pan",
"Tso-Chien",
""
]
] | Due to the evolving nature of power systems and the complicated coupling relationship of power devices, it has been a great challenge to identify the contingencies that could trigger cascading blackouts of power systems. This paper provides an effective approach to identifying the initial contingency in power transmiss... |
0806.1397 | Xianmin Feng | Xianmin Ming, Jiansheng Yang | The Improvement of the Bound on Hash Family | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study the bound on three kinds of hash family using the
Singleton bound. To $\epsilon-U(N; n, m)$ hash family, in the caes of $n>m^2>1$
and $1\geq\epsilon\geq \epsilon_1(n, m)$, we get that the new bound is better.
To $\epsilon-\bigtriangleup U(N; n, m)$ hash family, in the case of $n>m>1$ and
$1\ge... | [
{
"created": "Mon, 9 Jun 2008 08:26:01 GMT",
"version": "v1"
}
] | 2008-12-18 | [
[
"Ming",
"Xianmin",
""
],
[
"Yang",
"Jiansheng",
""
]
] | In this paper, we study the bound on three kinds of hash family using the Singleton bound. To $\epsilon-U(N; n, m)$ hash family, in the caes of $n>m^2>1$ and $1\geq\epsilon\geq \epsilon_1(n, m)$, we get that the new bound is better. To $\epsilon-\bigtriangleup U(N; n, m)$ hash family, in the case of $n>m>1$ and $1\geq\... |
1410.7756 | Wenliang Du | Xing Jin, Tongbo Luo, Derek G. Tsui, Wenliang Du | Code Injection Attacks on HTML5-based Mobile Apps | In Proceedings of the Third Workshop on Mobile Security Technologies
(MoST) 2014 (http://arxiv.org/abs/1410.6674) | null | null | MoST/2014/11 | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | HTML5-based mobile apps become more and more popular, mostly because they are
much easier to be ported across different mobile platforms than native apps.
HTML5-based apps are implemented using the standard web technologies, including
HTML5, JavaScript and CSS; they depend on some middlewares, such as PhoneGap,
to in... | [
{
"created": "Tue, 28 Oct 2014 19:24:11 GMT",
"version": "v1"
}
] | 2014-10-29 | [
[
"Jin",
"Xing",
""
],
[
"Luo",
"Tongbo",
""
],
[
"Tsui",
"Derek G.",
""
],
[
"Du",
"Wenliang",
""
]
] | HTML5-based mobile apps become more and more popular, mostly because they are much easier to be ported across different mobile platforms than native apps. HTML5-based apps are implemented using the standard web technologies, including HTML5, JavaScript and CSS; they depend on some middlewares, such as PhoneGap, to inte... |
2212.07145 | Michael Gundall | Michael Gundall, Julius Raphael Stegmann, Christopher Huber, R\"udiger
Halfmann, Hans Dieter Schotten | Implementation and Evaluation of the RBIS Protocol in 5G | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 5G and 6G wireless communications allow for novel and disruptive
applications. While 5G was strongly focused on improvements on QoS and QoS
guarantees that are necessary for industrial deployments, 6G will have a
disruptive impact on possible use cases. Here, nearly each use case requires
time synchronization of the ... | [
{
"created": "Wed, 14 Dec 2022 10:35:50 GMT",
"version": "v1"
}
] | 2022-12-15 | [
[
"Gundall",
"Michael",
""
],
[
"Stegmann",
"Julius Raphael",
""
],
[
"Huber",
"Christopher",
""
],
[
"Halfmann",
"Rüdiger",
""
],
[
"Schotten",
"Hans Dieter",
""
]
] | 5G and 6G wireless communications allow for novel and disruptive applications. While 5G was strongly focused on improvements on QoS and QoS guarantees that are necessary for industrial deployments, 6G will have a disruptive impact on possible use cases. Here, nearly each use case requires time synchronization of the in... |
2107.13190 | Aoting Hu | Aoting Hu, Renjie Xie, Zhigang Lu, Aiqun Hu, Minhui Xue | TableGAN-MCA: Evaluating Membership Collisions of GAN-Synthesized
Tabular Data Releasing | Accepted to ACM CCS 2021 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative Adversarial Networks (GAN)-synthesized table publishing lets
people privately learn insights without access to the private table. However,
existing studies on Membership Inference (MI) Attacks show promising results on
disclosing membership of training datasets of GAN-synthesized tables. Different
from tho... | [
{
"created": "Wed, 28 Jul 2021 06:43:36 GMT",
"version": "v1"
}
] | 2021-07-29 | [
[
"Hu",
"Aoting",
""
],
[
"Xie",
"Renjie",
""
],
[
"Lu",
"Zhigang",
""
],
[
"Hu",
"Aiqun",
""
],
[
"Xue",
"Minhui",
""
]
] | Generative Adversarial Networks (GAN)-synthesized table publishing lets people privately learn insights without access to the private table. However, existing studies on Membership Inference (MI) Attacks show promising results on disclosing membership of training datasets of GAN-synthesized tables. Different from those... |
2010.01083 | Caelan Garrett | Caelan Reed Garrett, Rohan Chitnis, Rachel Holladay, Beomjoon Kim, Tom
Silver, Leslie Pack Kaelbling and Tom\'as Lozano-P\'erez | Integrated Task and Motion Planning | Accepted to the Annual Review of Control, Robotics, and Autonomous
Systems. Vol. 4 (Volume publication date May 2021) | null | null | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of planning for a robot that operates in environments containing
a large number of objects, taking actions to move itself through the world as
well as to change the state of the objects, is known as task and motion
planning (TAMP). TAMP problems contain elements of discrete task planning,
discrete-continu... | [
{
"created": "Fri, 2 Oct 2020 16:23:08 GMT",
"version": "v1"
}
] | 2020-10-05 | [
[
"Garrett",
"Caelan Reed",
""
],
[
"Chitnis",
"Rohan",
""
],
[
"Holladay",
"Rachel",
""
],
[
"Kim",
"Beomjoon",
""
],
[
"Silver",
"Tom",
""
],
[
"Kaelbling",
"Leslie Pack",
""
],
[
"Lozano-Pérez",
"Tomás",
"... | The problem of planning for a robot that operates in environments containing a large number of objects, taking actions to move itself through the world as well as to change the state of the objects, is known as task and motion planning (TAMP). TAMP problems contain elements of discrete task planning, discrete-continuou... |
1905.04770 | Will Ma | Will Ma, David Simchi-Levi | Algorithms for Online Matching, Assortment, and Pricing with Tight
Weight-dependent Competitive Ratios | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motivated by the dynamic assortment offerings and item pricings occurring in
e-commerce, we study a general problem of allocating finite inventories to
heterogeneous customers arriving sequentially. We analyze this problem under
the framework of competitive analysis, where the sequence of customers is
unknown and doe... | [
{
"created": "Sun, 12 May 2019 18:59:53 GMT",
"version": "v1"
}
] | 2019-05-14 | [
[
"Ma",
"Will",
""
],
[
"Simchi-Levi",
"David",
""
]
] | Motivated by the dynamic assortment offerings and item pricings occurring in e-commerce, we study a general problem of allocating finite inventories to heterogeneous customers arriving sequentially. We analyze this problem under the framework of competitive analysis, where the sequence of customers is unknown and does ... |
1102.5699 | Rachit Mohan Garg | Rachit Mohan Garg, Yamini Sood, Neha Tyagi | Ontology based approach for video transmission over the network | 7 pages, 2 figures, 4 tables | The International journal of Multimedia & Its Applications (IJMA)
Vol.3, No.1, February 2011 | 10.5121/ijma.2011.3106 | null | cs.MM cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the increase in the bandwidth & the transmission speed over the
internet, transmission of multimedia objects like video, audio, images has
become an easier work. In this paper we provide an approach that can be useful
for transmission of video objects over the internet without much fuzz. The
approach provides a ... | [
{
"created": "Mon, 28 Feb 2011 16:13:20 GMT",
"version": "v1"
}
] | 2011-03-01 | [
[
"Garg",
"Rachit Mohan",
""
],
[
"Sood",
"Yamini",
""
],
[
"Tyagi",
"Neha",
""
]
] | With the increase in the bandwidth & the transmission speed over the internet, transmission of multimedia objects like video, audio, images has become an easier work. In this paper we provide an approach that can be useful for transmission of video objects over the internet without much fuzz. The approach provides a on... |
2006.13401 | Xinshi Chen | Xinshi Chen, Yufei Zhang, Christoph Reisinger, Le Song | Understanding Deep Architectures with Reasoning Layer | 34th Conference on Neural Information Processing Systems (NeurIPS
2020) | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, there has been a surge of interest in combining deep learning
models with reasoning in order to handle more sophisticated learning tasks. In
many cases, a reasoning task can be solved by an iterative algorithm. This
algorithm is often unrolled, and used as a specialized layer in the deep
architecture, which... | [
{
"created": "Wed, 24 Jun 2020 00:26:35 GMT",
"version": "v1"
},
{
"created": "Thu, 29 Oct 2020 22:00:00 GMT",
"version": "v2"
}
] | 2020-11-02 | [
[
"Chen",
"Xinshi",
""
],
[
"Zhang",
"Yufei",
""
],
[
"Reisinger",
"Christoph",
""
],
[
"Song",
"Le",
""
]
] | Recently, there has been a surge of interest in combining deep learning models with reasoning in order to handle more sophisticated learning tasks. In many cases, a reasoning task can be solved by an iterative algorithm. This algorithm is often unrolled, and used as a specialized layer in the deep architecture, which c... |
2201.05716 | EPTCS | P\'eter Bereczky (E\"otv\"os Lor\'and University, Hungary), Xiaohong
Chen (University of Illinois at Urbana-Champaign, USA), D\'aniel Horp\'acsi
(E\"otv\"os Lor\'and University, Hungary), Lucas Pe\~na (University of
Illinois at Urbana-Champaign, USA), Jan Tu\v{s}il (Masaryk University,
Czechia) | Mechanizing Matching Logic In Coq | In Proceedings FROM 2022, arXiv:2209.09208 | EPTCS 369, 2022, pp. 17-36 | 10.4204/EPTCS.369.2 | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | Matching logic is a formalism for specifying, and reasoning about,
mathematical structures, using patterns and pattern matching. Growing in
popularity, it has been used to define many logical systems such as separation
logic with recursive definitions and linear temporal logic. In addition, it
serves as the logical f... | [
{
"created": "Sat, 15 Jan 2022 00:06:17 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Jan 2022 16:04:53 GMT",
"version": "v2"
},
{
"created": "Sun, 1 May 2022 09:58:07 GMT",
"version": "v3"
},
{
"created": "Wed, 21 Sep 2022 13:55:16 GMT",
"version": "v4"
}
] | 2022-09-22 | [
[
"Bereczky",
"Péter",
"",
"Eötvös Loránd University, Hungary"
],
[
"Chen",
"Xiaohong",
"",
"University of Illinois at Urbana-Champaign, USA"
],
[
"Horpácsi",
"Dániel",
"",
"Eötvös Loránd University, Hungary"
],
[
"Peña",
"Lucas",
"",
"Univ... | Matching logic is a formalism for specifying, and reasoning about, mathematical structures, using patterns and pattern matching. Growing in popularity, it has been used to define many logical systems such as separation logic with recursive definitions and linear temporal logic. In addition, it serves as the logical fou... |
2310.11117 | Jianchao Tan | Huan Yuan, Chao Liao, Jianchao Tan, Peng Yao, Jiyuan Jia, Bin Chen,
Chengru Song, Di Zhang | USDC: Unified Static and Dynamic Compression for Visual Transformer | This paper was actually finished in 2021 | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Visual Transformers have achieved great success in almost all vision tasks,
such as classification, detection, and so on. However, the model complexity and
the inference speed of the visual transformers hinder their deployments in
industrial products. Various model compression techniques focus on directly
compressing... | [
{
"created": "Tue, 17 Oct 2023 10:04:47 GMT",
"version": "v1"
}
] | 2023-10-18 | [
[
"Yuan",
"Huan",
""
],
[
"Liao",
"Chao",
""
],
[
"Tan",
"Jianchao",
""
],
[
"Yao",
"Peng",
""
],
[
"Jia",
"Jiyuan",
""
],
[
"Chen",
"Bin",
""
],
[
"Song",
"Chengru",
""
],
[
"Zhang",
"Di",
""... | Visual Transformers have achieved great success in almost all vision tasks, such as classification, detection, and so on. However, the model complexity and the inference speed of the visual transformers hinder their deployments in industrial products. Various model compression techniques focus on directly compressing t... |
2306.03929 | Stratis Tsirtsis | Stratis Tsirtsis, Manuel Gomez-Rodriguez | Finding Counterfactually Optimal Action Sequences in Continuous State
Spaces | Accepted at NeurIPS 2023 | null | null | null | cs.LG cs.AI cs.CY stat.ML | http://creativecommons.org/licenses/by/4.0/ | Whenever a clinician reflects on the efficacy of a sequence of treatment
decisions for a patient, they may try to identify critical time steps where,
had they made different decisions, the patient's health would have improved.
While recent methods at the intersection of causal inference and reinforcement
learning pro... | [
{
"created": "Tue, 6 Jun 2023 18:00:29 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Nov 2023 11:01:28 GMT",
"version": "v2"
}
] | 2023-11-07 | [
[
"Tsirtsis",
"Stratis",
""
],
[
"Gomez-Rodriguez",
"Manuel",
""
]
] | Whenever a clinician reflects on the efficacy of a sequence of treatment decisions for a patient, they may try to identify critical time steps where, had they made different decisions, the patient's health would have improved. While recent methods at the intersection of causal inference and reinforcement learning promi... |
1512.00312 | Anton Aristov AA | Anton Aristov | The Quasi cellular nets-based models of transport and logistic systems | null | Reports of the XXIII XXIII International Scientific Symposium
Miner's Week, 2015, Moscow : NUST MISIS., PP. 280-287 | null | null | cs.OH | http://creativecommons.org/licenses/by-nc-sa/4.0/ | There are many systems in different subjects such as industry, medicine,
transport, social and others, can be discribed on their dynamic of flows.
Nowadays models of flows consist of micro- and macro-models. In practice there
is a problem of convertation from different levels of simulation. In the
different articles ... | [
{
"created": "Fri, 27 Nov 2015 01:49:02 GMT",
"version": "v1"
}
] | 2015-12-04 | [
[
"Aristov",
"Anton",
""
]
] | There are many systems in different subjects such as industry, medicine, transport, social and others, can be discribed on their dynamic of flows. Nowadays models of flows consist of micro- and macro-models. In practice there is a problem of convertation from different levels of simulation. In the different articles au... |
2108.12129 | Keshav Srinivasan | Keshav Srinivasan, Nolan Coble, Joy Hamlin, Thomas Antonsen, Edward
Ott and Michelle Girvan | Parallel Machine Learning for Forecasting the Dynamics of Complex
Networks | null | null | 10.1103/PhysRevLett.128.164101 | null | cs.LG nlin.CD | http://creativecommons.org/licenses/by/4.0/ | Forecasting the dynamics of large complex networks from previous time-series
data is important in a wide range of contexts. Here we present a machine
learning scheme for this task using a parallel architecture that mimics the
topology of the network of interest. We demonstrate the utility and scalability
of our metho... | [
{
"created": "Fri, 27 Aug 2021 06:06:41 GMT",
"version": "v1"
}
] | 2022-05-04 | [
[
"Srinivasan",
"Keshav",
""
],
[
"Coble",
"Nolan",
""
],
[
"Hamlin",
"Joy",
""
],
[
"Antonsen",
"Thomas",
""
],
[
"Ott",
"Edward",
""
],
[
"Girvan",
"Michelle",
""
]
] | Forecasting the dynamics of large complex networks from previous time-series data is important in a wide range of contexts. Here we present a machine learning scheme for this task using a parallel architecture that mimics the topology of the network of interest. We demonstrate the utility and scalability of our method ... |
1707.04520 | Wanming Hao | Wanming Hao, Ming Zeng, Zheng Chu, Shouyi Yang | Energy-Efficient Power Allocation in Millimeter Wave Massive MIMO with
Non-Orthogonal Multiple Access | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this letter, we investigate the energy efficiency (EE) problem in a
millimeter wave (mmWave) massive MIMO (mMIMO) system with non-orthogonal
multiple access (NOMA). Multiple two-user clusters are formulated according to
their channel correlation and gain difference. Following this, we propose a
hybrid analog/digit... | [
{
"created": "Fri, 14 Jul 2017 14:24:16 GMT",
"version": "v1"
}
] | 2017-07-17 | [
[
"Hao",
"Wanming",
""
],
[
"Zeng",
"Ming",
""
],
[
"Chu",
"Zheng",
""
],
[
"Yang",
"Shouyi",
""
]
] | In this letter, we investigate the energy efficiency (EE) problem in a millimeter wave (mmWave) massive MIMO (mMIMO) system with non-orthogonal multiple access (NOMA). Multiple two-user clusters are formulated according to their channel correlation and gain difference. Following this, we propose a hybrid analog/digital... |
2207.02370 | Tianhong Li | Tianhong Li, Lijie Fan, Yuan Yuan, Dina Katabi | Unsupervised Learning for Human Sensing Using Radio Signals | WACV 2022. The first three authors contributed equally to this paper | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | There is a growing literature demonstrating the feasibility of using Radio
Frequency (RF) signals to enable key computer vision tasks in the presence of
occlusions and poor lighting. It leverages that RF signals traverse walls and
occlusions to deliver through-wall pose estimation, action recognition, scene
captionin... | [
{
"created": "Wed, 6 Jul 2022 00:28:18 GMT",
"version": "v1"
}
] | 2022-07-07 | [
[
"Li",
"Tianhong",
""
],
[
"Fan",
"Lijie",
""
],
[
"Yuan",
"Yuan",
""
],
[
"Katabi",
"Dina",
""
]
] | There is a growing literature demonstrating the feasibility of using Radio Frequency (RF) signals to enable key computer vision tasks in the presence of occlusions and poor lighting. It leverages that RF signals traverse walls and occlusions to deliver through-wall pose estimation, action recognition, scene captioning,... |
1612.09087 | Farshad Roohbakhshan | Farshad Roohbakhshan and Roger A. Sauer | Efficient isogeometric thin shell formulations for soft biological
materials | Typos are removed. Remark 3.4 is added. Eq. (18) in the previous
version is removed. Thus, the equations get renumbered. Example 5.5 is
updated. Minor typos in Eqs. (17), (80), (145) and (146), are corrected. They
do not affect the results | Biomech Model Mechanobiol (2017) 16:1569 | 10.1007/s10237-017-0906-6 | null | cs.CE cond-mat.soft | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents three different constitutive approaches to model thin
rotation-free shells based on the Kirchhoff-Love hypothesis. One approach is
based on numerical integration through the shell thickness while the other two
approaches do not need any numerical integration and so they are
computationally more ef... | [
{
"created": "Thu, 29 Dec 2016 10:02:43 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Oct 2017 14:33:41 GMT",
"version": "v2"
}
] | 2017-10-25 | [
[
"Roohbakhshan",
"Farshad",
""
],
[
"Sauer",
"Roger A.",
""
]
] | This paper presents three different constitutive approaches to model thin rotation-free shells based on the Kirchhoff-Love hypothesis. One approach is based on numerical integration through the shell thickness while the other two approaches do not need any numerical integration and so they are computationally more effi... |
2402.06266 | Peter Vamplew | Peter Vamplew, Cameron Foale, Richard Dazeley | Value function interference and greedy action selection in value-based
multi-objective reinforcement learning | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Multi-objective reinforcement learning (MORL) algorithms extend conventional
reinforcement learning (RL) to the more general case of problems with multiple,
conflicting objectives, represented by vector-valued rewards. Widely-used
scalar RL methods such as Q-learning can be modified to handle multiple
objectives by (... | [
{
"created": "Fri, 9 Feb 2024 09:28:01 GMT",
"version": "v1"
}
] | 2024-02-12 | [
[
"Vamplew",
"Peter",
""
],
[
"Foale",
"Cameron",
""
],
[
"Dazeley",
"Richard",
""
]
] | Multi-objective reinforcement learning (MORL) algorithms extend conventional reinforcement learning (RL) to the more general case of problems with multiple, conflicting objectives, represented by vector-valued rewards. Widely-used scalar RL methods such as Q-learning can be modified to handle multiple objectives by (1)... |
2205.01464 | Andrew Drozdov | Andrew Drozdov, Jiawei Zhou, Radu Florian, Andrew McCallum, Tahira
Naseem, Yoon Kim, Ramon Fernandez Astudillo | Inducing and Using Alignments for Transition-based AMR Parsing | Accepted at NAACL 2022 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transition-based parsers for Abstract Meaning Representation (AMR) rely on
node-to-word alignments. These alignments are learned separately from parser
training and require a complex pipeline of rule-based components,
pre-processing, and post-processing to satisfy domain-specific constraints.
Parsers also train on a ... | [
{
"created": "Tue, 3 May 2022 12:58:36 GMT",
"version": "v1"
}
] | 2022-05-04 | [
[
"Drozdov",
"Andrew",
""
],
[
"Zhou",
"Jiawei",
""
],
[
"Florian",
"Radu",
""
],
[
"McCallum",
"Andrew",
""
],
[
"Naseem",
"Tahira",
""
],
[
"Kim",
"Yoon",
""
],
[
"Astudillo",
"Ramon Fernandez",
""
]
] | Transition-based parsers for Abstract Meaning Representation (AMR) rely on node-to-word alignments. These alignments are learned separately from parser training and require a complex pipeline of rule-based components, pre-processing, and post-processing to satisfy domain-specific constraints. Parsers also train on a po... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.