Sciweavers

101 search results - page 6 / 21
» The Intractability of Computing the Hamming Distance
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Some Issues in Solving the Anomaly Detection Problem using Immunological Approach
Results of an experimental study of an anomaly detection system based on the paradigm of artificial immune systems (AISs) are presented. Network traffic data are mapped into ant...
Franciszek Seredynski, Pascal Bouvry
ECCC
2006
99views more  ECCC 2006»
13 years 7 months ago
On the Subgroup Distance Problem
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
EUROGP
2003
Springer
14 years 23 days ago
Evolving Finite State Transducers: Some Initial Explorations
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
Simon M. Lucas
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 7 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
CVPR
2010
IEEE
14 years 3 months ago
Scalable Face Image Retrieval with Identity-Based Quantization and Multi-Reference Re-ranking
State-of-the-art image retrieval systems achieve scalability by using bag-of-words representation and textual retrieval methods, but their performance degrades quickly in the face...
Zhong Wu, Qifa Ke, Jian Sun, Heung-Yeung Shum