Results 1 - 10 of 7,338

Ant Colony System: A cooperative learning approach to the traveling salesman problem

by Marco Dorigo, Luca Maria Gambardella - IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION , 1997
"... This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSP’s. Ants cooperate using an indirect form of communication mediated by a pher ..."
Abstract - Cited by 1029 (53 self) - Add to MetaCart
This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSP’s. Ants cooperate using an indirect form of communication mediated by a

SCOP: a structural classification of proteins database for the investigation of sequences and structures.

by Tim J P Hubbard , Bart Ailey , Steven E Brenner , Alexey G Murzin , Cyrus Chothia - J. Mol. Biol. , 1995
"... ABSTRACT The Structural Classification of Proteins (SCOP) database provides a detailed and comprehensive description of the relationships of all known proteins structures. The classification is on hierarchical levels: the first two levels, family and superfamily, describe near and far evolutionary ..."
Abstract - Cited by 1552 (24 self) - Add to MetaCart
algorithms and for the generation of population statistics on protein structures. The database and its associated files are freely accessible from a number of WWW sites mirrored from URL http://scop.mrc-lmb.cam.ac.uk/scop/

XM2VTSDB: The Extended M2VTS Database

by K. Messer, J. Matas, J. Kittler, K. Jonsson - In Second International Conference on Audio and Video-based Biometric Person Authentication , 1999
"... In this paper we describe the acquisition and content of a large multi-modal database intended for training and testing of multi-modal verification systems. The XM2VTSDB database offers synchronised video and speech data as well as image sequences allowing multiple views of the face. It consists of ..."
Abstract - Cited by 438 (40 self) - Add to MetaCart
of digital video recordings taken of 295 hundred subjects at one month intervals taken over a period of five months. We also describe a protocol for evaluating verification algorithms on the database. The database has been made available to anyone on request to the University of Surrey through http://www.ee.surrey.ac

Direct least Square Fitting of Ellipses

by Andrew Fitzgibbon , Maurizio Pilu, Robert B. Fisher , 1998
"... This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac - b² = 1 the new method incorporates the ellipticity constraint ..."
Abstract - Cited by 430 (3 self) - Add to MetaCart
This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac - b² = 1 the new method incorporates the ellipticity constraint

Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks

by Moni Naor, Moti Yung - In Proc. of the 22nd STOC , 1995
"... We show how to construct a public-key cryptosystem (as originally defined by Diffie and Hellman) secure against chosen ciphertext attacks, given a public-key cryptosystem secure against passive eavesdropping and a non-interactive zero-knowledge proof system in the shared string model. No such secure ..."
Abstract - Cited by 284 (19 self) - Add to MetaCart
. No such secure cryptosystems were known before. Key words. cryptography, randomized algorithms AMS subject classifications. 68M10, 68Q20, 68Q22, 68R05, 68R10 A preliminary version of this paper appeared in the Proc. of the Twenty Second ACM Symposium of Theory of Computing. y Incumbent of the Morris

Noise power spectral density estimation based on optimal smoothing and minimum statistics

by Rainer Martin - IEEE TRANS. SPEECH AND AUDIO PROCESSING , 2001
"... We describe a method to estimate the power spectral density of nonstationary noise when a noisy speech signal is given. The method can be combined with any speech enhancement algo-rithm which requires a noise power spectral density estimate. In contrast to other methods, our approach does not use a ..."
Abstract - Cited by 276 (7 self) - Add to MetaCart
We describe a method to estimate the power spectral density of nonstationary noise when a noisy speech signal is given. The method can be combined with any speech enhancement algo-rithm which requires a noise power spectral density estimate. In contrast to other methods, our approach does not use

Which Problems Have Strongly Exponential Complexity?

by Russell Impagliazzo, Ramamohan Paturi, Francis Zane - Journal of Computer and System Sciences , 1998
"... For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper, we address the relative likelihood of sub-exponential algorithms for these problems. We introduce a generalized reduction which we call Sub-Exponential Reduction Family (SERF) t ..."
Abstract - Cited by 242 (11 self) - Add to MetaCart
For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper, we address the relative likelihood of sub-exponential algorithms for these problems. We introduce a generalized reduction which we call Sub-Exponential Reduction Family (SERF

Aggregating local descriptors into a compact image representation

by Herve Jegou, Matthijs Douze, Cordelia Schmid, Patrick Perez
"... We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy of the search, its efficiency, and the memory usage of the representation. We first propose a simple yet efficient way of aggregating local image descriptors into a vecto ..."
Abstract - Cited by 226 (19 self) - Add to MetaCart
vector of limited dimension, which can be viewed as a simplification of the Fisher kernel representation. We then show how to jointly optimize the dimension reduction and the indexing algorithm, so that it best preserves the quality of vector comparison. The evaluation shows that our approach

Simple linear work suffix array construction

by Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt , 2003
"... Abstract. Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space efficiency while theoreticians use suffix trees due to linear-time construction algorithms and more exp ..."
Abstract - Cited by 215 (8 self) - Add to MetaCart
explicit structure. We narrow this gap between theory and practice with a simple linear-time construction algorithm for suffix arrays. The simplicity is demonstrated with a C++ implementation of 50 effective lines of code. The algorithm is called DC3, which stems from the central underlying concept

Hilbert R-tree: An Improved R-tree Using Fractals

by Ibrahim Kamel, Christos Faloutsos, Ibrahim Kamel, Christos Faloutsos - Proceedings 20th VLDB Conference , 1994
"... We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing an ordering on the R-tree nodes. This ordering has to be 'good', in the sense that it should group 'simil ..."
Abstract - Cited by 223 (11 self) - Add to MetaCart
;similar ' data rectangles together, to minimize the area and perimeter of the resulting minimum bounding rectangles (MBRs). Following [19] we have chosen the so-called '2D-c ' method, which sorts rectangles according to the Hilbert value of the center of the rectangles. Given the ordering, every
Results 1 - 10 of 7,338