Igor+Dymkov

 More results for "Igor+Dymko..." in  VIDEOS DOCUMENTS AUDIOS GROUPS STAGES/PROFILES ALL

• 

• Associative Neural Network 2002
• An associative neural network (ASNN) is a combination of an ensemble of the feed-forward neural networks and the K-nearest neighbor technique. The introduced network uses correlation between ensemble ...
• Rating:        Views: (1007)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Associative Neural Network 2002
• An associative neural network (ASNN) is a combination of an ensemble of the feed-forward neural networks and the K-nearest neighbor technique. The introduced network uses correlation between ensemble ...
• Rating:        Views: (1005)     Pages: ()     Uploaded: 15-05-09
•  

• 

• Two Random Walks On Upper Triangular Matrices 1998
• . We study two random walks on a group of upper triangular matrices. In each case, we give upper bound on the mixing time by using a stopping time technique. Introduction In the past decades there has...
• Rating:        Views: (1006)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Cluster Repairing in the Microvertex Detector
• The cluster fixing algorithms are described for the DELPHI microvertex detector. For the few percent of affected clusters a considerable improvement in precision and in the description of their resolu...
• Rating:        Views: (1006)     Pages: ()     Uploaded: 13-05-09
•  

• 

• On The Graph Of Generating Sets Of A Simple Group 1999
• . We prove that the product replacement graph on generating k-tuples of a simple group contains a large connected component if k 3. This is related to the recent conjecture of Diaconis and Graham. As ...
• Rating:        Views: (1008)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Ukrainian National Academy of Sciences
• a maximal NFA without mergible states.
• Rating:        Views: (1009)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Is Quantum Search Practical
• Quantum algorithms and circuits can, in principle, outperform the best non-quantum (classical) techniques for some hard computational problems. However, this does not necessarily lead to useful applic...
• Rating:        Views: (1009)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Time/Space Ecient Compressed Pattern Matching
• An exact pattern matching problem is to nd all occurrences of a pattern p in a text t. We say that the pattern matching algorithm is optimal if its running time is linear in the sizes of t and p, i.e....
• Rating:        Views: (1004)     Pages: ()     Uploaded: 13-05-09
•