At present, there are many methods for frontal view face recognition. However, few of them can work well when only one example image per class is available. In this paper, we pres...
To predict the 100 missing values from a time series of 5000 data points, given for the IJCNN 2004 time series prediction competition, recurrent neural networks (RNNs) are trained...
Xindi Cai, Nian Zhang, Ganesh K. Venayagamoorthy, ...
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
In this paper, we propose a discrete cosine transform (DCT) based spread spectrum data-hiding algorithm that is resilient to statistical attacks. Unlike other spread spectrum base...
Palak K. Amin, Ning Liu, Koduvayur P. Subbalakshmi
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
The ability of communicating with a selected party anonymously is an important aspect of network security. Communicating anonymously means that no adversary can discern who is com...
Abstract. This paper presents the new DDAC4 algorithm for dynamic arc consistency enforcement in distributed Constraint Satisfaction Problems. The algorithm is an adaptation of the...
An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dynam...
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...