Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (4216)
- Computer Sciences (4213)
- Databases and Information Systems (1558)
- Software Engineering (1254)
- Artificial Intelligence and Robotics (747)
-
- Information Security (730)
- Graphics and Human Computer Interfaces (490)
- Numerical Analysis and Scientific Computing (454)
- Engineering (345)
- Programming Languages and Compilers (269)
- Computer Engineering (232)
- Social and Behavioral Sciences (214)
- Theory and Algorithms (212)
- Business (202)
- OS and Networks (148)
- Communication (103)
- Operations Research, Systems Engineering and Industrial Engineering (101)
- Social Media (83)
- Data Storage Systems (81)
- Medicine and Health Sciences (79)
- Education (66)
- Public Affairs, Public Policy and Public Administration (55)
- Computer and Systems Architecture (52)
- Health Information Technology (51)
- Transportation (51)
- Management Information Systems (49)
- Digital Communications and Networking (47)
- E-Commerce (44)
- Finance and Financial Management (40)
- Higher Education (30)
- Keyword
-
- Deep learning (71)
- Machine learning (59)
- Privacy (41)
- Empirical study (40)
- Deep Learning (35)
-
- Training (34)
- Security (33)
- Task analysis (32)
- Cloud computing (31)
- Data mining (31)
- Artificial intelligence (29)
- Reinforcement learning (29)
- Social media (29)
- Software engineering (29)
- Neural networks (28)
- Android (27)
- Blockchain (27)
- Feature extraction (27)
- Large Language Models (26)
- Model Check (26)
- Access control (25)
- Natural language processing (25)
- Authentication (24)
- Large language models (24)
- Privacy-preserving (24)
- Servers (24)
- Anomaly detection (23)
- Information retrieval (23)
- Visualization (23)
- Classification (22)
- Publication Year
Articles 3031 - 3060 of 4266
Full-Text Articles in Entire DC Network
Todmis: Mining Communities From Trajectories, Siyuan Liu, Shuhui Wang, Kasthuri Jayarajah, Archan Misra, Rammaya Krishnan
Todmis: Mining Communities From Trajectories, Siyuan Liu, Shuhui Wang, Kasthuri Jayarajah, Archan Misra, Rammaya Krishnan
Research Collection School Of Computing and Information Systems
Existing algorithms for trajectory-based clustering usually rely on simplex representation and a single proximity-related distance (or similarity) measure. Consequently, additional information markers (e.g., social interactions or the semantics of the spatial layout) are usually ignored, leading to the inability to fully discover the communities in the trajectory database. This is especially true for human-generated trajectories, where additional fine-grained markers (e.g., movement velocity at certain locations, or the sequence of semantic spaces visited) can help capture latent relationships between cluster members. To address this limitation, we propose TODMIS: a general framework for Trajectory cOmmunity Discovery using Multiple Information Sources. TODMIS combines …
Automated Library Recommendation, Ferdian Thung, David Lo, Julia Lawall
Automated Library Recommendation, Ferdian Thung, David Lo, Julia Lawall
Research Collection School Of Computing and Information Systems
Many third party libraries are available to be downloaded and used. Using such libraries can reduce development time and make the developed software more reliable. However, developers are often unaware of suitable libraries to be used for their projects and thus they miss out on these benefits. To help developers better take advantage of the available libraries, we propose a new technique that automatically recommends libraries to developers. Our technique takes as input the set of libraries that an application currently uses, and recommends other libraries that are likely to be relevant. We follow a hybrid approach that combines association …
Predictive Handling Of Asynchronous Concept Drifts In Distributed Environments, Hock Hee Ang, Vivek Gopalkrishnan, Indre Zliobaite, Mykola Pechenizkiy, Steven C. H. Hoi
Predictive Handling Of Asynchronous Concept Drifts In Distributed Environments, Hock Hee Ang, Vivek Gopalkrishnan, Indre Zliobaite, Mykola Pechenizkiy, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
In a distributed computing environment, peers collaboratively learn to classify concepts of interest from each other. When external changes happen and their concepts drift, the peers should adapt to avoid increase in misclassification errors. The problem of adaptation becomes more difficult when the changes are asynchronous, i.e., when peers experience drifts at different times. We address this problem by developing an ensemble approach, PINE, that combines reactive adaptation via drift detection, and proactive handling of upcoming changes via early warning and adaptation across the peers. With empirical study on simulated and real-world data sets, we show that PINE handles asynchronous …
Online Multimodal Distance Metric Learning With Application To Image Retrieval, Pengcheng Wu, Steven C. H. Hoi, Hao Xia, Peilin Zhao, Dayong Wang, Chunyan Miao
Online Multimodal Distance Metric Learning With Application To Image Retrieval, Pengcheng Wu, Steven C. H. Hoi, Hao Xia, Peilin Zhao, Dayong Wang, Chunyan Miao
Research Collection School Of Computing and Information Systems
Recent years have witnessed extensive studies on distance metric learning (DML) for improving similarity search in multimedia information retrieval tasks. Despite their successes, most existing DML methods suffer from two critical limitations: (i) they typically attempt to learn a linear distance function on the input feature space, in which the assumption of linearity limits their capacity of measuring the similarity on complex patterns in real-world applications; (ii) they are often designed for learning distance metrics on uni-modal data, which may not effectively handle the similarity measures for multimedia objects with multimodal representations. To address these limitations, in this paper, we …
Automatic Recovery Of Root Causes From Bug-Fixing Changes, Ferdian Thung, David Lo, Lingxiao Jiang
Automatic Recovery Of Root Causes From Bug-Fixing Changes, Ferdian Thung, David Lo, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
No abstract provided.
Error Recovered Hierarchical Classification, Shiai Zhu, Xiao-Yong Wei, Chong-Wah Ngo
Error Recovered Hierarchical Classification, Shiai Zhu, Xiao-Yong Wei, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Hierarchical classification (HC) is a popular and efficient way for detecting the semantic concepts from the images. However, the conventional HC, which always selects the branch with the highest classification response to go on, has the risk of propagating serious errors from higher levels of the hierarchy to the lower levels. We argue that the highestresponse-first strategy is too arbitrary, because the candidate nodes are considered individually which ignores the semantic relationship among them. In this paper, we propose a novel method for HC, which is able to utilize the semantic relationship among candidate nodes and their children to recover …
An Experimental Study For Inter-User Interference Mitigation In Wireless Body Sensor Networks, Bin Cao, Yu Ge, Chee Wee Kim, Gang Feng, Hwee-Pink Tan, Yun Li
An Experimental Study For Inter-User Interference Mitigation In Wireless Body Sensor Networks, Bin Cao, Yu Ge, Chee Wee Kim, Gang Feng, Hwee-Pink Tan, Yun Li
Research Collection School Of Computing and Information Systems
Inter-user interference degrades the reliability of data delivery in wireless body sensor networks (WBSNs) in dense deployments when multiple users wearing WBSNs are in close proximity to one another. The impact of such interference in realistic WBSN systems is significant but is not well explored. To this end, we investigate and analyze the impact of inter-user interference on packet delivery ratio (PDR) and throughput. We conduct extensive experiments based on the TelosB WBSN platform, considering unslotted carrier sense multiple access (CSMA) with collision avoidance (CA) and slotted CSMA/CA modes in IEEE 802.15.4 MAC, respectively. In order to mitigate interuser interference, …
A Collusion-Resistant Conditional Access System For Flexible-Pay-Per-Channel Pay-Tv Broadcasting, Zhiguo Wan, June Liu, Rui Zhang, Robert H. Deng
A Collusion-Resistant Conditional Access System For Flexible-Pay-Per-Channel Pay-Tv Broadcasting, Zhiguo Wan, June Liu, Rui Zhang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Pay-TV Broadcasting system, an extensively de- ployed application, charges its subscribers when receiving the broadcasted video. A conditional access system (CAS) ensures security for the Pay-TV broadcasting system, which is designed to control TV channel/program access to only authorized subscribers. There are mainly three CAS models: pay-per-channel (PPC), pay-per-view (PPV), and flexible-pay-per-channel (F- PPC). F-PPC is a novel model which combines the properties and advantages of both PPC and PPV. Several key management schemes with four-level hierarchical key structure have been proposed for this model. In this paper, we point out a severe security weakness of these schemes against collusion …
Automatic Recovery Of Root Causes From Bug-Fixing Changes, Ferdian Thung, David Lo, Lingxiao Jiang
Automatic Recovery Of Root Causes From Bug-Fixing Changes, Ferdian Thung, David Lo, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
What is the root cause of this failure? This question is often among the first few asked by software debuggers when they try to address issues raised by a bug report. Root cause is the erroneous lines of code that cause a chain of erroneous program states eventually leading to the failure. Bug tracking and source control systems only record the symptoms (e.g., bug reports) and treatments of a bug (e.g., committed changes that fix the bug), but not its root cause. Many treatments contain non-essential changes, which are intermingled with root causes. Reverse engineering the root cause of a …
K-Time Proxy Signature: Formal Definition And Efficient Construction, Weiwei Liu, Guomin Yang, Yi Mu, Jiannan Wei
K-Time Proxy Signature: Formal Definition And Efficient Construction, Weiwei Liu, Guomin Yang, Yi Mu, Jiannan Wei
Research Collection School Of Computing and Information Systems
Proxy signature, which allows an original signer to delegate his/her signing right to another party (or proxy signer), is very useful in many applications. Conventional proxy signature only allows the original signer to specify in the warrant the validity time period of the delegation but not the number of proxy signatures the proxy signer can generate. To address this problem, in this paper, we provide a formal treatment for k-time proxy signature. Such a scheme allows a designated proxy signer to produce only a fixed number of proxy signatures on behalf of the original signer. We provide the formal definitions …
Skyhunter: A Multi-Surface Environment For Supporting Oil And Gas Exploration, Teddy Seyed, Mario Costa Sousa, Frank Maurer, Anthony Tang
Skyhunter: A Multi-Surface Environment For Supporting Oil And Gas Exploration, Teddy Seyed, Mario Costa Sousa, Frank Maurer, Anthony Tang
Research Collection School Of Computing and Information Systems
The process of oil and gas exploration and its result, the decision to drill for oil in a specific location, relies on a number of distinct but related domains. These domains require effective collaboration to come to a decision that is both cost effective and maintains the integrity of the environment. As we show in this paper, many of the existing technologies and practices that support the oil and gas exploration process overlook fundamental user issues such as collaboration, interaction and visualization. The work presented in this paper is based upon a design process that involved expert users from an …
Consistent Stereo Image Editing, Tao Yan, Shengfeng He, Rynson W.H. Lau, Yun Xu
Consistent Stereo Image Editing, Tao Yan, Shengfeng He, Rynson W.H. Lau, Yun Xu
Research Collection School Of Computing and Information Systems
Stereo images and videos are very popular in recent years, and techniques for processing this media are attracting a lot of attention. In this paper, we extend the shift-map method for stereo image editing. Our method simultaneously processes the left and right images on pixel level using a global optimization algorithm. It enforces photo consistence between the two images and preserves 3D scene structures. It also addresses the occlusion and disocclusion problem, which may enable many stereo image editing functions, such as depth mapping, object depth adjustment and non-homogeneous image resizing. Our experiments show that the proposed method produces high …
Annotation For Free: Video Tagging By Mining User Search Behavior, Yao Ting, Tao Mei, Chong-Wah Ngo, Shipeng Li
Annotation For Free: Video Tagging By Mining User Search Behavior, Yao Ting, Tao Mei, Chong-Wah Ngo, Shipeng Li
Research Collection School Of Computing and Information Systems
The problem of tagging is mostly considered from the perspectives of machine learning and data-driven philosophy. A fundamental issue that underlies the success of these approaches is the visual similarity, ranging from the nearest neighbor search to manifold learning, to identify similar instances of an example for tag completion. The need to searching for millions of visual examples in high-dimensional feature space, however, makes the task computationally expensive. Moreover, the results can suffer from robustness problem, when the underlying data, such as online videos, are rich of semantics and the similarity is difficult to be learnt from low-level features. This …
Understanding Online Consumer’S Inter-Purchase Time, Youngsoo Kim
Understanding Online Consumer’S Inter-Purchase Time, Youngsoo Kim
Research Collection School Of Computing and Information Systems
This study is motivated by the premise that online consumers can make a purchase at any time of day if they have even a tiny time slot along with Internet access. Given the increased shopping time flexibility, we first examine the patterns of online purchase timing at an online shopping mall handling diverse products (e.g., Amazon.com). The results show (1) the breakdown of purchase timing regularity and (2) the change of weekly spike purchase occurrence. Second, we build online inter-purchase time and price promotion utilization models and estimate them with the data collected from one of the premier online shopping …
Learning Topics And Positions From Debatepedia, Swapna Gottopati, Minghui Qiu, Yanchuan Sim, Jing Jiang, Noah Smith
Learning Topics And Positions From Debatepedia, Swapna Gottopati, Minghui Qiu, Yanchuan Sim, Jing Jiang, Noah Smith
Research Collection School Of Computing and Information Systems
We explore Debatepedia, a communityauthored encyclopedia of sociopolitical debates, as evidence for inferring a lowdimensional, human-interpretable representation in the domain of issues and positions. We introduce a generative model positing latent topics and cross-cutting positions that gives special treatment to person mentions and opinion words. We evaluate the resulting representation’s usefulness in attaching opinionated documents to arguments and its consistency with human judgments about positions.
The Myths Of G-Tech For Business Decision Making, Tin Seong Kam
The Myths Of G-Tech For Business Decision Making, Tin Seong Kam
Research Collection School Of Computing and Information Systems
More than 80% of organisation data are location related - the locations where transactions are done, where retailers are found, and of customers who buy their products. Since the early 2005, there has been an increasing interest among the business community to use geospatial technology to enhance decision making process at both strategic and operational levels. Millions of dollars and man-hours have been invested into driving their geo-technology development and implementation. The use of geospatial technology in business, however, tends to confine to simple mapping. Many of these failures are the victims of misperception. Some of the perpetrators are practitioners. …
An Investigation Of Decision Analytic Methodologies For Stress Identification, Yong Deng, Chao-Hsien Chu, Huayou Si, Qixun Zhang, Zhonghai Wu
An Investigation Of Decision Analytic Methodologies For Stress Identification, Yong Deng, Chao-Hsien Chu, Huayou Si, Qixun Zhang, Zhonghai Wu
Research Collection School Of Computing and Information Systems
In modern society, more and more people are suffering from some type of stress. Monitoring and timely detecting of stress level will be very valuable for the person to take counter measures. In this paper, we investigate the use of decision analytics methodologies to detect stress. We present a new feature selection method based on the principal component analysis (PCA), compare three feature selection methods, and evaluate five information fusion methods for stress detection. A driving stress data set created by the MIT Media lab is used to evaluate the relative performance of these methods. Our study show that the …
Securearray: Improving Wifi Security With Fine-Grained Physical-Layer, Jie Xiong, Kyle Jamieson
Securearray: Improving Wifi Security With Fine-Grained Physical-Layer, Jie Xiong, Kyle Jamieson
Research Collection School Of Computing and Information Systems
Despite the important role that WiFi networks play in home and enterprise networks they are relatively weak from a security standpoint. With easily available directional antennas, attackers can be physically located off-site, yet compromise WiFi security protocols such as WEP, WPA, and even to some extent WPA2 through a range of exploits specific to those protocols, or simply by running dictionary and human-factors attacks on users' poorly-chosen passwords. This presents a security risk to the entire home or enterprise network. To mitigate this ongoing problem, we propose SecureArray, a system designed to operate alongside existing wireless security protocols, adding defense …
Theory And Practice, Do They Match? A Case With Spectrum-Based Fault Localization, Tien-Duy B. Le, Ferdian Thung, David Lo
Theory And Practice, Do They Match? A Case With Spectrum-Based Fault Localization, Tien-Duy B. Le, Ferdian Thung, David Lo
Research Collection School Of Computing and Information Systems
Spectrum-based fault localization refers to the process of identifying program units that are buggy from two sets of execution traces: normal traces and faulty traces. These approaches use statistical formulas to measure the suspiciousness of program units based on the execution traces. There have been many spectrum-based fault localization approaches proposing various formulas in the literature. Two of the best performing and well-known ones are Tarantula and Ochiai. Recently, Xie et al. find that theoretically, under certain assumptions, two families of spectrum-based fault localization formulas outperform all other formulas including those of Tarantula and Ochiai. In this work, we empirically …
Will Fault Localization Work For These Failures? An Automated Approach To Predict Effectiveness Of Fault Localization Tools, Tien-Duy B. Le, David Lo
Will Fault Localization Work For These Failures? An Automated Approach To Predict Effectiveness Of Fault Localization Tools, Tien-Duy B. Le, David Lo
Research Collection School Of Computing and Information Systems
Debugging is a crucial yet expensive activity to improve the reliability of software systems. To reduce debugging cost, various fault localization tools have been proposed. A spectrum-based fault localization tool often outputs an ordered list of program elements sorted based on their likelihood to be the root cause of a set of failures (i.e., their suspiciousness scores). Despite the many studies on fault localization, unfortunately, however, for many bugs, the root causes are often low in the ordered list. This potentially causes developers to distrust fault localization tools. Recently, Parnin and Orso highlight in their user study that many debuggers …
Inferring Ongoing Human Activities Based On Recurrent Self-Organizing Map Trajectory, Qianru Sun, Hong Liu
Inferring Ongoing Human Activities Based On Recurrent Self-Organizing Map Trajectory, Qianru Sun, Hong Liu
Research Collection School Of Computing and Information Systems
Automatically inferring ongoing activities is to enable the early recognition of unfinished activities, which is quite meaningful for applications, such as online human-machine interaction and security monitoring. State-of-the-art methods use the spatiotemporal interest point (STIP) based features as the low-level video description to handle complex scenes. While the existing problem is that typical bag-of-visual words (BoVW) focuses on the statistical distribution of features but ignores the inherent contexts in activity sequences, resulting in low discrimination when directly dealing with limited observations. To solve this problem, the Recurrent Self-Organizing Map (RSOM), which was designed to process sequential data, is novelly adopted …
A Highly Efficient Rfid Distance Bounding Protocol Without Real-Time Prf Evaluation, Yunhui Zhuang, Anjia Yang, Duncan S. Wong, Guomin Yang, Qi Xie
A Highly Efficient Rfid Distance Bounding Protocol Without Real-Time Prf Evaluation, Yunhui Zhuang, Anjia Yang, Duncan S. Wong, Guomin Yang, Qi Xie
Research Collection School Of Computing and Information Systems
There is a common situation among current distance bounding protocols in the literature: they set the fast bit exchange phase after a slow phase in which the nonces for both the reader and a tag are exchanged. The output computed in the slow phase is acting as the responses in the subsequent fast phase. Due to the calculation constrained RFID environment of being lightweight and efficient, it is the important objective of building the protocol which can have fewer number of message flows and less number of cryptographic operations in real time performed by the tag. In this paper, we …
Corporate Myths: Sourcing And Vendor Management In Asia Pacific, Patrick Thng
Corporate Myths: Sourcing And Vendor Management In Asia Pacific, Patrick Thng
Research Collection School Of Computing and Information Systems
There exists many mistaken beliefs about Sourcing and Vendor Management. Consequently the function is often mismanaged resulting in errors and frauds. Equipping the function with the needed skills and knowledge is critical for competent management of this key function which every organisation has to have.
Writing For Publication In Biomedical Informatics Journals, Christoph Lehmann, Reinhold Haux, Jan Talmon, Dominik Aronsky, Nicolette De Keizer, Tze-Yun Leong, Charles Safran
Writing For Publication In Biomedical Informatics Journals, Christoph Lehmann, Reinhold Haux, Jan Talmon, Dominik Aronsky, Nicolette De Keizer, Tze-Yun Leong, Charles Safran
Research Collection School Of Computing and Information Systems
No abstract provided.
Multi-View Discriminant Transfer Learning, Pei Yang Yang, Wei Gao
Multi-View Discriminant Transfer Learning, Pei Yang Yang, Wei Gao
Research Collection School Of Computing and Information Systems
We study to incorporate multiple views of data in a perceptive transfer learning framework and propose a Multi-view Discriminant Transfer (MDT) learning approach for domain adaptation. The main idea is to find the optimal discriminant weight vectors for each view such that the correlation between the two-view projected data is maximized, while both the domain discrepancy and the view disagreement are minimized simultaneously. Furthermore, we analyze MDT theoretically from discriminant analysis perspective to explain the condition and reason, under which the proposed method is not applicable. The analytical results allow us to investigate whether there exist within-view and/or betweenview conflicts, …
Audit Games, Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha
Audit Games, Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha
Research Collection School Of Computing and Information Systems
Effective enforcement of laws and policies requires expending resources to prevent and detect offenders, as well as appropriate punishment schemes to deter violators. In particular, enforcement of privacy laws and policies in modern organizations that hold large volumes of personal information (e.g., hospitals, banks) relies heavily on internal audit mechanisms. We study economic considerations in the design of these mechanisms, focusing in particular on effective resource allocation and appropriate punishment schemes. We present an audit game model that is a natural generalization of a standard security game model for resource allocation with an additional punishment parameter. Computing the Stackelberg equilibrium …
Learning To Name Faces: A Multimodal Learning Scheme For Search-Based Face Annotation, Dayong Wang, Steven C. H. Hoi, Pengcheng Wu, Jianke Zhu, Ying He, Chunyan Miao
Learning To Name Faces: A Multimodal Learning Scheme For Search-Based Face Annotation, Dayong Wang, Steven C. H. Hoi, Pengcheng Wu, Jianke Zhu, Ying He, Chunyan Miao
Research Collection School Of Computing and Information Systems
Automated face annotation aims to automatically detect human faces from a photo and further name the faces with the corresponding human names. In this paper, we tackle this open problem by investigating a search-based face annotation (SBFA) paradigm for mining large amounts of web facial images freely available on the WWW. Given a query facial image for annotation, the idea of SBFA is to first search for top-n similar facial images from a web facial image database and then exploit these top-ranked similar facial images and their weak labels for naming the query facial image. To fully mine those information, …
Marginal Deterrence In The Enforcement Of Law: Evidence From Distributed Denial Of Service Attack, Kai-Lung Hui, Seung-Hyun Kim, Qiu-Hong Wang
Marginal Deterrence In The Enforcement Of Law: Evidence From Distributed Denial Of Service Attack, Kai-Lung Hui, Seung-Hyun Kim, Qiu-Hong Wang
Research Collection School Of Computing and Information Systems
By studying a panel dataset of distributed denial of service attack across 240 countriesover 5 years, we find that enforcing the Convention on Cybercrime had increasedthe intensity of attack by 43 to 52 percent. It did not significantly reducethe chance for a country to be selected for the attack. We conducted a batteryof identification and falsification tests to show that such increased attack intensityarose because of failure in marginal deterrence, instead of other theories such asbrutalization, stigmatization, or defiance, or general forms of endogeneity. We showthat raising the standard of proof of conviction is one way to facilitate marginaldeterrence, but …
Best Upgrade Plans For Large Road Networks, Yimin Lin, Kyriakos Mouratidis
Best Upgrade Plans For Large Road Networks, Yimin Lin, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
In this paper, we consider a new problem in the context of road network databases, named Resource Constrained Best Upgrade Plan computation (BUP, for short). Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. Given a source and a destination in G, and a budget (resource constraint) B, the BUP problem is to identify which upgradable edges should be upgraded so that the shortest path distance between source and …
Incremental And Accuracy-Aware Personalized Pagerank Through Scheduled Approximation, Fanwei Zhu, Yuan Fang, Kevin Chen-Chuan Chang, Jing Ying
Incremental And Accuracy-Aware Personalized Pagerank Through Scheduled Approximation, Fanwei Zhu, Yuan Fang, Kevin Chen-Chuan Chang, Jing Ying
Research Collection School Of Computing and Information Systems
As Personalized PageRank has been widely leveraged for ranking on a graph, the efficient computation of Personalized PageRank Vector (PPV) becomes a prominent issue. In this paper, we propose FastPPV, an approximate PPV computation algorithm that is incremental and accuracy-aware. Our approach hinges on a novel paradigm of scheduled approximation: the computation is partitioned and scheduled for processing in an "organized" way, such that we can gradually improve our PPV estimation in an incremental manner, and quantify the accuracy of our approximation at query time. Guided by this principle, we develop an efficient hub based realization, where we adopt the …