Search Results for author: Kian-Lee Tan

Found 10 papers, 5 papers with code

Enhancing Balanced Graph Edge Partition with Effective Local Search

no code implementations17 Dec 2020 Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan

The graph edge partition problem, which is to split the edge set into multiple balanced parts to minimize the total number of copied vertices, has been widely studied from the view of optimization and algorithms.

Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version)

1 code implementation28 Jul 2020 Jingjing Wang, Yanhao Wang, Wenjun Jiang, Yuchen Li, Kian-Lee Tan

We first propose a generic edge sampling (ES) algorithm for estimating the number of instances of any temporal motif.

GRMR: Generalized Regret-Minimizing Representatives

no code implementations19 Jul 2020 Yanhao Wang, Michael Mathioudakis, Yuchen Li, Kian-Lee Tan

Extracting a small subset of representative tuples from a large database is an important task in multi-criteria decision making.

Data Structures and Algorithms Databases

A Fully Dynamic Algorithm for k-Regret Minimizing Sets

1 code implementation29 May 2020 Yanhao Wang, Yuchen Li, Raymond Chi-Wing Wong, Kian-Lee Tan

Selecting a small set of representatives from a large database is important in many applications such as multi-criteria decision making, web search, and recommendation.

Databases Data Structures and Algorithms

Database Meets Deep Learning: Challenges and Opportunities

no code implementations21 Jun 2019 Wei Wang, Meihui Zhang, Gang Chen, H. V. Jagadish, Beng Chin Ooi, Kian-Lee Tan

Deep learning has recently become very popular on account of its incredible success in many complex data-driven applications, such as image classification and speech recognition.

Image Classification Speech Recognition

Coresets for Minimum Enclosing Balls over Sliding Windows

1 code implementation9 May 2019 Yanhao Wang, Yuchen Li, Kian-Lee Tan

This paper investigates the problem of maintaining a coreset to preserve the minimum enclosing ball (MEB) for a sliding window of points that are continuously updated in a data stream.

Efficient Representative Subset Selection over Sliding Windows

1 code implementation15 Jun 2017 Yanhao Wang, Yuchen Li, Kian-Lee Tan

By keeping much fewer checkpoints, KW$^{+}$ achieves higher efficiency than KW while still guaranteeing a $\frac{1-\varepsilon'}{2+2d}$-approximate solution for SMDK.

BLOCKBENCH: A Framework for Analyzing Private Blockchains

2 code implementations12 Mar 2017 Tien Tuan Anh Dinh, Ji Wang, Gang Chen, Rui Liu, Beng Chin Ooi, Kian-Lee Tan

However, there is a clear lack of a systematic framework with which different systems can be analyzed and compared against each other.

Databases Cryptography and Security Distributed, Parallel, and Cluster Computing

Real-Time Influence Maximization on Dynamic Social Streams

no code implementations6 Feb 2017 Yanhao Wang, Qi Fan, Yuchen Li, Kian-Lee Tan

Influence maximization (IM), which selects a set of $k$ users (called seeds) to maximize the influence spread over a social network, is a fundamental problem in a wide range of applications such as viral marketing and network monitoring.

Social and Information Networks Data Structures and Algorithms

Deep Learning At Scale and At Ease

no code implementations25 Mar 2016 Wei Wang, Gang Chen, Haibo Chen, Tien Tuan Anh Dinh, Jinyang Gao, Beng Chin Ooi, Kian-Lee Tan, Sheng Wang

The other is scalability, that is the deep learning system must be able to provision for a huge demand of computing resources for training large models with massive datasets.

Image Classification

Cannot find the paper you are looking for? You can Submit a new open access paper.