Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Communications Society (2)
- Computer science (2)
- Peer-to-peer computing (2)
- Age-independent neighbor replacement (1)
- Age-weighted graph partitioning (1)
-
- Algorithms (1)
- Bandwidth (1)
- Computational modeling (1)
- Computer network reliability (1)
- Crawlers (1)
- Create-based method (1)
- Delay effects (1)
- Event detection (1)
- Factorization (1)
- Gnutella networks (1)
- Graph theory (1)
- H infinity control (1)
- Image retrieval (1)
- Infinite variance (1)
- Kernel machines (1)
- Language model (1)
- Lifetime distributions (1)
- Linear equations (1)
- Link lifetimes (1)
- Multiple modalities (1)
- Near-duplicate keyframe (1)
- News videos (1)
- Node-isolation model (1)
- P2P systems (1)
- Partitioning algorithms (1)
Articles 1 - 4 of 4
Full-Text Articles in Databases and Information Systems
Near-Duplicate Keyframe Retrieval With Visual Keywords And Semantic Context, Xiao Wu, Wan-Lei Zhao, Chong-Wah Ngo
Near-Duplicate Keyframe Retrieval With Visual Keywords And Semantic Context, Xiao Wu, Wan-Lei Zhao, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Near-duplicate keyframes (NDK) play a unique role in large-scale video search, news topic detection and tracking. In this paper, we propose a novel NDK retrieval approach by exploring both visual and textual cues from the visual vocabulary and semantic context respectively. The vocabulary, which provides entries for visual keywords, is formed by the clustering of local keypoints. The semantic context is inferred from the speech transcript surrounding a keyframe. We experiment the usefulness of visual keywords and semantic context, separately and jointly, using cosine similarity and language models. By linearly fusing both modalities, performance improvement is reported compared with the …
A Multi-Scale Tikhonov Regularization Scheme For Implicit Surface Modeling, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu
A Multi-Scale Tikhonov Regularization Scheme For Implicit Surface Modeling, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu
Research Collection School Of Computing and Information Systems
Kernel machines have recently been considered as a promising solution for implicit surface modelling. A key challenge of machine learning solutions is how to fit implicit shape models from large-scale sets of point cloud samples efficiently. In this paper, we propose a fast solution for approximating implicit surfaces based on a multi-scale Tikhonov regularization scheme. The optimization of our scheme is formulated into a sparse linear equation system, which can be efficiently solved by factorization methods. Different from traditional approaches, our scheme does not employ auxiliary off-surface points, which not only saves the computational cost but also avoids the problem …
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Computer Science Faculty Publications
Existing methods of measuring lifetimes in P2P systems usually rely on the so-called create-based method (CBM), which divides a given observation window into two halves and samples users "created" in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we flrst derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …
On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Computer Science Faculty Publications
Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared to uniform selection of neighbors. In fact, the second strategy based on random walks on age-weighted graphs demonstrates that for lifetimes with infinite variance, the system …