Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2024
Distance queries over dynamic interval graphs
Computational Geometry: Theory and Applications (COGE), Volume 122, Issue COct 2024https://doi.org/10.1016/j.comgeo.2024.102103AbstractWe design the first dynamic distance oracles for interval graphs, which are intersection graphs of a set of intervals on the real line, and for proper interval graphs, which are intersection graphs of a set of intervals in which no interval is ...
Highlights
- Fully dynamic proper interval graph with O ( log n ) time operations.
- Incremental and decremental interval graph with O ( log n ) amortized time operations.
- Fully dynamic interval graph with O ( n log n ) time operations.
- ArticleMarch 2024
- ArticleDecember 2023
- research-articleFebruary 2024
LAL-JER: Label-Aware Learning for Adaptive Joint Entity and Relation Extraction with LLM data augmentation
CNML '23: Proceedings of the 2023 International Conference on Communication Network and Machine LearningOctober 2023, Pages 414–419https://doi.org/10.1145/3640912.3640993Joint entity and relation extraction has achieved great improvements in Natural Language Processing (NLP) and has been widely applied, such as constructing knowledge graph, query understanding and question answering. Existing methods usually spend long ...
-
- research-articleOctober 2023
Structural vibration control based on the effect of acoustic black holes and piezoelectric actuators
Finite Elements in Analysis and Design (FEAD), Volume 224, Issue COct 2023https://doi.org/10.1016/j.finel.2023.103992AbstractThis paper investigates the performance of an integrated control system based on the acoustic black hole effect and piezoelectric actuators for structural vibration suppression in beams. The acoustic black hole is a technique for passive ...
Highlights- Vibration analysis of a control system with acoustic black hole-type structures.
- Finite element-based approach for structures equipped with acoustic black holes.
- Control systems with acoustic black holes and piezoelectric ...
- ArticleSeptember 2023
Dynamic Compact Planar Embeddings
String Processing and Information RetrievalSep 2023, Pages 233–245https://doi.org/10.1007/978-3-031-43980-3_18AbstractThis paper presents a way to compactly represent dynamic connected planar embeddings, which may contain self loops and multi-edges, in bits, to support basic navigation in time and edge and vertex insertion and deletion in time, where n and m ...
- research-articleAugust 2023
Knowledge Graph Embedding Method Based on Entity Metric Learning
ICCAI '23: Proceedings of the 2023 9th International Conference on Computing and Artificial IntelligenceMarch 2023, Pages 381–387https://doi.org/10.1145/3594315.3594345A knowledge graph is a knowledge base of graph structure that stores massive facts and their relations in the form of triplets. Embedding entities and relations in knowledge graph into low-dimensional continuous vector space is of great significance for ...
- research-articleNovember 2022
Data structures for categorical path counting queries
Theoretical Computer Science (TCSC), Volume 938, Issue CNov 2022, Pages 97–111https://doi.org/10.1016/j.tcs.2022.10.011AbstractConsider an ordinal tree T on n nodes, each of which is assigned a category from an alphabet [ σ ] = { 1 , 2 , … , σ }. We preprocess the tree T in order to support categorical path counting queries, which ask for the number of ...
- ArticleNovember 2022
Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries
String Processing and Information RetrievalNov 2022, Pages 217–232https://doi.org/10.1007/978-3-031-20643-6_16AbstractWe define a generalization of the prefix sum problem in which the vector can be masked by segments of a second (Boolean) vector. This problem is shown to be related to several other prefix sum, set intersection and approximate string match ...
- research-articleJune 2022
Universal Performance Bounds for Joint Self-Interference Cancellation and Data Detection in Full-Duplex Communications
IEEE Transactions on Wireless Communications (TWC), Volume 21, Issue 6June 2022, Pages 3792–3803https://doi.org/10.1109/TWC.2021.3124018This paper studies the joint digital self-interference (SI) cancellation and data detection in an orthogonal-frequency-division-multiplexing (OFDM) full-duplex (FD) system, considering the effect of phase noise introduced by the oscillators at both the ...
- research-articleJanuary 2022
Construction of Dynamic Balance Model of Supply and Demand in Labor Market under Flexible Employment
The dynamic balance of supply and demand in the labor market is a key issue at present. The change of employment quality is relatively complex. The current dynamic balance model of supply and demand cannot obtain high-precision evaluation results of ...
- ArticleAugust 2021
Correction to: Algorithms and Data Structures
The original version of this book was revised. The originally published omitted one volume editor of the book. This has now been corrected.
- research-articleJuly 2020
- research-articleDecember 2019
Self-Interference Cancellation and Data Detection for Full-Duplex Communications
2019 IEEE Global Communications Conference (GLOBECOM)Pages 1–6https://doi.org/10.1109/GLOBECOM38437.2019.9013150This paper studies the joint digital self- interference (SI) cancellation and data detection in an orthogonal-frequency-division-multiplexing (OFDM) full-duplex (FD) system, consisting the effects of phase noise. In particular, a two-stage scheme is ...
- research-articleMay 2019
Path queries on functions
Theoretical Computer Science (TCSC), Volume 770, Issue CMay 2019, Pages 34–50https://doi.org/10.1016/j.tcs.2018.10.021AbstractLet f : [ 1 . . n ] → [ 1 . . n ] be a function, and ℓ : [ 1 . . n ] → [ 1 . . σ ] indicate a label assigned to each element of the domain. We design several compact data structures that answer various kinds of summary queries on the ...
- articleDecember 2018
Dynamic Path Queries in Linear Space
Algorithmica (ALGR), Volume 80, Issue 12Dec 2018, Pages 3728–3765In the path reporting problem, we preprocess a tree on n nodes each of which is assigned a weight, such that given an arbitrary path and a weight range, we can report the nodes whose weights are within the range. We consider this problem in dynamic ...