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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1201.2905 | Qiyang Zhao | Zhao Qiyang | NegCut: Automatic Image Segmentation based on MRF-MAP | Since it's an unlucky failure about length-limit violation, I'd like
to save it on arXiv as a record. Any suggestions are welcome | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Solving the Maximum a Posteriori on Markov Random Field, MRF-MAP, is a
prevailing method in recent interactive image segmentation tools. Although
mathematically explicit in its computational targets, and impressive for the
segmentation quality, MRF-MAP is hard to accomplish without the interactive
information from us... | [
{
"created": "Fri, 13 Jan 2012 18:18:03 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Jan 2012 03:28:43 GMT",
"version": "v2"
}
] | 2012-01-17 | [
[
"Qiyang",
"Zhao",
""
]
] | Solving the Maximum a Posteriori on Markov Random Field, MRF-MAP, is a prevailing method in recent interactive image segmentation tools. Although mathematically explicit in its computational targets, and impressive for the segmentation quality, MRF-MAP is hard to accomplish without the interactive information from user... |
1804.01918 | Alessandro Gabbana | Enrico Calore, Alessandro Gabbana, Sebastiano Fabio Schifano, Raffaele
Tripiccione | Early Experience on Using Knights Landing Processors for Lattice
Boltzmann Applications | null | null | 10.1007/978-3-319-78024-5_45 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Knights Landing (KNL) is the codename for the latest generation of Intel
processors based on Intel Many Integrated Core (MIC) architecture. It relies on
massive thread and data parallelism, and fast on-chip memory. This processor
operates in standalone mode, booting an off-the-shelf Linux operating system.
The KN... | [
{
"created": "Thu, 5 Apr 2018 15:47:04 GMT",
"version": "v1"
}
] | 2018-04-06 | [
[
"Calore",
"Enrico",
""
],
[
"Gabbana",
"Alessandro",
""
],
[
"Schifano",
"Sebastiano Fabio",
""
],
[
"Tripiccione",
"Raffaele",
""
]
] | The Knights Landing (KNL) is the codename for the latest generation of Intel processors based on Intel Many Integrated Core (MIC) architecture. It relies on massive thread and data parallelism, and fast on-chip memory. This processor operates in standalone mode, booting an off-the-shelf Linux operating system. The KNL ... |
1706.03158 | Tryphon Georgiou | Zahra Askarzadeh, Rui Fu, Abhishek Halder, Yongxin Chen, and Tryphon
T. Georgiou | Stability Theory of Stochastic Models in Opinion Dynamics | 11 pages, 6 figures | null | null | null | cs.SY cs.SI math.DS math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a certain class of nonlinear maps that preserve the probability
simplex, i.e., stochastic maps, that are inspired by the DeGroot-Friedkin model
of belief/opinion propagation over influence networks. The corresponding
dynamical models describe the evolution of the probability distribution of
interacting sp... | [
{
"created": "Sat, 10 Jun 2017 00:27:38 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Oct 2018 04:34:49 GMT",
"version": "v2"
}
] | 2018-10-11 | [
[
"Askarzadeh",
"Zahra",
""
],
[
"Fu",
"Rui",
""
],
[
"Halder",
"Abhishek",
""
],
[
"Chen",
"Yongxin",
""
],
[
"Georgiou",
"Tryphon T.",
""
]
] | We consider a certain class of nonlinear maps that preserve the probability simplex, i.e., stochastic maps, that are inspired by the DeGroot-Friedkin model of belief/opinion propagation over influence networks. The corresponding dynamical models describe the evolution of the probability distribution of interacting spec... |
2407.20068 | Yuhan Liu | Yuhan Liu, Sheng Wang, Yixuan Liu, Feifei Li, Hong Chen | Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique
with Exponential Noise | null | null | null | null | cs.CR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Sparse Vector Technique (SVT) is one of the most fundamental tools in
differential privacy (DP). It works as a backbone for adaptive data analysis by
answering a sequence of queries on a given dataset, and gleaning useful
information in a privacy-preserving manner. Unlike the typical private query
releases that d... | [
{
"created": "Mon, 29 Jul 2024 14:54:28 GMT",
"version": "v1"
}
] | 2024-07-30 | [
[
"Liu",
"Yuhan",
""
],
[
"Wang",
"Sheng",
""
],
[
"Liu",
"Yixuan",
""
],
[
"Li",
"Feifei",
""
],
[
"Chen",
"Hong",
""
]
] | The Sparse Vector Technique (SVT) is one of the most fundamental tools in differential privacy (DP). It works as a backbone for adaptive data analysis by answering a sequence of queries on a given dataset, and gleaning useful information in a privacy-preserving manner. Unlike the typical private query releases that dir... |
2008.00023 | Gregory D. Hager | Gregory D. Hager, Mark D. Hill, and Katherine Yelick | Opportunities and Challenges for Next Generation Computing | A Computing Community Consortium (CCC) white paper, 7 pages | null | null | null | cs.CY cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computing has dramatically changed nearly every aspect of our lives, from
business and agriculture to communication and entertainment. As a nation, we
rely on computing in the design of systems for energy, transportation and
defense; and computing fuels scientific discoveries that will improve our
fundamental underst... | [
{
"created": "Fri, 31 Jul 2020 18:16:49 GMT",
"version": "v1"
}
] | 2020-08-04 | [
[
"Hager",
"Gregory D.",
""
],
[
"Hill",
"Mark D.",
""
],
[
"Yelick",
"Katherine",
""
]
] | Computing has dramatically changed nearly every aspect of our lives, from business and agriculture to communication and entertainment. As a nation, we rely on computing in the design of systems for energy, transportation and defense; and computing fuels scientific discoveries that will improve our fundamental understan... |
1602.07732 | Mattia Rebato | Mattia Rebato and Marco Mezzavilla and Sundeep Rangan and Michele
Zorzi | The Potential of Resource Sharing in 5G Millimeter-Wave Bands | null | null | null | null | cs.NI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the severe spectrum shortage in conventional cellular bands, the
millimeter (mmWave) frequencies, roughly above 10~GHz, have been attracting
growing attention for next-generation micro- and pico- cellular wireless
networks. A fundamental and open question is how these bands should be used by
cellular operators. ... | [
{
"created": "Wed, 24 Feb 2016 22:22:00 GMT",
"version": "v1"
}
] | 2016-02-26 | [
[
"Rebato",
"Mattia",
""
],
[
"Mezzavilla",
"Marco",
""
],
[
"Rangan",
"Sundeep",
""
],
[
"Zorzi",
"Michele",
""
]
] | With the severe spectrum shortage in conventional cellular bands, the millimeter (mmWave) frequencies, roughly above 10~GHz, have been attracting growing attention for next-generation micro- and pico- cellular wireless networks. A fundamental and open question is how these bands should be used by cellular operators. Ce... |
2308.07876 | Yibo Hu | Yibo Hu, Erick Skorupa Parolin, Latifur Khan, Patrick T. Brandt,
Javier Osorio, Vito J. D'Orazio | Leveraging Codebook Knowledge with NLI and ChatGPT for Zero-Shot
Political Relation Classification | ACL 2024 | null | null | null | cs.CL cs.AI cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Is it possible accurately classify political relations within evolving event
ontologies without extensive annotations? This study investigates zero-shot
learning methods that use expert knowledge from existing annotation codebook,
and evaluates the performance of advanced ChatGPT (GPT-3.5/4) and a natural
language in... | [
{
"created": "Tue, 15 Aug 2023 16:41:53 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Feb 2024 13:23:08 GMT",
"version": "v2"
},
{
"created": "Thu, 6 Jun 2024 14:46:44 GMT",
"version": "v3"
}
] | 2024-06-07 | [
[
"Hu",
"Yibo",
""
],
[
"Parolin",
"Erick Skorupa",
""
],
[
"Khan",
"Latifur",
""
],
[
"Brandt",
"Patrick T.",
""
],
[
"Osorio",
"Javier",
""
],
[
"D'Orazio",
"Vito J.",
""
]
] | Is it possible accurately classify political relations within evolving event ontologies without extensive annotations? This study investigates zero-shot learning methods that use expert knowledge from existing annotation codebook, and evaluates the performance of advanced ChatGPT (GPT-3.5/4) and a natural language infe... |
2306.03514 | Xinyu Huang | Youcai Zhang, Xinyu Huang, Jinyu Ma, Zhaoyang Li, Zhaochuan Luo,
Yanchun Xie, Yuzhuo Qin, Tong Luo, Yaqian Li, Shilong Liu, Yandong Guo, Lei
Zhang | Recognize Anything: A Strong Image Tagging Model | Homepage: https://recognize-anything.github.io/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the Recognize Anything Model (RAM): a strong foundation model for
image tagging. RAM makes a substantial step for large models in computer
vision, demonstrating the zero-shot ability to recognize any common category
with high accuracy. RAM introduces a new paradigm for image tagging, leveraging
large-scale... | [
{
"created": "Tue, 6 Jun 2023 09:00:10 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Jun 2023 04:24:55 GMT",
"version": "v2"
},
{
"created": "Fri, 9 Jun 2023 15:21:06 GMT",
"version": "v3"
}
] | 2023-06-12 | [
[
"Zhang",
"Youcai",
""
],
[
"Huang",
"Xinyu",
""
],
[
"Ma",
"Jinyu",
""
],
[
"Li",
"Zhaoyang",
""
],
[
"Luo",
"Zhaochuan",
""
],
[
"Xie",
"Yanchun",
""
],
[
"Qin",
"Yuzhuo",
""
],
[
"Luo",
"Tong"... | We present the Recognize Anything Model (RAM): a strong foundation model for image tagging. RAM makes a substantial step for large models in computer vision, demonstrating the zero-shot ability to recognize any common category with high accuracy. RAM introduces a new paradigm for image tagging, leveraging large-scale i... |
2112.14825 | Yaroslav Golubev | Sergey Titov, Yaroslav Golubev, Timofey Bryksin | ReSplit: Improving the Structure of Jupyter Notebooks by Re-Splitting
Their Cells | 5 pages, 2 figures | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Jupyter notebooks represent a unique format for programming - a combination
of code and Markdown with rich formatting, separated into individual cells. We
propose to perceive a Jupyter Notebook cell as a simplified and raw version of
a programming function. Similar to functions, Jupyter cells should strive to
contain... | [
{
"created": "Wed, 29 Dec 2021 21:15:30 GMT",
"version": "v1"
}
] | 2022-01-03 | [
[
"Titov",
"Sergey",
""
],
[
"Golubev",
"Yaroslav",
""
],
[
"Bryksin",
"Timofey",
""
]
] | Jupyter notebooks represent a unique format for programming - a combination of code and Markdown with rich formatting, separated into individual cells. We propose to perceive a Jupyter Notebook cell as a simplified and raw version of a programming function. Similar to functions, Jupyter cells should strive to contain s... |
1505.02405 | Vasco Manquinho | Miguel Neves and Ruben Martins and Mikol\'a\v{s} Janota and In\^es
Lynce and Vasco Manquinho | Exploiting Resolution-based Representations for MaxSAT Solving | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver
in order to find an optimal solution. In particular, several algorithms take
advantage of the ability of SAT solvers to identify unsatisfiable subformulas.
Usually, these MaxSAT algorithms perform better when small unsatisfiable
subformulas a... | [
{
"created": "Sun, 10 May 2015 16:38:15 GMT",
"version": "v1"
}
] | 2015-05-12 | [
[
"Neves",
"Miguel",
""
],
[
"Martins",
"Ruben",
""
],
[
"Janota",
"Mikoláš",
""
],
[
"Lynce",
"Inês",
""
],
[
"Manquinho",
"Vasco",
""
]
] | Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of SAT solvers to identify unsatisfiable subformulas. Usually, these MaxSAT algorithms perform better when small unsatisfiable subformulas are... |
1904.05396 | Yuta Nakahara | Yuta Nakahara, Toshiyasu Matsushima | Covariance Evolution for Spatially "Mt. Fuji" Coupled LDPC Codes | accepted to IEEE Information Theory Workshop (ITW) 2019 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A spatially "Mt. Fuji" coupled low-density parity check (LDPC) ensemble is a
modified version of the original spatially coupled (SC) LDPC ensemble. Its
desirable properties are first observed in experimentally. The decoding error
probability in the error floor region over the binary erasure channel (BEC) is
theoretic... | [
{
"created": "Wed, 10 Apr 2019 19:14:04 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Apr 2019 02:24:45 GMT",
"version": "v2"
},
{
"created": "Sat, 17 Aug 2019 12:01:37 GMT",
"version": "v3"
}
] | 2019-08-20 | [
[
"Nakahara",
"Yuta",
""
],
[
"Matsushima",
"Toshiyasu",
""
]
] | A spatially "Mt. Fuji" coupled low-density parity check (LDPC) ensemble is a modified version of the original spatially coupled (SC) LDPC ensemble. Its desirable properties are first observed in experimentally. The decoding error probability in the error floor region over the binary erasure channel (BEC) is theoretical... |
2402.00293 | Takuma Yagi | Takuma Yagi, Misaki Ohashi, Yifei Huang, Ryosuke Furuta, Shungo
Adachi, Toutai Mitsuyama, Yoichi Sato | FineBio: A Fine-Grained Video Dataset of Biological Experiments with
Hierarchical Annotation | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In the development of science, accurate and reproducible documentation of the
experimental process is crucial. Automatic recognition of the actions in
experiments from videos would help experimenters by complementing the recording
of experiments. Towards this goal, we propose FineBio, a new fine-grained video
dataset... | [
{
"created": "Thu, 1 Feb 2024 02:47:39 GMT",
"version": "v1"
}
] | 2024-02-02 | [
[
"Yagi",
"Takuma",
""
],
[
"Ohashi",
"Misaki",
""
],
[
"Huang",
"Yifei",
""
],
[
"Furuta",
"Ryosuke",
""
],
[
"Adachi",
"Shungo",
""
],
[
"Mitsuyama",
"Toutai",
""
],
[
"Sato",
"Yoichi",
""
]
] | In the development of science, accurate and reproducible documentation of the experimental process is crucial. Automatic recognition of the actions in experiments from videos would help experimenters by complementing the recording of experiments. Towards this goal, we propose FineBio, a new fine-grained video dataset o... |
2304.06939 | Wanrong Zhu | Wanrong Zhu and Jack Hessel and Anas Awadalla and Samir Yitzhak Gadre
and Jesse Dodge and Alex Fang and Youngjae Yu and Ludwig Schmidt and William
Yang Wang and Yejin Choi | Multimodal C4: An Open, Billion-scale Corpus of Images Interleaved with
Text | NeurIPS D&B 2023. Project homepage: https://github.com/allenai/mmc4 | null | null | null | cs.CV cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In-context vision and language models like Flamingo support arbitrarily
interleaved sequences of images and text as input. This format not only enables
few-shot learning via interleaving independent supervised (image, text)
examples, but also, more complex prompts involving interaction between images,
e.g., "What do ... | [
{
"created": "Fri, 14 Apr 2023 06:17:46 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Jun 2023 21:49:58 GMT",
"version": "v2"
},
{
"created": "Sat, 28 Oct 2023 04:19:41 GMT",
"version": "v3"
}
] | 2023-10-31 | [
[
"Zhu",
"Wanrong",
""
],
[
"Hessel",
"Jack",
""
],
[
"Awadalla",
"Anas",
""
],
[
"Gadre",
"Samir Yitzhak",
""
],
[
"Dodge",
"Jesse",
""
],
[
"Fang",
"Alex",
""
],
[
"Yu",
"Youngjae",
""
],
[
"Schmidt... | In-context vision and language models like Flamingo support arbitrarily interleaved sequences of images and text as input. This format not only enables few-shot learning via interleaving independent supervised (image, text) examples, but also, more complex prompts involving interaction between images, e.g., "What do im... |
1603.05365 | B.Sundar Rajan | Anindya Gupta and B. Sundar Rajan | A Relation Between Network Computation and Functional Index Coding
Problems | 3 figures, 7 tables and 9 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In contrast to the network coding problem wherein the sinks in a network
demand subsets of the source messages, in a network computation problem the
sinks demand functions of the source messages. Similarly, in the functional
index coding problem, the side information and demands of the clients include
disjoint sets o... | [
{
"created": "Thu, 17 Mar 2016 06:31:50 GMT",
"version": "v1"
}
] | 2016-03-18 | [
[
"Gupta",
"Anindya",
""
],
[
"Rajan",
"B. Sundar",
""
]
] | In contrast to the network coding problem wherein the sinks in a network demand subsets of the source messages, in a network computation problem the sinks demand functions of the source messages. Similarly, in the functional index coding problem, the side information and demands of the clients include disjoint sets of ... |
1910.06907 | Utku Kose | Utku Kose | Techniques for Adversarial Examples Threatening the Safety of Artificial
Intelligence Based Systems | International Science and Innovation Congress 2019, pp. 643-655, 13
pages, 10 figures | null | null | null | cs.LG cs.AI math.OC | http://creativecommons.org/licenses/by-sa/4.0/ | Artificial intelligence is known as the most effective technological field
for rapid developments shaping the future of the world. Even today, it is
possible to see intense use of intelligence systems in all fields of the life.
Although advantages of the Artificial Intelligence are widely observed, there
is also a da... | [
{
"created": "Sun, 29 Sep 2019 21:56:59 GMT",
"version": "v1"
}
] | 2019-10-16 | [
[
"Kose",
"Utku",
""
]
] | Artificial intelligence is known as the most effective technological field for rapid developments shaping the future of the world. Even today, it is possible to see intense use of intelligence systems in all fields of the life. Although advantages of the Artificial Intelligence are widely observed, there is also a dark... |
2010.13266 | Ramya Srinivasan | Ramya Srinivasan, Kanji Uchino | Biases in Generative Art -- A Causal Look from the Lens of Art History | ACM FAccT March 3--10, 2021, Virtual Event, Canada | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | With rapid progress in artificial intelligence (AI), popularity of generative
art has grown substantially. From creating paintings to generating novel art
styles, AI based generative art has showcased a variety of applications.
However, there has been little focus concerning the ethical impacts of AI based
generative... | [
{
"created": "Mon, 26 Oct 2020 00:49:09 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Feb 2021 19:01:11 GMT",
"version": "v2"
}
] | 2021-02-18 | [
[
"Srinivasan",
"Ramya",
""
],
[
"Uchino",
"Kanji",
""
]
] | With rapid progress in artificial intelligence (AI), popularity of generative art has grown substantially. From creating paintings to generating novel art styles, AI based generative art has showcased a variety of applications. However, there has been little focus concerning the ethical impacts of AI based generative a... |
1807.00316 | Andrii Striuk | Andrii Striuk | Using Elements Of Semantic Parsing In E-Learning Environments | null | Information Technologies and Knowledge (2007) 297-299 | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Possibilities for using semantic parsing to estimate the correspondence of
text materials to teaching aims, correspondence of test task to theoretical
materials and other problems arising during the distance course designing and
educational process itself in e-learning environments.
| [
{
"created": "Sun, 1 Jul 2018 11:26:43 GMT",
"version": "v1"
}
] | 2018-07-03 | [
[
"Striuk",
"Andrii",
""
]
] | Possibilities for using semantic parsing to estimate the correspondence of text materials to teaching aims, correspondence of test task to theoretical materials and other problems arising during the distance course designing and educational process itself in e-learning environments. |
1603.05335 | Delu Zeng | Tong Zhao, Lin Li, Xinghao Ding, Yue Huang and Delu Zeng | Saliency Detection with Spaces of Background-based Distribution | 5 pages, 6 figures, Accepted by IEEE Signal Processing Letters in
March 2016 | null | 10.1109/LSP.2016.2544781 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this letter, an effective image saliency detection method is proposed by
constructing some novel spaces to model the background and redefine the
distance of the salient patches away from the background. Concretely, given the
backgroundness prior, eigendecomposition is utilized to create four spaces of
background-b... | [
{
"created": "Thu, 17 Mar 2016 02:18:30 GMT",
"version": "v1"
}
] | 2016-05-04 | [
[
"Zhao",
"Tong",
""
],
[
"Li",
"Lin",
""
],
[
"Ding",
"Xinghao",
""
],
[
"Huang",
"Yue",
""
],
[
"Zeng",
"Delu",
""
]
] | In this letter, an effective image saliency detection method is proposed by constructing some novel spaces to model the background and redefine the distance of the salient patches away from the background. Concretely, given the backgroundness prior, eigendecomposition is utilized to create four spaces of background-bas... |
1304.3438 | Alan Bundy | Alan Bundy | Incidence Calculus: A Mechanism for Probabilistic Reasoning | Appears in Proceedings of the First Conference on Uncertainty in
Artificial Intelligence (UAI1985) | null | null | UAI-P-1985-PG-177-184 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mechanisms for the automation of uncertainty are required for expert systems.
Sometimes these mechanisms need to obey the properties of probabilistic
reasoning. A purely numeric mechanism, like those proposed so far, cannot
provide a probabilistic logic with truth functional connectives. We propose an
alternative mec... | [
{
"created": "Wed, 27 Mar 2013 19:57:29 GMT",
"version": "v1"
}
] | 2013-04-15 | [
[
"Bundy",
"Alan",
""
]
] | Mechanisms for the automation of uncertainty are required for expert systems. Sometimes these mechanisms need to obey the properties of probabilistic reasoning. A purely numeric mechanism, like those proposed so far, cannot provide a probabilistic logic with truth functional connectives. We propose an alternative mecha... |
2009.02934 | Anna Frid | Anna E. Frid, Enzo Laborde, Jarkko Peltom\"aki | On prefix palindromic length of automatic words | revised version, to appear in Theoret. Comput. Sci | null | null | null | cs.FL cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The prefix palindromic length $\mathrm{PPL}_{\mathbf{u}}(n)$ of an infinite
word $\mathbf{u}$ is the minimal number of concatenated palindromes needed to
express the prefix of length $n$ of $\mathbf{u}$. Since 2013, it is still
unknown if $\mathrm{PPL}_{\mathbf{u}}(n)$ is unbounded for every aperiodic
infinite word $... | [
{
"created": "Mon, 7 Sep 2020 08:09:32 GMT",
"version": "v1"
},
{
"created": "Wed, 9 Jun 2021 10:14:06 GMT",
"version": "v2"
}
] | 2021-06-10 | [
[
"Frid",
"Anna E.",
""
],
[
"Laborde",
"Enzo",
""
],
[
"Peltomäki",
"Jarkko",
""
]
] | The prefix palindromic length $\mathrm{PPL}_{\mathbf{u}}(n)$ of an infinite word $\mathbf{u}$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $\mathbf{u}$. Since 2013, it is still unknown if $\mathrm{PPL}_{\mathbf{u}}(n)$ is unbounded for every aperiodic infinite word $\m... |
2206.12464 | Charalambos Poullis | Qiao Chen, Charalambos Poullis | Motion Estimation for Large Displacements and Deformations | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Large displacement optical flow is an integral part of many computer vision
tasks. Variational optical flow techniques based on a coarse-to-fine scheme
interpolate sparse matches and locally optimize an energy model conditioned on
colour, gradient and smoothness, making them sensitive to noise in the sparse
matches, ... | [
{
"created": "Fri, 24 Jun 2022 18:53:22 GMT",
"version": "v1"
}
] | 2022-06-28 | [
[
"Chen",
"Qiao",
""
],
[
"Poullis",
"Charalambos",
""
]
] | Large displacement optical flow is an integral part of many computer vision tasks. Variational optical flow techniques based on a coarse-to-fine scheme interpolate sparse matches and locally optimize an energy model conditioned on colour, gradient and smoothness, making them sensitive to noise in the sparse matches, de... |
1606.09296 | Mihajlo Grbovic | Mihajlo Grbovic, Guy Halawi, Zohar Karnin, Yoelle Maarek | How Many Folders Do You Really Need? | 10 pages, 12 figures, Proceedings of the 23rd ACM International
Conference on Information and Knowledge Management (CIKM 2014), Shanghai,
China | Proceedings of the 23rd ACM International Conference on
Information and Knowledge Management (CIKM 2014), Shanghai, China | 10.1145/2661829.2662018. | null | cs.AI cs.HC cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Email classification is still a mostly manual task. Consequently, most Web
mail users never define a single folder. Recently however, automatic
classification offering the same categories to all users has started to appear
in some Web mail clients, such as AOL or Gmail. We adopt this approach, rather
than previous (u... | [
{
"created": "Wed, 29 Jun 2016 21:35:24 GMT",
"version": "v1"
}
] | 2016-07-01 | [
[
"Grbovic",
"Mihajlo",
""
],
[
"Halawi",
"Guy",
""
],
[
"Karnin",
"Zohar",
""
],
[
"Maarek",
"Yoelle",
""
]
] | Email classification is still a mostly manual task. Consequently, most Web mail users never define a single folder. Recently however, automatic classification offering the same categories to all users has started to appear in some Web mail clients, such as AOL or Gmail. We adopt this approach, rather than previous (uns... |
1808.05488 | Lukas Cavigelli | Lukas Cavigelli, Luca Benini | CBinfer: Exploiting Frame-to-Frame Locality for Faster Convolutional
Network Inference on Video Streams | arXiv admin note: substantial text overlap with arXiv:1704.04313 | null | null | null | cs.CV cs.AI cs.NE eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The last few years have brought advances in computer vision at an amazing
pace, grounded on new findings in deep neural network construction and training
as well as the availability of large labeled datasets. Applying these networks
to images demands a high computational effort and pushes the use of
state-of-the-art ... | [
{
"created": "Wed, 15 Aug 2018 15:27:29 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Mar 2019 17:07:31 GMT",
"version": "v2"
}
] | 2019-03-05 | [
[
"Cavigelli",
"Lukas",
""
],
[
"Benini",
"Luca",
""
]
] | The last few years have brought advances in computer vision at an amazing pace, grounded on new findings in deep neural network construction and training as well as the availability of large labeled datasets. Applying these networks to images demands a high computational effort and pushes the use of state-of-the-art ne... |
1604.00427 | Yu-Chuan Su | Yu-Chuan Su, Kristen Grauman | Leaving Some Stones Unturned: Dynamic Feature Prioritization for
Activity Detection in Streaming Video | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current approaches for activity recognition often ignore constraints on
computational resources: 1) they rely on extensive feature computation to
obtain rich descriptors on all frames, and 2) they assume batch-mode access to
the entire test video at once. We propose a new active approach to activity
recognition that ... | [
{
"created": "Fri, 1 Apr 2016 22:37:28 GMT",
"version": "v1"
}
] | 2016-04-05 | [
[
"Su",
"Yu-Chuan",
""
],
[
"Grauman",
"Kristen",
""
]
] | Current approaches for activity recognition often ignore constraints on computational resources: 1) they rely on extensive feature computation to obtain rich descriptors on all frames, and 2) they assume batch-mode access to the entire test video at once. We propose a new active approach to activity recognition that pr... |
1310.3556 | Abhisek Kundu | Abhisek Kundu, Srinivas Nambirajan, Petros Drineas | Identifying Influential Entries in a Matrix | There is a bug in the proof of Lemma 5, which we are currently
working to fix | null | null | null | cs.NA cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For any matrix A in R^(m x n) of rank \rho, we present a probability
distribution over the entries of A (the element-wise leverage scores of
equation (2)) that reveals the most influential entries in the matrix. From a
theoretical perspective, we prove that sampling at most s = O ((m + n) \rho^2
ln (m + n)) entries o... | [
{
"created": "Mon, 14 Oct 2013 03:49:02 GMT",
"version": "v1"
},
{
"created": "Sat, 14 Dec 2013 12:13:32 GMT",
"version": "v2"
}
] | 2013-12-17 | [
[
"Kundu",
"Abhisek",
""
],
[
"Nambirajan",
"Srinivas",
""
],
[
"Drineas",
"Petros",
""
]
] | For any matrix A in R^(m x n) of rank \rho, we present a probability distribution over the entries of A (the element-wise leverage scores of equation (2)) that reveals the most influential entries in the matrix. From a theoretical perspective, we prove that sampling at most s = O ((m + n) \rho^2 ln (m + n)) entries of ... |
cs/9810011 | Dr. Wolfram Hardt | Wolfram Hardt, Bernd Kleinjohann | Flysig: Dataflow Oriented Delay-Insensitive Processor for Rapid
Prototyping of Signal Processing | 6 pages, 10 figures | Nineth IEEE International Workshop on Rapid System Prototyping
1998, Belgium, IEEE Computer Society Press | 10.1109/IWRSP.1998.676682 | null | cs.AR | null | As the one-chip integration of HW-modules designed by different companies
becomes more and more popular reliability of a HW-design and evaluation of the
timing behavior during the prototype stage are absolutely necessary. One way to
guarantee reliability is the use of robust design styles, e.g.,
delay-insensitivity. ... | [
{
"created": "Mon, 12 Oct 1998 10:11:05 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Hardt",
"Wolfram",
""
],
[
"Kleinjohann",
"Bernd",
""
]
] | As the one-chip integration of HW-modules designed by different companies becomes more and more popular reliability of a HW-design and evaluation of the timing behavior during the prototype stage are absolutely necessary. One way to guarantee reliability is the use of robust design styles, e.g., delay-insensitivity. Fo... |
2207.03928 | Matteo Manica | Matteo Manica, Jannis Born, Joris Cadow, Dimitrios Christofidellis,
Ashish Dave, Dean Clarke, Yves Gaetan Nana Teukam, Giorgio Giannone, Samuel
C. Hoffman, Matthew Buchan, Vijil Chenthamarakshan, Timothy Donovan, Hsiang
Han Hsu, Federico Zipoli, Oliver Schilter, Akihiro Kishimoto, Lisa Hamada,
Inkit Padhi, Karl... | Accelerating Material Design with the Generative Toolkit for Scientific
Discovery | 15 pages, 2 figures | Nature Partner Journals (npj) Computational Materials 9, 69 (2023) | 10.1038/s41524-023-01028-1 | null | cs.LG cs.AI cs.SE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | With the growing availability of data within various scientific domains,
generative models hold enormous potential to accelerate scientific discovery.
They harness powerful representations learned from datasets to speed up the
formulation of novel hypotheses with the potential to impact material discovery
broadly. We... | [
{
"created": "Fri, 8 Jul 2022 14:28:13 GMT",
"version": "v1"
},
{
"created": "Wed, 27 Jul 2022 12:37:05 GMT",
"version": "v2"
},
{
"created": "Thu, 1 Dec 2022 21:49:03 GMT",
"version": "v3"
},
{
"created": "Tue, 31 Jan 2023 12:37:12 GMT",
"version": "v4"
}
] | 2023-08-25 | [
[
"Manica",
"Matteo",
""
],
[
"Born",
"Jannis",
""
],
[
"Cadow",
"Joris",
""
],
[
"Christofidellis",
"Dimitrios",
""
],
[
"Dave",
"Ashish",
""
],
[
"Clarke",
"Dean",
""
],
[
"Teukam",
"Yves Gaetan Nana",
""
... | With the growing availability of data within various scientific domains, generative models hold enormous potential to accelerate scientific discovery. They harness powerful representations learned from datasets to speed up the formulation of novel hypotheses with the potential to impact material discovery broadly. We p... |
1906.03683 | Kuan-Hui Lee | Kuan-Hui Lee, Takaaki Tagawa, Jia-En M. Pan, Adrien Gaidon, Bertrand
Douillard | An Attention-based Recurrent Convolutional Network for Vehicle Taillight
Recognition | Accepted by IV 2019 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vehicle taillight recognition is an important application for automated
driving, especially for intent prediction of ado vehicles and trajectory
planning of the ego vehicle. In this work, we propose an end-to-end deep
learning framework to recognize taillights, i.e. rear turn and brake signals,
from a sequence of ima... | [
{
"created": "Sun, 9 Jun 2019 18:08:49 GMT",
"version": "v1"
}
] | 2019-06-11 | [
[
"Lee",
"Kuan-Hui",
""
],
[
"Tagawa",
"Takaaki",
""
],
[
"Pan",
"Jia-En M.",
""
],
[
"Gaidon",
"Adrien",
""
],
[
"Douillard",
"Bertrand",
""
]
] | Vehicle taillight recognition is an important application for automated driving, especially for intent prediction of ado vehicles and trajectory planning of the ego vehicle. In this work, we propose an end-to-end deep learning framework to recognize taillights, i.e. rear turn and brake signals, from a sequence of image... |
1809.03392 | Masahiro Okubo | Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono | Optimal Partition of a Tree with Social Distance | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem to find a partition of \textcolor{black}{a} graph $G$
with maximum social welfare based on social distance between vertices in $G$,
called MaxSWP. This problem is known to be NP-hard in general. In this paper,
we first give a complete characterization of optimal partitions of trees with
small dia... | [
{
"created": "Mon, 10 Sep 2018 15:24:00 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Sep 2018 09:04:54 GMT",
"version": "v2"
},
{
"created": "Fri, 21 Sep 2018 07:11:52 GMT",
"version": "v3"
},
{
"created": "Mon, 12 Nov 2018 05:26:16 GMT",
"version": "v4"
}
] | 2018-11-13 | [
[
"Okubo",
"Masahiro",
""
],
[
"Hanaka",
"Tesshu",
""
],
[
"Ono",
"Hirotaka",
""
]
] | We study the problem to find a partition of \textcolor{black}{a} graph $G$ with maximum social welfare based on social distance between vertices in $G$, called MaxSWP. This problem is known to be NP-hard in general. In this paper, we first give a complete characterization of optimal partitions of trees with small diame... |
1307.6626 | Zhixiong Chen | Zhixiong Chen, Zhihua Niu, Chenhuang Wu | On the $k$-error linear complexity of binary sequences derived from
polynomial quotients | 2 figures | null | 10.1007/s11432-014-5220-7 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the $k$-error linear complexity of $p^2$-periodic binary
sequences defined from the polynomial quotients (including the well-studied
Fermat quotients), which is defined by $$ q_{p,w}(u)\equiv \frac{u^w-u^{wp}}{p}
\bmod p ~ \mathrm{with} 0 \le q_{p,w}(u) \le p-1, ~u\ge 0, $$ where $p$ is an
odd prime an... | [
{
"created": "Thu, 25 Jul 2013 03:28:42 GMT",
"version": "v1"
}
] | 2016-03-15 | [
[
"Chen",
"Zhixiong",
""
],
[
"Niu",
"Zhihua",
""
],
[
"Wu",
"Chenhuang",
""
]
] | We investigate the $k$-error linear complexity of $p^2$-periodic binary sequences defined from the polynomial quotients (including the well-studied Fermat quotients), which is defined by $$ q_{p,w}(u)\equiv \frac{u^w-u^{wp}}{p} \bmod p ~ \mathrm{with} 0 \le q_{p,w}(u) \le p-1, ~u\ge 0, $$ where $p$ is an odd prime and ... |
2406.04546 | Sabri Mustafa Kahya | Sabri Mustafa Kahya, Boran Hamdi Sivrikaya, Muhammet Sami Yavuz,
Eckehard Steinbach | FOOD: Facial Authentication and Out-of-Distribution Detection with
Short-Range FMCW Radar | Accepted at ICIP 2024 | null | null | null | cs.CV cs.LG eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes a short-range FMCW radar-based facial authentication and
out-of-distribution (OOD) detection framework. Our pipeline jointly estimates
the correct classes for the in-distribution (ID) samples and detects the OOD
samples to prevent their inaccurate prediction. Our reconstruction-based
architecture ... | [
{
"created": "Thu, 6 Jun 2024 23:08:03 GMT",
"version": "v1"
}
] | 2024-06-10 | [
[
"Kahya",
"Sabri Mustafa",
""
],
[
"Sivrikaya",
"Boran Hamdi",
""
],
[
"Yavuz",
"Muhammet Sami",
""
],
[
"Steinbach",
"Eckehard",
""
]
] | This paper proposes a short-range FMCW radar-based facial authentication and out-of-distribution (OOD) detection framework. Our pipeline jointly estimates the correct classes for the in-distribution (ID) samples and detects the OOD samples to prevent their inaccurate prediction. Our reconstruction-based architecture co... |
2211.08029 | Amirhossein Abaskohi | Amirhossein Abaskohi, Nazanin Sabri, Behnam Bahrak | Persian Emotion Detection using ParsBERT and Imbalanced Data Handling
Approaches | 14 pages, 5 figures, 9 tables | ACM Transactions on Asian and Low-Resource Language Information
Processing 2022 | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Emotion recognition is one of the machine learning applications which can be
done using text, speech, or image data gathered from social media spaces.
Detecting emotion can help us in different fields, including opinion mining.
With the spread of social media, different platforms like Twitter have become
data sources... | [
{
"created": "Tue, 15 Nov 2022 10:22:49 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Nov 2022 12:13:11 GMT",
"version": "v2"
}
] | 2022-11-21 | [
[
"Abaskohi",
"Amirhossein",
""
],
[
"Sabri",
"Nazanin",
""
],
[
"Bahrak",
"Behnam",
""
]
] | Emotion recognition is one of the machine learning applications which can be done using text, speech, or image data gathered from social media spaces. Detecting emotion can help us in different fields, including opinion mining. With the spread of social media, different platforms like Twitter have become data sources, ... |
1907.08083 | Azqa Nadeem | Azqa Nadeem, and Marianne Junger | Laptop Theft in a University Setting can be Avoided with Warnings | The results in this paper are erroneous. Due to selection bias, the
results are not statistically significant | null | null | null | cs.CY cs.CR | http://creativecommons.org/licenses/by/4.0/ | Laptops have become an indispensable asset in today's digital age. They often
contain highly sensitive information, such as credentials and confidential
documents. As a result, the value of a laptop is an accumulation of the value
of both the physical device itself and the cyber assets it contains, making it
a lucrat... | [
{
"created": "Thu, 18 Jul 2019 14:36:52 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Jul 2021 17:06:57 GMT",
"version": "v2"
},
{
"created": "Fri, 4 Nov 2022 10:51:49 GMT",
"version": "v3"
}
] | 2022-11-07 | [
[
"Nadeem",
"Azqa",
""
],
[
"Junger",
"Marianne",
""
]
] | Laptops have become an indispensable asset in today's digital age. They often contain highly sensitive information, such as credentials and confidential documents. As a result, the value of a laptop is an accumulation of the value of both the physical device itself and the cyber assets it contains, making it a lucrativ... |
0909.4642 | Marc Scherfenberg | Christian Knauer, Maarten L\"offler, Marc Scherfenberg, Thomas Wolle | The directed Hausdorff distance between imprecise point sets | null | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the directed Hausdorff distance between point sets in the plane,
where one or both point sets consist of imprecise points. An imprecise point is
modelled by a disc given by its centre and a radius. The actual position of an
imprecise point may be anywhere within its disc. Due to the direction of the
Hausd... | [
{
"created": "Fri, 25 Sep 2009 15:25:25 GMT",
"version": "v1"
}
] | 2009-09-30 | [
[
"Knauer",
"Christian",
""
],
[
"Löffler",
"Maarten",
""
],
[
"Scherfenberg",
"Marc",
""
],
[
"Wolle",
"Thomas",
""
]
] | We consider the directed Hausdorff distance between point sets in the plane, where one or both point sets consist of imprecise points. An imprecise point is modelled by a disc given by its centre and a radius. The actual position of an imprecise point may be anywhere within its disc. Due to the direction of the Hausdor... |
2104.06784 | Yih-Chin Tai | Chi-Jyun Ko, Po-Chih Chen, Hock-Kiet Wong and Yih-Chin Tai | MoSES_2PDF: A GIS-Compatible GPU-accelerated High-Performance Simulation
Tool for Grain-Fluid Shallow Flows | 16 pages, 7 figures and 1 table | null | null | null | cs.CE physics.geo-ph | http://creativecommons.org/licenses/by/4.0/ | We introduce a GPU-accelerated simulation tool, named Modeling on Shallow
Flows with Efficient Simulation for Two-Phase Debris Flows (MoSES_2PDF), of
which the input and output data can be linked to the GIS system for engineering
application. MoSES_2PDF is developed based on the CUDA structure so that it can
well run... | [
{
"created": "Wed, 14 Apr 2021 11:19:39 GMT",
"version": "v1"
}
] | 2021-04-15 | [
[
"Ko",
"Chi-Jyun",
""
],
[
"Chen",
"Po-Chih",
""
],
[
"Wong",
"Hock-Kiet",
""
],
[
"Tai",
"Yih-Chin",
""
]
] | We introduce a GPU-accelerated simulation tool, named Modeling on Shallow Flows with Efficient Simulation for Two-Phase Debris Flows (MoSES_2PDF), of which the input and output data can be linked to the GIS system for engineering application. MoSES_2PDF is developed based on the CUDA structure so that it can well run w... |
2310.16035 | Jiayuan Mao | Joy Hsu, Jiayuan Mao, Joshua B. Tenenbaum, Jiajun Wu | What's Left? Concept Grounding with Logic-Enhanced Foundation Models | NeurIPS 2023. First two authors contributed equally. Project page:
https://web.stanford.edu/~joycj/projects/left_neurips_2023 | null | null | null | cs.CV cs.AI cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent works such as VisProg and ViperGPT have smartly composed foundation
models for visual reasoning-using large language models (LLMs) to produce
programs that can be executed by pre-trained vision-language models. However,
they operate in limited domains, such as 2D images, not fully exploiting the
generalization... | [
{
"created": "Tue, 24 Oct 2023 17:50:20 GMT",
"version": "v1"
}
] | 2023-10-25 | [
[
"Hsu",
"Joy",
""
],
[
"Mao",
"Jiayuan",
""
],
[
"Tenenbaum",
"Joshua B.",
""
],
[
"Wu",
"Jiajun",
""
]
] | Recent works such as VisProg and ViperGPT have smartly composed foundation models for visual reasoning-using large language models (LLMs) to produce programs that can be executed by pre-trained vision-language models. However, they operate in limited domains, such as 2D images, not fully exploiting the generalization o... |
1905.01011 | Jakob Pfender | Jakob Pfender, Alvin Valera, Winston K. G. Seah | Content Delivery Latency of Caching Strategies for Information-Centric
IoT | 10 pages, 9 figures, journal paper | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In-network caching is a central aspect of Information-Centric Networking
(ICN). It enables the rapid distribution of content across the network,
alleviating strain on content producers and reducing content delivery
latencies. ICN has emerged as a promising candidate for use in the Internet of
Things (IoT). However, I... | [
{
"created": "Fri, 3 May 2019 02:50:08 GMT",
"version": "v1"
}
] | 2019-05-06 | [
[
"Pfender",
"Jakob",
""
],
[
"Valera",
"Alvin",
""
],
[
"Seah",
"Winston K. G.",
""
]
] | In-network caching is a central aspect of Information-Centric Networking (ICN). It enables the rapid distribution of content across the network, alleviating strain on content producers and reducing content delivery latencies. ICN has emerged as a promising candidate for use in the Internet of Things (IoT). However, IoT... |
1901.10610 | Myung Seok Shim | Myung Seok Shim, Chenye Zhao, Yang Li, Xuchong Zhang, Wenrui Zhang,
Peng Li | Robust Deep Multi-Modal Sensor Fusion using Fusion Weight Regularization
and Target Learning | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sensor fusion has wide applications in many domains including health care and
autonomous systems. While the advent of deep learning has enabled promising
multi-modal fusion of high-level features and end-to-end sensor fusion
solutions, existing deep learning based sensor fusion techniques including deep
gating archit... | [
{
"created": "Tue, 29 Jan 2019 23:32:20 GMT",
"version": "v1"
},
{
"created": "Thu, 25 Jun 2020 05:06:28 GMT",
"version": "v2"
},
{
"created": "Thu, 22 Apr 2021 02:38:26 GMT",
"version": "v3"
}
] | 2021-04-23 | [
[
"Shim",
"Myung Seok",
""
],
[
"Zhao",
"Chenye",
""
],
[
"Li",
"Yang",
""
],
[
"Zhang",
"Xuchong",
""
],
[
"Zhang",
"Wenrui",
""
],
[
"Li",
"Peng",
""
]
] | Sensor fusion has wide applications in many domains including health care and autonomous systems. While the advent of deep learning has enabled promising multi-modal fusion of high-level features and end-to-end sensor fusion solutions, existing deep learning based sensor fusion techniques including deep gating architec... |
2207.05409 | Chenxin Li | Chenxin Li, Mingbao Lin, Zhiyuan Ding, Nie Lin, Yihong Zhuang, Yue
Huang, Xinghao Ding, Liujuan Cao | Knowledge Condensation Distillation | ECCV2022 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Knowledge Distillation (KD) transfers the knowledge from a high-capacity
teacher network to strengthen a smaller student. Existing methods focus on
excavating the knowledge hints and transferring the whole knowledge to the
student. However, the knowledge redundancy arises since the knowledge shows
different values to... | [
{
"created": "Tue, 12 Jul 2022 09:17:34 GMT",
"version": "v1"
}
] | 2022-07-13 | [
[
"Li",
"Chenxin",
""
],
[
"Lin",
"Mingbao",
""
],
[
"Ding",
"Zhiyuan",
""
],
[
"Lin",
"Nie",
""
],
[
"Zhuang",
"Yihong",
""
],
[
"Huang",
"Yue",
""
],
[
"Ding",
"Xinghao",
""
],
[
"Cao",
"Liujuan... | Knowledge Distillation (KD) transfers the knowledge from a high-capacity teacher network to strengthen a smaller student. Existing methods focus on excavating the knowledge hints and transferring the whole knowledge to the student. However, the knowledge redundancy arises since the knowledge shows different values to t... |
2406.13046 | Cristian Meo | Cristian Meo, Ksenia Sycheva, Anirudh Goyal, Justin Dauwels | Bayesian-LoRA: LoRA based Parameter Efficient Fine-Tuning using Optimal
Quantization levels and Rank Values trough Differentiable Bayesian Gates | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | It is a common practice in natural language processing to pre-train a single
model on a general domain and then fine-tune it for downstream tasks. However,
when it comes to Large Language Models, fine-tuning the entire model can be
computationally expensive, resulting in very intensive energy consumption. As a
result... | [
{
"created": "Tue, 18 Jun 2024 20:26:30 GMT",
"version": "v1"
},
{
"created": "Tue, 9 Jul 2024 16:29:08 GMT",
"version": "v2"
}
] | 2024-07-10 | [
[
"Meo",
"Cristian",
""
],
[
"Sycheva",
"Ksenia",
""
],
[
"Goyal",
"Anirudh",
""
],
[
"Dauwels",
"Justin",
""
]
] | It is a common practice in natural language processing to pre-train a single model on a general domain and then fine-tune it for downstream tasks. However, when it comes to Large Language Models, fine-tuning the entire model can be computationally expensive, resulting in very intensive energy consumption. As a result, ... |
2205.08301 | Antonello Paolino | Tong Hui (1 and 2), Antonello Paolino (1 and 4), Gabriele Nava (1),
Giuseppe L'Erario (1 and 3), Fabio Di Natale (1), Fabio Bergonti (1 and 3),
Francesco Braghin (2) and Daniele Pucci (1 and 3) ((1) Istituto Italiano di
Tecnologia, (2) Politecnico di Milano, (3) University of Manchester, (4)
Universit\`a degli ... | Centroidal Aerodynamic Modeling and Control of Flying Multibody Robots | 7 pages, 6 figures, to be published in IEEE ICRA 2022. Presentation
video: https://youtu.be/WDb-OVlh5XA | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a modeling and control framework for multibody flying
robots subject to non-negligible aerodynamic forces acting on the centroidal
dynamics. First, aerodynamic forces are calculated during robot flight in
different operating conditions by means of Computational Fluid Dynamics (CFD)
analysis. Then,... | [
{
"created": "Tue, 17 May 2022 12:58:18 GMT",
"version": "v1"
}
] | 2022-05-18 | [
[
"Hui",
"Tong",
"",
"1 and 2"
],
[
"Paolino",
"Antonello",
"",
"1 and 4"
],
[
"Nava",
"Gabriele",
"",
"1 and 3"
],
[
"L'Erario",
"Giuseppe",
"",
"1 and 3"
],
[
"Di Natale",
"Fabio",
"",
"1 and 3"
],
[
"Bergonti"... | This paper presents a modeling and control framework for multibody flying robots subject to non-negligible aerodynamic forces acting on the centroidal dynamics. First, aerodynamic forces are calculated during robot flight in different operating conditions by means of Computational Fluid Dynamics (CFD) analysis. Then, a... |
2107.11174 | Mohit Singhala | Mohit Singhala, Amy Chi, Maria Coleman and Jeremy D. Brown | Preliminary investigation into how limb choice affects kinesthetic
perception | Accepted as Works-in-Progress paper to World Haptics 2019 | null | null | null | cs.RO cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We have a limited understanding of how we integrate haptic information in
real-time from our upper limbs to perform complex bimanual tasks, an ability
that humans routinely employ to perform tasks of varying levels of difficulty.
In order to understand how information from both limbs is used to create a
unified perce... | [
{
"created": "Thu, 22 Jul 2021 16:56:43 GMT",
"version": "v1"
}
] | 2021-07-26 | [
[
"Singhala",
"Mohit",
""
],
[
"Chi",
"Amy",
""
],
[
"Coleman",
"Maria",
""
],
[
"Brown",
"Jeremy D.",
""
]
] | We have a limited understanding of how we integrate haptic information in real-time from our upper limbs to perform complex bimanual tasks, an ability that humans routinely employ to perform tasks of varying levels of difficulty. In order to understand how information from both limbs is used to create a unified percept... |
2312.11587 | Diogo Luvizon | Diogo Luvizon and Vladislav Golyanik and Adam Kortylewski and Marc
Habermann and Christian Theobalt | Relightable Neural Actor with Intrinsic Decomposition and Pose Control | Accepted to ECCV 2024. Project page:
https://vcai.mpi-inf.mpg.de/projects/RNA/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Creating a controllable and relightable digital avatar from multi-view video
with fixed illumination is a very challenging problem since humans are highly
articulated, creating pose-dependent appearance effects, and skin as well as
clothing require space-varying BRDF modeling. Existing works on creating
animatible av... | [
{
"created": "Mon, 18 Dec 2023 14:30:13 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Jul 2024 13:16:28 GMT",
"version": "v2"
}
] | 2024-07-29 | [
[
"Luvizon",
"Diogo",
""
],
[
"Golyanik",
"Vladislav",
""
],
[
"Kortylewski",
"Adam",
""
],
[
"Habermann",
"Marc",
""
],
[
"Theobalt",
"Christian",
""
]
] | Creating a controllable and relightable digital avatar from multi-view video with fixed illumination is a very challenging problem since humans are highly articulated, creating pose-dependent appearance effects, and skin as well as clothing require space-varying BRDF modeling. Existing works on creating animatible avat... |
2009.12401 | Fergal Stapleton | Edgar Galv\'an and Fergal Stapleton | Semantic-based Distance Approaches in Multi-objective Genetic
Programming | 8 pages, 6 tables, added additional reference, updated citation
format | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Semantics in the context of Genetic Program (GP) can be understood as the
behaviour of a program given a set of inputs and has been well documented in
improving performance of GP for a range of diverse problems. There have been a
wide variety of different methods which have incorporated semantics into
single-objectiv... | [
{
"created": "Fri, 25 Sep 2020 19:01:13 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Sep 2020 10:24:35 GMT",
"version": "v2"
},
{
"created": "Sun, 4 Oct 2020 11:33:30 GMT",
"version": "v3"
},
{
"created": "Wed, 16 Dec 2020 20:31:59 GMT",
"version": "v4"
}
] | 2020-12-18 | [
[
"Galván",
"Edgar",
""
],
[
"Stapleton",
"Fergal",
""
]
] | Semantics in the context of Genetic Program (GP) can be understood as the behaviour of a program given a set of inputs and has been well documented in improving performance of GP for a range of diverse problems. There have been a wide variety of different methods which have incorporated semantics into single-objective ... |
2201.05646 | Biplav Srivastava | Biplav Srivastava, Tarmo Koppel, Sai Teja Paladi, Siva Likitha
Valluru, Rohit Sharma, Owen Bond | ULTRA: A Data-driven Approach for Recommending Team Formation in
Response to Proposal Calls | 8 pages, Accepted to IEEE ICDM Workshop on AI for Nudging and
Personalization (WAIN) 2022 | null | null | null | cs.IR cs.AI cs.CY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We introduce an emerging AI-based approach and prototype system for assisting
team formation when researchers respond to calls for proposals from funding
agencies. This is an instance of the general problem of building teams when
demand opportunities come periodically and potential members may vary over
time. The nov... | [
{
"created": "Thu, 13 Jan 2022 02:48:42 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Nov 2022 00:00:24 GMT",
"version": "v2"
}
] | 2022-11-29 | [
[
"Srivastava",
"Biplav",
""
],
[
"Koppel",
"Tarmo",
""
],
[
"Paladi",
"Sai Teja",
""
],
[
"Valluru",
"Siva Likitha",
""
],
[
"Sharma",
"Rohit",
""
],
[
"Bond",
"Owen",
""
]
] | We introduce an emerging AI-based approach and prototype system for assisting team formation when researchers respond to calls for proposals from funding agencies. This is an instance of the general problem of building teams when demand opportunities come periodically and potential members may vary over time. The novel... |
1901.03097 | Deepak Mishra | Deepak Mishra and Erik G. Larsson | Optimal Channel Estimation for Reciprocity-Based Backscattering with a
Full-Duplex MIMO Reader | accepted for publication in IEEE Transactions on Signal Processing,
16 pages, 15 figures, 1 table | null | 10.1109/TSP.2019.2893859 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Backscatter communication (BSC) technology can enable ubiquitous deployment
of low-cost sustainable wireless devices. In this work we investigate the
efficacy of a full-duplex multiple-input-multiple-output (MIMO) reader for
enhancing the limited communication range of monostatic BSC systems. As this
performance is s... | [
{
"created": "Thu, 10 Jan 2019 10:56:12 GMT",
"version": "v1"
}
] | 2019-03-27 | [
[
"Mishra",
"Deepak",
""
],
[
"Larsson",
"Erik G.",
""
]
] | Backscatter communication (BSC) technology can enable ubiquitous deployment of low-cost sustainable wireless devices. In this work we investigate the efficacy of a full-duplex multiple-input-multiple-output (MIMO) reader for enhancing the limited communication range of monostatic BSC systems. As this performance is str... |
2110.11402 | Harald Steck | Harald Steck and Dario Garcia Garcia | On the Regularization of Autoencoders | 10 pages | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | While much work has been devoted to understanding the implicit (and explicit)
regularization of deep nonlinear networks in the supervised setting, this paper
focuses on unsupervised learning, i.e., autoencoders are trained with the
objective of reproducing the output from the input. We extend recent results
[Jin et a... | [
{
"created": "Thu, 21 Oct 2021 18:28:25 GMT",
"version": "v1"
}
] | 2021-10-25 | [
[
"Steck",
"Harald",
""
],
[
"Garcia",
"Dario Garcia",
""
]
] | While much work has been devoted to understanding the implicit (and explicit) regularization of deep nonlinear networks in the supervised setting, this paper focuses on unsupervised learning, i.e., autoencoders are trained with the objective of reproducing the output from the input. We extend recent results [Jin et al.... |
2005.09117 | Avner May | Simran Arora, Avner May, Jian Zhang, Christopher R\'e | Contextual Embeddings: When Are They Worth It? | ACL 2020 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the settings for which deep contextual embeddings (e.g., BERT) give
large improvements in performance relative to classic pretrained embeddings
(e.g., GloVe), and an even simpler baseline---random word embeddings---focusing
on the impact of the training set size and the linguistic properties of the
task. Sur... | [
{
"created": "Mon, 18 May 2020 22:20:17 GMT",
"version": "v1"
}
] | 2020-05-20 | [
[
"Arora",
"Simran",
""
],
[
"May",
"Avner",
""
],
[
"Zhang",
"Jian",
""
],
[
"Ré",
"Christopher",
""
]
] | We study the settings for which deep contextual embeddings (e.g., BERT) give large improvements in performance relative to classic pretrained embeddings (e.g., GloVe), and an even simpler baseline---random word embeddings---focusing on the impact of the training set size and the linguistic properties of the task. Surpr... |
2405.16656 | Hellina Hailu Nigatu | Hellina Hailu Nigatu and Inioluwa Deborah Raji | "I Searched for a Religious Song in Amharic and Got Sexual Content
Instead": Investigating Online Harm in Low-Resourced Languages on YouTube | To appear in ACM Conference on Fairness, Accountability, and
Transparency (ACM FAccT) 2024 | null | 10.1145/3630106.3658546 | null | cs.HC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Online social media platforms such as YouTube have a wide, global reach.
However, little is known about the experience of low-resourced language
speakers on such platforms; especially in how they experience and navigate
harmful content. To better understand this, we (1) conducted semi-structured
interviews (n=15) and... | [
{
"created": "Sun, 26 May 2024 18:18:11 GMT",
"version": "v1"
}
] | 2024-05-28 | [
[
"Nigatu",
"Hellina Hailu",
""
],
[
"Raji",
"Inioluwa Deborah",
""
]
] | Online social media platforms such as YouTube have a wide, global reach. However, little is known about the experience of low-resourced language speakers on such platforms; especially in how they experience and navigate harmful content. To better understand this, we (1) conducted semi-structured interviews (n=15) and (... |
2406.05881 | Utsav Singh | Utsav Singh, Pramit Bhattacharyya, Vinay P. Namboodiri | LGR2: Language Guided Reward Relabeling for Accelerating Hierarchical
Reinforcement Learning | null | null | null | null | cs.LG cs.CL cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Developing interactive systems that leverage natural language instructions to
solve complex robotic control tasks has been a long-desired goal in the
robotics community. Large Language Models (LLMs) have demonstrated exceptional
abilities in handling complex tasks, including logical reasoning, in-context
learning, an... | [
{
"created": "Sun, 9 Jun 2024 18:40:24 GMT",
"version": "v1"
},
{
"created": "Sun, 16 Jun 2024 10:28:45 GMT",
"version": "v2"
}
] | 2024-06-18 | [
[
"Singh",
"Utsav",
""
],
[
"Bhattacharyya",
"Pramit",
""
],
[
"Namboodiri",
"Vinay P.",
""
]
] | Developing interactive systems that leverage natural language instructions to solve complex robotic control tasks has been a long-desired goal in the robotics community. Large Language Models (LLMs) have demonstrated exceptional abilities in handling complex tasks, including logical reasoning, in-context learning, and ... |
1609.04493 | Jia Pan | Yajue Yang and Yuanqing Wu and Jia Pan | Parallel Dynamics Computation using Prefix Sum Operations | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new parallel framework for fast computation of inverse and
forward dynamics of articulated robots based on prefix sums (scans). We
re-investigate the well-known recursive Newton-Euler formulation of robot
dynamics and show that the forward-backward propagation process for robot
inverse dynamics is equiva... | [
{
"created": "Thu, 15 Sep 2016 02:11:16 GMT",
"version": "v1"
}
] | 2016-09-16 | [
[
"Yang",
"Yajue",
""
],
[
"Wu",
"Yuanqing",
""
],
[
"Pan",
"Jia",
""
]
] | We propose a new parallel framework for fast computation of inverse and forward dynamics of articulated robots based on prefix sums (scans). We re-investigate the well-known recursive Newton-Euler formulation of robot dynamics and show that the forward-backward propagation process for robot inverse dynamics is equivale... |
1201.3458 | Jeffrey Yu | Di Wu, Yiping Ke, Jeffrey Xu Yu, Zheng Liu | Detecting Priming News Events | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study a problem of detecting priming events based on a time series index
and an evolving document stream. We define a priming event as an event which
triggers abnormal movements of the time series index, i.e., the Iraq war with
respect to the president approval index of President Bush. Existing solutions
either fo... | [
{
"created": "Tue, 17 Jan 2012 08:59:57 GMT",
"version": "v1"
}
] | 2012-01-18 | [
[
"Wu",
"Di",
""
],
[
"Ke",
"Yiping",
""
],
[
"Yu",
"Jeffrey Xu",
""
],
[
"Liu",
"Zheng",
""
]
] | We study a problem of detecting priming events based on a time series index and an evolving document stream. We define a priming event as an event which triggers abnormal movements of the time series index, i.e., the Iraq war with respect to the president approval index of President Bush. Existing solutions either focu... |
2310.06744 | Wangbo Yu | Wangbo Yu, Li Yuan, Yan-Pei Cao, Xiangjun Gao, Xiaoyu Li, Wenbo Hu,
Long Quan, Ying Shan, Yonghong Tian | HiFi-123: Towards High-fidelity One Image to 3D Content Generation | Accepted by ECCV 2024. Project Page:
https://drexubery.github.io/HiFi-123/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in diffusion models have enabled 3D generation from a single
image. However, current methods often produce suboptimal results for novel
views, with blurred textures and deviations from the reference image, limiting
their practical applications. In this paper, we introduce HiFi-123, a method
designed f... | [
{
"created": "Tue, 10 Oct 2023 16:14:20 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Mar 2024 11:35:55 GMT",
"version": "v2"
},
{
"created": "Fri, 12 Jul 2024 01:55:26 GMT",
"version": "v3"
}
] | 2024-07-15 | [
[
"Yu",
"Wangbo",
""
],
[
"Yuan",
"Li",
""
],
[
"Cao",
"Yan-Pei",
""
],
[
"Gao",
"Xiangjun",
""
],
[
"Li",
"Xiaoyu",
""
],
[
"Hu",
"Wenbo",
""
],
[
"Quan",
"Long",
""
],
[
"Shan",
"Ying",
""
... | Recent advances in diffusion models have enabled 3D generation from a single image. However, current methods often produce suboptimal results for novel views, with blurred textures and deviations from the reference image, limiting their practical applications. In this paper, we introduce HiFi-123, a method designed for... |
1909.06623 | Wen Yan | Wen Yan and Eduardo Corona and Dhairya Malhotra and Shravan
Veerapaneni and Michael Shelley | A scalable computational platform for particulate Stokes suspensions | null | null | 10.1016/j.jcp.2020.109524 | null | cs.CE cond-mat.soft physics.comp-ph physics.flu-dyn | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe a computational framework for simulating suspensions of rigid
particles in Newtonian Stokes flow. One central building block is a
collision-resolution algorithm that overcomes the numerical constraints arising
from particle collisions. This algorithm extends the well-known complementarity
method for non-s... | [
{
"created": "Sat, 14 Sep 2019 16:18:13 GMT",
"version": "v1"
},
{
"created": "Fri, 15 May 2020 17:19:44 GMT",
"version": "v2"
}
] | 2020-06-24 | [
[
"Yan",
"Wen",
""
],
[
"Corona",
"Eduardo",
""
],
[
"Malhotra",
"Dhairya",
""
],
[
"Veerapaneni",
"Shravan",
""
],
[
"Shelley",
"Michael",
""
]
] | We describe a computational framework for simulating suspensions of rigid particles in Newtonian Stokes flow. One central building block is a collision-resolution algorithm that overcomes the numerical constraints arising from particle collisions. This algorithm extends the well-known complementarity method for non-smo... |
2210.06812 | Jonas Mueller | Hui Wen Goh, Ulyana Tkachenko, Jonas Mueller | CROWDLAB: Supervised learning to infer consensus labels and quality
scores for data with multiple annotators | null | NeurIPS 2022 Human in the Loop Learning Workshop | null | null | cs.LG cs.HC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Real-world data for classification is often labeled by multiple annotators.
For analyzing such data, we introduce CROWDLAB, a straightforward approach to
utilize any trained classifier to estimate: (1) A consensus label for each
example that aggregates the available annotations; (2) A confidence score for
how likely ... | [
{
"created": "Thu, 13 Oct 2022 07:54:07 GMT",
"version": "v1"
},
{
"created": "Fri, 27 Jan 2023 18:53:11 GMT",
"version": "v2"
}
] | 2023-01-30 | [
[
"Goh",
"Hui Wen",
""
],
[
"Tkachenko",
"Ulyana",
""
],
[
"Mueller",
"Jonas",
""
]
] | Real-world data for classification is often labeled by multiple annotators. For analyzing such data, we introduce CROWDLAB, a straightforward approach to utilize any trained classifier to estimate: (1) A consensus label for each example that aggregates the available annotations; (2) A confidence score for how likely ea... |
2309.12442 | DongHoon Kim | DongHoon Kim, Preston Bruner, Isaac Cho | Folding Rays: a Bimanual Occluded Target Interaction Technique | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | As Virtual Reality becomes commonplace in the world, it is important for
developers to focus on user interaction with the virtual world. Currently,
there are limitations to some selection and navigation techniques that have not
yet been completely overcome. Focusing specifically on enhancing ray-casting,
we present t... | [
{
"created": "Thu, 21 Sep 2023 19:23:55 GMT",
"version": "v1"
}
] | 2023-09-25 | [
[
"Kim",
"DongHoon",
""
],
[
"Bruner",
"Preston",
""
],
[
"Cho",
"Isaac",
""
]
] | As Virtual Reality becomes commonplace in the world, it is important for developers to focus on user interaction with the virtual world. Currently, there are limitations to some selection and navigation techniques that have not yet been completely overcome. Focusing specifically on enhancing ray-casting, we present the... |
2104.07654 | Nicha Dvornek | Nicha C. Dvornek, Xiaoxiao Li, Juntang Zhuang, Pamela Ventola, and
James S. Duncan | Demographic-Guided Attention in Recurrent Neural Networks for Modeling
Neuropathophysiological Heterogeneity | MLMI 2020 (MICCAI Workshop) | null | 10.1007/978-3-030-59861-7_37 | null | cs.LG cs.CV eess.IV q-bio.QM stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Heterogeneous presentation of a neurological disorder suggests potential
differences in the underlying pathophysiological changes that occur in the
brain. We propose to model heterogeneous patterns of functional network
differences using a demographic-guided attention (DGA) mechanism for recurrent
neural network mode... | [
{
"created": "Thu, 15 Apr 2021 17:58:36 GMT",
"version": "v1"
}
] | 2021-04-16 | [
[
"Dvornek",
"Nicha C.",
""
],
[
"Li",
"Xiaoxiao",
""
],
[
"Zhuang",
"Juntang",
""
],
[
"Ventola",
"Pamela",
""
],
[
"Duncan",
"James S.",
""
]
] | Heterogeneous presentation of a neurological disorder suggests potential differences in the underlying pathophysiological changes that occur in the brain. We propose to model heterogeneous patterns of functional network differences using a demographic-guided attention (DGA) mechanism for recurrent neural network models... |
2405.02004 | Yingshuang Zou | Yingshuang Zou, Yikang Ding, Xi Qiu, Haoqian Wang, Haotian Zhang | M${^2}$Depth: Self-supervised Two-Frame Multi-camera Metric Depth
Estimation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel self-supervised two-frame multi-camera metric
depth estimation network, termed M${^2}$Depth, which is designed to predict
reliable scale-aware surrounding depth in autonomous driving. Unlike the
previous works that use multi-view images from a single time-step or multiple
time-step images ... | [
{
"created": "Fri, 3 May 2024 11:06:37 GMT",
"version": "v1"
}
] | 2024-05-06 | [
[
"Zou",
"Yingshuang",
""
],
[
"Ding",
"Yikang",
""
],
[
"Qiu",
"Xi",
""
],
[
"Wang",
"Haoqian",
""
],
[
"Zhang",
"Haotian",
""
]
] | This paper presents a novel self-supervised two-frame multi-camera metric depth estimation network, termed M${^2}$Depth, which is designed to predict reliable scale-aware surrounding depth in autonomous driving. Unlike the previous works that use multi-view images from a single time-step or multiple time-step images fr... |
2110.06361 | Shihao Ju | Shihao Ju and Theodore S. Rappaport | Sub-Terahertz Spatial Statistical MIMO Channel Model for Urban
Microcells at 142 GHz | 6 pages, 7 figures, 2021 IEEE Global Communications Conference | null | null | null | cs.IT eess.SP math.IT | http://creativecommons.org/licenses/by/4.0/ | Sixth generation (6G) cellular systems are expected to extend the operational
range to sub-Terahertz (THz) frequencies between 100 and 300 GHz due to the
broad unexploited spectrum therein. A proper channel model is needed to
accurately describe spatial and temporal channel characteristics and faithfully
create chann... | [
{
"created": "Tue, 12 Oct 2021 21:10:15 GMT",
"version": "v1"
}
] | 2021-10-14 | [
[
"Ju",
"Shihao",
""
],
[
"Rappaport",
"Theodore S.",
""
]
] | Sixth generation (6G) cellular systems are expected to extend the operational range to sub-Terahertz (THz) frequencies between 100 and 300 GHz due to the broad unexploited spectrum therein. A proper channel model is needed to accurately describe spatial and temporal channel characteristics and faithfully create channel... |
2206.12139 | Qi Liao | Qi Liao and Tianlun Hu and Nikolaj Marchenko and Peter Kulics and Lutz
Ewe | HARU: Haptic Augmented Reality-Assisted User-Centric Industrial Network
Planning | null | null | null | null | cs.NI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To support Industry 4.0 applications with haptics and human-machine
interaction, 6G requires a new framework that is fully autonomous, visual, and
interactive. In this paper, we provide an end-to-end solution, HARU, for
private network planning services, especially industrial networks. The solution
consists of the fo... | [
{
"created": "Fri, 24 Jun 2022 08:02:48 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Oct 2022 14:18:07 GMT",
"version": "v2"
}
] | 2022-10-14 | [
[
"Liao",
"Qi",
""
],
[
"Hu",
"Tianlun",
""
],
[
"Marchenko",
"Nikolaj",
""
],
[
"Kulics",
"Peter",
""
],
[
"Ewe",
"Lutz",
""
]
] | To support Industry 4.0 applications with haptics and human-machine interaction, 6G requires a new framework that is fully autonomous, visual, and interactive. In this paper, we provide an end-to-end solution, HARU, for private network planning services, especially industrial networks. The solution consists of the foll... |
2305.17520 | Uddeshya Upadhyay | Vikrant Rangnekar, Uddeshya Upadhyay, Zeynep Akata, Biplab Banerjee | USIM-DAL: Uncertainty-aware Statistical Image Modeling-based Dense
Active Learning for Super-resolution | Accepted at UAI 2023 | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Dense regression is a widely used approach in computer vision for tasks such
as image super-resolution, enhancement, depth estimation, etc. However, the
high cost of annotation and labeling makes it challenging to achieve accurate
results. We propose incorporating active learning into dense regression models
to addre... | [
{
"created": "Sat, 27 May 2023 16:33:43 GMT",
"version": "v1"
}
] | 2023-05-30 | [
[
"Rangnekar",
"Vikrant",
""
],
[
"Upadhyay",
"Uddeshya",
""
],
[
"Akata",
"Zeynep",
""
],
[
"Banerjee",
"Biplab",
""
]
] | Dense regression is a widely used approach in computer vision for tasks such as image super-resolution, enhancement, depth estimation, etc. However, the high cost of annotation and labeling makes it challenging to achieve accurate results. We propose incorporating active learning into dense regression models to address... |
1905.04709 | Gang Min | Gang Min, Changqing Zhang, Xiongwei Zhang, Wei Tan | Deep Vocoder: Low Bit Rate Compression of Speech with Deep Autoencoder | null | null | null | null | cs.MM cs.IT cs.SD eess.AS math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Inspired by the success of deep neural networks (DNNs) in speech processing,
this paper presents Deep Vocoder, a direct end-to-end low bit rate speech
compression method with deep autoencoder (DAE). In Deep Vocoder, DAE is used
for extracting the latent representing features (LRFs) of speech, which are
then efficient... | [
{
"created": "Sun, 12 May 2019 12:24:27 GMT",
"version": "v1"
},
{
"created": "Tue, 14 May 2019 09:06:34 GMT",
"version": "v2"
}
] | 2019-05-15 | [
[
"Min",
"Gang",
""
],
[
"Zhang",
"Changqing",
""
],
[
"Zhang",
"Xiongwei",
""
],
[
"Tan",
"Wei",
""
]
] | Inspired by the success of deep neural networks (DNNs) in speech processing, this paper presents Deep Vocoder, a direct end-to-end low bit rate speech compression method with deep autoencoder (DAE). In Deep Vocoder, DAE is used for extracting the latent representing features (LRFs) of speech, which are then efficiently... |
2406.08753 | Ricardo Grando | Hiago Sodre, Sebastian Barcelona, Anthony Scirgalea, Brandon Macedo,
Gabriel Sampson, Pablo Moraes, William Moraes, Victoria Saravia, Juan Deniz,
Bruna Guterres, Andre Kelbouscas, Ricardo Grando | UruBots UAV -- Air Emergency Service Indoor Team Description Paper for
FIRA 2024 | Team Description Paper for the FIRA RoboWorld Cup 2024 | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | This document addresses the description of the corresponding "Urubots" Team
for the 2024 Fira Air League, "Air Emergency Service (Indoor)." We introduce
our team and an autonomous Unmanned Aerial Vehicle (UAV) that relies on
computer vision for its flight control. This UAV has the capability to perform
a wide variety... | [
{
"created": "Thu, 13 Jun 2024 02:23:29 GMT",
"version": "v1"
}
] | 2024-06-14 | [
[
"Sodre",
"Hiago",
""
],
[
"Barcelona",
"Sebastian",
""
],
[
"Scirgalea",
"Anthony",
""
],
[
"Macedo",
"Brandon",
""
],
[
"Sampson",
"Gabriel",
""
],
[
"Moraes",
"Pablo",
""
],
[
"Moraes",
"William",
""
],... | This document addresses the description of the corresponding "Urubots" Team for the 2024 Fira Air League, "Air Emergency Service (Indoor)." We introduce our team and an autonomous Unmanned Aerial Vehicle (UAV) that relies on computer vision for its flight control. This UAV has the capability to perform a wide variety o... |
1405.3352 | Ziqiang Chen | F. Lu and Z. Chen | Newton-Type Iterative Solver for Multiple View $L2$ Triangulation | 15 pages, 1 figure, 4 tables, 30 references, C++ source codes | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this note, we show that the L2 optimal solutions to most real multiple
view L2 triangulation problems can be efficiently obtained by two-stage
Newton-like iterative methods, while the difficulty of such problems mainly
lies in how to verify the L2 optimality. Such a working two-stage bundle
adjustment approach fea... | [
{
"created": "Wed, 14 May 2014 03:35:56 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Jun 2014 23:39:32 GMT",
"version": "v2"
}
] | 2014-07-02 | [
[
"Lu",
"F.",
""
],
[
"Chen",
"Z.",
""
]
] | In this note, we show that the L2 optimal solutions to most real multiple view L2 triangulation problems can be efficiently obtained by two-stage Newton-like iterative methods, while the difficulty of such problems mainly lies in how to verify the L2 optimality. Such a working two-stage bundle adjustment approach featu... |
2106.14610 | Henrique Ferraz de Arruda | Henrique Ferraz de Arruda, Luciano da Fontoura Costa | A keyword-driven approach to science | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | To a good extent, words can be understood as corresponding to patterns or
categories that appeared in order to represent concepts and structures that are
particularly important or useful in a given time and space. Words are
characterized by not being completely general nor specific, in the sense that
the same word ca... | [
{
"created": "Mon, 31 May 2021 22:06:20 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Jul 2021 21:35:07 GMT",
"version": "v2"
}
] | 2021-07-21 | [
[
"de Arruda",
"Henrique Ferraz",
""
],
[
"Costa",
"Luciano da Fontoura",
""
]
] | To a good extent, words can be understood as corresponding to patterns or categories that appeared in order to represent concepts and structures that are particularly important or useful in a given time and space. Words are characterized by not being completely general nor specific, in the sense that the same word can ... |
2011.04246 | Lun Quan | Lun Quan, Zhiwei Zhang, Xingguang Zhong, Chao Xu and Fei Gao | EVA-Planner: Environmental Adaptive Quadrotor Planning | IEEE International Conference on Robotics and Automation (ICRA 2021) | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The quadrotor is popularly used in challenging environments due to its
superior agility and flexibility. In these scenarios, trajectory planning plays
a vital role in generating safe motions to avoid obstacles while ensuring
flight smoothness. Although many works on quadrotor planning have been
proposed, a research g... | [
{
"created": "Mon, 9 Nov 2020 08:32:25 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Jul 2021 13:02:23 GMT",
"version": "v2"
}
] | 2021-07-06 | [
[
"Quan",
"Lun",
""
],
[
"Zhang",
"Zhiwei",
""
],
[
"Zhong",
"Xingguang",
""
],
[
"Xu",
"Chao",
""
],
[
"Gao",
"Fei",
""
]
] | The quadrotor is popularly used in challenging environments due to its superior agility and flexibility. In these scenarios, trajectory planning plays a vital role in generating safe motions to avoid obstacles while ensuring flight smoothness. Although many works on quadrotor planning have been proposed, a research gap... |
2009.07489 | Sufeng Duan | Sufeng Duan, Hai Zhao and Rui Wang | Graph-to-Sequence Neural Machine Translation | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural machine translation (NMT) usually works in a seq2seq learning way by
viewing either source or target sentence as a linear sequence of words, which
can be regarded as a special case of graph, taking words in the sequence as
nodes and relationships between words as edges. In the light of the current NMT
models m... | [
{
"created": "Wed, 16 Sep 2020 06:28:58 GMT",
"version": "v1"
}
] | 2020-09-17 | [
[
"Duan",
"Sufeng",
""
],
[
"Zhao",
"Hai",
""
],
[
"Wang",
"Rui",
""
]
] | Neural machine translation (NMT) usually works in a seq2seq learning way by viewing either source or target sentence as a linear sequence of words, which can be regarded as a special case of graph, taking words in the sequence as nodes and relationships between words as edges. In the light of the current NMT models mor... |
2305.19398 | Eric Heisler | Eric Heisler and Cheng-Hau Yang and Aadesh Deshmukh and Baskar
Ganapathysubramanian and Hari Sundar | Generating Finite Element Codes combining Adaptive Octrees with Complex
Geometries | null | null | null | null | cs.CE | http://creativecommons.org/licenses/by-sa/4.0/ | We present a high-level domain-specific language (DSL) interface to drive an
adaptive incomplete $k$-d tree-based framework for finite element (FEM)
solutions to PDEs. This DSL provides three key advances: (a) it abstracts out
the complexity of implementing non-trivial FEM formulations, (b) it simplifies
deploying th... | [
{
"created": "Tue, 30 May 2023 20:25:25 GMT",
"version": "v1"
}
] | 2023-06-01 | [
[
"Heisler",
"Eric",
""
],
[
"Yang",
"Cheng-Hau",
""
],
[
"Deshmukh",
"Aadesh",
""
],
[
"Ganapathysubramanian",
"Baskar",
""
],
[
"Sundar",
"Hari",
""
]
] | We present a high-level domain-specific language (DSL) interface to drive an adaptive incomplete $k$-d tree-based framework for finite element (FEM) solutions to PDEs. This DSL provides three key advances: (a) it abstracts out the complexity of implementing non-trivial FEM formulations, (b) it simplifies deploying thes... |
2311.10924 | Theodore Pan | Slobodan Mitrovi\'c, Theodore Pan | Faster Streaming and Scalable Algorithms for Finding Directed Dense
Subgraphs in Large Graphs | null | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | Finding dense subgraphs is a fundamental algorithmic tool in data mining,
community detection, and clustering. In this problem, one aims to find an
induced subgraph whose edge-to-vertex ratio is maximized.
We study the directed case of this question in the context of semi-streaming
and massively parallel algorithms... | [
{
"created": "Sat, 18 Nov 2023 00:58:05 GMT",
"version": "v1"
}
] | 2023-11-21 | [
[
"Mitrović",
"Slobodan",
""
],
[
"Pan",
"Theodore",
""
]
] | Finding dense subgraphs is a fundamental algorithmic tool in data mining, community detection, and clustering. In this problem, one aims to find an induced subgraph whose edge-to-vertex ratio is maximized. We study the directed case of this question in the context of semi-streaming and massively parallel algorithms. In... |
2106.04555 | Tommi Kerola | Tommi Kerola, Jie Li, Atsushi Kanehira, Yasunori Kudo, Alexis Vallet,
Adrien Gaidon | Hierarchical Lov\'asz Embeddings for Proposal-free Panoptic Segmentation | 13 pages, 9 figures, including supplementary material. To be
published in CVPR 2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Panoptic segmentation brings together two separate tasks: instance and
semantic segmentation. Although they are related, unifying them faces an
apparent paradox: how to learn simultaneously instance-specific and
category-specific (i.e. instance-agnostic) representations jointly. Hence,
state-of-the-art panoptic segme... | [
{
"created": "Tue, 8 Jun 2021 17:43:54 GMT",
"version": "v1"
}
] | 2021-06-09 | [
[
"Kerola",
"Tommi",
""
],
[
"Li",
"Jie",
""
],
[
"Kanehira",
"Atsushi",
""
],
[
"Kudo",
"Yasunori",
""
],
[
"Vallet",
"Alexis",
""
],
[
"Gaidon",
"Adrien",
""
]
] | Panoptic segmentation brings together two separate tasks: instance and semantic segmentation. Although they are related, unifying them faces an apparent paradox: how to learn simultaneously instance-specific and category-specific (i.e. instance-agnostic) representations jointly. Hence, state-of-the-art panoptic segment... |
1004.0765 | Secretary Aircc Journal | E.Sathiyamoorthy, N.Ch.Sriman Narayana Iyenger, V.Ramachandran (VIT
University, India) | Agent Based Trust Management Model Based on Weight Value Model for
Online Auctions | 17Pages | International Journal of Network Security & Its Applications 1.3
(2009) 15-31 | null | null | cs.GT cs.CR | http://creativecommons.org/licenses/by-nc-sa/3.0/ | This paper is aimed at the stipulations which arise in the traditional online
auctions as a result of various anomalies in the reputation and trust
calculation mechanism. We try to improve the scalability and efficiency of the
online auctions by providing efficient trust management methodology considering
several fac... | [
{
"created": "Tue, 6 Apr 2010 03:43:17 GMT",
"version": "v1"
}
] | 2010-07-15 | [
[
"Sathiyamoorthy",
"E.",
"",
"VIT\n University, India"
],
[
"Iyenger",
"N. Ch. Sriman Narayana",
"",
"VIT\n University, India"
],
[
"Ramachandran",
"V.",
"",
"VIT\n University, India"
]
] | This paper is aimed at the stipulations which arise in the traditional online auctions as a result of various anomalies in the reputation and trust calculation mechanism. We try to improve the scalability and efficiency of the online auctions by providing efficient trust management methodology considering several facto... |
1708.09129 | Chien-Chun Ni | Xiaotian Yin, Yu-Yao Lin, Chien-Chun Ni, Jiaxin Ding, Wei Han, Dengpan
Zhou, Jie Gao, Xianfeng Gu | Decentralized Trajectory Tracking Using Homology and Hodge Decomposition
in Sensor Networks | 30 pages, 10 figures, submitted to ACM TSAS | null | null | null | cs.NI cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the recent development of localization and tracking systems for both
indoor and outdoor settings, we consider the problem of sensing, representing
and analyzing human movement trajectories that we expect to gather in the near
future. In this paper, we propose to use the topological representation, which
records ... | [
{
"created": "Wed, 30 Aug 2017 05:42:18 GMT",
"version": "v1"
}
] | 2017-08-31 | [
[
"Yin",
"Xiaotian",
""
],
[
"Lin",
"Yu-Yao",
""
],
[
"Ni",
"Chien-Chun",
""
],
[
"Ding",
"Jiaxin",
""
],
[
"Han",
"Wei",
""
],
[
"Zhou",
"Dengpan",
""
],
[
"Gao",
"Jie",
""
],
[
"Gu",
"Xianfeng",... | With the recent development of localization and tracking systems for both indoor and outdoor settings, we consider the problem of sensing, representing and analyzing human movement trajectories that we expect to gather in the near future. In this paper, we propose to use the topological representation, which records ho... |
2312.08009 | Kewei Wang | Kewei Wang, Yizheng Wu, Zhiyu Pan, Xingyi Li, Ke Xian, Zhe Wang,
Zhiguo Cao, Guosheng Lin | Semi-Supervised Class-Agnostic Motion Prediction with Pseudo Label
Regeneration and BEVMix | This paper is accepted by AAAI2024 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Class-agnostic motion prediction methods aim to comprehend motion within
open-world scenarios, holding significance for autonomous driving systems.
However, training a high-performance model in a fully-supervised manner always
requires substantial amounts of manually annotated data, which can be both
expensive and ti... | [
{
"created": "Wed, 13 Dec 2023 09:32:50 GMT",
"version": "v1"
},
{
"created": "Thu, 14 Dec 2023 11:16:05 GMT",
"version": "v2"
}
] | 2023-12-15 | [
[
"Wang",
"Kewei",
""
],
[
"Wu",
"Yizheng",
""
],
[
"Pan",
"Zhiyu",
""
],
[
"Li",
"Xingyi",
""
],
[
"Xian",
"Ke",
""
],
[
"Wang",
"Zhe",
""
],
[
"Cao",
"Zhiguo",
""
],
[
"Lin",
"Guosheng",
""
... | Class-agnostic motion prediction methods aim to comprehend motion within open-world scenarios, holding significance for autonomous driving systems. However, training a high-performance model in a fully-supervised manner always requires substantial amounts of manually annotated data, which can be both expensive and time... |
1708.00606 | Zhiyong Chen | Xiao Yang, Zhiyong Chen, Kuikui Li, Yaping Sun and Hongming Zheng | Optimal Task Scheduling in Communication-Constrained Mobile Edge
Computing Systems for Wireless Virtual Reality | submitted to APCC 2017 | null | null | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile edge computing (MEC) is expected to be an effective solution to
deliver 360-degree virtual reality (VR) videos over wireless networks. In
contrast to previous computation-constrained MEC framework, which reduces the
computation-resource consumption at the mobile VR device by increasing the
communication-resour... | [
{
"created": "Wed, 2 Aug 2017 05:33:36 GMT",
"version": "v1"
}
] | 2017-08-03 | [
[
"Yang",
"Xiao",
""
],
[
"Chen",
"Zhiyong",
""
],
[
"Li",
"Kuikui",
""
],
[
"Sun",
"Yaping",
""
],
[
"Zheng",
"Hongming",
""
]
] | Mobile edge computing (MEC) is expected to be an effective solution to deliver 360-degree virtual reality (VR) videos over wireless networks. In contrast to previous computation-constrained MEC framework, which reduces the computation-resource consumption at the mobile VR device by increasing the communication-resource... |
2102.05737 | Xuan Lu | Xuan Lu, Wei Ai, Zhenpeng Chen, Yanbin Cao, Qiaozhu Mei | Emojis predict dropouts of remote workers: An empirical study of emoji
usage on GitHub | null | PLOS ONE 17(2022):1-21 | 10.1371/journal.pone.0261262 | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Emotions at work have long been identified as critical signals of work
motivations, status, and attitudes, and as predictors of various work-related
outcomes. When more and more employees work remotely, these emotional signals
of workers become harder to observe through daily, face-to-face communications.
The use o... | [
{
"created": "Wed, 10 Feb 2021 20:59:43 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Jan 2022 17:22:11 GMT",
"version": "v2"
}
] | 2022-01-28 | [
[
"Lu",
"Xuan",
""
],
[
"Ai",
"Wei",
""
],
[
"Chen",
"Zhenpeng",
""
],
[
"Cao",
"Yanbin",
""
],
[
"Mei",
"Qiaozhu",
""
]
] | Emotions at work have long been identified as critical signals of work motivations, status, and attitudes, and as predictors of various work-related outcomes. When more and more employees work remotely, these emotional signals of workers become harder to observe through daily, face-to-face communications. The use of on... |
2205.02225 | Shuliang Liu | Xuming Hu, Shuliang Liu, Chenwei Zhang, Shu`ang Li, Lijie Wen, Philip
S. Yu | HiURE: Hierarchical Exemplar Contrastive Learning for Unsupervised
Relation Extraction | In NAACL 2022 as a long paper. Code and data available at
https://github.com/THU-BPM/HiURE | Proceedings of the 2022 Conference of the North American Chapter
of the Association for Computational Linguistics | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Unsupervised relation extraction aims to extract the relationship between
entities from natural language sentences without prior information on
relational scope or distribution. Existing works either utilize self-supervised
schemes to refine relational feature signals by iteratively leveraging adaptive
clustering and... | [
{
"created": "Wed, 4 May 2022 17:56:48 GMT",
"version": "v1"
},
{
"created": "Thu, 5 May 2022 19:08:32 GMT",
"version": "v2"
},
{
"created": "Mon, 20 Feb 2023 07:59:36 GMT",
"version": "v3"
}
] | 2023-02-21 | [
[
"Hu",
"Xuming",
""
],
[
"Liu",
"Shuliang",
""
],
[
"Zhang",
"Chenwei",
""
],
[
"Li",
"Shu`ang",
""
],
[
"Wen",
"Lijie",
""
],
[
"Yu",
"Philip S.",
""
]
] | Unsupervised relation extraction aims to extract the relationship between entities from natural language sentences without prior information on relational scope or distribution. Existing works either utilize self-supervised schemes to refine relational feature signals by iteratively leveraging adaptive clustering and c... |
2107.05445 | Yipeng Zhang | Yipeng Zhang, Tyler L. Hayes, Christopher Kanan | Disentangling Transfer and Interference in Multi-Domain Learning | AAAI 2022 PracticalDL Workshop | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Humans are incredibly good at transferring knowledge from one domain to
another, enabling rapid learning of new tasks. Likewise, transfer learning has
enabled enormous success in many computer vision problems using pretraining.
However, the benefits of transfer in multi-domain learning, where a network
learns multipl... | [
{
"created": "Fri, 2 Jul 2021 01:30:36 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Jul 2021 01:14:21 GMT",
"version": "v2"
},
{
"created": "Thu, 16 Sep 2021 01:59:09 GMT",
"version": "v3"
},
{
"created": "Fri, 14 Jan 2022 22:41:18 GMT",
"version": "v4"
}
] | 2022-01-19 | [
[
"Zhang",
"Yipeng",
""
],
[
"Hayes",
"Tyler L.",
""
],
[
"Kanan",
"Christopher",
""
]
] | Humans are incredibly good at transferring knowledge from one domain to another, enabling rapid learning of new tasks. Likewise, transfer learning has enabled enormous success in many computer vision problems using pretraining. However, the benefits of transfer in multi-domain learning, where a network learns multiple ... |
1907.00103 | Matthew Streeter | Matthew Streeter | Learning Effective Loss Functions Efficiently | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of learning a loss function which, when minimized
over a training dataset, yields a model that approximately minimizes a
validation error metric. Though learning an optimal loss function is NP-hard,
we present an anytime algorithm that is asymptotically optimal in the worst
case, and is provab... | [
{
"created": "Fri, 28 Jun 2019 22:35:17 GMT",
"version": "v1"
}
] | 2019-07-02 | [
[
"Streeter",
"Matthew",
""
]
] | We consider the problem of learning a loss function which, when minimized over a training dataset, yields a model that approximately minimizes a validation error metric. Though learning an optimal loss function is NP-hard, we present an anytime algorithm that is asymptotically optimal in the worst case, and is provably... |
2102.07974 | Thiparat Chotibut | Jakub Bielawski, Thiparat Chotibut, Fryderyk Falniowski, Grzegorz
Kosiorowski, Micha{\l} Misiurewicz, Georgios Piliouras | Follow-the-Regularized-Leader Routes to Chaos in Routing Games | 30 pages, 8 figures | Proceedings of the 38th International Conference on Machine
Learning, PMLR 139:925-935, 2021 | null | null | cs.GT cs.LG math.DS nlin.CD physics.soc-ph | http://creativecommons.org/licenses/by/4.0/ | We study the emergence of chaotic behavior of Follow-the-Regularized Leader
(FoReL) dynamics in games. We focus on the effects of increasing the population
size or the scale of costs in congestion games, and generalize recent results
on unstable, chaotic behaviors in the Multiplicative Weights Update dynamics to
a mu... | [
{
"created": "Tue, 16 Feb 2021 06:40:31 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Feb 2021 05:38:45 GMT",
"version": "v2"
}
] | 2022-01-28 | [
[
"Bielawski",
"Jakub",
""
],
[
"Chotibut",
"Thiparat",
""
],
[
"Falniowski",
"Fryderyk",
""
],
[
"Kosiorowski",
"Grzegorz",
""
],
[
"Misiurewicz",
"Michał",
""
],
[
"Piliouras",
"Georgios",
""
]
] | We study the emergence of chaotic behavior of Follow-the-Regularized Leader (FoReL) dynamics in games. We focus on the effects of increasing the population size or the scale of costs in congestion games, and generalize recent results on unstable, chaotic behaviors in the Multiplicative Weights Update dynamics to a much... |
2002.09699 | Rongfei Zeng | Rongfei Zeng, Shixun Zhang, Jiaqi Wang and Xiaowen Chu | FMore: An Incentive Scheme of Multi-dimensional Auction for Federated
Learning in MEC | null | null | 10.1109/ICDCS47774.2020.00094 | null | cs.LG cs.GT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Promising federated learning coupled with Mobile Edge Computing (MEC) is
considered as one of the most promising solutions to the AI-driven service
provision. Plenty of studies focus on federated learning from the performance
and security aspects, but they neglect the incentive mechanism. In MEC, edge
nodes would not... | [
{
"created": "Sat, 22 Feb 2020 13:43:36 GMT",
"version": "v1"
}
] | 2021-06-29 | [
[
"Zeng",
"Rongfei",
""
],
[
"Zhang",
"Shixun",
""
],
[
"Wang",
"Jiaqi",
""
],
[
"Chu",
"Xiaowen",
""
]
] | Promising federated learning coupled with Mobile Edge Computing (MEC) is considered as one of the most promising solutions to the AI-driven service provision. Plenty of studies focus on federated learning from the performance and security aspects, but they neglect the incentive mechanism. In MEC, edge nodes would not l... |
2405.07006 | Yu-Ying Chuang | Yu-Ying Chuang and Melanie J. Bell and Yu-Hsiang Tseng and R. Harald
Baayen | Word-specific tonal realizations in Mandarin | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | The pitch contours of Mandarin two-character words are generally understood
as being shaped by the underlying tones of the constituent single-character
words, in interaction with articulatory constraints imposed by factors such as
speech rate, co-articulation with adjacent tones, segmental make-up, and
predictability... | [
{
"created": "Sat, 11 May 2024 13:00:35 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"Chuang",
"Yu-Ying",
""
],
[
"Bell",
"Melanie J.",
""
],
[
"Tseng",
"Yu-Hsiang",
""
],
[
"Baayen",
"R. Harald",
""
]
] | The pitch contours of Mandarin two-character words are generally understood as being shaped by the underlying tones of the constituent single-character words, in interaction with articulatory constraints imposed by factors such as speech rate, co-articulation with adjacent tones, segmental make-up, and predictability. ... |
cs/0602089 | Pascal Vontobel | Roxana Smarandache and Pascal O. Vontobel | Pseudo-Codeword Analysis of Tanner Graphs from Projective and Euclidean
Planes | Submitted to IEEE Transactions on Information Theory, February 25,
2006 | null | null | null | cs.IT cs.DM math.IT | null | In order to understand the performance of a code under maximum-likelihood
(ML) decoding, one studies the codewords, in particular the minimal codewords,
and their Hamming weights. In the context of linear programming (LP) decoding,
one's attention needs to be shifted to the pseudo-codewords, in particular to
the mini... | [
{
"created": "Sun, 26 Feb 2006 01:33:01 GMT",
"version": "v1"
}
] | 2007-07-13 | [
[
"Smarandache",
"Roxana",
""
],
[
"Vontobel",
"Pascal O.",
""
]
] | In order to understand the performance of a code under maximum-likelihood (ML) decoding, one studies the codewords, in particular the minimal codewords, and their Hamming weights. In the context of linear programming (LP) decoding, one's attention needs to be shifted to the pseudo-codewords, in particular to the minima... |
2301.08518 | Haksoo Lim | Haksoo Lim, Minjung Kim, Sewon Park, Noseong Park | Regular Time-series Generation using SGM | 9 pages, appendix 3 pages, under review | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Score-based generative models (SGMs) are generative models that are in the
spotlight these days. Time-series frequently occurs in our daily life, e.g.,
stock data, climate data, and so on. Especially, time-series forecasting and
classification are popular research topics in the field of machine learning.
SGMs are als... | [
{
"created": "Fri, 20 Jan 2023 11:34:12 GMT",
"version": "v1"
}
] | 2023-01-23 | [
[
"Lim",
"Haksoo",
""
],
[
"Kim",
"Minjung",
""
],
[
"Park",
"Sewon",
""
],
[
"Park",
"Noseong",
""
]
] | Score-based generative models (SGMs) are generative models that are in the spotlight these days. Time-series frequently occurs in our daily life, e.g., stock data, climate data, and so on. Especially, time-series forecasting and classification are popular research topics in the field of machine learning. SGMs are also ... |
1011.3717 | Romain Couillet | Romain Couillet, Jakob Hoydis, and Merouane Debbah | Random Beamforming over Quasi-Static and Fading Channels: A
Deterministic Equivalent Approach | to appear in IEEE Transactions on Information Theory, 2012 | null | 10.1109/TIT.2012.2201913 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we study the performance of random isometric precoders over
quasi-static and correlated fading channels. We derive deterministic
approximations of the mutual information and the
signal-to-interference-plus-noise ratio (SINR) at the output of the
minimum-mean-square-error (MMSE) receiver and provide simp... | [
{
"created": "Tue, 16 Nov 2010 14:59:24 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Nov 2011 18:37:23 GMT",
"version": "v2"
},
{
"created": "Fri, 11 May 2012 09:22:25 GMT",
"version": "v3"
}
] | 2016-11-18 | [
[
"Couillet",
"Romain",
""
],
[
"Hoydis",
"Jakob",
""
],
[
"Debbah",
"Merouane",
""
]
] | In this work, we study the performance of random isometric precoders over quasi-static and correlated fading channels. We derive deterministic approximations of the mutual information and the signal-to-interference-plus-noise ratio (SINR) at the output of the minimum-mean-square-error (MMSE) receiver and provide simple... |
2109.00653 | Billy Jin | Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson | Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm
Flows | arXiv admin note: text overlap with arXiv:2010.16316 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of finding flows in undirected graphs so as to minimize
the weighted $p$-norm of the flow for any $p > 1$. When $p=2$, the problem is
that of finding an electrical flow, and its dual is equivalent to solving a
Laplacian linear system. The case $p = \infty$ corresponds to finding a
min-congestion ... | [
{
"created": "Thu, 2 Sep 2021 00:17:20 GMT",
"version": "v1"
}
] | 2021-09-06 | [
[
"Henzinger",
"Monika",
""
],
[
"Jin",
"Billy",
""
],
[
"Peng",
"Richard",
""
],
[
"Williamson",
"David P.",
""
]
] | We study the problem of finding flows in undirected graphs so as to minimize the weighted $p$-norm of the flow for any $p > 1$. When $p=2$, the problem is that of finding an electrical flow, and its dual is equivalent to solving a Laplacian linear system. The case $p = \infty$ corresponds to finding a min-congestion fl... |
2203.10256 | Zhixian Yang | Zhixian Yang, Xiaojun Wan | Dependency-based Mixture Language Models | Accepted to ACL 2022 Main Conference | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Various models have been proposed to incorporate knowledge of syntactic
structures into neural language models. However, previous works have relied
heavily on elaborate components for a specific language model, usually
recurrent neural network (RNN), which makes themselves unwieldy in practice to
fit into other neura... | [
{
"created": "Sat, 19 Mar 2022 06:28:30 GMT",
"version": "v1"
}
] | 2022-03-22 | [
[
"Yang",
"Zhixian",
""
],
[
"Wan",
"Xiaojun",
""
]
] | Various models have been proposed to incorporate knowledge of syntactic structures into neural language models. However, previous works have relied heavily on elaborate components for a specific language model, usually recurrent neural network (RNN), which makes themselves unwieldy in practice to fit into other neural ... |
1305.4163 | Dmitry Namiot | Dmitry Namiot, Manfred Sneps-Sneppe | Local Messages for Smartphones | 6 pages. Submitted to CFIC Coimbra 2013 The Conference on Future
Internet Communications | null | null | null | cs.NI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes a new model for local messaging based on the network
proximity. We present a novelty mobile mashup which combines Wi-Fi proximity
measurements with Cloud Messaging. Our mobile mashup combines passive
monitoring for smart phones and cloud based messaging for mobile operational
systems. Passive mon... | [
{
"created": "Fri, 17 May 2013 19:23:47 GMT",
"version": "v1"
}
] | 2013-05-20 | [
[
"Namiot",
"Dmitry",
""
],
[
"Sneps-Sneppe",
"Manfred",
""
]
] | This paper describes a new model for local messaging based on the network proximity. We present a novelty mobile mashup which combines Wi-Fi proximity measurements with Cloud Messaging. Our mobile mashup combines passive monitoring for smart phones and cloud based messaging for mobile operational systems. Passive monit... |
2312.08378 | Houcheng Su | Houcheng Su, Daixian Liu, Mengzhu Wang, Wei Wang | Singular Value Penalization and Semantic Data Augmentation for Fully
Test-Time Adaptation | 10 pages, 5 figures,aaai2024(score:5422) | null | null | null | cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | Fully test-time adaptation (FTTA) adapts a model that is trained on a source
domain to a target domain during the testing phase, where the two domains
follow different distributions and source data is unavailable during the
training phase. Existing methods usually adopt entropy minimization to reduce
the uncertainty ... | [
{
"created": "Sun, 10 Dec 2023 01:08:56 GMT",
"version": "v1"
}
] | 2023-12-15 | [
[
"Su",
"Houcheng",
""
],
[
"Liu",
"Daixian",
""
],
[
"Wang",
"Mengzhu",
""
],
[
"Wang",
"Wei",
""
]
] | Fully test-time adaptation (FTTA) adapts a model that is trained on a source domain to a target domain during the testing phase, where the two domains follow different distributions and source data is unavailable during the training phase. Existing methods usually adopt entropy minimization to reduce the uncertainty of... |
2003.12590 | Martin Grohe | Martin Grohe | word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector
Embeddings of Structured Data | null | null | null | null | cs.LG cs.DB cs.DM stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vector representations of graphs and relational structures, whether
hand-crafted feature vectors or learned representations, enable us to apply
standard data analysis and machine learning techniques to the structures. A
wide range of methods for generating such embeddings have been studied in the
machine learning and... | [
{
"created": "Fri, 27 Mar 2020 18:23:55 GMT",
"version": "v1"
}
] | 2020-03-31 | [
[
"Grohe",
"Martin",
""
]
] | Vector representations of graphs and relational structures, whether hand-crafted feature vectors or learned representations, enable us to apply standard data analysis and machine learning techniques to the structures. A wide range of methods for generating such embeddings have been studied in the machine learning and k... |
2407.11998 | Pei Chen | Pei Chen, Heng Wang, Sainan Sun, Zhiyuan Chen, Zhenkun Liu, Shuhua
Cao, Li Yang, Minghui Yang | Custom Cloth Creation and Virtual Try-on for Everyone | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This demo showcases a simple tool that utilizes AIGC technology, enabling
both professional designers and regular users to easily customize clothing for
their digital avatars. Customization options include changing clothing colors,
textures, logos, and patterns. Compared with traditional 3D modeling processes,
our ap... | [
{
"created": "Fri, 14 Jun 2024 03:19:03 GMT",
"version": "v1"
}
] | 2024-07-18 | [
[
"Chen",
"Pei",
""
],
[
"Wang",
"Heng",
""
],
[
"Sun",
"Sainan",
""
],
[
"Chen",
"Zhiyuan",
""
],
[
"Liu",
"Zhenkun",
""
],
[
"Cao",
"Shuhua",
""
],
[
"Yang",
"Li",
""
],
[
"Yang",
"Minghui",
... | This demo showcases a simple tool that utilizes AIGC technology, enabling both professional designers and regular users to easily customize clothing for their digital avatars. Customization options include changing clothing colors, textures, logos, and patterns. Compared with traditional 3D modeling processes, our appr... |
2112.03003 | Shakshi Sharma | Sabur Butt, Shakshi Sharma, Rajesh Sharma, Grigori Sidorov, Alexander
Gelbukh | What goes on inside rumour and non-rumour tweets and their reactions: A
Psycholinguistic Analyses | 10 pages | null | null | null | cs.CL cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, the problem of rumours on online social media (OSM) has
attracted lots of attention. Researchers have started investigating from two
main directions. First is the descriptive analysis of rumours and secondly,
proposing techniques to detect (or classify) rumours. In the descriptive line
of works, wher... | [
{
"created": "Tue, 9 Nov 2021 07:45:11 GMT",
"version": "v1"
}
] | 2021-12-07 | [
[
"Butt",
"Sabur",
""
],
[
"Sharma",
"Shakshi",
""
],
[
"Sharma",
"Rajesh",
""
],
[
"Sidorov",
"Grigori",
""
],
[
"Gelbukh",
"Alexander",
""
]
] | In recent years, the problem of rumours on online social media (OSM) has attracted lots of attention. Researchers have started investigating from two main directions. First is the descriptive analysis of rumours and secondly, proposing techniques to detect (or classify) rumours. In the descriptive line of works, where ... |
2108.01374 | Hsiao-Tzu Hung | Hsiao-Tzu Hung and Joann Ching and Seungheon Doh and Nabin Kim and
Juhan Nam and Yi-Hsuan Yang | EMOPIA: A Multi-Modal Pop Piano Dataset For Emotion Recognition and
Emotion-based Music Generation | The paper has been accepted for publication at ISMIR 2021 | null | null | null | cs.SD cs.MM eess.AS | http://creativecommons.org/licenses/by/4.0/ | While there are many music datasets with emotion labels in the literature,
they cannot be used for research on symbolic-domain music analysis or
generation, as there are usually audio files only. In this paper, we present
the EMOPIA (pronounced `yee-m\`{o}-pi-uh') dataset, a shared multi-modal (audio
and MIDI) databa... | [
{
"created": "Tue, 3 Aug 2021 08:59:26 GMT",
"version": "v1"
}
] | 2021-08-04 | [
[
"Hung",
"Hsiao-Tzu",
""
],
[
"Ching",
"Joann",
""
],
[
"Doh",
"Seungheon",
""
],
[
"Kim",
"Nabin",
""
],
[
"Nam",
"Juhan",
""
],
[
"Yang",
"Yi-Hsuan",
""
]
] | While there are many music datasets with emotion labels in the literature, they cannot be used for research on symbolic-domain music analysis or generation, as there are usually audio files only. In this paper, we present the EMOPIA (pronounced `yee-m\`{o}-pi-uh') dataset, a shared multi-modal (audio and MIDI) database... |
1608.03990 | Anand Pratap Singh | Anand Pratap Singh and Shivaji Medida and Karthik Duraisamy | Machine Learning-augmented Predictive Modeling of Turbulent Separated
Flows over Airfoils | null | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A modeling paradigm is developed to augment predictive models of turbulence
by effectively utilizing limited data generated from physical experiments. The
key components of our approach involve inverse modeling to infer the spatial
distribution of model discrepancies, and, machine learning to reconstruct
discrepancy ... | [
{
"created": "Sat, 13 Aug 2016 15:07:50 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Aug 2016 13:56:32 GMT",
"version": "v2"
},
{
"created": "Sun, 6 Nov 2016 23:42:22 GMT",
"version": "v3"
}
] | 2016-11-08 | [
[
"Singh",
"Anand Pratap",
""
],
[
"Medida",
"Shivaji",
""
],
[
"Duraisamy",
"Karthik",
""
]
] | A modeling paradigm is developed to augment predictive models of turbulence by effectively utilizing limited data generated from physical experiments. The key components of our approach involve inverse modeling to infer the spatial distribution of model discrepancies, and, machine learning to reconstruct discrepancy in... |
1004.4944 | Stefano Rini | Stefano Rini, Daniela Tuninetti, and Natasha Devroye | Outer Bounds for the Interference Channel with a Cognitive Relay | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we first present an outer bound for a general interference
channel with a cognitive relay, i.e., a relay that has non-causal knowledge of
both independent messages transmitted in the interference channel. This outer
bound reduces to the capacity region of the deterministic broadcast channel and
of the ... | [
{
"created": "Wed, 28 Apr 2010 02:53:34 GMT",
"version": "v1"
},
{
"created": "Tue, 18 May 2010 19:35:04 GMT",
"version": "v2"
}
] | 2015-03-17 | [
[
"Rini",
"Stefano",
""
],
[
"Tuninetti",
"Daniela",
""
],
[
"Devroye",
"Natasha",
""
]
] | In this paper, we first present an outer bound for a general interference channel with a cognitive relay, i.e., a relay that has non-causal knowledge of both independent messages transmitted in the interference channel. This outer bound reduces to the capacity region of the deterministic broadcast channel and of the de... |
1807.02420 | Yuexiang Li | Yuexiang Li, Xinpeng Xie, Linlin Shen and Shaoxiong Liu | Reversed Active Learning based Atrous DenseNet for Pathological Image
Classification | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Witnessed the development of deep learning in recent years, increasing number
of researches try to adopt deep learning model for medical image analysis.
However, the usage of deep learning networks for the pathological image
analysis encounters several challenges, e.g. high resolution (gigapixel) of
pathological imag... | [
{
"created": "Fri, 6 Jul 2018 13:57:48 GMT",
"version": "v1"
}
] | 2018-07-09 | [
[
"Li",
"Yuexiang",
""
],
[
"Xie",
"Xinpeng",
""
],
[
"Shen",
"Linlin",
""
],
[
"Liu",
"Shaoxiong",
""
]
] | Witnessed the development of deep learning in recent years, increasing number of researches try to adopt deep learning model for medical image analysis. However, the usage of deep learning networks for the pathological image analysis encounters several challenges, e.g. high resolution (gigapixel) of pathological images... |
2005.09057 | Kevin Moran P | Carlos Bernal-C\'ardenas, Nathan Cooper, Kevin Moran, Oscar Chaparro,
Andrian Marcus and Denys Poshyvanyk | Translating Video Recordings of Mobile App Usages into Replayable
Scenarios | In proceedings of the 42nd International Conference on Software
Engineering (ICSE'20), 13 pages | null | 10.1145/3377811.3380328 | null | cs.SE cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Screen recordings of mobile applications are easy to obtain and capture a
wealth of information pertinent to software developers (e.g., bugs or feature
requests), making them a popular mechanism for crowdsourced app feedback. Thus,
these videos are becoming a common artifact that developers must manage. In
light of u... | [
{
"created": "Mon, 18 May 2020 20:11:36 GMT",
"version": "v1"
}
] | 2020-05-20 | [
[
"Bernal-Cárdenas",
"Carlos",
""
],
[
"Cooper",
"Nathan",
""
],
[
"Moran",
"Kevin",
""
],
[
"Chaparro",
"Oscar",
""
],
[
"Marcus",
"Andrian",
""
],
[
"Poshyvanyk",
"Denys",
""
]
] | Screen recordings of mobile applications are easy to obtain and capture a wealth of information pertinent to software developers (e.g., bugs or feature requests), making them a popular mechanism for crowdsourced app feedback. Thus, these videos are becoming a common artifact that developers must manage. In light of uni... |
1706.07363 | Mary Ann Weitnauer | Mary Ann Weitnauer, Jennifer Rexford, Nicholas Laneman, Matthieu
Bloch, Santiago Griljava, Catherine Ross, and Gee-Kung Chang | Smart Wireless Communication is the Cornerstone of Smart Infrastructures | A Computing Community Consortium (CCC) white paper, 5 pages | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Emerging smart infrastructures, such as Smart City, Smart Grid, Smart Health,
and Smart Transportation, need smart wireless connectivity. However, the
requirements of these smart infrastructures cannot be met with today's wireless
networks. A new wireless infrastructure is needed to meet unprecedented needs
in terms ... | [
{
"created": "Thu, 22 Jun 2017 15:19:16 GMT",
"version": "v1"
}
] | 2017-06-23 | [
[
"Weitnauer",
"Mary Ann",
""
],
[
"Rexford",
"Jennifer",
""
],
[
"Laneman",
"Nicholas",
""
],
[
"Bloch",
"Matthieu",
""
],
[
"Griljava",
"Santiago",
""
],
[
"Ross",
"Catherine",
""
],
[
"Chang",
"Gee-Kung",
... | Emerging smart infrastructures, such as Smart City, Smart Grid, Smart Health, and Smart Transportation, need smart wireless connectivity. However, the requirements of these smart infrastructures cannot be met with today's wireless networks. A new wireless infrastructure is needed to meet unprecedented needs in terms of... |
2209.00296 | Jianchuan Ding | Jianchuan Ding, Lingping Gao, Wenxi Liu, Haiyin Piao, Jia Pan, Zhenjun
Du, Xin Yang, Baocai Yin | Monocular Camera-based Complex Obstacle Avoidance via Efficient Deep
Reinforcement Learning | arXiv admin note: substantial text overlap with arXiv:2108.06887 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep reinforcement learning has achieved great success in laser-based
collision avoidance works because the laser can sense accurate depth
information without too much redundant data, which can maintain the robustness
of the algorithm when it is migrated from the simulation environment to the
real world. However, hig... | [
{
"created": "Thu, 1 Sep 2022 08:58:40 GMT",
"version": "v1"
}
] | 2022-09-02 | [
[
"Ding",
"Jianchuan",
""
],
[
"Gao",
"Lingping",
""
],
[
"Liu",
"Wenxi",
""
],
[
"Piao",
"Haiyin",
""
],
[
"Pan",
"Jia",
""
],
[
"Du",
"Zhenjun",
""
],
[
"Yang",
"Xin",
""
],
[
"Yin",
"Baocai",
... | Deep reinforcement learning has achieved great success in laser-based collision avoidance works because the laser can sense accurate depth information without too much redundant data, which can maintain the robustness of the algorithm when it is migrated from the simulation environment to the real world. However, high-... |
1504.03182 | Amaro Barreal | Amaro Barreal, Joonas P\"a\"akk\"onen, David Karpuk, Camilla Hollanti,
Olav Tirkkonen | A Low-Complexity Message Recovery Method for Compute-and-Forward
Relaying | 5 figures, 5 pages, submitted | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Compute-and-Forward relaying strategy achieves high computation rates by
decoding linear combinations of transmitted messages at intermediate relays.
However, if the involved relays independently choose which combinations of the
messages to decode, there is no guarantee that the overall system of linear
equations... | [
{
"created": "Mon, 13 Apr 2015 13:48:59 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Apr 2015 06:29:41 GMT",
"version": "v2"
}
] | 2015-04-21 | [
[
"Barreal",
"Amaro",
""
],
[
"Pääkkönen",
"Joonas",
""
],
[
"Karpuk",
"David",
""
],
[
"Hollanti",
"Camilla",
""
],
[
"Tirkkonen",
"Olav",
""
]
] | The Compute-and-Forward relaying strategy achieves high computation rates by decoding linear combinations of transmitted messages at intermediate relays. However, if the involved relays independently choose which combinations of the messages to decode, there is no guarantee that the overall system of linear equations i... |
2407.11837 | Hongwei Li | Hongwei Li, Zoran Radivojevic, and Michael S. Eggleston | The Patchkeeper: An Integrated Wearable Electronic Stethoscope with
Multiple Sensors | Submitted for IEEE Sensors Conference 2024 | null | null | null | cs.HC eess.SP | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Many parts of human body generate internal sound during biological processes,
which are rich sources of information for understanding health and wellbeing.
Despite a long history of development and usage of stethoscopes, there is still
a lack of proper tools for recording internal body sound together with
complementa... | [
{
"created": "Tue, 16 Jul 2024 15:22:10 GMT",
"version": "v1"
}
] | 2024-07-17 | [
[
"Li",
"Hongwei",
""
],
[
"Radivojevic",
"Zoran",
""
],
[
"Eggleston",
"Michael S.",
""
]
] | Many parts of human body generate internal sound during biological processes, which are rich sources of information for understanding health and wellbeing. Despite a long history of development and usage of stethoscopes, there is still a lack of proper tools for recording internal body sound together with complementary... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.