Sciweavers

4816 search results - page 508 / 964
» Performance analysis of the AntNet algorithm
Sort
View
CATS
2008
15 years 8 months ago
On the Efficiency of Pollard's Rho Method for Discrete Logarithms
Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Ma...
Shi Bai, Richard P. Brent
MVA
2007
160views Computer Vision» more  MVA 2007»
15 years 8 months ago
Investigation of Color Spaces for Face Recognition
This paper presents color processing for face recognition systems and proposes new directions for them. We show that color information helps performance of face recognition and fo...
Seunghwan Yoo, Rae-Hong Park, Dong-Gyu Sim
TSP
2008
57views more  TSP 2008»
15 years 6 months ago
Polarimetric Detection of Targets in Heavy Inhomogeneous Clutter
Polarization diversity has proved to be a useful tool for radar detection, especially when discrimination by Doppler effect is not possible. In this paper, we address the problem o...
Martin Hurtado, Arye Nehorai
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 8 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
CAL
2002
15 years 6 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally