Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3555)
- Software Engineering (2197)
- Artificial Intelligence and Robotics (1881)
- Information Security (1102)
- Numerical Analysis and Scientific Computing (1060)
-
- Graphics and Human Computer Interfaces (942)
- Engineering (884)
- Social and Behavioral Sciences (807)
- Business (748)
- Theory and Algorithms (514)
- Computer Engineering (449)
- Programming Languages and Compilers (413)
- Operations Research, Systems Engineering and Industrial Engineering (407)
- OS and Networks (345)
- Communication (326)
- Social Media (264)
- Public Affairs, Public Policy and Public Administration (230)
- Medicine and Health Sciences (196)
- Education (194)
- Transportation (194)
- Management Information Systems (176)
- Data Storage Systems (167)
- E-Commerce (154)
- International and Area Studies (147)
- Technology and Innovation (146)
- Asian Studies (145)
- Health Information Technology (118)
- Higher Education (105)
- Keyword
-
- Machine learning (145)
- Deep learning (129)
- Artificial intelligence (123)
- Social media (82)
- Singapore (73)
-
- Reinforcement learning (72)
- Data mining (70)
- Privacy (67)
- Security (62)
- Cloud computing (60)
- Deep Learning (57)
- Empirical study (55)
- Software engineering (55)
- Optimization (53)
- Online learning (51)
- Visualization (51)
- Neural networks (50)
- Anomaly detection (49)
- Training (49)
- Twitter (49)
- Task analysis (48)
- Blockchain (47)
- Natural language processing (47)
- Collaboration (46)
- Large Language Models (46)
- Feature extraction (45)
- Algorithms (44)
- Access control (43)
- Machine Learning (43)
- Semantics (43)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8458)
- Dissertations and Theses Collection (Open Access) (189)
- Research Collection Lee Kong Chian School Of Business (59)
- Research Collection Yong Pung How School Of Law (49)
- Research Collection School of Social Sciences (27)
-
- Asian Management Insights (26)
- Research Collection College of Integrative Studies (23)
- Perspectives@SMU (21)
- Research Collection School Of Accountancy (18)
- Dissertations and Theses Collection (15)
- FORCE 2026 (14)
- SMU Press Releases and News (12)
- MITB Thought Leadership Series (11)
- Research Collection Library (10)
- Research Collection School of Computing and Information Systems (10)
- Research@SMU: Connecting the Dots (10)
- PhD Student’s Publications Collection (8)
- LARC Research Publications (7)
- Research Collection School Of Economics (6)
- CCX Research (4)
- SMU Research Data (4)
- Student Publications (4)
- 2024 AI for Research Week (3)
- SCIS Student Publications (3)
- Centre for AI & Data Governance (2019-2025) (2)
- Research Collection Office of Research (2)
- CASTLe: Collection of Articles on Scholarship for Teaching and Learning (1)
- Centre for Computational Law (2022-2025) (1)
- Library Events (1)
- ROSA Journal Articles and Publications (1)
- Publication Type
- File Type
Articles 8521 - 8550 of 9003
Full-Text Articles in Computer Sciences
Validating Digital Signatures Without Ttp’S Time-Stamping And Certificate Revocation, Jianying Zhou, Feng Bao, Robert H. Deng
Validating Digital Signatures Without Ttp’S Time-Stamping And Certificate Revocation, Jianying Zhou, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
In non-repudiation services where digital signatures usually serve as irrefutable cryptographic evidence for dispute resolution, trusted time-stamping and certificate revocation services, although very costly in practice, must be available, to prevent big loss due to compromising of the signing key. In [12], a new concept called intrusion-resilient signature was proposed to get rid of trusted time-stamping and certificate revocation services and a concrete scheme was presented. In this paper, we put forward a new scheme that can achieve the same effect in a much more efficient way. In our scheme, forward-secure signature serves as a building block that enables signature …
Variations Of Diffie-Hellman Problem, Feng Bao, Robert H. Deng, Huafei Zhu
Variations Of Diffie-Hellman Problem, Feng Bao, Robert H. Deng, Huafei Zhu
Research Collection School Of Computing and Information Systems
This paper studies various computational and decisional Diffie-Hellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational Diffie-Hellman problem: square Diffie-Hellman problem, inverse Diffie-Hellman problem and divisible Diffie-Hellman problem, are equivalent with optimal reduction. Also, we are considering variations of the decisional Diffie-Hellman problem in single sample and polynomial samples settings, and we are able to show that all variations are equivalent except for the argument DDH ⇐ SDDH. We are not able to prove or disprove this statement, thus leave an interesting open problem. Keywords: Diffie-Hellman problem, Square Diffie-Hellman …
Safe Robot Driving In Cluttered Environments, Chuck Thorpe, Justin Carlson, Dave Duggins, Jay Gowdy, Rob Maclachlan, Christoph Mertz, Arne Suppe, Bob Wang
Safe Robot Driving In Cluttered Environments, Chuck Thorpe, Justin Carlson, Dave Duggins, Jay Gowdy, Rob Maclachlan, Christoph Mertz, Arne Suppe, Bob Wang
Research Collection School Of Computing and Information Systems
The Navlab group at Carnegie Mellon University has a long history of development of automated vehicles and intelligent systems for driver assistance. The earlier work of the group concentrated on road following, cross-country driving, and obstacle detection. The new focus is on short-range sensing, to look all around the vehicle for safe driving. The current system uses video sensing, laser rangefinders, a novel light-stripe rangefinder, software to process each sensor individually, and a map-based fusion system. The complete system has been demonstrated on the Navlab 11 vehicle for monitoring the environment of a vehicle driving through a cluttered urban environment, …
An Efficient Known Plaintext Attack On Fea-M, Hongjun Wu, Feng Bao, Robert H. Deng
An Efficient Known Plaintext Attack On Fea-M, Hongjun Wu, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Yi et al. have proposed a cipher called the fast encryption algorithm for multimedia (FEA-M). Recently Mihaljevi and Kohno pointed out that FEA-M is insecure. However, their attacks are not efficient: their chosen plaintext attack and known plaintext attack require 237-bit chosen plaintext and 260-bit known plaintext, respectively. In this paper we give an efficient known plaintext attack against FEA-M. Our attack requires only 228-bit known plaintext and about 233 XOR operations.
High-Performance Architectures For Ip-Based Multihop 802.11 Networks, Arup Acharya, Archan Misra, Sorav Bansal
High-Performance Architectures For Ip-Based Multihop 802.11 Networks, Arup Acharya, Archan Misra, Sorav Bansal
Research Collection School Of Computing and Information Systems
The concept of a forwarding node, which receives packets from upstream nodes and then transmits these packets to downstream nodes, is a key element of any multihop network, wired or wireless. While high-speed IP router architectures have been extensively studied for wired networks, the concept of a "wireless IP router" has not been addressed so far. We examine the limitations of the IEEE 802.11 MAC protocol in supporting a low-latency and high-throughput IP datapath comprising multiple wireless LAN hops. We first propose a wireless IP forwarding architecture that uses MPLS with modifications to 802.11 MAC to significantly improve packet forwarding …
Adaptive Collusion Attack To A Block Oriented Watermarking Scheme, Yongdong Wu, Robert H. Deng
Adaptive Collusion Attack To A Block Oriented Watermarking Scheme, Yongdong Wu, Robert H. Deng
Research Collection School Of Computing and Information Systems
In this paper, we propose an adaptive collusion attack to a block oriented watermarking scheme [1]. In this attack, traitors conspire to selectively manipulate watermarked blocks to remove the watermark information. To this end, the traitors compare the watermarked blocks generated from the same original block. If two watermarked block are not equal, they average these two blocks to generate a pirated block. Then, replace the watermarked blocks with the pirated blocks so as to build a pirated image. The pirated image has no watermark but has much higher quality than watermarked images. We also give a theoretical analysis on …
An Efficient Public-Key Framework, Jianying Zhou, Feng Bao, Robert H. Deng
An Efficient Public-Key Framework, Jianying Zhou, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Public-key certificates play an important role in binding the public key with the identity of the owner of the corresponding private key. A certificate might be revoked before its scheduled expiry date by the issuing CA. Efficient and timely distribution of certificate revocation information is a big challenge facing the PKI providers. Existing certificate revocation schemes place a considerable processing, communication, and storage overheads on the CA as well as the relying parties. To improve the current situation, we propose a revocation-free public-key framework, in which the maximum lifetime of a certificate is divided into short periods and the certificate …
Security Remarks On A Group Signature Scheme With Member Deletion, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Security Remarks On A Group Signature Scheme With Member Deletion, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
A group signature scheme allows a group member of a given group to sign messages on behalf of the group in an anonymous and unlinkable fashion. In case of a dispute, however, a designated group manager can reveal the signer of a valid group signature. Based on the Camenisch-Michels group signature scheme, Kim, Lim and Lee proposed the first group signature scheme with a member deletion procedure at ICISC 2000. Their scheme is very efficient in both communication and computation aspects. Unfortunately, their scheme is insecure. In this paper, we first identify an effective way that allows any verifier to …
Multi-Agent Coalition Via Autonomous Price Negotiation In A Real-Time Web Environment, Hoong Chuin Lau, Wei Sian Lim
Multi-Agent Coalition Via Autonomous Price Negotiation In A Real-Time Web Environment, Hoong Chuin Lau, Wei Sian Lim
Research Collection School Of Computing and Information Systems
In e-marketplaces, customers specify job requests in real-time and agents form coalitions to service them. This paper proposes a protocol for self-interested agents to negotiate prices in forming successful coalitions. We propose and experiment with two negotiation schemes: one allows information sharing while the other does not.
Aggregated Causal Maps: An Approach To Elicit And Aggregate The Knowledge Of Multiple Experts, S. Nadkarni, Fiona Fui-Hoon Nah
Aggregated Causal Maps: An Approach To Elicit And Aggregate The Knowledge Of Multiple Experts, S. Nadkarni, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
This paper presents a systematic procedure to elicit and aggregate the knowledge of multiple individual experts and represent it in the form of an Aggregated Causal Map (ACM). This procedure differs from existing methods in two ways. First, unlike other methods, this method does not rely on group interaction in eliciting knowledge of multiple experts, and, therefore, is not fraught with biases associated with group dynamics. Second, this method uses both the idiographic and nomothetic approaches while existing methods focus on nomothetic approaches to knowledge elicitation. We draw on the strengths of both approaches by using the idiographic approach to …
E-Ducation, J. Erickson, Keng Siau
E-Ducation, J. Erickson, Keng Siau
Research Collection School Of Computing and Information Systems
Most educators are convinced Internet technology will sharply alter the educational landscape of the future, but considerable uncertainly still exists as to exactly how the classroom will evolve over the next decade. Many of the relevant technologies in development are a direct result of the Internet2 Project [1], a collaboration of more than 200 universities working closely with private industry and the National Science Foundation to build and promote an advanced network using state-of-the-art technology and applications. But how the classroom evolves depends not only on advanced Internet2 technologies, which are discussed later in the article, but also on issues …
Ssm: Fast Construction Of The Optimized Segment Support Map, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim
Ssm: Fast Construction Of The Optimized Segment Support Map, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Computing the frequency of a pattern is one of the key operations in data mining algorithms. Recently, the Optimized Segment Support Map (OSSM) was introduced as a simple but powerful way of speeding up any form of frequency counting satisfying the monotonicity condition. However, the construction cost to obtain the ideal OSSM is high, and makes it less attractive in practice. In this paper, we propose the FSSM, a novel algorithm that constructs the OSSM quickly using a FP-Tree. Given a user-defined segment size, the FSSM is able to construct the OSSM at a fraction of the time required by …
Interorganizational Systems And Competitive Advantages – Lessons From History, Keng Siau
Interorganizational Systems And Competitive Advantages – Lessons From History, Keng Siau
Research Collection School Of Computing and Information Systems
Global business constantly faces radical transformations stemming from advances in information technology (IT). The concept of gaining competitive advantages by linking information systems across organizations (e.g., supply chain integration) has taken on an overtone of dogma in many business circles. Such electronic linkages are known as Interorganizational Systems (IOS). Lately, the growing importance and easy accessibility of the Internet have propelled IOS to a new height. Undoubtedly, IOS can have a great impact on organizational performance and industry structure. However, IT such as the Internet is readily available to all companies, and most IOS concepts can be easily replicated. Followers …
On Mining Group Patterns Of Mobile Users, Yida Wang, Ee Peng Lim, San-Yih Hwang
On Mining Group Patterns Of Mobile Users, Yida Wang, Ee Peng Lim, San-Yih Hwang
Research Collection School Of Computing and Information Systems
In this paper, we present a group pattern mining approach to derive the grouping information of mobile device users based on the spatio-temporal distances among them. Group patterns of users are determined by a distance threshold and a minimum duration. To discover group patterns, we propose the AGP and VG-growth algorithms that are derived from the Apriori and FP-growth algorithms respectively. We further evaluate the efficiencies of these two algorithms using synthetically generated user movement data.
Capacitated Network Revenue Management Through Shadow Pricing, Mustapha Bouhtou, Madiagne Diallo, Laura Wynter
Capacitated Network Revenue Management Through Shadow Pricing, Mustapha Bouhtou, Madiagne Diallo, Laura Wynter
Research Collection School Of Computing and Information Systems
In this paper, we analyze a method that links Lagrange multipliers from a resource allocation problem to the problem of revenue or profit maximization. This technique, first proposed in the transportation science literature by [7] has important implications for telecommunication network pricing. Indeed, the framework provides a generalization of telecommunication resource allocation/shadow price-based schemes such as those of [6] and [9], in that it permits the optimization of the shadow prices themselves, through a computationally simple procedure. We analyze the extent to which revenue can be maximized on a network that uses shadow-price-based prices, and how to deal with cases …
The Effect Of Domain Knowledge On Icon Visualization, Keng Siau, Fiona Fui-Hoon Nah
The Effect Of Domain Knowledge On Icon Visualization, Keng Siau, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
Iconic interfaces are now the de facto interface for most computer systems. Despite the popularity of iconic interfaces and the widespread belief that iconic interfaces are easier to comprehend than non-iconic interfaces, we have not come across any published study that has examined the effect of domain knowledge on end users’ interpretation of icons. An understanding of the relationship between domain knowledge and its effect on interpretation will enable us to design better icons to not only facilitate end users’ interpretation but also reduce misinterpretations of icons. This paper reports on an experimental study that investigates the effect of domain …
Performance Sensitivity And Fairness Of Ecn-Aware 'Modified Tcp', Archan Misra, Teunis Ott
Performance Sensitivity And Fairness Of Ecn-Aware 'Modified Tcp', Archan Misra, Teunis Ott
Research Collection School Of Computing and Information Systems
The paper discusses how Explicit Congestion Notification (ECN) can be used to devise a congestion control mechanism for the Internet, which is more rapidly reactive and allows best-effort flows to rapidly adjust to fluctuations in available capacity. Our ECN-mod protocol involves simple modifications to TCP behavior and leverages more aggressive marking-based router feedback.Simulations show that ECN-mod is better than TCP NewReno even for Web-style intermittent traffic sources, and makes the link utilization significantly less sensitive to the variation in the number of active flows. Simulations also show that, while ECN-mod flows obtain a larger portion of the available capacity than …
Erp Implementation: Chief Information Officers’ Perceptions Of Critical Success Factors, Fiona Fui-Hoon Nah, Kathryn M. Zuckweiler, Janet Lee-Shang Lau
Erp Implementation: Chief Information Officers’ Perceptions Of Critical Success Factors, Fiona Fui-Hoon Nah, Kathryn M. Zuckweiler, Janet Lee-Shang Lau
Research Collection School Of Computing and Information Systems
This article reports the results of a survey of Chief Information Officers (CIOs) from Fortune 1000 companies on their perceptions of the critical success factors in Enterprise Resource Planning (ERP) implementation. Through a review of the literature, 11 critical success factors were identified , with underlying subfactors, for successful ERP implementation. The degree of criticality of each of these factors were assessed in a survey administered to the CIOs. The 5 most critical factors identified by the CIOs were top management support, project champion, ERP teamwork and composition, project management, and change management program and culture. The importance of each …
Information Systems Requirements Determination And Analysis: A Mental Modeling Approach, Keng Siau, X. Tan
Information Systems Requirements Determination And Analysis: A Mental Modeling Approach, Keng Siau, X. Tan
Research Collection School Of Computing and Information Systems
Regardless of the system development methodology adopted, being able to understand users’ informationrequirements is vital to the success of an information systems project. The intrinsic communications obstaclesexist within an individual user, among users, and between users and systems analysts. Different requirementsdetermination and analysis (RDA) techniques have been widely used with different outcomes. Some limitations of these techniques can be identified. In this paper, we propose a mental modeling approach to support RDA. Popular in other disciplines, mental modeling techniques have some distinct advantages to overcome some intrinsic communication obstacles in RDA, and to complement other techniques.
Solving Multi-Objective Multi-Constrained Optimization Problems Using Hybrid Ants System And Tabu Search, Hoong Chuin Lau, Min Kwang Lim, Wee Chong Wan, Hui Wang, Xiaotao Wu
Solving Multi-Objective Multi-Constrained Optimization Problems Using Hybrid Ants System And Tabu Search, Hoong Chuin Lau, Min Kwang Lim, Wee Chong Wan, Hui Wang, Xiaotao Wu
Research Collection School Of Computing and Information Systems
Many real-world optimization problems today are multi-objective multi-constraint generalizations of NP-hard problems. A classic case we study in this paper is the Inventory Routing Problem with Time Windows (IRPTW). IRPTW considers inventory costs across multiple instances of Vehicle Routing Problem with Time Windows (VRPTW). The latter is in turn extended with time-windows constraints from the Vehicle Routing Problem (VRP), which is extended with optimal fleet size objective from the single-objective Traveling Salesman Problem (TSP). While single-objective problems like TSP are solved effectively using meta-heuristics, it is not obvious how to cope with the increasing complexity systematically as the problem is …
Towards A Role-Based Metadata Scheme For Educational Digital Libraries: A Case Study In Singapore, Dian Melati Md Ismail, Ming Yin, Yin-Leng Theng, Dion Hoe-Lian Goh, Ee Peng Lim
Towards A Role-Based Metadata Scheme For Educational Digital Libraries: A Case Study In Singapore, Dian Melati Md Ismail, Ming Yin, Yin-Leng Theng, Dion Hoe-Lian Goh, Ee Peng Lim
Research Collection School Of Computing and Information Systems
In this paper, we describe the development of an appropriate metadata scheme for GeogDL, a Web-based digital library application containing past-year examination resources for students taking a Singapore national examination in geography. The new metadata scheme was developed from established metadata schemes on education and e-learning. Initial evaluation showed that a role-based approach would be more viable, adapting to the different roles of teachers/educators and librarians contributing geography resources to GeogDL. The paper concludes with concrete implementation of the role-based metadata schema for GeogDL.
A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Wee Chong Wan, Xiaomin Jia
A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Wee Chong Wan, Xiaomin Jia
Research Collection School Of Computing and Information Systems
Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a welldesigned set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that is …
Factors Influencing The Adoption Of E-Marketplaces By Small Organizations: An Empirical Investigation, Xin Tan, Fiona Fui-Hoon Nah, Charalambos Iacovou, Jaekyung. Kim
Factors Influencing The Adoption Of E-Marketplaces By Small Organizations: An Empirical Investigation, Xin Tan, Fiona Fui-Hoon Nah, Charalambos Iacovou, Jaekyung. Kim
Research Collection School Of Computing and Information Systems
The emergence of mobile computing combined with the increased popularity of the Internet is changing our daily lives. The increasing use of small portable computers, wireless networks and satellites un folds the new technology of mobile computing, which allows transmis sion of data to computers that are not physically linked to a network. As a result, people can communicate on the move. Mobile devices with new input and output methods and form factors are dramatically different from traditional desktop computers (Rodden et al., 1998). These technological changes make increasing demands on both the quality of user interface and the functionality …
A Study On Tolerable Waiting Time: How Long Are Web Users Willing To Wait?, Fiona Fui-Hoon Nah
A Study On Tolerable Waiting Time: How Long Are Web Users Willing To Wait?, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
The WWW has become an important channel for information access, electronic commerce, and publication. With an exponential increase in the number of Web users and the popularity of multimedia technology, users often face a long waiting time for downloading Web pages. Although various technologies and techniques have been implemented to alleviate the situation and to comfort the impatient users, little research has been done to assess what constitutes an acceptable and tolerable waiting time for Web users. This research reviews the literature on computer response time and users’ waiting time, and assesses Web users’ tolerable waiting time in information retrieval. …
Detection Of Documentary Scene Changes By Audio-Visual Fusion, Atulya Velivelli, Chong-Wah Ngo, Thomas S. Huang
Detection Of Documentary Scene Changes By Audio-Visual Fusion, Atulya Velivelli, Chong-Wah Ngo, Thomas S. Huang
Research Collection School Of Computing and Information Systems
The concept of a documentary scene was inferred from the audio-visual characteristics of certain documentary videos. It was observed that the amount of information from the visual component alone was not enough to convey a semantic context to most portions of these videos, but a joint observation of the visual component and the audio component conveyed a better semantic context. From the observations that we made on the video data, we generated an audio score and a visual score. We later generated a weighted audio-visual score within an interval and adaptively expanded or shrunk this interval until we found a …
A Novel Scheme For Video Similarity Detection, Steven Hoi, Wei Wang, Michael R. Lyu
A Novel Scheme For Video Similarity Detection, Steven Hoi, Wei Wang, Michael R. Lyu
Research Collection School Of Computing and Information Systems
In this paper, a new two-phase scheme for video similarity detection is proposed. For each video sequence, we extract two kinds of signatures with different granularities: coarse and fine. Coarse signature is based on the Pyramid Density Histogram (PDH) technique and fine signature is based on the Nearest Feature Trajectory (NFT) technique. In the first phase, most of unrelated video data are filtered out with respect to the similarity measure of the coarse signature. In the second phase, the query video example is compared with the results of the first phase according to the similarity measure of the fine signature. …
A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau
A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a welldesigned set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that is …
Trifocal Morphing, Angus M. K. Siu, Ada S. K. Wan, Rynson W. H. Lau, Chong-Wah Ngo
Trifocal Morphing, Angus M. K. Siu, Ada S. K. Wan, Rynson W. H. Lau, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Image morphing allows smooth transition between 2D images. However, one of the limitations of existing image morphing techniques is the lack of interaction - the viewpoints of the interpolated images are restrained to the line joining the optical centers of the source and the destination images. Another limitation of existing image morphing techniques is that shape warping often causes distortion due to barycentric mapping. In this paper, we present our trifocal morphing technique to address these problems. The new technique allows a user to change the viewpoint of the output images, i.e., increasing the degrees of freedom of interaction, and …
Video Clip Retrieval By Maximal Matching And Optimal Matching In Graph Theory, Yu-Xin Peng, Chong-Wah Ngo, Qing-Jie Dong, Zong-Ming Guo, Jian-Guo Xiao
Video Clip Retrieval By Maximal Matching And Optimal Matching In Graph Theory, Yu-Xin Peng, Chong-Wah Ngo, Qing-Jie Dong, Zong-Ming Guo, Jian-Guo Xiao
Research Collection School Of Computing and Information Systems
In this paper, a novel approach for automatic matching, ranking and retrieval of video clips is proposed. Motivated by the maximal and optimal matching theories in graph analysis, a new similarity measure of video clips is defined based on the representation and modeling of bipartite graph. Four different factors: visual similarity, granularity, interference and temporal order of shots are taken into consideration for similarity ranking. These factors are progressively analyzed in the proposed approach. Maximal matching utilizes the granularity factor to efficiently filter false matches, while optimal matching takes into account the visual, granularity and interference factors for similarity measure. …
Adaptive Filters For Continuous Queries Over Distributed Data Stream, Chris Olston, Jing Jiang, Jennifer Widom
Adaptive Filters For Continuous Queries Over Distributed Data Stream, Chris Olston, Jing Jiang, Jennifer Widom
Research Collection School Of Computing and Information Systems
We consider an environment where distributed data sources continuously stream updates to a centralized processor that monitors continuous queries over the distributed data. Significant communication overhead is incurred in the presence of rapid update streams, and we propose a new technique for reducing the overhead. Users register continuous queries with precision requirements at the central stream processor, which installs filters at remote data sources. The filters adapt to changing conditions to minimize stream rates while guaranteeing that all continuous queries still receive the updates necessary to provide answers of adequate precision at all times. Our approach enables applications to trade …