- Full text PDF available (290)
- This year (73)
- Last 5 years (521)
- Last 10 years (816)
Journals and Conferences
Data Set Used
The Visual Object Tracking challenge 2015, VOT2015, aims at comparing short-term single-object visual trackers that do not apply pre-learned models of object appearance. Results of 62 trackers are presented. The number of tested trackers makes VOT 2015 the largest benchmark on shortterm tracking to date. For each participating tracker, a short description… (More)
We propose a dimensionality reduction technique for time series analysis that significantly improves the efficiency and accuracy of similarity searches. In contrast to piecewise constant approximation (PCA) techniques that approximate each time series with constant value segments, the proposed method--Piecewise Vector Quantized Approximation--uses the… (More)
Location is a fundamental service for mobile computing. Typical GPS receivers, although widely available, consume too much energy to be useful for many applications. Observing that in many sensing scenarios, the location information can be post-processed when the data is uploaded to a server, we design a Cloud-Offloaded GPS (CO-GPS) solution that allows a… (More)
Let p be an odd prime and q = p m. Let l be an odd positive integer. Let p ≡ −1 (mod l) or p ≡ 1 (mod l) and l | m. By employing the integer sequence an = l−1 2 t=1 2 cos π(2t − 1) l n , which can be considered as a generalized Lucas sequence, we construct all the permutation binomials P (x) = x r + x u of the finite field Fq.
In this paper, a novel method for learning based image super resolution (SR) is presented. The basic idea is to bridge the gap between a set of low resolution (LR) images and the corresponding high resolution (HR) image using both the SR reconstruction constraint and a patch based image synthesis constraint in a general probabilistic framework. We show that… (More)
Motivated by several constructions of permutation polynomials done by several authors (most notably by Zieve), we propose a unified treatment for a large set of classes of permutation polynomials of F q. Our approach yields a recipe for constructing several new and old classes of permutation polynomials of F q .
It is well observed that usually the run-length of successive zero coefficients becomes longer and the magnitude of non-zero coefficients gets smaller while the DCT subband frequency increases. So the probability distributions of level/run combinations should be different at different DCT positions. Based on this observation, an efficient context based… (More)
Artemisinic aldehyde Δ11 (13) reductase (DBR2) is the checkpoint enzyme catalyzing artemisinic aldehyde to form dihydroartemisinic aldehyde directly involved in artemisinin biosynthetic pathway. In the present study, DBR2 was employed to engineer the biosynthetic pathway of artemisinin in transgenic plants of Artemisia annua L. Seven independent transgenic… (More)
Transforming growth factor-beta (TGF-beta) elicits its signals through two transmembrane serine/threonine kinase receptors, type II (TbetaRII) and type I receptors. It is generally believed that the initial receptor dimerization is an essential event for receptor activation. However, previous studies suggested that TGF-beta signals by binding to the… (More)
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that best matches a query. In the proposed algorithm we map the problem of the best matching subsequence to the problem of a cheapest path in a directed acyclic graph (DAG). The approach… (More)