Sciweavers

402 search results - page 49 / 81
» Cryptosystems using Linear Groups
Sort
View
IJCNN
2007
IEEE
15 years 4 months ago
A Functional Link Network With Ordered Basis Functions
—A procedure is presented for selecting and ordering the polynomial basis functions in the functional link net (FLN). This procedure, based upon a modified Gram Schmidt orthonorm...
Saurabh Sureka, Michael T. Manry
AVBPA
2003
Springer
121views Biometrics» more  AVBPA 2003»
15 years 3 months ago
Enhanced VQ-Based Algorithms for Speech Independent Speaker Identification
Abstract. Weighted distance measure and discriminative training are two different approaches to enhance VQ-based solutions for speaker identification. To account for varying import...
Ningping Fan, Justinian P. Rosca
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 1 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
COR
2006
129views more  COR 2006»
14 years 10 months ago
Game-theoretic analysis of an ancient Chinese horse race problem
This paper analyzes a legendary Chinese horse race problem involving the King of Qi and General Tianji which took place more than 2000 years ago. In this problem each player owns ...
Mingming Leng, Mahmut Parlar
IJCV
1998
109views more  IJCV 1998»
14 years 9 months ago
Robust Optic Flow Computation
This paper formulates the optic flow problem as a set of over-determined simultaneous linear equations. It then introduces and studies two new robust optic flow methods. The fir...
Alireza Bab-Hadiashar, David Suter