Kewen Liao

Haifeng Shen

Ming Jian Tang

CoRR, 2024

Efficient Constrained K-center Clustering with Background Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Densest Multipartite Subgraph Search in Heterogeneous Information Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., December, 2023

A Metadata-Assisted Cascading Ensemble Classification Framework for Automatic Annotation of Open IoT Data.

[BibT_eX]

[DOI]

Federico Montori

Matteo De Giosa

Luciano Bononi

Timos Sellis

IEEE Internet Things J., August, 2023

Submodular maximization over data streams with differential privacy noise.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Fed-SC: One-Shot Federated Subspace Clustering over High-Dimensional Data.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Demo: SenShaMart - A Sensor Sharing Marketplace for IoT.

[BibT_eX]

[DOI]

Anas Dawod

Josip Karabotic Milovac

Panos K. Chrysanthis

Proceedings of the 43rd IEEE International Conference on Distributed Computing Systems, 2023

2022

CNN Attention Guidance for Improved Orthopedics Radiographic Fracture Classification.

[BibT_eX]

[DOI]

Zhibin Liao

Abdur Rahim Mohammad Forkan

Haifeng Shen

Marouska F. van Boxel

IEEE J. Biomed. Health Informatics, 2022

CorrDetector: A framework for structural corrosion detection from drone images using ensemble deep learning.

[BibT_eX]

[DOI]

Yong-Bin Kang

Expert Syst. Appl., 2022

Efficient approximation algorithms for offline and online unit disk multiple coverage.

[BibT_eX]

[DOI]

Xuening Gao

Comput. Electr. Eng., 2022

Fast Approximation Algorithms for Multiple Coverage with Unit Disks.

[BibT_eX]

[DOI]

Xuening Gao

Peerumporn Jiranantanagorn

Proceedings of the 23rd IEEE International Symposium on a World of Wireless, 2022

A Multi-output Integration Residual Network for Predicting Time Series Data with Diverse Scales.

[BibT_eX]

[DOI]

Proceedings of the PRICAI 2022: Trends in Artificial Intelligence, 2022

Do Simpler Statistical Methods Perform Better in Multivariate Long Sequence Time-Series Forecasting?

[BibT_eX]

[DOI]

Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

2021

On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Understanding the effects of real-time sentiment analysis and morale visualisation in backchannel systems: A case study.

[BibT_eX]

[DOI]

Theodor Wyeld

Haifeng Shen

Tomasz Bednarz

Int. J. Hum. Comput. Stud., 2021

INFORM: A Tool for Classification and Semantic Annotation of IoT Datastreams.

[BibT_eX]

[DOI]

Matteo De Giosa

Arkady B. Zaslavsky

Proceedings of the 7th IEEE World Forum on Internet of Things, 2021

Streaming Submodular Maximization Under Differential Privacy Noise.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2021

Human-AI Interactive and Continuous Sensemaking: A Case Study of Image Classification using Scribble Attention Maps.

[BibT_eX]

[DOI]

Proceedings of the CHI '21: CHI Conference on Human Factors in Computing Systems, 2021

2020

Temporal betweenness centrality in dynamic graphs.

[BibT_eX]

[DOI]

Int. J. Data Sci. Anal., 2020

Inferring Location Types With Geo-Social-Temporal Pattern Mining.

[BibT_eX]

[DOI]

IEEE Access, 2020

LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2020

A Service Computing Framework for Proteomics Analysis and Collaboration of Pathogenic Mechanism Studies.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Services Computing, 2020

Maximizing Reliability of Data-Intensive Workflow Systems with Active Fault Tolerance Schemes in Cloud.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE International Conference on Cloud Computing, 2020

2019

On effective and efficient graph edge labeling.

[BibT_eX]

[DOI]

Distributed Parallel Databases, 2019

Contextual Community Search Over Large Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Fast Anomaly Detection in Multiple Multi-Dimensional Data Streams.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

2018

Efficient Algorithms for Flexible Sweep Coverage in Crowdsensing.

[BibT_eX]

[DOI]

IEEE Access, 2018

Classification and Annotation of Open Internet of Things Datastreams.

[BibT_eX]

[DOI]

Federico Montori

Luciano Bononi

Timos Sellis

Proceedings of the Web Information Systems Engineering - WISE 2018, 2018

A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

DistClusTree: A Framework for Distributed Stream Clustering.

[BibT_eX]

[DOI]

Zhinoos Razavi Hesabi

Timos Sellis

Proceedings of the Databases Theory and Applications, 2018

2017

A Cost Model for Long-Term Compressed Data Retention.

[BibT_eX]

[DOI]

Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

Edge Labeling Schemes for Graph Data.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Scientific and Statistical Database Management, 2017

2016

Effective Construction of Relative Lempel-Ziv Dictionaries.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on World Wide Web, 2016

2015

Improved approximation algorithms for constrained fault-tolerant resource allocation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Improved approximation algorithms for computing k disjoint paths subject to two constraints.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Efficient Approximation Algorithms for Computing \emph{k} Disjoint Restricted Shortest Paths.

[BibT_eX]

[DOI]

CoRR, 2015

Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014

LP-Based Approximation Algorithms for Reliable Resource Allocation.

[BibT_eX]

[DOI]

Comput. J., 2014

On the Shallow-Light Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Parallel and Distributed Computing, 2014

2013

Improved Approximation Algorithms for Constrained Fault-Tolerant Resource Allocation - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Improved Approximation Algorithms for Computing <i>k</i> Disjoint Paths Subject to Two Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Improved Approximations for Shallow-Light Spanning and Steiner Trees

[BibT_eX]

[DOI]

CoRR, 2012

Constrained Fault-Tolerant Resource Allocation

[BibT_eX]

[DOI]

CoRR, 2012

WS-Finder: A Framework for Similarity Search of Web Services.

[BibT_eX]

[DOI]

Proceedings of the Service-Oriented Computing - 10th International Conference, 2012

Approximating the Reliable Resource Allocation Problem Using Inverse Dual Fitting.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011

Fast Fault-Tolerant Resource Allocation.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Parallel and Distributed Computing, 2011

Unconstrained and Constrained Fault-Tolerant Resource Allocation.

[BibT_eX]

[DOI]