Keyword-aware optimal route search by Cao, Xin, Chen, Lisi, Cong, Gao, Xiao, Xiaokui

“…Based on this algorithm, another more efficient approximation algorithm BucketBound is proposed. We also design a greedy approximation algorithm. …”
Get full text
Get full text
Get full text

Mining weakly labeled web facial images for search-based face annotation by Wang, Dayong, He, Ying, Zhu, Jianke, Hoi, Steven C. H.

“…To further speed up the proposed scheme, we also propose a clustering-based approximation algorithm which can improve the scalability considerably. …”
Get full text
Get full text

Retrieving regions of interest for user exploration by Cao, Xin, Cong, Gao, Jensen, Christian S., Yiu, Man Lung

“…We develop an approximation algorithm with a (5 + ε) approximation ratio utilizing a technique that scales node weights into integers. …”
Get full text
Get full text
Get full text

Find your neighbors (quickly!) by Wong, Wei Tian.

“…Therefore in recent years, the approximate nearest neighbor solution was proposed to mitigate the curse of dimensionality issue. These approximate algorithms are known to provide large speedups with a minor tradeoff between the loss of efficiency or accuracy. …”
Get full text

Overlapping decomposition for causal graphical modeling by Han, Lei, Song, Guojie, Cong, Gao, Xie, Kunqing

“…Specifically, we formulate an objective function for the overlapping decomposition problem and propose an approximate algorithm for it. A key theory of the algorithm is that the problem of solving a k + 1 node graphical model can be reduced to the problem of solving a one-step regularization based on a solved k node graphical model. …”
Get full text
Get full text

Interactivity-constrained server provisioning in large-scale distributed virtual environments by Ta, Duong Nguyen Binh, Nguyen, Thang, Zhou, Suiping, Tang, Xueyan, Cai, Wentong, Ayani, Rassul

“…We then propose several computationally efficient approximation algorithms for solving the problem. The main algorithms exploit dependencies among distributed servers to make provisioning decisions. …”
Get full text
Get full text

Minimum-energy connected coverage in wireless sensor networks with omni-directional and directional features by Liu, Yang, Han, Kai., Xiang, Liu., Luo, Jun.

“…We prove that the MeCoCo problem is NP-hard under all these cases, and present approximation algorithms with provable approximation ratios. …”
Get full text
Get full text