Sciweavers

3702 search results - page 8 / 741
» All Pairings Are in a Group
Sort
View
PPSN
2010
Springer
13 years 5 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
IVC
1998
51views more  IVC 1998»
13 years 7 months ago
Improving the generalized Hough transform through imperfect grouping
This paper analyses the improvements that can be gained in the generalized Hough transform method for recognizing objects through the use of imperfect perceptual grouping techniqu...
Clark F. Olson
EUROCRYPT
2010
Springer
14 years 6 days ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
INFORMATICALT
2010
151views more  INFORMATICALT 2010»
13 years 5 months ago
The Use of Group Delay Features of Linear Prediction Model for Speaker Recognition
Abstract. New text independent speaker identification method is presented. Phase spectrum of allpole linear prediction (LP) model is used to derive the speech features. The featur...
Algirdas Bastys, Andrej Kisel, Bernardas Salna