Sciweavers

AMC
2005
128views more  AMC 2005»
13 years 9 months ago
A new face recognition method based on SVD perturbation for single example image per person
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...
Daoqiang Zhang, Songcan Chen, Zhi-Hua Zhou
IJON
2007
118views more  IJON 2007»
13 years 9 months ago
Time series prediction with recurrent neural networks trained by a hybrid PSO-EA algorithm
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, ...
AMAI
2005
Springer
13 years 9 months ago
Resolution cannot polynomially simulate compressed-BFS
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...
DoRon B. Motter, Jarrod A. Roy, Igor L. Markov
IJNSEC
2007
193views more  IJNSEC 2007»
13 years 9 months ago
Statistical Attack Resilient Data Hiding
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
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 9 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
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...
Heikki Hyyrö, Gonzalo Navarro
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
13 years 9 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
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...
Markus Bläser, Bodo Manthey
IJNSEC
2007
144views more  IJNSEC 2007»
13 years 9 months ago
IPLess Stochastic Anonymous Routing Algorithm Using Multi-Agent Systems
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...
Magdy Saeb, Meer Hamza, Ahmed El-Shikh
AIR
2005
111views more  AIR 2005»
13 years 9 months ago
An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems
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...
Georg Ringwelski
AIR
2005
130views more  AIR 2005»
13 years 9 months ago
Framework for Task Scheduling in Heterogeneous Distributed Computing Using Genetic Algorithms
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...
Andrew J. Page, Thomas J. Naughton
SMA
2008
ACM
173views Solid Modeling» more  SMA 2008»
13 years 9 months ago
Visibility-based feature extraction from discrete models
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 ...
Antoni Chica